[
  {
    "id": 19402,
    "title": "DreamClean: Restoring Clean Image Using Deep Diffusion Prior",
    "authors": [
      "Jie Xiao",
      "Ruili Feng",
      "Han Zhang",
      "Zhiheng Liu",
      "Zhantao Yang",
      "Yurui Zhu",
      "Xueyang Fu",
      "Kai Zhu",
      "Yu Liu",
      "Zheng-Jun Zha"
    ],
    "abstract": "Image restoration poses a garners substantial interest due to the exponential surge in demands for recovering high-quality images from diverse mobile camera devices, adverse lighting conditions, suboptimal shooting environments, and frequent image compression for efficient transmission purposes. Yet this problem gathers significant challenges as people are blind to the type of restoration the images suffer, which, is usually the case in real-day scenarios and is most urgent to solve for this field. Current research, however, heavily relies on prior knowledge of the restoration type, either explicitly through rules or implicitly through the availability of degraded-clean image pairs to define the restoration process, and consumes considerable effort to collect image pairs of vast degradation types. This paper introduces DreamClean, a training-free method that needs no degradation prior knowledge but yields high-fidelity and generality towards various types of image degradation. DreamClean embeds the degraded image back to the latent of pre-trained diffusion models and re-sample it through a carefully designed diffusion process that mimics those generating clean images. Thanks to the rich image prior in diffusion models and our novel Variance Preservation Sampling (VPS) technique, DreamClean manages to handle various different degradation types at one time and reaches far more satisfied final quality than previous competitors. DreamClean relies on elegant theoretical supports to assure its convergence to clean image when VPS has appropriate parameters, and also enjoys superior experimental performance over various challenging tasks that could be overwhelming for previous methods when degradation prior is unavailable.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6ALuy19mPa",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19568,
    "title": "ConjNorm: Tractable Density Estimation for Out-of-Distribution Detection",
    "authors": [
      "Bo Peng",
      "Yadan Luo",
      "Yonggang Zhang",
      "Yixuan Li",
      "Zhen Fang"
    ],
    "abstract": "Post-hoc out-of-distribution (OOD) detection has garnered intensive attention in reliable machine learning. Many efforts have been dedicated to deriving score functions based on logits, distances, or rigorous data distribution assumptions to identify low-scoring OOD samples. Nevertheless, these estimate scores may fail to accurately reflect the true data density or impose impractical constraints. To provide a unified perspective on density-based score design, we propose a novel theoretical framework grounded in Bregman divergence, which extends distribution considerations to encompass an exponential family of distributions. Leveraging the conjugation constraint revealed in our theorem, we introduce a \\textsc{ConjNorm} method, reframing density function design as a search for the optimal norm coefficient $p$ against the given dataset. In light of the computational challenges of normalization, we devise an unbiased and analytically tractable estimator of the partition function using the Monte Carlo-based importance sampling technique. Extensive experiments across OOD detection benchmarks empirically demonstrate that our proposed \\textsc{ConjNorm} has established a new state-of-the-art in a variety of OOD detection setups, outperforming the current best method by up to 13.25\\% and 28.19\\% (FPR95) on CIFAR-100 and ImageNet-1K, respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1pSL2cXWoz",
    "arxiv_id": "2402.17888",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18010,
    "title": "Self-Supervised High Dynamic Range Imaging with Multi-Exposure Images in Dynamic Scenes",
    "authors": [
      "Zhilu Zhang",
      "Haoyu Wang",
      "Shuai Liu",
      "Xiaotao Wang",
      "LEI LEI",
      "Wangmeng Zuo"
    ],
    "abstract": "Merging multi-exposure images is a common approach for obtaining high dynamic range (HDR) images, with the primary challenge being the avoidance of ghosting artifacts in dynamic scenes. Recent methods have proposed using deep neural networks for deghosting. However, the methods typically rely on sufficient data with HDR ground-truths, which are difficult and costly to collect. In this work, to eliminate the need for labeled data, we propose SelfHDR, a self-supervised HDR reconstruction method that only requires dynamic multi-exposure images during training. Specifically, SelfHDR learns a reconstruction network under the supervision of two complementary components, which can be constructed from multi-exposure images and focus on HDR color as well as structure, respectively. The color component is estimated from aligned multi-exposure images, while the structure one is generated through a structure-focused network that is supervised by the color component and an input reference (\\eg, medium-exposure) image. During testing, the learned reconstruction network is directly deployed to predict an HDR image. Experiments on real-world images demonstrate our SelfHDR achieves superior results against the state-of-the-art self-supervised methods, and comparable performance to supervised ones. Codes will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jjiOHEcS2c",
    "arxiv_id": "2310.01840",
    "GitHub": [
      "https://github.com/cszhilu1998/SelfHDR"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19537,
    "title": "Ferret: Refer and Ground Anything Anywhere at Any Granularity",
    "authors": [
      "Haoxuan You",
      "Haotian Zhang",
      "Zhe Gan",
      "Xianzhi Du",
      "Bowen Zhang",
      "Zirui Wang",
      "Liangliang Cao",
      "Shih-Fu Chang",
      "Yinfei Yang"
    ],
    "abstract": "We introduce Ferret, a new Multimodal Large Language Model (MLLM) capable of understanding spatial referring of any shape or granularity within an image and accurately grounding open-vocabulary descriptions. To unify referring and grounding in the LLM paradigm, Ferret employs a novel and powerful hybrid region representation that integrates discrete coordinates and continuous features jointly to represent a region in the image. To extract the continuous features of versatile regions,  we propose a spatial-aware visual sampler, adept at handling varying sparsity across different shapes. Consequently, Ferret can accept diverse region inputs, such as points, bounding boxes, and free-form shapes. To bolster the desired capability of Ferret, we curate GRIT, a comprehensive refer-and-ground instruction tuning dataset including 1.1M samples that contain rich hierarchical spatial knowledge, with an additional 130K hard negative data to promote model robustness. The resulting model not only achieves superior performance in classical referring and grounding tasks, but also greatly outperforms existing MLLMs in region-based and localization-demanded multimodal chatting. Our evaluations also reveal a significantly improved capability of describing image details and a remarkable alleviation in object hallucination.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=2msbbX3ydD",
    "arxiv_id": "2310.07704",
    "GitHub": [
      "https://github.com/apple/ml-ferret"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18711,
    "title": "Overcoming the Pitfalls of Vision-Language Model Finetuning for OOD Generalization",
    "authors": [
      "Yuhang Zang",
      "Hanlin Goh",
      "Joshua M. Susskind",
      "Chen Huang"
    ],
    "abstract": "Existing vision-language models exhibit strong generalization on a variety of visual domains and tasks. However, such models mainly perform zero-shot recognition in a closed-set manner, and thus struggle to handle open-domain visual concepts by design. There are recent finetuning methods, such as prompt learning, that not only study the discrimination between in-distribution (ID) and out-of-distribution (OOD) samples, but also show some improvements in both ID and OOD accuracies. In this paper, we first demonstrate that vision-language models, after long enough finetuning but without proper regularization, tend to overfit the known classes in the given dataset, with degraded performance on unknown classes. Then we propose a novel approach OGEN to address this pitfall, with the main focus on improving the OOD GENeralization of finetuned models. Specifically, a class-conditional feature generator is introduced to synthesize OOD features using just the class name of any unknown class. Such synthesized features will provide useful knowledge about unknowns and help regularize the decision boundary between ID and OOD data when optimized jointly. Equally important is our adaptive self-distillation mechanism to regularize our feature generation model during joint optimization, i.e., adaptively transferring knowledge between model states to further prevent overfitting. Experiments validate that our method yields convincing gains in OOD generalization performance in different settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PKICZXVY9M",
    "arxiv_id": "2401.15914",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18844,
    "title": "Unraveling the Key Components of OOD Generalization via Diversification",
    "authors": [
      "Harold Luc Benoit",
      "Liangze Jiang",
      "Andrei Atanov",
      "Oguzhan Fatih Kar",
      "Mattia Rigotti",
      "Amir Zamir"
    ],
    "abstract": "Supervised learning datasets may contain multiple cues that explain the training set equally well, i.e., learning any of them would lead to the correct predictions on the training data. However, many of them can be spurious, i.e., lose their predictive power under a distribution shift and consequently fail to generalize to out-of-distribution (OOD) data. Recently developed \"diversification\" methods (Lee et al., 2023; Pagliardini et al., 2023) approach this problem by finding multiple diverse hypotheses that rely on different features. This paper aims to study this class of methods and identify the key components contributing to their OOD generalization abilities.We show that (1) diversification methods are highly sensitive to the distribution of the unlabeled data used for diversification and can underperform significantly when away from a method-specific sweet spot. (2) Diversification alone is insufficient for OOD generalization. The choice of the used learning algorithm, e.g., the model's architecture and pretraining, is crucial. In standard experiments (classification on Waterbirds and Office-Home datasets), using the second-best choice leads to an up to 20\\% absolute drop in accuracy. (3) The optimal choice of learning algorithm depends on the unlabeled data and vice versa i.e. they are co-dependent. (4) Finally, we show that, in practice, the above pitfalls cannot be alleviated by increasing the number of diverse hypotheses, the major feature of diversification methods.These findings provide a clearer understanding of the critical design factors influencing the OOD generalization abilities of diversification methods. They can guide practitioners in how to use the existing methods best and guide researchers in developing new, better ones.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Lvf7GnaLru",
    "arxiv_id": "2312.16313",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18067,
    "title": "ECoFLaP: Efficient Coarse-to-Fine Layer-Wise Pruning for Vision-Language Models",
    "authors": [
      "Yi-Lin Sung",
      "Jaehong Yoon",
      "Mohit Bansal"
    ],
    "abstract": "Large Vision-Language Models (LVLMs) can understand the world comprehensively by integrating rich information from different modalities, achieving remarkable performance improvements on various multimodal downstream tasks. However, deploying LVLMs is often problematic due to their massive computational/energy costs and carbon consumption, making it infeasible to adopt conventional iterative global pruning, which is costly due to computing the Hessian matrix of the entire large model for sparsification. Alternatively, several studies have recently proposed layer-wise pruning approaches to avoid the expensive computation of global pruning and efficiently compress model weights according to their importance within a layer. However, these methods often suffer from suboptimal model compression due to their lack of a global perspective. To address this limitation in recent efficient pruning methods for large models, we propose Efficient Coarse-to-Fine Layer-Wise Pruning (ECoFLaP), a two-stage coarse-to-fine weight pruning approach for LVLMs. We first determine the sparsity ratios of different layers or blocks by leveraging the global importance score, which is efficiently computed based on the zeroth-order approximation of the global model gradients. Then, the multimodal model performs layer-wise unstructured weight pruning. We validate our proposed method across various multi-modal and single-modal models and datasets, demonstrating significant performance improvements over prevalent pruning techniques in the high-sparsity regime.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iIT02bAKzv",
    "arxiv_id": "2310.02998",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18228,
    "title": "Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy",
    "authors": [
      "Pingzhi Li",
      "Zhenyu Zhang",
      "Prateek Yadav",
      "Yi-Lin Sung",
      "Yu Cheng",
      "Mohit Bansal",
      "Tianlong Chen"
    ],
    "abstract": "Sparsely activated Mixture-of-Experts (SMoE) has shown promise to scale up the learning capacity of neural networks, however, they have issues like: ($a$) $\\textit{High Memory Usage,}$ due to duplication of the network layers into multiple copies as experts; and ($b$) $\\textit{Redundancy in Experts,}$ as common learning-based routing policies suffer from representational collapse. Therefore, vanilla SMoE models are memory inefficient and non-scalable, especially for resource-constrained downstream scenarios. In this paper, we ask: Can we craft a compact SMoE model by consolidating expert information? What is the best recipe to merge multiple experts into fewer but more knowledgeable experts? Our pilot investigation reveals that conventional model merging methods fail to be effective in such expert merging for SMoE. The potential reasons are: ($1$) redundant information overshadows critical experts; ($2$) appropriate neuron permutation for each expert is missing to bring all of them in alignment. To address these challenges, we propose a novel merging algorithm for SMoE, $\\textit{i.e.}$, $\\texttt{M-SMoE}$, which leverages routing statistics to guide expert merging. Specifically, it starts with neuron permutation alignment for experts; then, dominant experts and their \"group members\" are formed based on routing policies; lastly, every expert group is merged into a single expert by utilizing each expert's activation frequency as their weight for merging, thus diminishing the impact of insignificant experts. Moreover, we draw an interesting observation that our proposed merging promotes a low dimensionality in the merged expert's weight space, naturally paving the way for additional compression. Hence, our final method, $\\texttt{MC-SMoE}$ ($\\textit{i.e.}$, Merge, then Compress SMoE), further decomposes the merged experts into low-rank and structural sparse alternatives. Extensive experiments across $8$ benchmarks validate the effectiveness of our proposals. For instance, our $\\texttt{MC-SMoE}$ achieves up to $80\\%$ memory and a $20\\%$ FLOPs reduction, with virtually no loss in performance. Our code is provided as supplementary material.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=eFWG9Cy3WK",
    "arxiv_id": "2310.01334",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18927,
    "title": "Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learning",
    "authors": [
      "Patrik Okanovic",
      "Roger Waleffe",
      "Vasilis Mageirakos",
      "Konstantinos Nikolakakis",
      "Amin Karbasi",
      "Dionysios Kalogerias",
      "Nezihe Merve G\u00fcrel",
      "Theodoros Rekatsinas"
    ],
    "abstract": "Methods for carefully selecting or generating a small set of training data to learn from, i.e., data pruning, coreset selection, and dataset distillation, have been shown to be effective in reducing the ever-increasing cost of training neural networks. Behind this success are rigorously designed, yet expensive, strategies for identifying the most informative training examples out of large datasets. In this work, we revisit these methods to understand if the additional computational costs associated with such strategies are justified from the perspective of time-to-accuracy, which has become a critical efficiency measure of deep neural network training over large datasets. Surprisingly, we find that many of the recently proposed methods underperform what we call Repeated Sampling of Random Subsets (RSRS or RS2), a powerful yet overlooked extension of the standard random baseline that learns from repeatedly sampled data throughout training instead of a fixed random subset. We test RS2 against thirty-two state-of-the-art data pruning and distillation methods across four datasets including ImageNet. Our results demonstrate that RS2 significantly reduces time-to-accuracy, particularly in practical regimes where accuracy, but not runtime, is similar to that of training on full dataset. For example, when training ResNet-18 on ImageNet, with 10\\% of the dataset each epoch RS2 reaches an accuracy of 66\\% versus 69\\% when training with the full dataset. The best competing method achieves only 55\\% while training 1.6$\\times$ slower than RS2. Beyond the above meta-study, we discuss the theoretical properties of RS2 such as its convergence rate and generalization error. Our primary goal is to highlight that future works that aim to minimize total training cost by using subset selection, need to consider 1) the total computation cost (including preparing the subset) and 2) should aim to outperform a simple extension of random sampling (i.e., RS2).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JnRStoIuTe",
    "arxiv_id": "2305.18424",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17545,
    "title": "The Expressive Leaky Memory Neuron: an Efficient and Expressive Phenomenological Neuron Model Can Solve Long-Horizon Tasks.",
    "authors": [
      "Aaron Spieler",
      "Nasim Rahaman",
      "Georg Martius",
      "Bernhard Sch\u00f6lkopf",
      "Anna Levina"
    ],
    "abstract": "Biological cortical neurons are remarkably sophisticated computational devices,temporally integrating their vast synaptic input over an intricate dendritic tree,subject to complex, nonlinearly interacting internal biological processes. A recentstudy proposed to characterize this complexity by fitting accurate surrogate modelsto replicate the input-output relationship of a detailed biophysical cortical pyramidalneuron model and discovered it needed temporal convolutional networks (TCN)with millions of parameters. Requiring these many parameters, however, couldbe the result of a misalignment between the inductive biases of the TCN andcortical neuron\u2019s computations. In light of this, and with the aim to explorethe computational implications of leaky memory units and nonlinear dendriticprocessing, we introduce the Expressive Leaky Memory (ELM) neuron model, abiologically inspired phenomenological model of a cortical neuron. Remarkably, byexploiting a few such slowly decaying memory-like hidden states and two-layerednonlinear integration of synaptic input, our ELM neuron can accurately matchthe aforementioned input-output relationship with under ten-thousand trainableparameters. To further assess the computational ramifications of our neuron design,we evaluate on various tasks with demanding temporal structures, including theLong Range Arena (LRA) datasets, as well as a novel neuromorphic dataset basedon the Spiking Heidelberg Digits dataset (SHD-Adding). Leveraging a largernumber of memory units with sufficiently long timescales, and correspondinglysophisticated synaptic integration, the ELM neuron proves to be competitive onboth datasets, reliably outperforming the classic Transformer or Chrono-LSTMarchitectures on latter, even solving the Pathfinder-X task with over 70\\% accuracy(16k context length). These findings indicate the importance of inductive biasesfor efficient surrogate neuron models and the potential for biologically motivatedmodels to enhance performance in challenging machine learning tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vE1e1mLJ0U",
    "arxiv_id": "2306.16922",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17434,
    "title": "Emergent mechanisms for long timescales depend on training curriculum and affect performance in memory tasks",
    "authors": [
      "Sina Khajehabdollahi",
      "Roxana Zeraati",
      "Emmanouil Giannakakis",
      "Tim Jakob Sch\u00e4fer",
      "Georg Martius",
      "Anna Levina"
    ],
    "abstract": "Recurrent neural networks (RNNs) in the brain and in silico excel at solving tasks with intricate temporal dependencies. Long timescales required for solving such tasks can arise from properties of individual neurons (single-neuron timescale, $\\tau$, e.g., membrane time constant in biological neurons) or recurrent interactions among them (network-mediated timescale). However, the contribution of each mechanism for optimally solving memory-dependent tasks remains poorly understood. Here, we train RNNs to solve $N$-parity and $N$-delayed match-to-sample tasks with increasing memory requirements controlled by $N$ by simultaneously optimizing recurrent weights and $\\tau$s. We find that for both tasks RNNs develop longer timescales with increasing $N$, but depending on the learning objective, they use different mechanisms. Two distinct curricula define learning objectives: sequential learning of a single-$N$ (single-head) or simultaneous learning of multiple $N$s (multi-head). Single-head networks increase their $\\tau$ with $N$ and are able to solve tasks for large $N$, but they suffer from catastrophic forgetting. However, multi-head networks, which are explicitly required to hold multiple concurrent memories, keep $\\tau$ constant and develop longer timescales through recurrent connectivity.  Moreover, we show that the multi-head curriculum increases training speed and network stability to ablations and perturbations, and allows RNNs to generalize better to tasks beyond their training regime. This curriculum also significantly improves training GRUs and LSTMs for large-$N$ tasks. Our results suggest that adapting timescales to task requirements via recurrent interactions allows learning more complex objectives and improves the RNN's performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xwKt6bUkXj",
    "arxiv_id": "2309.12927",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17642,
    "title": "DSPy: Compiling Declarative Language Model Calls into State-of-the-Art Pipelines",
    "authors": [
      "Omar Khattab",
      "Arnav Singhvi",
      "Paridhi Maheshwari",
      "Zhiyuan Zhang",
      "Keshav Santhanam",
      "Sri Vardhamanan A",
      "Saiful Haq",
      "Ashutosh Sharma",
      "Thomas T. Joshi",
      "Hanna Moazam",
      "Heather Miller",
      "Matei Zaharia",
      "Christopher Potts"
    ],
    "abstract": "The ML community is rapidly exploring techniques for prompting language models (LMs) and for stacking them into pipelines that solve complex tasks. Unfortunately, existing LM pipelines are typically implemented using hard-coded \u201cprompt templates\u201d, i.e. lengthy strings discovered via trial and error. Toward a more systematic approach for developing and optimizing LM pipelines, we introduce DSPy, a programming model that abstracts LM pipelines as text transformation graphs, or imperative computational graphs where LMs are invoked through declarative modules. DSPy modules are parameterized, meaning they can learn (by creating and collecting demonstrations) how to apply compositions of prompting, finetuning, augmentation, and reasoning techniques. We design a compiler that will optimize any DSPy pipeline to maximize a given metric. We conduct two case studies, showing that succinct DSPy programs can express and optimize sophisticated LM pipelines that reason about math word problems, tackle multi-hop retrieval, answer complex questions, and control agent loops. Within minutes of compiling, DSPy can automatically produce prompt pipelines and finetune pipelines that outperform out-of-the-box few-shot prompting as well as expert-created demonstrations for GPT-3.5 and Llama2-13b-chat. On top of that, DSPy programs compiled to relatively small LMs like 770M parameter T5 and Llama2- 13b-chat are competitive with many approaches that rely on large and proprietary LMs like GPT-3.5 and on expert-written prompt chains.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=sY5N0zY5Od",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19582,
    "title": "Defining Expertise: Applications to Treatment Effect Estimation",
    "authors": [
      "Alihan H\u00fcy\u00fck",
      "Qiyao Wei",
      "Alicia Curth",
      "Mihaela van der Schaar"
    ],
    "abstract": "Decision-makers are often experts of their domain and take actions based on their domain knowledge. Doctors, for instance, may prescribe treatments by predicting the likely outcome of each available treatment. Actions of an expert thus naturally encode part of their domain knowledge, and can help make inferences within the same domain: Knowing doctors try to prescribe the best treatment for their patients, we can tell treatments prescribed more frequently are likely to be more effective. Yet in machine learning, the fact that most decision-makers are experts is often overlooked, and \u201cexpertise\u201d is seldom leveraged as an inductive bias. This is especially true for the literature on treatment effect estimation, where often the only assumption made about actions is that of overlap. In this paper, we argue that expertise\u2014particularly the type of expertise the decision-makers of a domain are likely to have\u2014can be informative in designing and selecting methods for treatment effect estimation. We formally define two types of expertise, predictive and prognostic, and demonstrate empirically that: (i) the prominent type of expertise in a domain significantly influences the performance of different methods in treatment effect estimation, and (ii) it is possible to predict the type of expertise present in a dataset, which can provide a quantitative basis for model selection.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1YPfmglNRU",
    "arxiv_id": "2403.00694",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19032,
    "title": "AutoChunk: Automated Activation Chunk for Memory-Efficient Deep Learning Inference",
    "authors": [
      "Xuanlei Zhao",
      "Shenggan Cheng",
      "Guangyang LU",
      "Haotian Zhou",
      "Bin Jia",
      "Yang You"
    ],
    "abstract": "Large deep learning models have achieved impressive performance across a range of applications. However, their large memory requirements, including parameter memory and activation memory, have become a significant challenge for their practical serving. While existing methods mainly address parameter memory, the importance of activation memory has been overlooked. Especially for long input sequences, activation memory is expected to experience a significant exponential growth as the length of sequences increases. In this approach, we propose AutoChunk, an automatic and adaptive compiler system that efficiently reduces activation memory for long sequence inference by chunk strategies. The proposed system generates chunk plans by optimizing through multiple stages. In each stage, the chunk search pass explores all possible chunk candidates and the chunk selection pass identifies the optimal one. At runtime, AutoChunk employs code generation to automatically apply chunk strategies. The experiments demonstrate that AutoChunk can reduce over 80\\% of activation memory while maintaining speed loss within 10\\%, extend max sequence length by 3.2x to 11.7x, and outperform state-of-the-art methods by a large margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GQGNLEHmdl",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18170,
    "title": "Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation",
    "authors": [
      "Jianliang He",
      "Han Zhong",
      "Zhuoran Yang"
    ],
    "abstract": "We study infinite-horizon average-reward Markov decision processes (AMDPs) in the context of general function approximation. Specifically, we propose a novel algorithmic framework named Fixed-Point Local Optimization (FLOP), which incorporates both model-based and value-based incarnations. In particular, FLOP features a novel construction of confidence sets and a low-switching policy updating scheme, which are tailored to the average-reward and function approximation setting. Moreover, for AMDPs, we propose a novel complexity measure --- average-reward generalized eluder coefficient (AGEC) --- which captures the challenge of exploration in AMDPs with general function approximation. Such a complexity measure encompasses almost all previously known tractable AMDP models, such as linear AMDPs and linear mixture AMDPs, and also includes newly identified cases such as kernel AMDPs and AMDPs with low Bellman eluder dimensions. Using AGEC, we prove that FLOP achieves a sublinear  $\\tilde{\\mathcal{O}}(\\mathrm{poly}(d, \\mathrm{sp}(v^*)) \\sqrt{T \\beta })$ regret, where $d$  and  $\\beta$ correspond to  AGEC and the log-covering number of the hypothesis class respectively,  $\\mathrm{sp}(v^*)$ represents the span of the optimal state bias function, $T$ denotes the number of steps, and $\\tilde{\\mathcal{O}} (\\cdot) $ omits logarithmic factors.  When specialized to concrete AMDP models, our regret bounds are comparable to those established by the existing algorithms designed specifically for these special cases.  To the best of our knowledge, this paper presents the first comprehensive theoretical framework capable of handling nearly all AMDPs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fq1wNrC2ai",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19419,
    "title": "Towards Robust Offline Reinforcement Learning under Diverse Data Corruption",
    "authors": [
      "Rui Yang",
      "Han Zhong",
      "Jiawei Xu",
      "Amy Zhang",
      "Chongjie Zhang",
      "Lei Han",
      "Tong Zhang"
    ],
    "abstract": "Offline reinforcement learning (RL) presents a promising approach for learning reinforced policies from offline datasets without the need for costly or unsafe interactions with the environment. However, datasets collected by humans in real-world environments are often noisy and may even be maliciously corrupted, which can significantly degrade the performance of offline RL. In this work, we first investigate the performance of current offline RL algorithms under comprehensive data corruption, including states, actions, rewards, and dynamics. Our extensive experiments reveal that implicit Q-learning (IQL) demonstrates remarkable resilience to data corruption among various offline RL algorithms. Furthermore, we conduct both empirical and theoretical analyses to understand IQL's robust performance, identifying its supervised policy learning scheme as the key factor. Despite its relative robustness, IQL still suffers from heavy-tail targets of Q functions under dynamics corruption. To tackle this challenge, we draw inspiration from robust statistics to employ the Huber loss to handle the heavy-tailedness and utilize quantile estimators to balance penalization for corrupted data and learning stability. By incorporating these simple yet effective modifications into IQL, we propose a more robust offline RL approach named Robust IQL (RIQL). Extensive experiments demonstrate that RIQL exhibits highly robust performance when subjected to diverse data corruption scenarios.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=5hAMmCU0bK",
    "arxiv_id": "2310.12955",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19401,
    "title": "Enhancing Tail Performance in Extreme Classifiers by Label Variance Reduction",
    "authors": [
      "Anirudh Buvanesh",
      "Rahul Chand",
      "Jatin Prakash",
      "Bhawna Paliwal",
      "Mudit Dhawan",
      "Neelabh Madan",
      "Deepesh Hada",
      "Vidit Jain",
      "SONU MEHTA",
      "Yashoteja Prabhu",
      "Manish Gupta",
      "Ramachandran Ramjee",
      "Manik Varma"
    ],
    "abstract": "Extreme Classification (XC) architectures, which utilize a massive one-vs-all classifier layer at the output, have demonstrated remarkable performance on problems with large label sets. Nonetheless, these have also been observed to falter on tail labels with few representative samples. This phenomenon has been attributed to factors such as classifier over-fitting and missing label bias, and solutions involving regularization and loss re-calibration have been developed.This paper explores the impact of label variance, a previously unexamined factor, on the tail performance in extreme classifiers. Label variance refers to the imprecision introduced in the ground truth when sampling it from a complex underlying distribution - a common phenomenon in most XC datasets. This compromises the quality of trained models, with a pronounced impact on the classifiers for infrequently sampled tail labels.This paper presents a method to systematically reduce label variance in XC by effectively utilizing the capabilities of an additional, tail-robust teacher model. It proposes a principled knowledge distillation framework, \\model, which enhances tail performance in extreme classifiers, with formal guarantees on generalization. Finally, we introduce an effective instantiation of this framework that employs a specialized Siamese teacher model. This model excels in tail accuracy and significantly enhances the quality of student one-vs-all classifiers.Comprehensive experiments are conducted on a diverse set of XC datasets which demonstrate that \\model can enhance tail performance by around 5\\% and 6\\% points in PSP and Coverage metrics respectively when integrated with leading extreme classifiers. Moreover, when added to the top-performing Ren\u00e9e classifier, it establishes a new state-of-the-art. Extensive ablations and analysis substantiate the efficacy of our design choices. Code and datasets will be released for research purposes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6ARlSgun7J",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19786,
    "title": "Multi-granularity Correspondence Learning from Long-term Noisy Videos",
    "authors": [
      "Yijie Lin",
      "Jie Zhang",
      "Zhenyu Huang",
      "Jia Liu",
      "zujie wen",
      "Xi Peng"
    ],
    "abstract": "Existing video-language studies mainly focus on learning short video clips, leaving long-term temporal dependencies rarely explored due to over-high computational cost of modeling long videos. To address this issue, one feasible solution is learning the correspondence between video clips and captions, which however inevitably encounters the multi-granularity noisy correspondence (MNC) problem. To be specific, MNC refers to the clip-caption misalignment (coarse-grained) and frame-word misalignment (fine-grained), hindering temporal learning and video understanding. In this paper, we propose NOise Robust Temporal Optimal traNsport (Norton) that addresses MNC in a unified optimal transport (OT) framework. In brief, Norton employs video-paragraph and clip-caption contrastive losses to capture long-term dependencies based on OT. To address coarse-grained misalignment in video-paragraph contrast, Norton filters out the irrelevant clips and captions through an alignable prompt bucket and realigns asynchronous clip-caption pairs based on transport distance. To address the fine-grained misalignment, Norton incorporates a soft-maximum operator to identify crucial words and key frames. Additionally, Norton exploits the potential faulty negative samples in clip-caption contrast by rectifying the alignment target with OT assignment to ensure precise temporal modeling. Extensive experiments on video retrieval, videoQA, and action segmentation verify the effectiveness of our method. Code is available at https://lin-yijie.github.io/projects/Norton.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=9Cu8MRmhq2",
    "arxiv_id": "2401.16702",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19737,
    "title": "Multi-Source Diffusion Models for Simultaneous Music Generation and Separation",
    "authors": [
      "Giorgio Mariani",
      "Irene Tallini",
      "Emilian Postolache",
      "Michele Mancusi",
      "Luca Cosmo",
      "Emanuele Rodol\u00e0"
    ],
    "abstract": "In this work, we define a diffusion-based generative model capable of both music generation and source separation by learning the score of the joint probability density of sources sharing a context. Alongside the classic total inference tasks (i.e., generating a mixture, separating the sources), we also introduce and experiment on the partial generation task of source imputation, where we generate a subset of the sources given the others (e.g., play a piano track that goes well with the drums). Additionally, we introduce a novel inference method for the separation task based on Dirac likelihood functions. We train our model on Slakh2100, a standard dataset for musical source separation, provide qualitative results in the generation settings, and showcase competitive quantitative results in the source separation setting. Our method is the first example of a single model that can handle both generation and separation tasks, thus representing a step toward general audio models.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=h922Qhkmx1",
    "arxiv_id": "2302.02257",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19031,
    "title": "Reward-Consistent Dynamics Models are Strongly Generalizable for Offline Reinforcement Learning",
    "authors": [
      "Fan-Ming Luo",
      "Tian Xu",
      "Xingchen Cao",
      "Yang Yu"
    ],
    "abstract": "Learning a precise dynamics model can be crucial for offline reinforcement learning, which, unfortunately, has been found to be quite challenging. Dynamics models that are learned by fitting historical transitions often struggle to generalize to unseen transitions. In this study, we identify a hidden but pivotal factor termed \\emph{dynamics reward} that remains consistent across transitions, offering a pathway to better generalization. Therefore, we propose the idea of reward-consistent dynamics models: any trajectory generated by the dynamics model should maximize the dynamics reward derived from the data. We implement this idea as the MOREC (Model-based Offline reinforcement learning with Reward Consistency) method, which can be seamlessly integrated into previous offline model-based reinforcement learning (MBRL) methods. MOREC learns a generalizable dynamics reward function from offline data, which is subsequently employed as a transition filter in any offline MBRL method: when generating transitions, the dynamics model generates a batch of transitions and selects the one with the highest dynamics reward value. On a synthetic task, we visualize that MOREC has a strong generalization ability and can surprisingly recover some distant unseen transitions. On 21 offline tasks in D4RL and NeoRL benchmarks, MOREC improves the previous state-of-the-art performance by a significant margin, i.e., 4.6\\% on D4RL tasks and 25.9\\% on NeoRL tasks. Notably, MOREC is the first method that can achieve above 95\\% online RL performance in 6 out of 12 D4RL tasks and 3 out of 9 NeoRL tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=GSBHKiw19c",
    "arxiv_id": "2310.05422",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19738,
    "title": "W\u00fcrstchen: An Efficient Architecture for Large-Scale Text-to-Image Diffusion Models",
    "authors": [
      "Pablo Pernias",
      "Dominic Rampas",
      "Mats Leon Richter",
      "Christopher Pal",
      "Marc Aubreville"
    ],
    "abstract": "We introduce W\u00fcrstchen, a novel architecture for text-to-image synthesis that combines competitive performance with unprecedented cost-effectiveness for large-scale text-to-image diffusion models.A key contribution of our work is to develop a latent diffusion technique in which we learn a detailed but extremely compact semantic image representation used to guide the diffusion process. This highly compressed representation of an image provides much more detailed guidance compared to latent representations of language and this significantly reduces the computational requirements to achieve state-of-the-art results. Our approach also improves the quality of text-conditioned image generation based on our user preference study.The training requirements of our approach consists of 24,602 A100-GPU hours - compared to Stable Diffusion 2.1's 200,000 GPU hours.  Our approach also requires less training data to achieve these results. Furthermore, our compact latent representations allows us to perform inference over twice as fast, slashing the usual costs and carbon footprint of a state-of-the-art (SOTA) diffusion model significantly, without compromising the end performance. In a broader comparison against SOTA models our approach is substantially more efficient and compares favourably in terms of image quality.We believe that this work motivates more emphasis on the prioritization of both performance and computational accessibility.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=gU58d5QeGv",
    "arxiv_id": "2306.00637",
    "GitHub": [],
    "Space": [
      "warp-ai/Wuerstchen"
    ],
    "Model": [
      "warp-ai/wuerstchen"
    ],
    "Dataset": []
  },
  {
    "id": 19583,
    "title": "A Variational Perspective on Solving Inverse Problems with Diffusion Models",
    "authors": [
      "Morteza Mardani",
      "Jiaming Song",
      "Jan Kautz",
      "Arash Vahdat"
    ],
    "abstract": "Diffusion models have emerged as a key pillar of foundation models in visual domains. One of their critical applications is to universally solve different downstream inverse tasks via a single diffusion prior without re-training for each task. Most inverse tasks can be formulated as inferring a posterior distribution over data (e.g., a full image) given a measurement (e.g., a masked image). This is however challenging in diffusion models since the nonlinear and iterative nature of the diffusion process renders the posterior intractable. To cope with this challenge, we propose a variational approach that by design seeks to approximate the true posterior distribution. We show that our approach naturally leads to regularization by denoising diffusion process (RED-diff) where denoisers at different timesteps concurrently impose different structural constraints over the image. To gauge the contribution of denoisers from different timesteps, we propose a weighting mechanism based on signal-to-noise-ratio (SNR). Our approach provides a new variational perspective for solving inverse problems with diffusion models, allowing us to formulate sampling as stochastic optimization, where one can simply apply off-the-shelf solvers with lightweight iterates. Our experiments for image restoration tasks such as inpainting and superresolution demonstrate the strengths of our method compared with state-of-the-art sampling-based diffusion models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1YO4EE3SPB",
    "arxiv_id": "2305.04391",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19589,
    "title": "MAMBA: an Effective World Model Approach for Meta-Reinforcement Learning",
    "authors": [
      "Zohar Rimon",
      "Tom Jurgenson",
      "Orr Krupnik",
      "Gilad Adler",
      "Aviv Tamar"
    ],
    "abstract": "Meta-reinforcement learning (meta-RL) is a promising framework for tackling challenging domains requiring efficient exploration. Existing meta-RL algorithms are characterized by low sample efficiency, and mostly focus on low-dimensional task distributions. In parallel, model-based RL methods have been successful in solving partially observable MDPs, of which meta-RL is a special case.In this work, we leverage this success and propose a new model-based approach to meta-RL, based on elements from existing state-of-the-art model-based and meta-RL methods. We demonstrate the effectiveness of our approach on common meta-RL benchmark domains, attaining greater return with better sample efficiency (up to $15\\times$) while requiring very little hyperparameter tuning. In addition, we validate our approach on a slate of more challenging, higher-dimensional domains, taking a step towards real-world generalizing agents.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1RE0H6mU7M",
    "arxiv_id": "2403.09859",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18279,
    "title": "Procedural Fairness Through Decoupling Objectionable Data Generating Components",
    "authors": [
      "Zeyu Tang",
      "Jialu Wang",
      "Yang Liu",
      "Peter Spirtes",
      "Kun Zhang"
    ],
    "abstract": "We reveal and address the frequently overlooked yet important issue of _disguised procedural unfairness_, namely, the potentially inadvertent alterations on the behavior of neutral (i.e., not problematic) aspects of data generating process, and/or the lack of procedural assurance of the greatest benefit of the least advantaged individuals. Inspired by John Rawls's advocacy for _pure procedural justice_ (Rawls, 1971; 2001), we view automated decision-making as a microcosm of social institutions, and consider how the data generating process itself can satisfy the requirements of procedural fairness. We propose a framework that decouples the objectionable data generating components from the neutral ones by utilizing reference points and the associated value instantiation rule. Our findings highlight the necessity of preventing _disguised procedural unfairness_, drawing attention not only to the objectionable data generating components that we aim to mitigate, but also more importantly, to the neutral components that we intend to keep unaffected.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=cxfPefbu1s",
    "arxiv_id": "2311.14688",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18380,
    "title": "Kalman Filter for Online Classification of Non-Stationary Data",
    "authors": [
      "Michalis Titsias",
      "Alexandre Galashov",
      "Amal Rannen-Triki",
      "Razvan Pascanu",
      "Yee Whye Teh",
      "Jorg Bornschein"
    ],
    "abstract": "In Online Continual Learning (OCL) a learning system receives a stream of data and sequentially performs prediction and training steps. Important challenges in OCL are concerned with automatic adaptation to the particular non-stationary structure of the data, and with quantification of predictive uncertainty. Motivated by these challenges we introduce a probabilistic Bayesian online learning model by using a (possibly pretrained) neural representation and a state space model over the linear predictor weights. Non-stationarity over the linear predictor weights is modelled using a \u201cparameter drift\u201d transition density, parametrized by a coefficient that quantifies forgetting. Inference in the model is implemented with efficient Kalman filter recursions which track the posterior distribution over the linear weights, while online SGD updates over the transition dynamics coefficient allows to adapt to the non-stationarity seen in data. While the framework is developed assuming a linear Gaussian model, we also extend it to deal with classification problems and for fine-tuning the deep learning representation. In a set of experiments in multi-class classification using data sets such as CIFAR-100 and CLOC we demonstrate the predictive ability of the model and its flexibility to capture non-stationarity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZzmKEpze8e",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17524,
    "title": "CODE REPRESENTATION LEARNING AT SCALE",
    "authors": [
      "Dejiao Zhang",
      "Wasi Uddin Ahmad",
      "Ming Tan",
      "Hantian Ding",
      "Ramesh Nallapati",
      "Dan Roth",
      "Xiaofei Ma",
      "Bing Xiang"
    ],
    "abstract": "Recent studies have shown that code language model at scale demonstrate significant performance gains on downstream tasks, i.e., code generation. However, most of the existing works on code representation learning train models at a hundred million parameter scale using very limited pretraining corpora. In this work, we fuel code representation learning with a vast amount of code data via a two-stage pretraining scheme. We first train the encoders via a mix that leverages both randomness in masking language modeling and the structure aspect of programming language. We then enhance the representations via contrastive learning with hard negative and hard positive constructed in an unsupervised manner. We establish an off-the-shelf encoder model that persistently outperforms the existing models on a wide variety of downstream tasks by large margins. To comprehend the factors contributing to successful code representation learning, we conduct detailed ablations and share our findings on (i) a customized and effective token-level denoising scheme for source code; (ii) the importance of hard negatives and hard positives; (iii) how the proposed bimodal contrastive learning boost the cross-lingual semantic search performance; and (iv) how the pretraining schemes decide the downstream task performance scales with the model size.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vfzRRjumpX",
    "arxiv_id": "2402.01935",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17610,
    "title": "Uni-O4: Unifying Online and Offline Deep Reinforcement Learning with Multi-Step On-Policy Optimization",
    "authors": [
      "Kun LEI",
      "Zhengmao He",
      "Chenhao Lu",
      "Kaizhe Hu",
      "Yang Gao",
      "Huazhe Xu"
    ],
    "abstract": "Combining offline and online reinforcement learning (RL) is crucial for efficient and safe learning. However, previous approaches treat offline and online learning as separate procedures, resulting in redundant designs and limited performance. We ask: *Can we achieve straightforward yet effective offline and online learning without introducing extra conservatism or regularization?* In this study, we propose Uni-O4, which utilizes an on-policy objective for both offline and online learning. Owning to the alignment of objectives in two phases, the RL agent can transfer between offline and online learning seamlessly. This property enhances the flexibility of the learning paradigm, allowing for arbitrary combinations of pretraining, fine-tuning, offline, and online learning. In the offline phase, specifically, Uni-O4 leverages diverse ensemble policies to address the mismatch issues between the estimated behavior policy and the offline dataset. Through a simple offline policy evaluation (OPE) approach, Uni-O4 can achieve multi-step policy improvement safely. We demonstrate that by employing the method above, the fusion of these two paradigms can yield superior offline initialization as well as stable and rapid online fine-tuning capabilities. Through real-world robot tasks, we highlight the benefits of this paradigm for rapid deployment in challenging, previously unseen real-world environments. Additionally, through comprehensive evaluations using numerous simulated benchmarks, we substantiate that our method achieves state-of-the-art performance in both offline and offline-to-online fine-tuning learning. [Our website](uni-o4.github.io)",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tbFBh3LMKi",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17987,
    "title": "Selective Visual Representations Improve Convergence and Generalization for Embodied AI",
    "authors": [
      "Ainaz Eftekhar",
      "Kuo-Hao Zeng",
      "Jiafei Duan",
      "Ali Farhadi",
      "Aniruddha Kembhavi",
      "Ranjay Krishna"
    ],
    "abstract": "Embodied AI models often employ off the shelf vision backbones like CLIP to encode their visual observations. Although such general purpose representations encode rich syntactic and semantic information about the scene, much of this information is often irrelevant to the specific task at hand. This introduces noise within the learning process and distracts the agent's focus from task-relevant visual cues.Inspired by selective attention in humans\u2014the process through which people filter their perception based on their experiences, knowledge, and the task at hand\u2014we introduce a parameter-efficient approach to filter visual stimuli for embodied AI.Our approach induces a task-conditioned bottleneck using a small learnable codebook module. This codebook is trained jointly to optimize task reward and acts as a task-conditioned selective filter over the visual observation.Our experiments showcase state-of-the-art performance for object goal navigation and object displacement across $5$ benchmarks, ProcTHOR, ArchitecTHOR, RoboTHOR, AI2-iTHOR, and ManipulaTHOR. The filtered representations produced by the codebook are also able generalize better and converge faster when adapted to other simulation environments such as Habitat. Our qualitative analyses show that agents explore their environments more effectively and their representations retain task-relevant information like target object recognition while ignoring superfluous information about other objects.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=kC5nZDU5zf",
    "arxiv_id": "2311.04193",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19723,
    "title": "How I Warped Your Noise: a Temporally-Correlated Noise Prior for Diffusion Models",
    "authors": [
      "Pascal Chang",
      "Jingwei Tang",
      "Markus Gross",
      "Vinicius C. Azevedo"
    ],
    "abstract": "Video editing and generation methods often rely on pre-trained image-based diffusion models. During the diffusion process, however, the reliance on rudimentary noise sampling techniques that do not preserve correlations present in subsequent frames of a video is detrimental to the quality of the results. This either produces high-frequency flickering, or texture-sticking artifacts that are not amenable to post-processing. With this in mind, we propose a novel method for preserving temporal correlations in a sequence of noise samples. This approach is materialized by a novel noise representation, dubbed $\\int$-noise (integral noise), that reinterprets individual noise samples as a continuously integrated noise field: pixel values do not represent discrete values, but are rather the integral of an underlying infinite-resolution noise over the pixel area. Additionally, we propose a carefully tailored transport method that uses $\\int$-noise to accurately advect noise samples over a sequence of frames, maximizing the correlation between different frames while also preserving the noise properties. Our results demonstrate that the proposed $\\int$-noise can be used for a variety of tasks, such as video restoration, surrogate rendering, and conditional video generation.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=pzElnMrgSD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19029,
    "title": "DiffAR: Denoising Diffusion Autoregressive Model for Raw Speech Waveform Generation",
    "authors": [
      "Roi Benita",
      "Michael Elad",
      "Joseph Keshet"
    ],
    "abstract": "Diffusion models have recently been shown to be relevant for high-quality speech generation. Most work has been focused on generating spectrograms, and as such, they further require a subsequent model to convert the spectrogram to a waveform (i.e., a vocoder). This work proposes a diffusion probabilistic end-to-end model for generating a raw speech waveform. The proposed model is autoregressive, generating overlapping frames sequentially, where each frame is conditioned on a portion of the previously generated one. Hence, our model can effectively synthesize an unlimited speech duration while preserving high-fidelity synthesis and temporal coherence. We implemented the proposed model for unconditional and conditional speech generation, where the latter can be driven by an input sequence of phonemes, amplitudes, and pitch values. Working on the waveform directly has some empirical advantages. Specifically, it allows the creation of local acoustic behaviors, like vocal fry, which makes the overall waveform sounds more natural. Furthermore, the proposed diffusion model is stochastic and not deterministic; therefore, each inference generates a slightly different waveform variation, enabling abundance of valid realizations. Experiments show that the proposed model generates speech with superior quality compared with other state-of-the-art neural speech generation systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GTk0AdOYLq",
    "arxiv_id": "2310.01381",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18004,
    "title": "Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop Scheduling",
    "authors": [
      "Cong Zhang",
      "Zhiguang Cao",
      "Wen Song",
      "Yaoxin Wu",
      "Jie Zhang"
    ],
    "abstract": "Recent studies in using deep reinforcement learning (DRL) to solve Job-shop scheduling problems (JSSP) focus on construction heuristics. However, their performance is still far from optimality, mainly because the underlying graph representation scheme is unsuitable for modelling partial solutions at each construction step. This paper proposes a novel DRL-guided improvement heuristic for solving JSSP, where graph representation is employed to encode complete solutions. We design a Graph-Neural-Network-based representation scheme, consisting of two modules to effectively capture the information of dynamic topology and different types of nodes in graphs encountered during the improvement process. To speed up solution evaluation during improvement, we present a novel message-passing mechanism that can evaluate multiple solutions simultaneously. We prove that the computational complexity of our method scales linearly with problem size. Experiments on classic benchmarks show that the improvement policy learned by our method outperforms state-of-the-art DRL-based methods by a large margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jsWCmrsHHs",
    "arxiv_id": "2211.10936",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18303,
    "title": "Label-Focused Inductive Bias over Latent Object Features in Visual Classification",
    "authors": [
      "Ilmin Kang",
      "HyounYoung Bae",
      "Kangil Kim"
    ],
    "abstract": "Most neural networks for classification primarily learn features differentiated by input-domain related information such as visual similarity of objects in an image. While this focus is natural behavior, it can inadvertently introduce an inductive bias that conflicts with unseen relations in an implicit output-domain determined by human labeling based on their own world knowledge. Such conflicts can limit generalization of models by potential dominance of the input-domain focused bias in inference.To overcome this limitation without external resources, we introduce Output-Domain focused Biasing (ODB) training strategy that constructs inductive biases on features differentiated by only output labels. It has four steps: 1) it learns intermediate latent object features in an unsupervised manner; 2) it decouples their visual dependencies by assigning new independent embedding parameters; 3) it captures structured features optimized for the original classification task; and 4) it integrates the structured features with the original visual features for the final prediction.We implement the ODB on a vision transformer architecture, and achieved significant improvements on image classification benchmarks. This paper offers a straightforward and effective method to obtain and utilize output-domain focused inductive bias for classification mapping two different domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cH3oufN8Pl",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19028,
    "title": "DreamFlow: High-quality text-to-3D generation by Approximating Probability Flow",
    "authors": [
      "Kyungmin Lee",
      "Kihyuk Sohn",
      "Jinwoo Shin"
    ],
    "abstract": "Recent progress in text-to-3D generation has been achieved through the utilization of score distillation methods: they make use of the pre-trained text-to-image (T2I) diffusion models by distilling via the diffusion model training objective. However, such an approach inevitably results in the use of random timesteps at each update, which increases the variance of the gradient and ultimately prolongs the optimization process. In this paper, we propose to enhance the text-to-3D optimization by leveraging the T2I diffusion prior in the generative sampling process with a predetermined timestep schedule. To this end, we interpret text-to-3D optimization as a multi-view image-to-image translation problem, and propose a solution by approximating the probability flow. By leveraging the proposed novel optimization algorithm, we design DreamFlow, a practical three-stage coarse-to-fine text-to-3D optimization framework that enables fast generation of high-quality and high-resolution (i.e., 1024\u00d71024) 3D contents. For example, we demonstrate that DreamFlow is 5 times faster than the existing state-of-the-art text-to-3D method, while producing more photorealistic 3D contents.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=GURqUuTebY",
    "arxiv_id": "2403.14966",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17891,
    "title": "Analyzing Feed-Forward Blocks in Transformers through the Lens of Attention Map",
    "authors": [
      "Goro Kobayashi",
      "Tatsuki Kuribayashi",
      "Sho Yokoi",
      "Kentaro Inui"
    ],
    "abstract": "Given that Transformers are ubiquitous in wide tasks, interpreting their internals is a pivotal issue. Still, their particular components, feed-forward (FF) blocks, have typically been less analyzed despite their substantial parameter amounts.We analyze the input contextualization effects of FF blocks by rendering them in the attention maps as a human-friendly visualization scheme.Our experiments with both masked- and causal-language models reveal that FF networks modify the input contextualization to emphasize specific types of linguistic compositions. In addition, FF and its surrounding components tend to cancel out each other's effects, suggesting potential redundancy in the processing of the Transformer layer.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=mYWsyTuiRp",
    "arxiv_id": "2302.00456",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19026,
    "title": "Rethinking Information-theoretic Generalization: Loss Entropy Induced PAC Bounds",
    "authors": [
      "Yuxin Dong",
      "Tieliang Gong",
      "Hong Chen",
      "Shujian Yu",
      "Chen Li"
    ],
    "abstract": "Information-theoretic generalization analysis has achieved astonishing success in characterizing the generalization capabilities of noisy and iterative learning algorithms. However, current advancements are mostly restricted to average-case scenarios and necessitate the stringent bounded loss assumption, leaving a gap with regard to computationally tractable PAC generalization analysis, especially for long-tailed loss distributions. In this paper, we bridge this gap by introducing a novel class of PAC bounds through leveraging loss entropies. These bounds simplify the computation of key information metrics in previous PAC information-theoretic bounds to one-dimensional variables, thereby enhancing computational tractability. Moreover, our data-independent bounds provide novel insights into the generalization behavior of the minimum error entropy criterion, while our data-dependent bounds improve over previous results by alleviating the bounded loss assumption under both leave-one-out and supersample settings. Extensive numerical studies indicate strong correlations between the generalization error and the induced loss entropy, showing that the presented bounds adeptly capture the patterns of the true generalization gap under various learning scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GWSIo2MzuH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19716,
    "title": "Batched Low-Rank Adaptation of Foundation Models",
    "authors": [
      "Yeming Wen",
      "Swarat Chaudhuri"
    ],
    "abstract": "Low-Rank Adaptation (LoRA) has recently gained attention for fine-tuning foundation models by incorporating trainable low-rank matrices, thereby reducing the number of trainable parameters. While \\lora/ offers numerous advantages, its applicability for real-time serving to a diverse and global user base is constrained by its incapability to handle multiple task-specific adapters efficiently. This imposes a performance bottleneck in scenarios requiring personalized, task-specific adaptations for each incoming request.To address this, we introduce FLORA (Fast LoRA), a framework in which each input example in a minibatch can be associated with its unique low-rank adaptation weights, allowing for efficient batching of heterogeneous requests. We empirically demonstrate that \\flora/ retains the performance merits of \\lora/, showcasing competitive results on the MultiPL-E code generation benchmark spanning over 8 languages and a multilingual speech recognition task across 6 languages.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=w4abltTZ2f",
    "arxiv_id": "2312.05677",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18007,
    "title": "COPlanner: Plan to Roll Out Conservatively but to Explore Optimistically for Model-Based RL",
    "authors": [
      "Xiyao Wang",
      "Ruijie Zheng",
      "Yanchao Sun",
      "Ruonan Jia",
      "Wichayaporn Wongkamjan",
      "Huazhe Xu",
      "Furong Huang"
    ],
    "abstract": "Dyna-style model-based reinforcement learning contains two phases: model rollouts to generate sample for policy learning and real environment exploration using current policy for dynamics model learning. However, due to the complex real-world environment, it is inevitable to learn an imperfect dynamics model with model prediction error, which can further mislead policy learning and result in sub-optimal solutions. In this paper, we propose $\\texttt{COPlanner}$, a planning-driven framework for model-based methods to address the inaccurately learned dynamics model problem with conservative model rollouts and optimistic environment exploration. $\\texttt{COPlanner}$ leverages an uncertainty-aware policy-guided model predictive control (UP-MPC) component to plan for multi-step uncertainty estimation. This estimated uncertainty then serves as a penalty during model rollouts and as a bonus during real environment exploration  respectively, to choose actions. Consequently, $\\texttt{COPlanner}$ can avoid model uncertain regions through conservative model rollouts,  thereby alleviating the influence of model error. Simultaneously, it explores high-reward model uncertain regions to reduce model error actively through optimistic real environment exploration. $\\texttt{COPlanner}$ is a plug-and-play framework that can be applied to any dyna-style model-based methods. Experimental results on a series of proprioceptive and visual continuous control tasks demonstrate that both sample efficiency and asymptotic performance of strong model-based methods are significantly improved combined with $\\texttt{COPlanner}$.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jnFcKjtUPN",
    "arxiv_id": "2310.07220",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18821,
    "title": "DrM: Mastering Visual Reinforcement Learning through Dormant Ratio Minimization",
    "authors": [
      "Guowei Xu",
      "Ruijie Zheng",
      "Yongyuan Liang",
      "Xiyao Wang",
      "Zhecheng Yuan",
      "Tianying Ji",
      "Yu Luo",
      "Xiaoyu Liu",
      "Jiaxin Yuan",
      "Pu Hua",
      "Shuzhen Li",
      "Yanjie Ze",
      "Hal Daum\u00e9 III",
      "Furong Huang",
      "Huazhe Xu"
    ],
    "abstract": "Visual reinforcement learning (RL) has shown promise in continuous control tasks.Despite its progress, current algorithms are still unsatisfactory in virtually every aspect of the performance such as sample efficiency, asymptotic performance, and their robustness to the choice of random seeds.In this paper, we identify a major shortcoming in existing visual RL methods that is the agents often exhibit sustained inactivity during early training, thereby limiting their ability to explore effectively. Expanding upon this crucial observation, we additionally unveil a significant correlation between the agents' inclination towards motorically inactive exploration and the absence of neuronal activity within their policy networks.To quantify this inactivity, we adopt dormant ratio as a metric to measure inactivity in the RL agent's network.Empirically, we also recognize that the dormant ratio can act as a standalone indicator of an agent's activity level, regardless of the received reward signals.Leveraging the aforementioned insights, we introduce DrM, a method that uses three core mechanisms to guide agents' exploration-exploitation trade-offs by actively minimizing the dormant ratio. Experiments demonstrate that  DrM achieves significant improvements in sample efficiency and asymptotic performance with no broken seeds (76 seeds in total) across three continuous control benchmark environments, including DeepMind Control Suite, MetaWorld, and Adroit.Most importantly, DrM is the first model-free algorithm that consistently solves tasks in both the Dog and Manipulator domains from the DeepMind Control Suite as well as three dexterous hand manipulation tasks without demonstrations in Adroit, all based on pixel observations.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MSe8YFbhUE",
    "arxiv_id": "2310.19668",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18756,
    "title": "CNN Kernels Can Be the Best Shapelets",
    "authors": [
      "Eric Qu",
      "Yansen Wang",
      "Xufang Luo",
      "Wenqiang He",
      "Kan Ren",
      "Dongsheng Li"
    ],
    "abstract": "Shapelets and CNN are two typical approaches to model time series. Shapelets aim at finding a set of sub-sequences that extract feature-based interpretable shapes, but may suffer from accuracy and efficiency issues. CNN performs well by encoding sequences with a series of hidden representations, but lacks interpretability. In this paper, we demonstrate that shapelets are essentially equivalent to a specific type of CNN kernel with a squared norm and pooling. Based on this finding, we propose ShapeConv, an interpretable CNN layer with its kernel serving as shapelets to conduct time-series modeling tasks in both supervised and unsupervised settings. By incorporating shaping regularization, we enforce the similarity for maximum interpretability. We also find human knowledge can be easily injected to ShapeConv by adjusting its initialization and model performance is boosted with it. Experiments show that ShapeConv can achieve state-of-the-art performance on time-series benchmarks without sacrificing interpretability and controllability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=O8ouVV8PjF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17395,
    "title": "Massively Scalable Inverse Reinforcement Learning in Google Maps",
    "authors": [
      "Matt Barnes",
      "Matthew Abueg",
      "Oliver F. Lange",
      "Matt Deeds",
      "Jason Trader",
      "Denali Molitor",
      "Markus Wulfmeier",
      "Shawn O'Banion"
    ],
    "abstract": "Optimizing for humans\u2019 latent preferences remains a grand challenge in route recommendation. Prior research has provided increasingly general methods based on inverse reinforcement learning (IRL), yet no approach has successfully addressed planetary-scale routing problems with hundreds of millions of states and demonstration trajectories. In this paper, we introduce scaling techniques based on graph compression, spatial parallelization, and improved initialization conditions inspired by a connection to eigenvector algorithms. We revisit classic algorithms in the routing context, and make the key observation that there exists a trade-off between the use of cheap, deterministic planners and expensive yet robust stochastic policies. This insight is leveraged in Receding Horizon Inverse Planning (RHIP), a new generalization of classic IRL algorithms that provides fine-grained control over performance trade-offs via its planning horizon. Our contributions culminate in a policy that achieves a 16-24% improvement in route quality at a global scale, and to the best of our knowledge, represents the largest published benchmark of IRL algorithms in a real-world setting to date. We conclude by conducting an ablation study of key components, presenting negative results from alternative eigenvalue solvers, and identifying opportunities to further improve scalability via IRL-specific batching strategies.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=z3L59iGALM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18216,
    "title": "Enhancing Neural Subset Selection: Integrating Background Information into Set Representations",
    "authors": [
      "Binghui Xie",
      "Yatao Bian",
      "Kaiwen Zhou",
      "Yongqiang Chen",
      "Peilin Zhao",
      "Bo Han",
      "Wei Meng",
      "James Cheng"
    ],
    "abstract": "Learning neural subset selection tasks, such as compound selection in AI-aided drug discovery, have become increasingly pivotal across diverse applications. The existing methodologies in the field primarily concentrate on constructing models that capture the relationship between utility function values and subsets within their respective supersets. However, these approaches tend to overlook the valuable information contained within the superset when utilizing neural networks to model set functions. In this work, we address this oversight by adopting a probabilistic perspective. Our theoretical findings demonstrate that when the target value is conditioned on both the input set and subset, it is essential to incorporate an invariant sufficient statistic of the superset into the subset of interest for effective learning. This ensures that the output value remains invariant to permutations of the subset and its corresponding superset, enabling identification of the specific superset from which the subset originated. Motivated by these insights, we propose a simple yet effective information aggregation module designed to merge the representations of subsets and supersets from a permutation invariance perspective. Comprehensive empirical evaluations across diverse tasks and datasets validate the enhanced efficacy of our approach over conventional methods, underscoring the practicality and potency of our proposed strategies in real-world contexts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eepoE7iLpL",
    "arxiv_id": "2402.03139",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19610,
    "title": "TopoMLP: A Simple yet Strong Pipeline for Driving Topology Reasoning",
    "authors": [
      "Dongming Wu",
      "Jiahao Chang",
      "Fan Jia",
      "Yingfei Liu",
      "Tiancai Wang",
      "Jianbing Shen"
    ],
    "abstract": "Topology reasoning aims to comprehensively understand road scenes and present drivable routes in autonomous driving. It requires detecting road centerlines (lane) and traffic elements, further reasoning their topology relationship, \\textit{i.e.}, lane-lane topology, and lane-traffic topology. In this work, we first present that the topology score relies heavily on detection performance on lane and traffic elements. Therefore, we introduce a powerful 3D lane detector and an improved 2D traffic element detector to extend the upper limit of topology performance. Further, we propose TopoMLP, a simple yet high-performance pipeline for driving topology reasoning. Based on the impressive detection performance, we develop two simple MLP-based heads for topology generation. TopoMLP achieves state-of-the-art performance on OpenLane-V2 dataset, \\textit{i.e.}, 41.2\\% OLS with ResNet-50 backbone. It is also the 1st solution for 1st OpenLane Topology in Autonomous Driving Challenge. We hope such simple and strong pipeline can provide some new insights to the community. Code is at https://github.com/wudongming97/TopoMLP.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0gTW5JUFTW",
    "arxiv_id": "2310.06753",
    "GitHub": [
      "https://github.com/wudongming97/TopoMLP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17377,
    "title": "Shadow Cones: A Generalized Framework for Partial Order Embeddings",
    "authors": [
      "Tao Yu",
      "Toni J.B. Liu",
      "Albert Tseng",
      "Christopher De Sa"
    ],
    "abstract": "Hyperbolic space has proven to be well-suited for capturing hierarchical relations in data, such as trees and directed acyclic graphs. Prior work introduced the concept of entailment cones, which uses partial orders defined by nested cones in the Poincar\\'e ball to model hierarchies. Here, we introduce the ``shadow cones\" framework, a physics-inspired entailment cone construction. Specifically, we model partial orders as subset relations between shadows formed by a light source and opaque objects in hyperbolic space. The shadow cones framework generalizes entailment cones to a broad class of formulations and hyperbolic space models beyond the Poincar\\'e ball. This results in clear advantages over existing constructions: for example, shadow cones possess better optimization properties over constructions limited to the Poincar\\'e ball. Our experiments on datasets of various sizes and hierarchical structures show that shadow cones consistently and significantly outperform existing entailment cone constructions. These results indicate that shadow cones are an effective way to model partial orders in hyperbolic space, offering physically intuitive and novel insights about the nature of such structures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zbKcFZ6Dbp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19183,
    "title": "The Generative AI Paradox: \u201cWhat It Can Create, It May Not Understand\u201d",
    "authors": [
      "Peter West",
      "Ximing Lu",
      "Nouha Dziri",
      "Faeze Brahman",
      "Linjie Li",
      "Jena D. Hwang",
      "Liwei Jiang",
      "Jillian Fisher",
      "Abhilasha Ravichander",
      "Khyathi Chandu",
      "Benjamin Newman",
      "Pang Wei Koh",
      "Allyson Ettinger",
      "Yejin Choi"
    ],
    "abstract": "The recent wave of generative AI has sparked unprecedented global attention, with both excitement and concern over potentially superhuman levels of artificial intelligence: models now take only seconds to produce outputs that would challenge or exceed the capabilities even of expert humans. At the same time, models still show basic errors in understanding that would not be expected even in non-expert humans. This presents us with an apparent paradox: how do we reconcile seemingly superhuman capabilities with the persistence of errors that few humans would make? In this work, we posit that this tension reflects a divergence in the configuration of intelligence in today's generative models relative to intelligence in humans. Specifically, we propose and test the **Generative AI Paradox** hypothesis: generative models, having been trained directly to reproduce expert-like outputs, acquire generative capabilities that are not contingent upon---and can therefore exceed---their ability to understand those same types of outputs. This contrasts with humans, for whom basic understanding almost always precedes the ability togenerate expert-level outputs. We test this hypothesis through controlled experiments analyzing generation vs.~understanding in generative models, across both language and image modalities. Our results show that although models can outperform humans in generation, they consistently fall short of human capabilities in measures of understanding, as well as weaker correlation between generation and understanding performance, and more brittleness to adversarial inputs. Our findings support the hypothesis that models' generative capability may not be contingent upon understanding capability, and call for caution in interpreting artificial intelligence by analogy to human intelligence.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CF8H8MS5P8",
    "arxiv_id": "2311.00059",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17744,
    "title": "LayoutNUWA: Revealing the Hidden Layout Expertise of Large Language Models",
    "authors": [
      "Zecheng Tang",
      "Chenfei Wu",
      "Juntao Li",
      "Nan Duan"
    ],
    "abstract": "Graphic layout generation, a growing research field, plays a significant role in user engagement and information perception. Existing methods primarily treat layout generation as a numerical optimization task, focusing on quantitative aspects while overlooking the semantic information of layout, such as the relationship between each layout element. In this paper, we propose LayoutNUWA, the first model that treats layout generation as a code generation task to enhance semantic information and harness the hidden layout expertise of large language models~(LLMs). Concretely, we develop a Code Instruct Tuning (CIT) approach comprising three interconnected modules: 1) the Code Initialization (CI) module quantifies the numerical conditions and initializes them as HTML code with strategically placed masks; 2) the Code Completion (CC) module employs the formatting knowledge of LLMs to fill in the masked portions within the HTML code; 3) the Code Rendering (CR) module transforms the completed code into the final layout output, ensuring a highly interpretable and transparent layout generation procedure that directly maps code to a visualized layout. We attain significant state-of-the-art performance (even over 50\\% improvements compared to previous works) on multiple datasets, showcasing the strong capabilities of LayoutNUWA.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qCUWVT0Ayy",
    "arxiv_id": "2309.09506",
    "GitHub": [
      "https://github.com/ProjectNUWA/LayoutNUWA"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17466,
    "title": "Are Bert Family Good Instruction Followers?  A Study on Their Potential And Limitations",
    "authors": [
      "yisheng xiao",
      "Juntao Li",
      "Zechen Sun",
      "Zechang Li",
      "Qingrong Xia",
      "Xinyu Duan",
      "Zhefeng Wang",
      "Min Zhang"
    ],
    "abstract": "Language modeling at scale has proven very effective and brought unprecedented success to natural language models. Many typical representatives, especially decoder-only models, e.g., BLOOM and LLaMA, and encoder-decoder models, e.g., Flan-T5 and AlexaTM, have exhibited incredible instruction-following capabilities while keeping strong task completion ability. These large language models can achieve superior performance in various tasks and even yield emergent capabilities, e.g., reasoning and universal generalization. Though the above two paradigms are mainstream and well explored, the potential of the BERT family, which are encoder-only based models and have ever been one of the most representative pre-trained models, also deserves attention, at least should be discussed. In this work, we adopt XML-R to explore the effectiveness of the BERT family for instruction following and zero-shot learning. We first design a simple yet effective strategy to utilize the encoder-only models for generation tasks and then conduct multi-task instruction tuning.  Experimental results demonstrate that our fine-tuned model, Instruct-XMLR, outperforms Bloomz on all evaluation tasks and achieves comparable performance with mT0 on most tasks. Surprisingly, Instruct-XMLR also possesses strong task and language generalization abilities, indicating that Instruct-XMLR can also serve as a good instruction follower and zero-shot learner. Besides, Instruct-XMLR can accelerate decoding due to its non-autoregressive generation manner, achieving around 3 times speedup compared with current autoregressive large language models. Although we also witnessed several limitations through our experiments, such as the performance decline in long-generation tasks and the shortcoming of length prediction, Instruct-XMLR can still become a good member of the family of current large language models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=x8VNtpCu1I",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19217,
    "title": "FreeReg: Image-to-Point Cloud Registration Leveraging Pretrained Diffusion Models and Monocular Depth Estimators",
    "authors": [
      "Haiping Wang",
      "Yuan Liu",
      "Bing WANG",
      "YUJING SUN",
      "Zhen Dong",
      "Wenping Wang",
      "Bisheng Yang"
    ],
    "abstract": "Matching cross-modality features between images and point clouds is a fundamental problem for image-to-point cloud registration. However, due to the modality difference between images and points, it is difficult to learn robust and discriminative cross-modality features by existing metric learning methods for feature matching. Instead of applying metric learning on cross-modality data, we propose to unify the modality between images and point clouds by pretrained large-scale models first, and then establish robust correspondence within the same modality. We show that the intermediate features, called diffusion features, extracted by depth-to-image diffusion models are semantically consistent between images and point clouds, which enables the building of coarse but robust cross-modality correspondences. We further extract geometric features on depth maps produced by the monocular depth estimator. By matching such geometric features, we significantly improve the accuracy of the coarse correspondences produced by diffusion features. Extensive experiments demonstrate that without any task-specific training, direct utilization of both features produces accurate image-to-point cloud registration. On three public indoor and outdoor benchmarks, the proposed method averagely achieves a 20.6 percent improvement in Inlier Ratio, a $3.0\\times$ higher Inlier Number, and a 48.6 percent improvement in Registration Recall than existing state-of-the-arts. The codes are available in the supplementary material and will be released upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BPb5AhT2Vf",
    "arxiv_id": "2310.03420",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17657,
    "title": "ViDA: Homeostatic Visual Domain Adapter for Continual Test Time Adaptation",
    "authors": [
      "Jiaming Liu",
      "Senqiao Yang",
      "Peidong Jia",
      "Renrui Zhang",
      "Ming Lu",
      "Yandong Guo",
      "Wei Xue",
      "Shanghang Zhang"
    ],
    "abstract": "Since real-world machine systems are running in non-stationary environments, Continual Test-Time Adaptation (CTTA) task is proposed to adapt the pre-trained model to continually changing target domains. Recently, existing methods mainly focus on model-based adaptation, which aims to leverage a self-training manner to extract the target domain knowledge. However, pseudo labels can be noisy and the updated model parameters are unreliable under dynamic data distributions, leading to error accumulation and catastrophic forgetting in the continual adaptation process. To tackle these challenges and maintain the model plasticity, we tactfully design a Visual Domain Adapter (ViDA) for CTTA, explicitly handling both domain-specific and domain-shared knowledge. Specifically, we first comprehensively explore the different domain representations of the adapters with trainable high-rank or low-rank embedding spaces. Then we inject ViDAs into the pre-trained model, which leverages high-rank and low-rank features to adapt the current domain distribution and maintain the continual domain-shared knowledge, respectively. To exploit the low-rank and high-rank ViDAs more effectively, we further propose a Homeostatic Knowledge Allotment (HKA) strategy, which adaptively combines different knowledge from each ViDA. Extensive experiments conducted on four widely used benchmarks demonstrate that our proposed method achieves state-of-the-art performance in both classification and segmentation CTTA tasks. Note that, our method can be regarded as a novel transfer paradigm for large-scale models, delivering promising results in adaptation to continually changing distributions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sJ88Wg5Bp5",
    "arxiv_id": "2306.04344",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19309,
    "title": "Learning Flexible Body Collision Dynamics with Hierarchical Contact Mesh Transformer",
    "authors": [
      "Youn-Yeol Yu",
      "Jeongwhan Choi",
      "Woojin Cho",
      "Kookjin Lee",
      "Nayong Kim",
      "Kiseok Chang",
      "ChangSeung Woo",
      "ILHO KIM",
      "SeokWoo Lee",
      "Joon Young Yang",
      "SOOYOUNG YOON",
      "Noseong Park"
    ],
    "abstract": "Recently, many mesh-based graph neural network (GNN) models have been proposed for modeling complex high-dimensional physical systems. Remarkable achievements have been made in significantly reducing the solving time compared to traditional numerical solvers. These methods are typically designed to i) reduce the computational cost in solving physical dynamics and/or ii) propose techniques to enhance the solution accuracy in fluid and rigid body dynamics. However, it remains under-explored whether they are effective in addressing the challenges of flexible body dynamics, where instantaneous collisions occur within a very short timeframe.In this paper, we present Hierarchical Contact Mesh Transformer (HCMT), which uses hierarchical mesh structures and can learn long-range dependencies (occurred by collisions) among spatially distant positions of a body --- two close positions in a higher-level mesh corresponds to two distant positions in a lower-level mesh. HCMT enables long-range interactions, and the hierarchical mesh structure quickly propagates collision effects to faraway positions. To this end, it consists of a contact mesh Transformer and a hierarchical mesh Transformer (CMT and HMT, respectively). Lastly, we propose a unique flexible body dynamics dataset, which is commonly used for product designs. We also compare the performance of several baselines using well-known benchmark datasets. Our results show that HCMT provides significant performance improvements over existing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=90yw2uM6J5",
    "arxiv_id": "2312.12467",
    "GitHub": [
      "https://github.com/yuyudeep/hcmt"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17918,
    "title": "Submodular Reinforcement Learning",
    "authors": [
      "Manish Prajapat",
      "Mojmir Mutny",
      "Melanie Zeilinger",
      "Andreas Krause"
    ],
    "abstract": "In reinforcement learning (RL), rewards of states are typically considered additive, and following the Markov assumption, they are independent of states visited previously. In many important applications, such as coverage control, experiment design and informative path planning, rewards naturally have diminishing returns, i.e., their value decreases in light of similar states visited previously. To tackle this, we propose Submodular RL (subRL), a paradigm which seeks to optimize more general, non-additive (and history-dependent) rewards modelled via submodular set functions, which capture diminishing returns. Unfortunately, in general, even in tabular settings, we show that the resulting optimization problem is hard to approximate. On the other hand, motivated by the success of greedy algorithms in classical submodular optimization, we propose subPO, a simple policy gradient-based algorithm for subRL that handles non-additive rewards by greedily maximizing marginal gains. Indeed, under some assumptions on the underlying Markov Decision Process (MDP), subPO recovers optimal constant factor approximations of submodular bandits. Moreover, we derive a natural policy gradient approach for locally optimizing subRL instances even in large state- and action- spaces. We showcase the versatility of our approach by applying subPO to several applications, such as biodiversity monitoring, Bayesian experiment design, informative path planning, and coverage maximization. Our results demonstrate sample efficiency, as well as scalability to high-dimensional state-action spaces.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=loYSzjSaAK",
    "arxiv_id": "2307.13372",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19797,
    "title": "One-shot Empirical Privacy Estimation for Federated Learning",
    "authors": [
      "Galen Andrew",
      "Peter Kairouz",
      "Sewoong Oh",
      "Alina Oprea",
      "Hugh Brendan McMahan",
      "Vinith Menon Suriyakumar"
    ],
    "abstract": "Privacy estimation techniques for differentially private (DP) algorithms are useful for comparing against analytical bounds, or to empirically measure privacy loss insettings where known analytical bounds are not tight. However, existing privacy auditing techniques usually make strong assumptions on the adversary (e.g., knowl-edge of intermediate model iterates or the training data distribution), are tailored to specific tasks, model architectures, or DP algorithm, and/or require retraining the model many times (typically on the order of thousands). These shortcomings make deploying such techniques at scale difficult in practice, especially in federatedsettings where model training can take days or weeks.  In this work, we present a novel \u201cone-shot\u201d approach that can systematically address these challenges, al-lowing efficient auditing or estimation of the privacy loss of a model during the same, single training run used to fit model parameters, and without requiring anyaprioriknowledge about the model architecture, task, or DP algorithm. We show that our method provides provably correct estimates for the privacy loss under the Gaussian mechanism, and we demonstrate its performance on a well-established FL benchmark dataset under several adversarial threat models.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=0BqyZSWfzo",
    "arxiv_id": "2302.03098",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19194,
    "title": "Inducing High Energy-Latency of Large Vision-Language Models with Verbose Images",
    "authors": [
      "Kuofeng Gao",
      "Yang Bai",
      "Jindong Gu",
      "Shu-Tao Xia",
      "Philip Torr",
      "Zhifeng Li",
      "Wei Liu"
    ],
    "abstract": "Large vision-language models (VLMs) such as GPT-4 have achieved exceptional performance across various multi-modal tasks. However, the deployment of VLMs necessitates substantial energy consumption and computational resources. Once attackers maliciously induce high energy consumption and latency time (energy-latency cost) during inference of VLMs, it will exhaust computational resources. In this paper, we explore this attack surface about availability of VLMs and aim to induce high energy-latency cost during inference of VLMs. We find that high energy-latency cost during inference of VLMs can be manipulated by maximizing the length of generated sequences. To this end, we propose verbose images, with the goal of crafting an imperceptible perturbation to induce VLMs to generate long sentences during inference. Concretely, we design three loss objectives. First, a loss is proposed to delay the occurrence of end-of-sequence (EOS) token, where EOS token is a signal for VLMs to stop generating further tokens. Moreover, an uncertainty loss and a token diversity loss are proposed to increase the uncertainty over each generated token and the diversity among all tokens of the whole generated sequence, respectively, which can break output dependency at token-level and sequence-level. Furthermore, a temporal weight adjustment algorithm is proposed, which can effectively balance these losses. Extensive experiments demonstrate that our verbose images can increase the length of generated sequences by 7.87\u00d7 and 8.56\u00d7 compared to original images on MS-COCO and ImageNet datasets, which presents potential challenges for various applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BteuUysuXX",
    "arxiv_id": "2401.11170",
    "GitHub": [
      "https://github.com/KuofengGao/Verbose_Images"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19441,
    "title": "Be Aware of the Neighborhood Effect: Modeling Selection Bias under Interference for Recommendation",
    "authors": [
      "Haoxuan Li",
      "Chunyuan Zheng",
      "Sihao Ding",
      "Peng Wu",
      "Zhi Geng",
      "Fuli Feng",
      "Xiangnan He"
    ],
    "abstract": "The interaction between users and recommender systems is not only affected by selection bias but also the neighborhood effect, i.e., the interaction between a user and an item is affected by the interactions between other users and other items, or between the same user and other items, or between other users and the same item. Many previous studies have focused on addressing selection bias to achieve unbiased learning of the prediction model, but the lack of consideration of neighborhood effects can lead to biased estimates and suboptimal performance of the prediction model. In this paper, we formally formulate the neighborhood effect as an interference problem from the perspective of causal inference and introduce a treatment representation to capture the neighborhood effect. On this basis, we propose a novel ideal loss that can be used to deal with selection bias in the presence of neighborhood effects. In addition, we further develop two novel estimators for the ideal loss. We theoretically establish the connection between the proposed methods and previous methods ignoring the neighborhood effect and show that the proposed methods achieve unbiased learning when both selection bias and neighborhood effects are present, while the existing methods are biased. Extensive semi-synthetic and real-world experiments are conducted to demonstrate the effectiveness of the proposed methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=52fz5sUAy2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19055,
    "title": "Debiased Collaborative Filtering with Kernel-based Causal Balancing",
    "authors": [
      "Haoxuan Li",
      "Yanghao Xiao",
      "Chunyuan Zheng",
      "Peng Wu",
      "Zhi Geng",
      "Xu Chen",
      "Peng Cui"
    ],
    "abstract": "Collaborative filtering builds personalized models from the collected user feedback. However, the collected data is observational rather than experimental, leading to various biases in the data, which can significantly affect the learned model. To address this issue, many studies have focused on propensity-based methods to combat the selection bias by reweighting the sample loss, and demonstrate thatbalancing is important for debiasing both theoretically and empirically. However, there are two questions that still need to be addressed: which function class should be balanced and how to effectively balance that function class? In this paper, we first perform theoretical analysis to show the effect of balancing finite-dimensional function classes on the bias of IPS and DR methods, and based on this, we propose a universal kernel-based balancing method to balance functions on the reproducing kernel Hilbert space. In addition, we propose a novel adaptive causal balancing method during the alternating update between unbiased evaluation and training of the prediction model. Specifically, the prediction loss of the model is projected in the kernel-based covariate function space, and the projection coefficients are used to determine which functions should be prioritized for balancing to reduce the estimation bias. We conduct extensive experiments on three real-world datasets to demonstrate the effectiveness of the proposed approach.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Ffjc8ApSbt",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19133,
    "title": "MetaCoCo: A New Few-Shot Classification Benchmark with Spurious Correlation",
    "authors": [
      "Min Zhang",
      "Haoxuan Li",
      "Fei Wu",
      "Kun Kuang"
    ],
    "abstract": "Out-of-distribution (OOD) problems in few-shot classification (FSC) occur when novel classes sampled from testing distributions differ from base classes drawn from training distributions, which considerably degrades the performance of deep learning models deployed in real-world applications. Recent studies suggest that the OOD problems in FSC mainly including: (a) cross-domain few-shot classification (CD-FSC) and (b) spurious-correlation few-shot classification (SC-FSC). Specifically, CD-FSC occurs when a classifier learns transferring knowledge from base classes drawn from \\underline{seen} training distributions but recognizes novel classes sampled from unseen testing distributions. In contrast, SC-FSC arises when a classifier relies on non-causal features (or contexts) that happen to be correlated with the labels (or concepts) in base classes but such relationships no longer hold during the model deployment. Despite CD-FSC has been extensively studied, SC-FSC remains understudied due to lack of the corresponding evaluation benchmarks. To this end, we present Meta Concept Context (MetaCoCo), a benchmark with spurious-correlation shifts collected from real-world scenarios. Moreover, to quantify the extent of spurious-correlation shifts of the presented MetaCoCo, we further propose a metric by using CLIP as a pre-trained vision-language model. Extensive experiments on the proposed benchmark are performed to evaluate the state-of-the-art methods in FSC, cross-domain shifts, and self-supervised learning. The experimental results show that the performance of the existing methods degrades significantly in the presence of spurious-correlation shifts. We open-source all codes of our benchmark and hope that the proposed MetaCoCo can facilitate future research on spurious-correlation shifts problems in FSC.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DiWRG9JTWZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19416,
    "title": "Jointly Training Large Autoregressive Multimodal Models",
    "authors": [
      "Emanuele Aiello",
      "LILI YU",
      "Yixin Nie",
      "Armen Aghajanyan",
      "Barlas Oguz"
    ],
    "abstract": "In recent years, advances in the large-scale pretraining of language and text-to-image models have revolutionized the field of machine learning. Yet, integrating these two modalities into a single, robust model capable of generating seamless multimodal outputs remains a significant challenge. To address this gap, we present the Joint Autoregressive Mixture (JAM) framework, a modular approach that systematically fuses existing text and image generation models. We also introduce a specialized, data-efficient instruction-tuning strategy, tailored for mixed-modal generation tasks. Our final instruct-tuned model demonstrates unparalleled performance in generating high-quality multimodal outputs and represents the first model explicitly designed for this purpose.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5jcav5RcKw",
    "arxiv_id": "2309.15564",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18835,
    "title": "Learning interpretable control inputs and dynamics underlying animal locomotion",
    "authors": [
      "Thomas Soares Mullen",
      "Marine Schimel",
      "Guillaume Hennequin",
      "Christian K. Machens",
      "Michael Orger",
      "Adrien Jouary"
    ],
    "abstract": "A central objective in neuroscience is to understand how the brain orchestrates movement. Recent advances in automated tracking technologies have made it possible to document behavior with unprecedented temporal resolution and scale, generating rich datasets which can be exploited to gain insights into the neural control of movement. One common approach is to identify stereotypical motor primitives using cluster analysis. However, this categorical description can limit our ability to model the effect of more continuous control schemes. Here we take a control theoretic approach to behavioral modeling and argue that movements can be understood as the output of a controlled dynamical system. Previously, models of movement dynamics, trained solely on behavioral data, have been effective in reproducing observed features of neural activity. These models addressed specific scenarios where animals were trained to execute particular movements upon receiving a prompt. In this study, we extend this approach to analyze the full natural locomotor repertoire of an animal: the zebrafish larva. Our findings demonstrate that this repertoire can be effectively generated through a sparse control signal driving a latent Recurrent Neural Network (RNN). Our model's learned latent space preserves key kinematic features and disentangles different categories of movements. To further interpret the latent dynamics, we used balanced model reduction to yield a simplified model. Collectively, our methods serve as a case study for interpretable system identification, and offer a novel framework for understanding neural activity in relation to movement.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MFCjgEOLJT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18059,
    "title": "CausalTime: Realistically Generated Time-series for Benchmarking of Causal Discovery",
    "authors": [
      "Yuxiao Cheng",
      "Ziqian Wang",
      "Tingxiong Xiao",
      "Qin Zhong",
      "Jinli Suo",
      "Kunlun He"
    ],
    "abstract": "Time-series causal discovery (TSCD) is a fundamental problem of machine learning. However,  existing synthetic datasets cannot properly evaluate or predict the algorithms' performance on real data. This study introduces the CausalTime pipeline to generate time-series that highly resemble the real data and with ground truth causal graphs for quantitative performance evaluation. The pipeline starts from real observations in a specific scenario and produces a matching benchmark dataset. Firstly, we harness deep neural networks along with normalizing flow to accurately capture realistic dynamics. Secondly, we extract hypothesized causal graphs by performing importance analysis on the neural network or leveraging prior knowledge. Thirdly, we derive the ground truth causal graphs by splitting the causal model into causal term, residual term, and noise term. Lastly, using the fitted network and the derived causal graph, we generate corresponding versatile time-series proper for algorithm assessment. In the experiments, we validate the fidelity of the generated data through qualitative and quantitative experiments, followed by a benchmarking of existing TSCD algorithms using these generated datasets. CausalTime offers a feasible solution to evaluating TSCD algorithms in real applications and can be generalized to a wide range of fields. For easy use of the proposed approach, we also provide a user-friendly website, hosted on www.causaltime.cc.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iad1yyyGme",
    "arxiv_id": "2310.01753",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18615,
    "title": "A Study of Bayesian Neural Network Surrogates for Bayesian Optimization",
    "authors": [
      "Yucen Lily Li",
      "Tim G. J. Rudner",
      "Andrew Gordon Wilson"
    ],
    "abstract": "Bayesian optimization is a highly efficient approach to optimizing objective functions which are expensive to query. These objectives are typically represented by Gaussian process (GP) surrogate models which are easy to optimize and support exact inference. While standard GP surrogates have been well-established in Bayesian optimization, Bayesian neural networks (BNNs) have recently become practical function approximators, with many benefits over standard GPs such as the ability to naturally handle non-stationarity and learn representations for high-dimensional data. In this paper, we study BNNs as alternatives to standard GP surrogates for optimization. We consider a variety of approximate inference procedures for finite-width BNNs, including high-quality Hamiltonian Monte Carlo, low-cost stochastic MCMC, and heuristics such as deep ensembles. We also consider infinite-width BNNs, linearized Laplace approximations, and partially stochastic models such as deep kernel learning. We evaluate this collection of surrogate models on diverse problems with varying dimensionality, number of objectives, non-stationarity, and discrete and continuous inputs. We find: (i) the ranking of methods is highly problem dependent, suggesting the need for tailored inductive biases; (ii) HMC is the most successful approximate inference procedure for fully stochastic BNNs; (iii) full stochasticity may be unnecessary as deep kernel learning is relatively competitive; (iv) deep ensembles perform relatively poorly; (v) infinite-width BNNs are particularly promising, especially in high dimensions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SA19ijj44B",
    "arxiv_id": "2305.20028",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17662,
    "title": "SocioDojo: Building Lifelong Analytical Agents with Real-world Text and Time Series",
    "authors": [
      "Junyan Cheng",
      "Peter Chin"
    ],
    "abstract": "We introduce SocioDojo, an open-ended lifelong learning environment for developing ready-to-deploy autonomous agents capable of performing human-like analysis and decision-making on societal topics such as economics, finance, politics, and culture. It consists of (1) information sources from news, social media, reports, etc., (2) a knowledge base built from books, journals, and encyclopedias, plus a toolbox of Internet and knowledge graph search interfaces, (3) 30K high-quality time series in finance, economy, society, and polls, which support a novel task called \"hyperportfolio\", that can reliably and scalably evaluate societal analysis and decision-making power of agents, inspired by portfolio optimization with time series as assets to \"invest\". We also propose a novel Analyst-Assistant-Actuator architecture for the hyperportfolio task, and a Hypothesis & Proof prompting for producing in-depth analyses on input news, articles, etc. to assist decision-making. We perform experiments and ablation studies to explore the factors that impact performance. The results show that our proposed method achieves improvements of 32.4% and 30.4% compared to the state-of-the-art method in the two experimental settings.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=s9z0HzWJJp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17562,
    "title": "Bridging Neural and Symbolic Representations with Transitional Dictionary Learning",
    "authors": [
      "Junyan Cheng",
      "Peter Chin"
    ],
    "abstract": "This paper introduces a novel Transitional Dictionary Learning (TDL) framework that can implicitly learn symbolic knowledge, such as visual parts and relations, by reconstructing the input as a combination of parts with implicit relations. We propose a game-theoretic diffusion model to decompose the input into visual parts using the dictionaries learned by the Expectation Maximization (EM) algorithm, implemented as the online prototype clustering, based on the decomposition results. Additionally, two metrics, clustering information gain, and heuristic shape score are proposed to evaluate the model. Experiments are conducted on three abstract compositional visual object datasets, which require the model to utilize the compositionality of data instead of simply exploiting visual features.  Then, three tasks on symbol grounding to predefined classes of parts and relations, as well as transfer learning to unseen classes, followed by a human evaluation, were carried out on these datasets. The results show that the proposed method discovers compositional patterns, which significantly outperforms the state-of-the-art unsupervised part segmentation methods that rely on visual features from pre-trained backbones. Furthermore, the proposed metrics are consistent with human evaluations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uqxBTcWRnj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19763,
    "title": "Amortizing intractable inference in large language models",
    "authors": [
      "Edward J Hu",
      "Moksh Jain",
      "Eric Elmoznino",
      "Younesse Kaddar",
      "Guillaume Lajoie",
      "Yoshua Bengio",
      "Nikolay Malkin"
    ],
    "abstract": "Autoregressive large language models (LLMs) compress knowledge from their training data through next-token conditional distributions. This limits tractable querying of this knowledge to start-to-end autoregressive sampling. However, many tasks of interest---including sequence continuation, infilling, and other forms of constrained generation---involve sampling from intractable posterior distributions. We address this limitation by using amortized Bayesian inference to sample from these intractable posteriors. Such amortization is algorithmically achieved by fine-tuning LLMs via diversity-seeking reinforcement learning algorithms: generative flow networks (GFlowNets). We empirically demonstrate that this distribution-matching paradigm of LLM fine-tuning can serve as an effective alternative to maximum-likelihood training and reward-maximizing policy optimization. As an important application, we interpret chain-of-thought reasoning as a latent variable modeling problem and demonstrate that our approach enables data-efficient adaptation of LLMs to tasks that require multi-step rationalization and tool use.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=Ouj6p4ca60",
    "arxiv_id": "2310.04363",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17723,
    "title": "Closing the Gap between TD Learning and Supervised Learning - A Generalisation Point of View.",
    "authors": [
      "Raj Ghugare",
      "Matthieu Geist",
      "Glen Berseth",
      "Benjamin Eysenbach"
    ],
    "abstract": "Some reinforcement learning (RL) algorithms have the capability of recombining together pieces of previously seen experience to solve a task never seen before during training. This oft-sought property is one of the few ways in which dynamic programming based RL algorithms are considered different from supervised learning (SL) based RL algorithms. Yet, recent RL methods based on off-the-shelf SL algorithms achieve excellent results without an explicit mechanism for stitching; it remains unclear whether those methods forgo this important stitching property. This paper studies this question in the setting of goal-reaching problems. We show that the desirable stitching property corresponds to a form of generalization: after training on a distribution of (state, goal) pairs, one would like to evaluate on (state, goal) pairs not seen together in the training data. Our analysis shows that this sort of generalization is different from i.i.d. generalization. This connection between stitching and generalization reveals why we should not expect existing RL methods based on SL to perform stitching, even in the limit of large datasets and models. We experimentally validate this result on carefully constructed datasets.This connection suggests a simple remedy, the same remedy for improving generalization in supervised learning: data augmentation. We propose a naive temporal data augmentation approach and demonstrate that adding it to RL methods based on SL enables them to successfully stitch together experience, so that they succeed in navigating between states and goals unseen together during training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qg5JENs0N4",
    "arxiv_id": "2401.11237",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19739,
    "title": "Gene Regulatory Network Inference in the Presence of Dropouts: a Causal View",
    "authors": [
      "Haoyue Dai",
      "Ignavier Ng",
      "Gongxu Luo",
      "Peter Spirtes",
      "Petar Stojanov",
      "Kun Zhang"
    ],
    "abstract": "Gene regulatory network inference (GRNI) is a challenging problem, particularly owing to the presence of zeros in single-cell RNA sequencing data: some are biological zeros representing no gene expression, while some others are technical zeros arising from the sequencing procedure (aka dropouts), which may bias GRNI by distorting the joint distribution of the measured gene expressions. Existing approaches typically handle dropout error via imputation, which may introduce spurious relations as the true joint distribution is generally unidentifiable. To tackle this issue, we introduce a causal graphical model to characterize the dropout mechanism, namely, Causal Dropout Model. We provide a simple yet effective theoretical result: interestingly, the conditional independence (CI) relations in the data with dropouts, after deleting the samples with zero values (regardless if technical or not) for the conditioned variables, are asymptotically identical to the CI relations in the original data without dropouts. This particular test-wise deletion procedure, in which we perform CI tests on the samples without zeros for the conditioned variables, can be seamlessly integrated with existing structure learning approaches including constraint-based and greedy score-based methods, thus giving rise to a principled framework for GRNI in the presence of dropouts. We further show that the causal dropout model can be validated from data, and many existing statistical models to handle dropouts fit into our model as specific parametric instances. Empirical evaluation on synthetic, curated, and real-world experimental transcriptomic data comprehensively demonstrate the efficacy of our method.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=gFR4QwK53h",
    "arxiv_id": "2403.15500",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17454,
    "title": "SALMON: Self-Alignment with Principle-Following Reward Models",
    "authors": [
      "Zhiqing Sun",
      "Yikang Shen",
      "Hongxin Zhang",
      "Qinhong Zhou",
      "Zhenfang Chen",
      "David Daniel Cox",
      "Yiming Yang",
      "Chuang Gan"
    ],
    "abstract": "Supervised Fine-Tuning (SFT) on human demonstrations combined with Reinforcement Learning from Human Feedback (RLHF) constitutes a powerful alignment paradigm for Large Language Model (LLM) AI-assistant agents. However, a significant limitation of this approach is its substantial dependency on high-quality human annotations, making its broader application to intricate tasks challenging due to difficulties in obtaining consistent response demonstrations and task-specific response preferences. To address this issue, we present a novel alignment paradigm in this paper, termed SALMON (Self-ALignMent with principle-fOllowiNg reward models). This paradigm offers the ability to align base language models with minimal human supervision, using only a select set of human-defined principles, yet achieves superior performance. Central to our approach is a principle-following reward model. Trained on synthetic preference data, this reward model can generate reward scores based on arbitrary human-defined principles. Therefore, during the RL training phase, by merely adjusting these principles, we gain full control over the preferences of the reward model, subsequently influencing the behavior of the RL-trained policy model, and eliminating the traditional reliance on exhaustive online human preference collection. Applying our method to the LLaMA-2-70b base language model, we developed an AI assistant named Dromedary-2. With only 6 exemplars for in-context learning and 31 human-defined principles, Dromedary-2 significantly surpasses the performance of several state-of-the-art AI systems, including LLaMA-2-Chat-70b, on various benchmark datasets. We have open-sourced the code and model weights to encourage further research into aligning LLM-based AI agents with enhanced supervision efficiency, improved controllability, and scalable oversight.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xJbsmB8UMx",
    "arxiv_id": "2310.05910",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17693,
    "title": "Functional Interpolation for Relative Positions improves Long Context Transformers",
    "authors": [
      "Shanda Li",
      "Chong You",
      "Guru Guruganesh",
      "Joshua Ainslie",
      "Santiago Ontanon",
      "Manzil Zaheer",
      "Sumit Sanghai",
      "Yiming Yang",
      "Sanjiv Kumar",
      "Srinadh Bhojanapalli"
    ],
    "abstract": "Preventing the performance decay of Transformers on inputs longer than those used for training has been an important challenge in extending the context length of these models. Though the Transformer architecture has fundamentally no limits on the input sequence lengths it can process, the choice of position encoding used during training can limit the performance of these models on longer inputs. We propose a novel functional relative position encoding with progressive interpolation, FIRE, to improve Transformer generalization to longer contexts. We theoretically prove that this can represent some of the popular relative position encodings, such as T5's RPE, Alibi, and Kerple. We next empirically show that FIRE models have better generalization to longer contexts on both zero-shot language modeling and long text benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rR03qFesqk",
    "arxiv_id": "2310.04418",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17841,
    "title": "Searching for High-Value Molecules Using Reinforcement Learning and Transformers",
    "authors": [
      "Raj Ghugare",
      "Santiago Miret",
      "Adriana Hugessen",
      "Mariano Phielipp",
      "Glen Berseth"
    ],
    "abstract": "Reinforcement learning (RL) over text representations can be effective for finding high-value policies that can search over graphs. However, RL requires careful structuring of the search space and algorithm design to be effective in this challenge. Through extensive experiments, we explore how different design choices for text grammar and algorithmic choices for training can affect an RL policy's ability to generate molecules with desired properties. We arrive at a new RL-based molecular design algorithm (ChemRLformer) and perform a thorough analysis using 25 molecule design tasks, including computationally complex protein docking simulations. From this analysis, we discover unique insights in this problem space and show that ChemRLformer achieves state-of-the-art performance while being more straightforward than prior work by demystifying which design choices are actually helpful for text-based molecule design.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nqlymMx42E",
    "arxiv_id": "2310.02902",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18045,
    "title": "Learning Performance-Improving Code Edits",
    "authors": [
      "Alexander G Shypula",
      "Aman Madaan",
      "Yimeng Zeng",
      "Uri Alon",
      "Jacob R. Gardner",
      "Yiming Yang",
      "Milad Hashemi",
      "Graham Neubig",
      "Parthasarathy Ranganathan",
      "Osbert Bastani",
      "Amir Yazdanbakhsh"
    ],
    "abstract": "With the waning of Moore's law, optimizing program performance has become a major focus of software research. However, high-level optimizations such as API and algorithm changes remain elusive due to the difficulty of understanding the semantics of code.Simultaneously, pretrained large language models (LLMs) have demonstrated strong capabilities at solving a wide range of programming tasks.To that end, we introduce a framework for adapting LLMs to high-level program optimization.First, we curate a dataset of performance-improving edits made by human programmers of over 77,000 competitive C++ programming submission pairs, accompanied by extensive unit tests.A major challenge is the significant variability of measuring performance on commodity hardware, which can lead to spurious \"improvements\".To isolate and reliably evaluate the impact of program optimizations, we design an environment based on the gem5 full system simulator, the de facto simulator used in academia and industry.Next, we propose a broad range of adaptation strategies for code optimization; for prompting, these include retrieval-based few-shot prompting and chain-of-thought, and for finetuning, these include performance-conditioned generation and synthetic data augmentation based on self-play.A combination of these techniques achieves an average speedup of 5.65 times on CodeLlama-13B and 6.86 times on GPT-3.5, surpassing the best human performance (4.06 times).We find our proposed performance-conditioned generation is particularly effective at improving performance as well as increasing the fraction of optimized programs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ix7rLVHXyY",
    "arxiv_id": "2302.07867",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19730,
    "title": "An Analytical Solution to Gauss-Newton Loss for Direct Image Alignment",
    "authors": [
      "Sergei Solonets",
      "Daniil Sinitsyn",
      "Lukas Von Stumberg",
      "Nikita Araslanov",
      "Daniel Cremers"
    ],
    "abstract": "Direct image alignment is a widely used technique for relative 6DoF pose estimation between two images, but its accuracy strongly depends on pose initialization.Therefore, recent end-to-end frameworks focused on training objectives, such as the Gauss-Newton loss, which increase the convergence basin of the learned feature descriptors.However, the training data may be biased toward a specific type of motion and pose initialization,thus limiting the generalization of these methods.In this work, we derive a closed-form solution to the expected optimum of the Gauss-Newton loss. The solution is agnostic to the underlying feature representation and allows us to dynamically adjust the basin of convergence according to our assumptions about the uncertainty in the current estimates. This offers effective control over the convergence properties of the algorithm.Despite using self-supervised feature embeddings, our solution achieves compelling accuracy w.r.t. the state-of-the-art direct image alignment methods trained end-to-end with pose supervision, and exhibits improved robustness to pose initialization.Our analytical solution provides insight into the inherent limitations of end-to-end learning with the Gauss-Newton loss and establishes an intriguing connection between direct image alignment and feature-matching approaches.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=mE52zURNGc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19780,
    "title": "Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks",
    "authors": [
      "Jie Hu",
      "Vishwaraj Doshi",
      "Do Young Eun"
    ],
    "abstract": "We study a family of distributed stochastic optimization algorithms where gradients are sampled by a token traversing a network of agents in random-walk fashion. Typically, these random-walks are chosen to be Markov chains that asymptotically sample from a desired target distribution, and play a critical role in the convergence of the optimization iterates. In this paper, we take a novel approach by replacing the standard *linear* Markovian token by one which follows a *non-linear* Markov chain - namely the Self-Repellent Radom Walk (SRRW). Defined for any given 'base' Markov chain, the SRRW, parameterized by a positive scalar $\\\\alpha$, is less likely to transition to states that were highly visited in the past, thus the name. In the context of MCMC sampling on a graph, a recent breakthrough in Doshi et al. (2023) shows that the SRRW achieves $O(1/\\\\alpha)$ decrease in the asymptotic variance for sampling. We propose the use of a `generalized' version of the SRRW to drive token algorithms for distributed stochastic optimization in the form of stochastic approximation, termed SA-SRRW. We prove that the optimization iterate errors of the resulting SA-SRRW converge to zero almost surely and prove a central limit theorem, deriving the explicit form of the resulting asymptotic covariance matrix corresponding to iterate errors. This asymptotic covariance is always smaller than that of an algorithm driven by the base Markov chain and decreases at rate $O(1/\\\\alpha^2)$ - the performance benefit of using SRRW thereby *amplified* in the stochastic optimization context. Empirical results support our theoretical findings.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=BV1PHbTJzd",
    "arxiv_id": "2401.09665",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19770,
    "title": "Improved Active Learning via Dependent Leverage Score Sampling",
    "authors": [
      "Atsushi Shimizu",
      "Xiaoou Cheng",
      "Christopher Musco",
      "Jonathan Weare"
    ],
    "abstract": "We show how to obtain improved active learning methods in the agnostic (adversarial noise) setting by combining marginal leverage score sampling with non-independent sampling strategies that promote spatial coverage. In particular, we propose an easily implemented method based on the \\emph{pivotal sampling algorithm}, which we test on problems motivated by learning-based methods for parametric PDEs and uncertainty quantification. In comparison to independent sampling, our method reduces the number of samples needed to reach a given target accuracy by up to $50\\%$.We support our findings with two theoretical results. First, we show that any non-independent leverage score sampling method that obeys a weak \\emph{one-sided $\\ell_{\\infty}$ independence condition} (which includes pivotal sampling) can actively learn $d$ dimensional linear functions with $O(d\\log d)$ samples, matching independent sampling. This result extends recent work on matrix Chernoff bounds under $\\ell_{\\infty}$ independence, and may be of interest for analyzing other sampling strategies beyond pivotal sampling. Second, we show that, for the important case of polynomial regression, our pivotal method obtains an improved bound of $O(d)$ samples.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=IYxDy2jDFL",
    "arxiv_id": "2310.04966",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17641,
    "title": "NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks",
    "authors": [
      "Wenxi Wang",
      "Yang Hu",
      "Mohit Tiwari",
      "Sarfraz Khurshid",
      "Kenneth McMillan",
      "Risto Miikkulainen"
    ],
    "abstract": "Propositional satisfiability (SAT) is an NP-complete problem that impacts manyresearch fields, such as planning, verification, and security. Mainstream modernSAT solvers are based on the Conflict-Driven Clause Learning (CDCL) algorithm.Recent work aimed to enhance CDCL SAT solvers using Graph Neural Networks(GNNs). However, so far this approach either has not made solving more effective,or required substantial GPU resources for frequent online model inferences. Aimingto make GNN improvements practical, this paper proposes an approach calledNeuroBack, which builds on two insights: (1) predicting phases (i.e., values) ofvariables appearing in the majority (or even all) of the satisfying assignments areessential for CDCL SAT solving, and (2) it is sufficient to query the neural modelonly once for the predictions before the SAT solving starts. Once trained, theoffline model inference allows NeuroBack to execute exclusively on the CPU,removing its reliance on GPU resources. To train NeuroBack, a new dataset calledDataBack containing 120,286 data samples is created. Finally, NeuroBack is implementedas an enhancement to a state-of-the-art SAT solver called Kissat. As a result,it allowed Kissat to solve 5.2% more problems on the recent SAT competitionproblem set, SATCOMP-2022. NeuroBack therefore shows how machine learningcan be harnessed to improve SAT solving in an effective and practical manner.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=samyfu6G93",
    "arxiv_id": "2110.14053",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19731,
    "title": "Unprocessing Seven Years of Algorithmic Fairness",
    "authors": [
      "Andr\u00e9 Cruz",
      "Moritz Hardt"
    ],
    "abstract": "Seven years ago, researchers proposed a postprocessing method to equalize the error rates of a model across different demographic groups. The work launched hundreds of papers purporting to improve over the postprocessing baseline. We empirically evaluate these claims through thousands of model evaluations on several tabular datasets. We find that the fairness-accuracy Pareto frontier achieved by postprocessing contains all other methods we were feasibly able to evaluate. In doing so, we address two common methodological errors that have confounded previous observations. One relates to the comparison of methods with different unconstrained base models. The other concerns methods achieving different levels of constraint relaxation. At the heart of our study is a simple idea we call unprocessing that roughly corresponds to the inverse of postprocessing. Unprocessing allows for a direct comparison of methods using different underlying models and levels of relaxation.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=jr03SfWsBS",
    "arxiv_id": "2306.07261",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19400,
    "title": "Two-timescale Extragradient for Finding Local Minimax Points",
    "authors": [
      "Jiseok Chae",
      "Kyuwon Kim",
      "Donghwan Kim"
    ],
    "abstract": "Minimax problems are notoriously challenging to optimize. However, we present that two-timescale extragradient can be a viable solution. By utilizing dynamical systems theory, we show that it converges to points that satisfy the second-order necessary condition of local minimax points, under mild conditions. This work provably improves upon all previous results as we eliminate a crucial assumption that the Hessian, with respect to the maximization variable, is nondegenerate.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6CIGhcJYJH",
    "arxiv_id": "2305.16242",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19399,
    "title": "DrS: Learning Reusable Dense Rewards for Multi-Stage Tasks",
    "authors": [
      "Tongzhou Mu",
      "Minghua Liu",
      "Hao Su"
    ],
    "abstract": "The success of many RL techniques heavily relies on human-engineered dense rewards, which typically demands substantial domain expertise and extensive trial and error. In our work, we propose **DrS** (**D**ense **r**eward learning from **S**tages), a novel approach for learning *reusable* dense rewards for multi-stage tasks in a data-driven manner. By leveraging the stage structures of the task, DrS learns a high-quality dense reward from sparse rewards and demonstrations if given. The learned rewards can be *reused* in unseen tasks, thus reducing the human effort for reward engineering. Extensive experiments on three physical robot manipulation task families with 1000+ task variants demonstrate that our learned rewards can be reused in unseen tasks, resulting in improved performance and sample efficiency of RL algorithms. The learned rewards even achieve comparable performance to human-engineered rewards on some tasks. See our [project page](https://sites.google.com/view/iclr24drs) for videos.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6CZ50WgfCG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19027,
    "title": "Duolando: Follower GPT with Off-Policy Reinforcement Learning for Dance Accompaniment",
    "authors": [
      "Li Siyao",
      "Tianpei Gu",
      "Zhitao Yang",
      "Zhengyu Lin",
      "Ziwei Liu",
      "Henghui Ding",
      "Lei Yang",
      "Chen Change Loy"
    ],
    "abstract": "We introduce a novel task within the field of human motion generation, termed dance accompaniment, which necessitates the generation of responsive movements from a dance partner, the \"follower\", synchronized with the lead dancer\u2019s movements and the underlying musical rhythm. Unlike existing solo or group dance generation tasks, a duet dance scenario entails a heightened degree of interaction between the two participants, requiring delicate coordination in both pose and position. To support this task, we first build a large-scale and diverse duet interactive dance dataset, DD100, by recording about 115.4 minutes of professional dancers\u2019 performances. To address the challenges inherent in this task, we propose a GPT based model, Duolando, which autoregressively predicts the subsequent tokenized motion conditioned on the coordinated information of the music, the leader\u2019s and the follower\u2019s movements. To further enhance the GPT\u2019s capabilities of generating stable results on unseen conditions (music and leader motions), we devise an off-policy reinforcement learning strategy that allows the model to explore viable trajectories from out-of-distribution samplings, guided by human-defined rewards. Based on the collected dataset and proposed method, we establish a benchmark with several carefully designed metrics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GW4j4n2cjH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19398,
    "title": "Personalize Segment Anything Model with One Shot",
    "authors": [
      "Renrui Zhang",
      "Zhengkai Jiang",
      "Ziyu Guo",
      "Shilin Yan",
      "Junting Pan",
      "Hao Dong",
      "Yu Qiao",
      "Peng Gao",
      "Hongsheng Li"
    ],
    "abstract": "Driven by large-data pre-training, Segment Anything Model (SAM) has been demonstrated as a powerful promptable framework, revolutionizing the segmentation field. Despite the generality, customizing SAM for specific visual concepts without man-powered prompting is under-explored, e.g., automatically segmenting your pet dog in numerous images. In this paper, we introduce a training-free Personalization approach for SAM, termed PerSAM. Given only one-shot data, i.e., a single image with a reference mask, we first obtain a positive-negative location prior for the target concept in new images. Then, aided by target visual semantics, we empower SAM for personalized object segmentation via two proposed techniques: target-guided attention and target-semantic prompting. In this way, we can effectively customize the general-purpose SAM for private use without any training. To further alleviate the ambiguity of segmentation scales, we present an efficient one-shot fine-tuning variant, PerSAM-F. Freezing the entire SAM, we introduce a scale-aware fine-tuning to aggregate multi-scale masks, which only tunes 2 parameters within 10 seconds for improved performance. To demonstrate our efficacy, we construct a new dataset, PerSeg, for the evaluation of personalized object segmentation, and also test our methods on various one-shot image and video segmentation benchmarks. Besides, we propose to leverage PerSAM to improve DreamBooth for personalized text-to-image synthesis. By mitigating the disturbance of training-set backgrounds, our approach showcases better target appearance generation and higher fidelity to the input text prompt.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6Gzkhoc6YS",
    "arxiv_id": "2305.03048",
    "GitHub": [
      "https://github.com/ZrrSkywalker/Personalize-SAM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19397,
    "title": "Conserve-Update-Revise to Cure Generalization and Robustness Trade-off in Adversarial Training",
    "authors": [
      "Shruthi Gowda",
      "Bahram Zonooz",
      "Elahe Arani"
    ],
    "abstract": "Adversarial training improves the robustness of neural networks against adversarial attacks, albeit at the expense of the trade-off between standard and robust generalization.To unveil the underlying factors driving this phenomenon, we examine the layer-wise learning capabilities of neural networks during the transition from a standard to an adversarial setting. Our empirical findings demonstrate that selectively updating specific layers while preserving others can substantially enhance the network's learning capacity. We, therefore, propose CURE, a novel training framework that leverages a gradient prominence criterion to perform selective conservation, updating, and revision of weights. Importantly, CURE is designed to be dataset- and architecture-agnostic, ensuring its applicability across various scenarios. It effectively tackles both memorization and overfitting issues, thus enhancing the trade-off between robustness and generalization and additionally, this training approach also aids in mitigating \"robust overfitting\". Furthermore, our study provides valuable insights into the mechanisms of selective adversarial training and offers a promising avenue for future research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6IjN7oxjXt",
    "arxiv_id": "2401.14948",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19024,
    "title": "MMD Graph Kernel: Effective Metric Learning for Graphs via Maximum Mean Discrepancy",
    "authors": [
      "Yan Sun",
      "Jicong Fan"
    ],
    "abstract": "This paper focuses on graph metric learning. First, we present a class of maximum mean discrepancy (MMD) based graph kernels, called MMD-GK. These kernels are computed by applying MMD to the node representations of two graphs with message-passing propagation. Compared to classical graph kernels such as the Weisfeiler-Lehman kernel, our MMD-GKs have much lower computational costs and are able to exploit nodes' features of graphs effectively. Secondly, we provide a class of deep MMD-GKs that are able to learn graph metrics and implicit graph features adaptively in an unsupervised manner. Thirdly, we propose a class of supervised deep MMD-GKs that are able to utilize label information of graphs and hence yield more discriminative metrics. Besides the algorithms, we provide theoretical analysis for the proposed methods. The proposed methods are evaluated in comparison to many baselines such as graph kernels and graph neural networks in the tasks of graph clustering and graph classification. The numerical results demonstrate the effectiveness and superiority of our methods.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=GZ6AcZwA8r",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19396,
    "title": "Principled Federated Domain Adaptation: Gradient Projection and Auto-Weighting",
    "authors": [
      "Enyi Jiang",
      "Yibo Jacky Zhang",
      "Sanmi Koyejo"
    ],
    "abstract": "Federated Domain Adaptation (FDA) describes the federated learning (FL) setting where source clients and a server work collaboratively to improve the performance of a target client where limited data is available. The domain shift between the source and target domains, coupled with limited data of the target client, makes FDA a challenging problem, e.g., common techniques such as federated averaging and fine-tuning fail due to domain shift and data scarcity. To theoretically understand the problem, we introduce new metrics that characterize the FDA setting and a theoretical framework with novel theorems for analyzing the performance of server aggregation rules. Further, we propose a novel lightweight aggregation rule, Federated Gradient Projection ($\\texttt{FedGP}$), which significantly improves the target performance with domain shift and data scarcity. Moreover, our theory suggests an $\\textit{auto-weighting scheme}$ that finds the optimal combinations of the source and target gradients. This scheme improves both $\\texttt{FedGP}$ and a simpler heuristic aggregation rule. Extensive experiments verify the theoretical insights and illustrate the effectiveness of the proposed methods in practice.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6J3ehSUrMU",
    "arxiv_id": "2302.05049",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19762,
    "title": "Learning Energy Decompositions for Partial Inference in GFlowNets",
    "authors": [
      "Hyosoon Jang",
      "Minsu Kim",
      "Sungsoo Ahn"
    ],
    "abstract": "This paper studies generative flow networks (GFlowNets) to sample objects from the Boltzmann energy distribution via a sequence of actions. In particular, we focus on improving GFlowNet with partial inference: training flow functions with the evaluation of the intermediate states or transitions. To this end, the recently developed forward-looking GFlowNet reparameterizes the flow functions based on evaluating the energy of intermediate states. However, such an evaluation of intermediate energies may (i) be too expensive or impossible to evaluate and (ii) even provide misleading training signals under large energy fluctuations along the sequence of actions. To resolve this issue, we propose learning energy decompositions for GFlowNets (LED-GFN). Our main idea is to (i) decompose the energy of an object into learnable potential functions defined on state transitions and (ii) reparameterize the flow functions using the potential functions. In particular, to produce informative local credits, we propose to regularize the potential to change smoothly over the sequence of actions. It is also noteworthy that training GFlowNet with our learned potential can preserve the optimal policy. We empirically verify the superiority of LED-GFN in five problems including the generation of unstructured and maximum independent sets, molecular graphs, and RNA sequences.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=P15CHILQlg",
    "arxiv_id": "2310.03301",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19395,
    "title": "UniTabE: A Universal Pretraining Protocol for Tabular Foundation  Model in Data Science",
    "authors": [
      "Yazheng Yang",
      "Yuqi Wang",
      "Guang Liu",
      "Ledell Wu",
      "Qi Liu"
    ],
    "abstract": "Recent advancements in Natural Language Processing (NLP) have witnessed the groundbreaking impact of pretrained models, yielding impressive outcomes across various tasks. This study seeks to extend the power of pretraining methodologies to facilitating the prediction over tables in data science, a domain traditionally overlooked, yet inherently challenging due to the plethora of table schemas intrinsic to different tasks. The primary research questions underpinning this work revolve around the establishment of a universal pretraining protocol for tables with varied structures, the generalizability and transferability of learned knowledge across tasks, the adaptation to diverse downstream applications, and the incorporation of incremental columns over time. In response to these challenges, we introduce UniTabE, a straightforward yet effective method designed to process tables in a uniform manner, devoid of constraints imposed by specific table structures. UniTabE's core concept relies on representing each basic table element with a module, termed TabUnit. This is subsequently followed by a Transformer encoder to refine the representation. Moreover, our model is designed to facilitate pretraining and finetuning through the utilization of free-form prompts. In order to implement the pretraining phase, we curated an expansive tabular dataset comprising approximately 13 billion samples, meticulously gathered from the Kaggle platform. This research primarily centers on classification and regression tasks involving tabular data, and conducts rigorous experimental testing and analyses to validate the effectiveness of our methodology. The experimental results demonstrate UniTabE's superior performance against several baseline models across a multitude of benchmark datasets. This, therefore, underscores UniTabE's potential to significantly enhance the semantic representation of tabular data, thereby marking a significant stride for tabular data analysis.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6LLho5X6xV",
    "arxiv_id": "2307.09249",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19759,
    "title": "Meta Continual Learning Revisited: Implicitly Enhancing Online Hessian Approximation via Variance Reduction",
    "authors": [
      "Yichen Wu",
      "Long-Kai Huang",
      "Renzhen Wang",
      "Deyu Meng",
      "Ying Wei"
    ],
    "abstract": "Regularization-based methods have so far been among the *de facto* choices for continual learning. Recent theoretical studies have revealed that these methods all boil down to relying on the Hessian matrix approximation of model weights. However, these methods suffer from suboptimal trade-offs between knowledge transfer and forgetting due to fixed and unchanging Hessian estimations during training.Another seemingly parallel strand of Meta-Continual Learning (Meta-CL) algorithms enforces alignment between gradients of previous tasks and that of the current task. In this work we revisit Meta-CL and for the first time bridge it with regularization-based methods. Concretely, Meta-CL implicitly approximates Hessian in an online manner, which enjoys the benefits of timely adaptation but meantime suffers from high variance induced by random memory buffer sampling. We are thus highly motivated to combine the best of both worlds, through the proposal of Variance Reduced Meta-CL (VR-MCL) to achieve both timely and accurate Hessian approximation.Through comprehensive experiments across three datasets and various settings, we consistently observe that VR-MCL outperforms other SOTA methods, which further validates the effectiveness of VR-MCL.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=TpD2aG1h0D",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19746,
    "title": "Latent Trajectory Learning for Limited Timestamps under Distribution Shift over Time",
    "authors": [
      "QIUHAO Zeng",
      "Changjian Shui",
      "Long-Kai Huang",
      "Peng Liu",
      "Xi Chen",
      "Charles Ling",
      "Boyu Wang"
    ],
    "abstract": "Distribution shifts over time are common in real-world machine-learning applications. This scenario is formulated as Evolving Domain Generalization (EDG), where models aim to generalize well to unseen target domains in a time-varying system by learning and leveraging the underlying evolving pattern of the distribution shifts across domains. However, existing methods encounter challenges due to the limited number of timestamps (every domain corresponds to a timestamp) in EDG datasets, leading to difficulties in capturing evolving dynamics and risking overfitting to the sparse timestamps, which hampers their generalization and adaptability to new tasks. To address this limitation, we propose a novel approach SDE-EDG that collects the Infinitely Fined-Grid Evolving Trajectory (IFGET) of the data distribution with continuous-interpolated samples to bridge temporal gaps (intervals between two successive timestamps). Furthermore, by leveraging the inherent capacity of Stochastic Differential Equations (SDEs) to capture continuous trajectories, we propose their use to align SDE-modeled trajectories with IFGET across domains, thus enabling the capture of evolving distribution trends. We evaluate our approach on several benchmark datasets and demonstrate that it can achieve superior performance compared to existing state-of-the-art methods.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=bTMMNT7IdW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19393,
    "title": "Graphical Multioutput Gaussian Process with Attention",
    "authors": [
      "Yijue Dai",
      "Wenzhong Yan",
      "Feng Yin"
    ],
    "abstract": "Integrating information while recognizing dependence from multiple data sources and enhancing the predictive performance of the multi-output regression are challenging tasks. Multioutput Gaussian Process (MOGP) methods offer outstanding solutions with tractable predictions and uncertainty quantification.However, their practical applications are hindered by high computational complexity and storage demand. Additionally, there exist model mismatches in existing MOGP models when dealing with non-Gaussian data. To improve the model representation ability in terms of flexibility, optimality, and scalability,this paper introduces a novel multi-output regression framework, termed Graphical MOGP (GMOGP), which is empowered by:(i) generating flexible Gaussian process priors consolidated from identified parents, (ii) providing dependent processes with attention-based graphical representations, and (iii) achieving Pareto optimal solutions via a distributed learning framework. Numerical results confirm that the proposed GMOGP significantly outperforms state-of-the-art MOGP alternatives in predictive performance, as well as in time and memory efficiency, across various synthetic and real datasets.Our code and datasets are available at https://anonymous.4open.science/r/GMOGP-5ED3/.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=6N8TW504aa",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19726,
    "title": "ExeDec: Execution Decomposition for Compositional Generalization in Neural Program Synthesis",
    "authors": [
      "Kensen Shi",
      "Joey Hong",
      "Yinlin Deng",
      "Pengcheng Yin",
      "Manzil Zaheer",
      "Charles Sutton"
    ],
    "abstract": "When writing programs, people have the ability to tackle a new complex task by decomposing it into smaller and more familiar subtasks. While it is difficult to measure whether neural program synthesis methods have similar capabilities, we can measure whether they compositionally generalize, that is, whether a model that has been trained on the simpler subtasks is subsequently able to solve more complex tasks. In this paper, we characterize several different forms of compositional generalization that are desirable in program synthesis, forming a meta-benchmark which we use to create generalization tasks for two popular datasets, RobustFill and DeepCoder. We then propose ExeDec, a novel decomposition-based synthesis strategy that predicts execution subgoals to solve problems step-by-step informed by program execution at each step. When used with Transformer models trained from scratch, ExeDec has better synthesis performance and greatly improved compositional generalization ability compared to baselines. Finally, we use our benchmarks to demonstrate that LLMs struggle to compositionally generalize when asked to do programming-by-example in a few-shot setting, but an ExeDec-style prompting approach can improve the generalization ability and overall performance.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=oTRwljRgiv",
    "arxiv_id": "2307.13883",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19392,
    "title": "NoiseDiffusion: Correcting Noise for Image  Interpolation  with Diffusion Models beyond Spherical Linear Interpolation",
    "authors": [
      "PengFei Zheng",
      "Yonggang Zhang",
      "Zhen Fang",
      "Tongliang Liu",
      "Defu Lian",
      "Bo Han"
    ],
    "abstract": "Image interpolation based on diffusion models is promising in creating fresh and interesting images. Advanced interpolation methods mainly focus on linear spherical interpolation, delivering remarkable success for images generated by diffusion models.However, existing methods struggle with natural images (not generated by diffusion models), limiting practical applications.Our investigation into the interpolation process has unveiled that its shortcomings are rooted in the introduction of inappropriate noise, which may either exceed or fall below the denoising threshold, leading to issues such as image artifacts and information loss in the interpolated images. To address this issue, we initially investigated a direct noise addition method, which improved image quality but introduced unwanted information. Drawing from these findings, we subsequently developed a novel interpolation approach that harnesses the advantages of both techniques. This approach retains the valuable noise with information from the original images while introducing a subtle Gaussian noise to enhance interpolation quality. Moreover, we introduced an innovative constraint on the noise component responsible for generating artifacts and incorporated original image to supplement missing information.These enhancements not only improved the interpolation results for images within the training domain but also extended the capability to interpolate with natural images beyond the training domain, achieving in the best interpolation results to date.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=6O3Q6AFUTu",
    "arxiv_id": "2403.08840",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19391,
    "title": "Dynamic Discounted Counterfactual Regret Minimization",
    "authors": [
      "Hang Xu",
      "Kai Li",
      "Haobo Fu",
      "QIANG FU",
      "Junliang Xing",
      "Jian Cheng"
    ],
    "abstract": "Counterfactual regret minimization (CFR) is a family of iterative algorithms showing promising results in solving imperfect-information games. Recent novel CFR variants (e.g., CFR+, DCFR) have significantly improved the convergence rate of the vanilla CFR. The key to these CFR variants\u2019 performance is weighting each iteration non-uniformly, i.e., discounting earlier iterations. However, these algorithms use a fixed, manually-specified scheme to weight each iteration, which enormously limits their potential. In this work, we propose Dynamic Discounted CFR (DDCFR), the first equilibrium-finding framework that discounts prior iterations using a dynamic, automatically-learned scheme. We formalize CFR\u2019s iteration process as a carefully designed Markov decision process and transform the discounting scheme learning problem into a policy optimization problem within it. The learned discounting scheme dynamically weights each iteration on the fly using information available at runtime. Experimental results across multiple games demonstrate that DDCFR\u2019s dynamic discounting scheme has a strong generalization ability and leads to faster convergence with improved performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=6PbvbLyqT6",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19023,
    "title": "Robust Model Based Reinforcement Learning Using $\\mathcal{L}_1$ Adaptive Control",
    "authors": [
      "Minjun Sung",
      "Sambhu Harimanas Karumanchi",
      "Aditya Gahlawat",
      "Naira Hovakimyan"
    ],
    "abstract": "We introduce $\\mathcal{L}_1$-MBRL, a control-theoretic augmentation scheme for Model-Based Reinforcement Learning (MBRL) algorithms. Unlike model-free approaches, MBRL algorithms learn a model of the transition function using data and use it to design a control input. Our approach generates an approximate control-affine model of the learned transition function according to the switching law. Using the approximate model, control input produced by the underlying MBRL is perturbed by the $\\mathcal{L}_1$ adaptive control, which is designed to enhance the robustness of the system against uncertainties. Importantly, this approach is agnostic to the choice of MBRL algorithm, which enables the utilization of the scheme in various MBRL algorithms. Our method exhibits superior performance and sample efficiency on multiple MuJoCo environments, both with and without system noise, as demonstrated through numerical simulations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GaLCLvJaoF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19790,
    "title": "LongLoRA: Efficient Fine-tuning of Long-Context Large Language Models",
    "authors": [
      "Yukang Chen",
      "Shengju Qian",
      "Haotian Tang",
      "Xin Lai",
      "Zhijian Liu",
      "Song Han",
      "Jiaya Jia"
    ],
    "abstract": "We present LongLoRA, an efficient fine-tuning approach that extends the context sizes of pre-trained large language models (LLMs), with limited computation cost. Typically, training LLMs with long context sizes is computationally expensive, requiring extensive training hours and GPU resources. For example, training on the context length of 8192 needs 16x computational costs in self-attention layers as that of 2048. In this paper, we speed up the context extension of LLMs in two aspects. On the one hand, although dense global attention is needed during inference, fine-tuning the model can be effectively and efficiently done by sparse local attention. The proposed shift short attention effectively enables context extension, leading to non-trivial computation saving with similar performance to fine-tuning with vanilla attention. Particularly, it can be implemented with only two lines of code in training, while being optional in inference. On the other hand, we revisit the parameter-efficient fine-tuning regime for context expansion. Notably, we find that LoRA for context extension works well under the premise of trainable embedding and normalization. LongLoRA demonstrates strong empirical results on various tasks on Llama2 models from 7B/13B to 70B. LongLoRA adopts Llama2 7B from 4k context to 100k, or Llama2 70B to 32k on a single 8$\\times$ A100 machine. LongLoRA extends models' context while retaining their original architectures, and is compatible with most existing techniques, like Flash-Attention2. In addition, we further conduct supervised fine-tuning on our LongLoRA models, with long instruction-following data. Our code and models will be publicly available.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=6PmJoRfdaK",
    "arxiv_id": "2309.12307",
    "GitHub": [
      "https://github.com/dvlab-research/LongLoRA"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19021,
    "title": "Dictionary Contrastive Learning for Efficient Local Supervision without Auxiliary Networks",
    "authors": [
      "Suhwan Choi",
      "Myeongho Jeon",
      "Yeonjung Hwang",
      "Jeonglyul Oh",
      "Sungjun Lim",
      "Joonseok Lee",
      "Myungjoo Kang"
    ],
    "abstract": "While backpropagation (BP) has achieved widespread success in deep learning, it faces two prominent challenges; that is, computational inefficiency and biological implausibility. These issues arise from the requirements of feedback weight symmetry and the forward/backward pass locking. \"Forward learning\" (FL), an emerging alternative, updates each layer's weights during the forward pass, eliminating the need for backward error signal propagation to address these concerns. Recent approaches have leveraged contrastive learning as a specialized tool for this scenario. However, it still exhibits suboptimal performance in comparison to BP. Our investigation suggests that existing contrastive FL methods, which assess similarities among local features, are susceptible to the inclusion of task-irrelevant information. In response to this, we propose a straightforward FL objective within a contrastive learning framework, with the goal of enhancing the similarity between local features and label embeddings, i.e., Dictionary Contrastive Forward Learning (DC-FL). Consequently, our objective yields substantial performance improvements, outperforming other state-of-the-art forward learning techniques. Notably, our method closely approaches the performance achieved by BP while concurrently preserving superior memory efficiency.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Gg7cXo3S8l",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19020,
    "title": "Investigating the Benefits of Projection Head for Representation Learning",
    "authors": [
      "Yihao Xue",
      "Eric Gan",
      "Jiayi Ni",
      "Siddharth Joshi",
      "Baharan Mirzasoleiman"
    ],
    "abstract": "Recently, multimodal contrastive learning (MMCL) approaches, such as CLIP \\citep{radford2021learning}, have achieved a remarkable success in learning representations that are robust against distribution shift and generalize to new domains. Despite the empirical success, the mechanism behind learning such generalizable representations is not understood. In this work, we rigorously analyze this problem and uncover two mechanisms behind MMCL's robustness: \\emph{intra-class contrasting}, which allows the model to learn features with a high variance, and \\emph{inter-class feature sharing}, where annotated details in one class help learning other classes better. Both mechanisms prevent spurious features that are over-represented in the training data to overshadow the generalizable core features. This yields superior zero-shot classification accuracy under distribution shift. Furthermore, we theoretically demonstrate the benefits of using rich captions on robustness and explore the effect of annotating different types of details in the captions. We validate our theoretical findings through experiments, including a well-designed synthetic experiment and an experiment involving training CLIP on MS COCO \\citep{lin2014microsoft} and evaluating the model on variations of shifted ImageNet.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GgEAdqYPNA",
    "arxiv_id": "2403.11391",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19777,
    "title": "Multisize Dataset Condensation",
    "authors": [
      "Yang He",
      "Lingao Xiao",
      "Joey Tianyi Zhou",
      "Ivor Tsang"
    ],
    "abstract": "While dataset condensation effectively enhances training efficiency, its application in on-device scenarios brings unique challenges. 1) Due to the fluctuating computational resources of these devices, there's a demand for a flexible dataset size that diverges from a predefined size. 2) The limited computational power on devices often prevents additional condensation operations. These two challenges connect to the \"subset degradation problem\" in traditional dataset condensation: a subset from a larger condensed dataset is often unrepresentative compared to directly condensing the whole dataset to that smaller size. In this paper, we propose Multisize Dataset Condensation (MDC) by **compressing N condensation processes into a single condensation process to obtain datasets with multiple sizes**. Specifically, we introduce an \"adaptive subset loss\" on top of the basic condensation loss to mitigate the \"subset degradation problem\". Our MDC method offers several benefits: 1) No additional condensation process is required; 2) reduced storage requirement by reusing condensed images. Experiments validate our findings on networks including ConvNet, ResNet and DenseNet, and datasets including SVHN,  CIFAR-10, CIFAR-100 and ImageNet. For example, we achieved 6.40% average accuracy gains on condensing CIFAR-10 to ten images per class.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=FVhmnvqnsI",
    "arxiv_id": "2403.06075",
    "GitHub": [
      "https://github.com/he-y/Multisize-Dataset-Condensation"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19019,
    "title": "Orbit-Equivariant Graph Neural Networks",
    "authors": [
      "Matthew Morris",
      "Bernardo Cuenca Grau",
      "Ian Horrocks"
    ],
    "abstract": "Equivariance is an important structural property that is captured by architectures such as graph neural networks (GNNs). However, equivariant graph functions cannot produce different outputs for similar nodes, which may be undesirable when the function is trying to optimize some global graph property. In this paper, we define orbit-equivariance, a relaxation of equivariance which allows for such functions whilst retaining important structural inductive biases. We situate the property in the hierarchy of graph functions, define a taxonomy of orbit-equivariant functions, and provide four different ways to achieve non-equivariant GNNs. For each, we analyze their expressivity with respect to orbit-equivariance and evaluate them on two novel datasets, one of which stems from a real-world use-case of designing optimal bioisosteres.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GkJOCga62u",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19779,
    "title": "InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning",
    "authors": [
      "Ziheng Qin",
      "Kai Wang",
      "Zangwei Zheng",
      "Jianyang Gu",
      "Xiangyu Peng",
      "xu Zhao Pan",
      "Daquan Zhou",
      "Lei Shang",
      "Baigui Sun",
      "Xuansong Xie",
      "Yang You"
    ],
    "abstract": "Data pruning aims to obtain lossless performances with less overall cost. A common approach is to filter out samples that make less contribution to the training. This could lead to gradient expectation bias compared to the original data. To solve this problem, we propose InfoBatch, a novel framework aiming to achieve lossless training acceleration by unbiased dynamic data pruning. Specifically, InfoBatchrandomly prunes a portion of less informative samples based on the loss distribution and rescales the gradients of the remaining samples to approximate the original gradient. As a plug-and-play and architecture-agnostic framework, InfoBatch consistently obtains lossless training results on classification, semantic segmentation, vision pertaining, and instruction fine-tuning tasks. On CIFAR10/100, ImageNet-1K, and ADE20K, InfoBatch losslessly saves 40% overall cost. For pertaining MAE and diffusion model, InfoBatch can respectively save 24.8% and 27% cost. For LLaMA instruction fine-tuning, InfoBatch is also able to save 20% cost and is compatible with coreset selection methods. The code will be made public.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=C61sk5LsK6",
    "arxiv_id": "2303.04947",
    "GitHub": [
      "https://github.com/henryqin1997/InfoBatch"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19715,
    "title": "ClimODE: Climate Forecasting With Physics-informed Neural ODEs",
    "authors": [
      "Yogesh Verma",
      "Markus Heinonen",
      "Vikas Garg"
    ],
    "abstract": "Climate prediction traditionally relies on complex numerical simulations of atmospheric physics. Deep learning approaches, such as transformers, have recently challenged the simulation paradigm with complex network forecasts. However, they often act as data-driven black-box models that neglect the underlying physics and lack uncertainty quantification. We address these limitations with ClimODE, a  spatiotemporal continuous-time process that implements a key principle of advection from statistical mechanics, namely, weather changes due to a spatial movement of quantities over time. ClimODE models precise weather evolution with value-conserving dynamics, learning global weather transport as a neural flow, which also enables estimating the uncertainty in predictions. Our approach outperforms existing data-driven methods in global and regional forecasting with an order of magnitude smaller parameterization, establishing a new state of the art.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=xuY33XhEGR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19792,
    "title": "Mixed-Type Tabular Data Synthesis with Score-based Diffusion in Latent Space",
    "authors": [
      "Hengrui Zhang",
      "Jiani Zhang",
      "Zhengyuan Shen",
      "Balasubramaniam Srinivasan",
      "Xiao Qin",
      "Christos Faloutsos",
      "Huzefa Rangwala",
      "George Karypis"
    ],
    "abstract": "Recent advances in tabular data generation have greatly enhanced synthetic data quality. However, extending diffusion models to tabular data is challenging due to the intricately varied distributions and a blend of data types of tabular data. This paper introduces TABSYN, a methodology that synthesizes tabular data by leveraging a diffusion model within a variational autoencoder (VAE) crafted latent space.The key advantages of the proposed TabSyn include (1) Generality: the ability to handle a broad spectrum of data types by converting them into a single unified space and explicitly capture inter-column relations, (2) Quality: optimizing the distribution of latent embeddings to enhance the subsequent training of diffusion models, which helps generate high-quality synthetic data, (3) Speed: much fewer number of reverse steps and faster synthesis speed than existing diffusion-based methods. Extensive experiments on six datasets with five metrics demonstrate that TabSyn outperforms existing methods. Specifically, it reduces the error rates by 86% and 67% for column-wise distribution and pair-wise column correlation estimations compared with the most competitive baselines, its superiority in accuratelylearning the data distributions of tabular data.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=4Ay23yeuz0",
    "arxiv_id": "2310.09656",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19775,
    "title": "On the Humanity of Conversational AI: Evaluating the Psychological Portrayal of LLMs",
    "authors": [
      "Jen-tse Huang",
      "Wenxuan Wang",
      "Eric John Li",
      "Man Ho LAM",
      "Shujie Ren",
      "Youliang Yuan",
      "Wenxiang Jiao",
      "Zhaopeng Tu",
      "Michael Lyu"
    ],
    "abstract": "Large Language Models (LLMs) have recently showcased their remarkable capacities, not only in natural language processing tasks but also across diverse domains such as clinical medicine, legal consultation, and education. LLMs become more than mere applications, evolving into assistants capable of addressing diverse user requests. This narrows the distinction between human beings and artificial intelligence agents, raising intriguing questions regarding the potential manifestation of personalities, temperaments, and emotions within LLMs. In this paper, we propose a framework, PPBench, for evaluating diverse psychological aspects of LLMs. Comprising thirteen scales commonly used in clinical psychology, PPBench further classifies these scales into four distinct categories: personality traits, interpersonal relationships, motivational tests, and emotional abilities. Our study examines five popular models, namely \\texttt{text-davinci-003}, ChatGPT, GPT-4, LLaMA-2-7b, and LLaMA-2-13b. Additionally, we employ a jailbreak approach to bypass the safety alignment protocols and test the intrinsic natures of LLMs. We have made PPBench openly accessible via *\\footnote{The link is hidden due to anonymity. For reviewers, please refer to the supplementary materials.}.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=H3UayAQWoE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19733,
    "title": "Less is More: Fewer Interpretable Region via Submodular Subset Selection",
    "authors": [
      "Ruoyu Chen",
      "Hua Zhang",
      "Siyuan Liang",
      "Jingzhi Li",
      "Xiaochun Cao"
    ],
    "abstract": "Image attribution algorithms aim to identify important regions that are highly relevant to model decisions. Although existing attribution solutions can effectively assign importance to target elements, they still face the following challenges: 1) existing attribution methods generate inaccurate small regions thus misleading the direction of correct attribution, and 2) the model cannot produce good attribution results for samples with wrong predictions. To address the above challenges, this paper re-models the above image attribution problem as a submodular subset selection problem, aiming to enhance model interpretability using fewer regions. To address the lack of attention to local regions, we construct a novel submodular function to discover more accurate fine-grained interpretation regions. To enhance the attribution effect for all samples, we also impose four different constraints on the selection of sub-regions, i.e., confidence, effectiveness, consistency, and collaboration scores, to assess the importance of various subsets. Moreover, we also analyze the link between the validity of the submodular function and four constraints at the level of theoretical aspects. Extensive experiments show that the proposed method outperforms SOTA methods on two face datasets (Celeb-A and VGG-Face2) and one fine-grained dataset (CUB-200-2011). For correctly predicted samples, the proposed method improves the Deletion and Insertion scores with an average of 4.9% and 2.5% gain relative to HSIC-Attribution. For incorrectly predicted samples, our method achieves gains of 81.0% and 18.4% compared to the HSIC-Attribution algorithm in the average highest confidence and Insertion score respectively.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=jKTUlxo5zy",
    "arxiv_id": "2402.09164",
    "GitHub": [
      "https://github.com/RuoyuChen10/SMDL-Attribution"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19712,
    "title": "On the Joint Interaction of Models, Data, and Features",
    "authors": [
      "Yiding Jiang",
      "Christina Baek",
      "J Zico Kolter"
    ],
    "abstract": "Learning features from data is one of the defining characteristics of deep learning,but our theoretical understanding of the role features play in deep learning is stillrudimentary. To address this gap, we introduce a new tool, the interaction tensor,for empirically analyzing the interaction between data and model through features.With the interaction tensor, we make several key observations about how featuresare distributed in data and how models with different random seeds learn differentfeatures. Based on these observations, we propose a conceptual framework for fea-ture learning. Under this framework, the expected accuracy for a single hypothesisand agreement for a pair of hypotheses can both be derived in closed-form. Wedemonstrate that the proposed framework can explain empirically observed phenomena, including the recently discovered Generalization Disagreement Equality(GDE) that allows for estimating the generalization error with only unlabeled data.Further, our theory also provides explicit construction of natural data distributionsthat break the GDE. Thus, we believe this work provides valuable new insight intoour understanding of feature learning.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=ze7DOLi394",
    "arxiv_id": "2306.04793",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19753,
    "title": "Knowledge Card: Filling LLMs' Knowledge Gaps with Plug-in Specialized Language Models",
    "authors": [
      "Shangbin Feng",
      "Weijia Shi",
      "Yuyang Bai",
      "Vidhisha Balachandran",
      "Tianxing He",
      "Yulia Tsvetkov"
    ],
    "abstract": "By design, large language models (LLMs) are static general-purpose models, expensive to retrain or update frequently. As they are increasingly adopted for knowledge-intensive tasks, it becomes evident that these design choices lead to failures to generate factual, relevant, and up-to-date knowledge. To this end, we propose Knowledge Card, a modular framework to plug in new factual and relevant knowledge into general-purpose LLMs. We first introduce knowledge cards---specialized language models trained on corpora from specific domains and sources. Knowledge cards serve as parametric repositories that are selected at inference time to generate background knowledge for the base LLM. We then propose three content selectors to dynamically select and retain information in documents generated by knowledge cards, specifically controlling for relevance, brevity, and factuality of outputs. Finally, we propose two complementary integration approaches to augment the base LLM with the (relevant, factual) knowledge curated from the specialized LMs. Through extensive experiments, we demonstrate that Knowledge Card achieves state-of-the-art performance on six benchmark datasets. Ultimately, Knowledge Card framework enables dynamic synthesis and updates of knowledge from diverse domains. Its modularity will ensure that relevant knowledge can be continuously updated through the collective efforts of the research community.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=WbWtOYIzIK",
    "arxiv_id": "2305.09955",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19743,
    "title": "Small-scale proxies for large-scale Transformer training instabilities",
    "authors": [
      "Mitchell Wortsman",
      "Peter J Liu",
      "Lechao Xiao",
      "Katie E Everett",
      "Alexander A Alemi",
      "Ben Adlam",
      "John D Co-Reyes",
      "Izzeddin Gur",
      "Abhishek Kumar",
      "Roman Novak",
      "Jeffrey Pennington",
      "Jascha Sohl-Dickstein",
      "Kelvin Xu",
      "Jaehoon Lee",
      "Justin Gilmer",
      "Simon Kornblith"
    ],
    "abstract": "Teams that have trained large Transformer-based models have reported training instabilities at large scale that did not appear when training with the same hyperparameters at smaller scales. Although the causes of such instabilities are of scientific interest, the amount of resources required to reproduce them has made investigation difficult. In this work, we seek ways to reproduce and study training instability at smaller scales. First, we focus on two sources of training instability described in previous work: the growth of logits in attention layers (Dehghani et al., 2023) and divergence of the output logits from the log probabilities (Chowdhery et al., 2022). By measuring the relationship between learning rate and loss across scales, we show that these instabilities also appear in small models when training at high learning rates, and that mitigations previously employed at large scales are equally effective in this regime. This prompts us to investigate the extent to which other known optimizer and model interventions influence the sensitivity of the final loss to changes in the learning rate. To this end, we study methods such as warm-up, weight decay, and the MuParam (Yang et al., 2022), and combine techniques to train small models that achieve similar losses across orders of magnitude of learning rate variation. Finally, to conclude our exploration we study two cases where instabilities can be predicted before they emerge by examining the scaling behavior of model characteristics such as activation and gradient norms.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=d8w0pmvXbZ",
    "arxiv_id": "2309.14322",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19784,
    "title": "Zipformer: A faster and better encoder for automatic speech recognition",
    "authors": [
      "Zengwei Yao",
      "Liyong Guo",
      "Xiaoyu Yang",
      "Wei Kang",
      "Fangjun Kuang",
      "Yifan Yang",
      "Zengrui Jin",
      "Long Lin",
      "Daniel Povey"
    ],
    "abstract": "The Conformer has become the most popular encoder model for automatic speech recognition (ASR).  It adds convolution modules to a transformer to learn both local and global dependencies. In this work we describe a faster, more memory-efficient, and better-performing transformer, called Zipformer.  Modeling changes include: 1) a U-Net-like encoder structure where middle stacks operate at lower frame rates; 2) reorganized block structure with more modules, within which we re-use attention weights for efficiency; 3) a modified form of LayerNorm called BiasNorm allows us to retain some length information; 4)  new activation functions SwooshR and SwooshL work better than Swish.  We also propose a new optimizer, called ScaledAdam, which scales the update by each tensor's current scale to keep the relative change about the same, and also explictly learns the parameter scale. It achieves faster converge and better performance than Adam. Extensive experiments on LibriSpeech, Aishell-1, and WenetSpeech datasets demonstrate the effectiveness of our proposed Zipformer over other state-of-the-art ASR models.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=9WD9KwssyT",
    "arxiv_id": "2310.11230",
    "GitHub": [
      "https://github.com/k2-fsa/icefall"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19776,
    "title": "Candidate Label Set Pruning: A Data-centric Perspective for Deep Partial-label Learning",
    "authors": [
      "Shuo He",
      "Chaojie Wang",
      "Guowu Yang",
      "Lei Feng"
    ],
    "abstract": "Partial-label learning (PLL) allows each training example to be equipped with a set of candidate labels. Existing deep PLL research focuses on a \\emph{learning-centric} perspective to design various training strategies for label disambiguation i.e., identifying the concealed true label from the candidate label set, for model training. However, when the size of the candidate label set becomes excessively large, these learning-centric strategies would be unable to find the true label for model training, thereby causing performance degradation. This motivates us to think from a \\emph{data-centric} perspective and pioneer a new PLL-related task called candidate label set pruning (CLSP) that aims to filter out certain potential false candidate labels in a training-free manner. To this end, we propose the first CLSP method based on the inconsistency between the representation space and the candidate label space. Specifically, for each candidate label of a training instance, if it is not a candidate label of the instance's nearest neighbors in the representation space, then it has a high probability of being a false label. Based on this intuition, we employ a per-example pruning scheme that filters out a specific proportion of high-probability false candidate labels. Theoretically, we prove an upper bound of the pruning error rate and analyze how the quality of representations affects our proposed method. Empirically, extensive experiments on both benchmark-simulated and real-world PLL datasets validate the great value of CLSP to significantly improve many state-of-the-art deep PLL methods.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=Fk5IzauJ7F",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19761,
    "title": "Never Train from Scratch: Fair Comparison of Long-Sequence Models Requires Data-Driven Priors",
    "authors": [
      "Ido Amos",
      "Jonathan Berant",
      "Ankit Gupta"
    ],
    "abstract": "Modeling long-range dependencies across sequences is a longstanding goal in machine learning and has led to architectures, such as state space models, that dramatically outperform Transformers on long sequences. However, these impressive empirical gains have been by and large demonstrated on benchmarks (e.g. Long Range Arena), where models are randomly initialized and trained to predict a target label from an input sequence. In this work, we show that random initialization leads to gross overestimation of the differences between architectures and that pretraining with standard denoising objectives, *using only the downstream task data*, leads to dramatic gains across multiple architectures and to very small gaps between Transformers and state space models (SSMs). In stark contrast to prior works, we find vanilla Transformers to match the performance of S4 on Long Range Arena when properly pretrained, and we improve the best reported results of SSMs on the PathX-256 task by 20 absolute points. Subsequently, we analyze the utility of previously-proposed structured parameterizations for SSMs and show they become mostly redundant in the presence of data-driven initialization obtained through pretraining. Our work shows that, when evaluating different architectures on supervised tasks, incorporation of data-driven priors via pretraining is essential for reliable performance estimation, and can be done efficiently.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=PdaPky8MUn",
    "arxiv_id": "2310.02980",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19771,
    "title": "GNNCert: Deterministic Certification of Graph Neural Networks against Adversarial Perturbations",
    "authors": [
      "zaishuo xia",
      "Han Yang",
      "Binghui Wang",
      "Jinyuan Jia"
    ],
    "abstract": "Graph classification, which aims to predict a label for a graph, has many real-world applications such as malware detection, fraud detection, and healthcare. However, many studies show an attacker could carefully perturb the structure and/or node features in a graph such that a graph classifier misclassifies the perturbed graph. Such vulnerability impedes the deployment of graph classification in security/safety-critical applications. Existing empirical defenses lack formal robustness guarantees and could be broken by adaptive or unknown attacks. Existing provable defenses have the following limitations: 1)  they achieve sub-optimal robustness guarantees for graph structure perturbation, 2) they cannot provide robustness guarantees for  arbitrarily node feature perturbations, 3) their robustness guarantees are probabilistic, meaning they could be incorrect with a non-zero probability, and 4) they incur large computation costs. We aim to address those limitations in this work. We propose GraphGuard, a certified defense against both graph structure and node feature perturbations for graph classification. Our GraphGuard provably predicts the same label for a graph when the number of perturbed edges and the number of nodes with perturbed features are bounded. Our results on 8 benchmark datasets show GraphGuard outperforms three state-of-the-art methods.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=IGzaH538fz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19769,
    "title": "Proving Test Set Contamination in Black-Box Language Models",
    "authors": [
      "Yonatan Oren",
      "Nicole Meister",
      "Niladri S. Chatterji",
      "Faisal Ladhak",
      "Tatsunori Hashimoto"
    ],
    "abstract": "Large language models are trained on vast amounts of internet data, prompting concerns that they have memorized public benchmarks. Detecting this type of contamination is challenging because the pretraining data used by proprietary models are often not publicly accessible.We propose a procedure for detecting test set contamination of language models with exact false positive guarantees and without access to pretraining data or model weights. Our approach leverages the fact that when there is no data contamination, all orderings of an exchangeable benchmark should be equally likely. In contrast, the tendency for language models to memorize example order means that a contaminated language model will find certain canonical orderings to be much more likely than others. Our test flags potential contamination whenever the likelihood of a canonically ordered benchmark dataset is significantly higher than the likelihood after shuffling the examples.We demonstrate that our procedure is sensitive enough to reliably detect contamination in challenging situations, including models as small as 1.4 billion parameters, on small test sets only 1000 examples, and datasets that appear only a few times in the pretraining corpus. Finally, we evaluate LLaMA-2 to apply our test in a realistic setting and find our results to be consistent with existing contamination evaluations.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=KS8mIvetg2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19750,
    "title": "LLMCarbon: Modeling the End-to-End Carbon Footprint of Large Language Models",
    "authors": [
      "Ahmad Faiz",
      "Sotaro Kaneda",
      "Ruhan Wang",
      "Rita Chukwunyere Osi",
      "Prateek Sharma",
      "Fan Chen",
      "Lei Jiang"
    ],
    "abstract": "The carbon footprint of large language models (LLMs) is substantial, stemming from their training, inference, experimentation, and storage processes, encompassing both operational and embodied carbon emissions. Precisely assessing the carbon impact of emerging LLMs before their actual training, which involves substantial GPU usage, is crucial. Although many previous studies have reported the carbon footprint of LLM training, only one prior tool, mlco2, can predict the carbon footprint of new neural networks before their physical training. However, mlco2 exhibits several limitations. Firstly, it cannot extend its carbon footprint estimation to include dense or mixture-of-experts (MoE) LLMs. Secondly, mlco2 disregards essential architectural parameters of networks, such as parameter counts, leading to inflated projections. Thirdly, mlco2 focuses solely on GPUs, excluding TPUs and assuming uniform peak computing throughput across GPUs, resulting in imprecise carbon footprint estimations. Lastly, mlco2 cannot model the embodied carbon footprint of an LLM. To address these gaps, we present an end-to-end carbon footprint projection model, LLMCarbon, designed for both dense and MoE LLMs. Compared to mlco2, LLMCarbon greatly improves the estimation accuracy of the carbon footprint of various LLMs.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=aIok3ZD9to",
    "arxiv_id": "2309.14393",
    "GitHub": [
      "https://github.com/SotaroKaneda/MLCarbon"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18598,
    "title": "Efficient local linearity regularization to overcome catastrophic overfitting",
    "authors": [
      "Elias Abad Rocamora",
      "Fanghui Liu",
      "Grigorios Chrysos",
      "Pablo M. Olmos",
      "Volkan Cevher"
    ],
    "abstract": "Catastrophic overfitting (CO) in single-step adversarial training (AT) results in abrupt drops in the adversarial test accuracy (even down to $0$%). For models trained with multi-step AT, it has been observed that the loss function behaves locally linearly with respect to the input, this is however lost in single-step AT. To address CO in single-step AT, several methods have been proposed to enforce local linearity of the loss via regularization. However, these regularization terms considerably slow down training due to *Double Backpropagation*. Instead, in this work, we introduce a regularization term, called ELLE, to mitigate CO *effectively* and *efficiently* in classical AT evaluations, as well as some more difficult regimes, e.g., large adversarial perturbations and long training schedules. Our regularization term can be theoretically linked to curvature of the loss function and is computationally cheaper than previous methods by avoiding *Double Backpropagation*. Our thorough experimental validation demonstrates that our work does not suffer from CO, even in challenging settings where previous works suffer from it. We also notice that adapting our regularization parameter during training (ELLE-A) greatly improves the performance, specially in large $\\epsilon$ setups.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SZzQz8ikwg",
    "arxiv_id": "2401.11618",
    "GitHub": [
      "https://github.com/LIONS-EPFL/ELLE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19791,
    "title": "Interpreting CLIP's Image Representation via Text-Based Decomposition",
    "authors": [
      "Yossi Gandelsman",
      "Alexei A Efros",
      "Jacob Steinhardt"
    ],
    "abstract": "We investigate the CLIP image encoder by analyzing how individual model components affect the final representation. We decompose the image representation as a sum across individual image patches, model layers, and attention heads, and use CLIP's text representation to interpret the summands. Interpreting the attention heads, we characterize each head's role by automatically finding text representations that span its output space, which reveals property-specific roles for many heads (e.g.~location or shape). Next, interpreting the image patches, we uncover an emergent spatial localization within CLIP. Finally, we use this understanding to remove spurious features from CLIP and to create a strong zero-shot image segmenter. Our results indicate that scalable understanding of transformer models is attainable and can be used to repair and improve models.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=5Ca9sSzuDp",
    "arxiv_id": "2310.05916",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18597,
    "title": "Horizon-Free Regret for Linear Markov Decision Processes",
    "authors": [
      "Zhang Zihan",
      "Jason D. Lee",
      "Yuxin Chen",
      "Simon Shaolei Du"
    ],
    "abstract": "A recent line of works showed regret bounds in reinforcement learning (RL) can be (nearly) independent of planning horizon, a.k.a. the horizon-free bounds. However, these regret bounds only apply to settings where a polynomial dependency on the size of transition model is allowed, such as tabular Markov Decision Process (MDP) and linear mixture MDP. We give the first horizon-free bound for the popular linear MDP setting where the size of the transition model can be exponentially large or even uncountable.  In contrast to prior works which explicitly estimate the transition model and compute the inhomogeneous value functions at different time steps, we directly estimate the value functions and confidence sets.  We obtain the horizon-free bound by: (1) maintaining multiple weighted least square estimators for the value functions; and (2) a structural lemma which shows the maximal total variation of the inhomogeneous value functions is bounded by a polynomial factor of the feature dimension.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SdBApv9iT4",
    "arxiv_id": "2403.10738",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19018,
    "title": "FeatUp: A Model-Agnostic Framework for Features at Any Resolution",
    "authors": [
      "Stephanie Fu",
      "Mark Hamilton",
      "Laura E. Brandt",
      "Axel Feldmann",
      "Zhoutong Zhang",
      "William T. Freeman"
    ],
    "abstract": "Deep features are a cornerstone of computer vision research, capturing image semantics and enabling the community to solve downstream tasks even in the zero- or few-shot regime. However, these features often lack the spatial resolution to directly perform dense prediction tasks like segmentation and depth prediction because models aggressively pool information over large areas. In this work, we introduce FeatUp, a task- and model-agnostic framework to restore lost spatial information in deep features. We introduce two variants of FeatUp: one that guides features with high-resolution signal in a single forward pass, and one that fits an implicit model to a single image to reconstruct features at any resolution. Both approaches use a multi-view consistency loss with deep analogies to NeRFs. Our features retain their original semantics and can be swapped into existing applications to yield resolution and performance gains even without re-training. We show that FeatUp significantly outperforms other feature upsampling and image super-resolution approaches in class activation map generation, transfer learning for segmentation and depth prediction, and end-to-end training for semantic segmentation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GkJiNn2QDF",
    "arxiv_id": "2403.10516",
    "GitHub": [
      "https://github.com/mhamilton723/FeatUp"
    ],
    "Space": [
      "mhamilton723/FeatUp"
    ],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19719,
    "title": "Quick-Tune: Quickly Learning Which Pretrained Model to Finetune and How",
    "authors": [
      "Sebastian Pineda Arango",
      "Fabio Ferreira",
      "Arlind Kadra",
      "Frank Hutter",
      "Josif Grabocka"
    ],
    "abstract": "With the ever-increasing number of pretrained models, machine learning practitioners are continuously faced with which pretrained model to use, and how to finetune it for a new dataset. In this paper, we propose a methodology that jointly searches for the optimal pretrained model and the hyperparameters for finetuning it. Our method transfers knowledge about the performance of many pretrained models with multiple hyperparameter configurations on a series of datasets. To this aim, we evaluated over 20k hyperparameter configurations for finetuning 24 pretrained image classification models on 87 datasets to generate a large-scale meta-dataset. We meta-learn a gray-box performance predictor on the learning curves of this meta-dataset and use it for fast hyperparameter optimization on new datasets. We empirically demonstrate that our resulting approach can quickly select an accurate pretrained model for a new dataset together with its optimal hyperparameters.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=tqh1zdXIra",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19735,
    "title": "Fine-tuning Aligned Language Models Compromises Safety, Even When Users Do Not Intend To!",
    "authors": [
      "Xiangyu Qi",
      "Yi Zeng",
      "Tinghao Xie",
      "Pin-Yu Chen",
      "Ruoxi Jia",
      "Prateek Mittal",
      "Peter Henderson"
    ],
    "abstract": "Optimizing large language models (LLMs) for downstream use cases often involves the customization of pre-trained LLMs through further fine-tuning. Meta's open-source release of Llama models and OpenAI's APIs for fine-tuning GPT-3.5 Turbo on customized datasets accelerate this trend. But, what are the safety costs associated with such customized fine-tuning? While existing safety alignment techniques restrict harmful behaviors of LLMs at inference time, they do not cover safety risks when fine-tuning privileges are extended to end-users. Our red teaming studies find that the safety alignment of LLMs can be compromised by fine-tuning with only a few adversarially designed training examples. For instance, we jailbreak GPT-3.5 Turbo's safety guardrails by fine-tuning it on only 10 such examples at a cost of less than $0.20 via OpenAI's APIs, making the model responsive to nearly any harmful instructions. Disconcertingly, our research also reveals that, even without malicious intent, simply fine-tuning with benign and commonly used datasets can also inadvertently degrade the safety alignment of LLMs, though to a lesser extent. These findings suggest that fine-tuning aligned LLMs introduces new safety risks that current safety infrastructures fall short of addressing --- even if a model's initial safety alignment is impeccable, how can it be maintained after customized fine-tuning? We outline and critically analyze potential mitigations and advocate for further research efforts toward reinforcing safety protocols for the customized fine-tuning of aligned LLMs.  (This paper contains red-teaming data and model-generated content that can be offensive in nature.)",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=hTEGyKf0dZ",
    "arxiv_id": "2310.03693",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19729,
    "title": "Monte Carlo guided Denoising Diffusion models for Bayesian linear inverse problems.",
    "authors": [
      "Gabriel Cardoso",
      "Yazid Janati el idrissi",
      "Sylvain Le Corff",
      "Eric Moulines"
    ],
    "abstract": "Ill-posed linear inverse problems arise frequently in various applications, from computational photography to medical imaging.A recent line of research exploits Bayesian inference with informative priors to handle the ill-posedness of such problems.Amongst such priors, score-based generative models (SGM) have recently been successfully applied to several different inverse problems.In this study, we exploit the particular structure of the prior defined by the SGM to define a sequence of intermediate linear inverse problems. As the noise level decreases, the posteriors of these inverse problems get closer to the target posterior of the original inverse problem. To sample from this sequence of posteriors, we propose the use of Sequential Monte Carlo (SMC) methods.The proposed algorithm, \\algo, is shown to be theoretically grounded and we provide numerical simulations showing that it outperforms competing baselines when dealing with ill-posed inverse problems in a Bayesian setting.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=nHESwXvxWK",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19745,
    "title": "METRA: Scalable Unsupervised RL with Metric-Aware Abstraction",
    "authors": [
      "Seohong Park",
      "Oleh Rybkin",
      "Sergey Levine"
    ],
    "abstract": "Unsupervised pre-training strategies have proven to be highly effective in natural language processing and computer vision. Likewise, unsupervised reinforcement learning (RL) holds the promise of discovering a variety of potentially useful behaviors that can accelerate the learning of a wide array of downstream tasks. Previous unsupervised RL approaches have mainly focused on pure exploration and mutual information skill learning. However, despite the previous attempts, making unsupervised RL truly scalable still remains a major open challenge: pure exploration approaches might struggle in complex environments with large state spaces, where covering every possible transition is infeasible, and mutual information skill learning approaches might completely fail to explore the environment due to the lack of incentives. To make unsupervised RL scalable to complex, high-dimensional environments, we propose a novel unsupervised RL objective, which we call **Metric-Aware Abstraction** (**METRA**). Our main idea is, instead of directly covering the state space, to only cover a compact latent space $\\mathcal{Z}$ that is *metrically* connected to the state space $\\mathcal{S}$ by temporal distances. By learning to move in every direction in the latent space, METRA obtains a tractable set of diverse behaviors that approximately cover the state space, being scalable to high-dimensional environments. Through our experiments in five locomotion and manipulation environments, we demonstrate that METRA can discover a variety of useful behaviors even in complex, pixel-based environments, being the *first* unsupervised RL method that discovers diverse locomotion behaviors in pixel-based Quadruped and Humanoid. Our code and video are available at https://sites.google.com/view/metra0",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=c5pwL0Soay",
    "arxiv_id": "2310.08887",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19728,
    "title": "Pre-Training Goal-based Models for Sample-Efficient Reinforcement Learning",
    "authors": [
      "Haoqi Yuan",
      "Zhancun Mu",
      "Feiyang Xie",
      "Zongqing Lu"
    ],
    "abstract": "Pre-training on task-agnostic large datasets is a promising approach for enhancing the sample efficiency of reinforcement learning (RL) in solving complex tasks. We present PTGM, a novel method that pre-trains goal-based models to augment RL by providing temporal abstractions and behavior regularization. PTGM involves pre-training a low-level, goal-conditioned policy and training a high-level policy to generate goals for subsequent RL tasks. To address the challenges posed by the high-dimensional goal space, while simultaneously maintaining the agent's capability to accomplish various skills, we propose clustering goals in the dataset to form a discrete high-level action space. Additionally, we introduce a pre-trained goal prior model to regularize the behavior of the high-level policy in RL, enhancing sample efficiency and learning stability. Experimental results in a robotic simulation environment and the challenging open-world environment of Minecraft demonstrate PTGM\u2019s superiority in sample efficiency and task performance compared to baselines. Moreover, PTGM exemplifies enhanced interpretability and generalization of the acquired low-level skills.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=o2IEmeLL9r",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19740,
    "title": "Flow Matching on General Geometries",
    "authors": [
      "Ricky T. Q. Chen",
      "Yaron Lipman"
    ],
    "abstract": "We propose Riemannian Flow Matching (RFM), a simple yet powerful framework for training continuous normalizing flows on manifolds. Existing methods for generative modeling on manifolds either require expensive simulation, are inherently unable to scale to high dimensions, or use approximations for limiting quantities that result in biased training objectives. Riemannian Flow Matching bypasses these limitations and offers several advantages over previous approaches: it is simulation-free on simple geometries, does not require divergence computation, and computes its target vector field in closed-form. The key ingredient behind RFM is the construction of a relatively simple premetric for defining target vector fields, which encompasses the existing Euclidean case. To extend to general geometries, we rely on the use of spectral decompositions to efficiently compute premetrics on the fly. Our method achieves state-of-the-art performance on real-world non-Euclidean datasets, and we demonstrate tractable training on general geometries, including triangular meshes with highly non-trivial curvature and boundaries.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=g7ohDlTITL",
    "arxiv_id": "2302.03660",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19727,
    "title": "Graph Neural Networks for Learning Equivariant Representations of Neural Networks",
    "authors": [
      "Miltiadis Kofinas",
      "Boris Knyazev",
      "Yan Zhang",
      "Yunlu Chen",
      "Gertjan J. Burghouts",
      "Efstratios Gavves",
      "Cees G. M. Snoek",
      "David W. Zhang"
    ],
    "abstract": "Neural networks that process the parameters of other neural networks find applications in domains as diverse as classifying implicit neural representations, generating neural network weights, and predicting generalization errors.However, existing approaches either overlook the inherent permutation symmetry in the neural network or rely on intricate weight-sharing patterns to achieve equivariance, while ignoring the impact of the network architecture itself.In this work, we propose to represent neural networks as computational graphs of parameters, which allows us to harness powerful graph neural networks and transformers that preserve permutation symmetry.Consequently, our approach enables a single model to encode neural computational graphs with diverse architectures.We showcase the effectiveness of our method on a wide range of tasks, including classification and editing of implicit neural representations, predicting generalization performance, and learning to optimize, while consistently outperforming state-of-the-art methods.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=oO6FsMyDBt",
    "arxiv_id": "2403.12143",
    "GitHub": [
      "https://github.com/mkofinas/neural-graphs"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19789,
    "title": "BooookScore: A systematic exploration of book-length summarization in the era of LLMs",
    "authors": [
      "Yapei Chang",
      "Kyle Lo",
      "Tanya Goyal",
      "Mohit Iyyer"
    ],
    "abstract": "Summarizing book-length documents ($>$100K tokens)  that exceed the context window size of large language models (LLMs) requires first breaking the input document into smaller chunks and then prompting an LLM to merge, update, and compress chunk-level summaries. Despite the complexity and importance of this task, it has yet to be meaningfully studied due to the challenges of evaluation: existing book-length summarization datasets (e.g., BookSum) are in the pretraining data of most public LLMs, and existing evaluation methods struggle to capture errors made by modern LLM summarizers. In this paper, we present the first study of the coherence of LLM-based book-length summarizers implemented via two prompting workflows: (1) hierarchically merging chunk-level summaries, and (2) incrementally updating a running summary. We obtain 1193 fine-grained human annotations on GPT-4 generated summaries of 100 recently-published books and identify eight common types of coherence errors made by LLMs. Because human evaluation is expensive and time-consuming, we develop an automatic metric, BooookScore, that measures the proportion of sentences in a summary that do not contain any of the identified error types. BooookScore has high agreement with human annotations and allows us to systematically evaluate the impact of many other critical parameters (e.g., chunk size, base LLM) while saving \\$15K and 500 hours in human evaluation costs. We find that closed-source LLMs such as GPT-4 and Claude 2 produce summaries with higher BooookScore than the oft-repetitive ones generated by LLaMA 2. Incremental updating yields lower BooookScore but higher level of detail than hierarchical merging, a trade-off sometimes preferred by human annotators. We release code and annotations after blind review to spur more principled research on book-length summarization.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=7Ttk3RzDeu",
    "arxiv_id": "2310.00785",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19757,
    "title": "SWE-bench: Can Language Models Resolve Real-world Github Issues?",
    "authors": [
      "Carlos E Jimenez",
      "John Yang",
      "Alexander Wettig",
      "Shunyu Yao",
      "Kexin Pei",
      "Ofir Press",
      "Karthik R Narasimhan"
    ],
    "abstract": "Language models (LMs) have been improving rapidly, and today we lack benchmarks that are hard to solve but easy to evaluate. Coding is such a desired task, but existing coding benchmarks only feature self-contained problems solvable within tens of lines. Inspired by how real-world programmers code to fix bugs or ship new features, we introduce SWE-bench, a benchmark with 2,294 GitHub issues sourced from 12 popular Python repositories. Given a codebase and an issue description, an LM is tasked with editing the codebase to resolve the issue and pass all related tests. Our experiments show that both state-of-the-art proprietary LMs and our fine-tuned LM, SWE-Llama, can resolve only the simplest issues. For example, Claude 2 and GPT-4 solve a mere 3.6% and 1.3% of tasks respectively, even when provided with an oracle retriever. Through systematic analysis, we identify various factors underlying LM performances, such as the retrieval setup, codebase size, and issue complexity. We also identify key challenges for LMs to solve real-world software engineering problems, including understanding cross-file dependencies, localizing edit locations, and generating long and well-formatted patch files. SWE-bench shows that real-world software engineering is a diverse, challenging and sustainable testbed for evaluating a wide range of language model abilities.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=VTF8yNQM66",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19714,
    "title": "ValUES: A Framework for Systematic Validation of Uncertainty Estimation in Semantic Segmentation",
    "authors": [
      "Kim-Celine Kahl",
      "Carsten T. L\u00fcth",
      "Maximilian Zenk",
      "Klaus Maier-Hein",
      "Paul F Jaeger"
    ],
    "abstract": "Uncertainty estimation is an essential and heavily-studied component for the reliable application of semantic segmentation methods. While various studies exist claiming methodological advances on the one hand, and successful application on the other hand, the field is currently hampered by a gap between theory and practice leaving fundamental questions unanswered: Can data-related and model-related uncertainty really be separated in practice? Which components of an uncertainty method are essential for real-world performance? Which uncertainty method works well for which application? In this work, we link this research gap to a lack of systematic and comprehensive evaluation of uncertainty methods. Specifically, we identify three key pitfalls in current literature and present an evaluation framework that bridges the research gap by providing 1) a controlled environment for studying data ambiguities as well as distribution shifts, 2) systematic ablations of relevant method components, and 3) test-beds for the five predominant uncertainty applications: OoD-detection, active learning, failure detection, calibration, and ambiguity modeling. Empirical results on simulated as well as real-world data demonstrate how the proposed framework is able to answer the predominant questions in the field revealing for instance that 1) separation of uncertainty types works on simulated data but does not necessarily translate to real-world data, 2) aggregation of scores is a crucial but currently neglected component of uncertainty methods, 3) While ensembles are performing most robustly across the different downstream tasks and settings, test-time augmentation often constitutes a light-weight alternative. (Code will be released upon acceptance)",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=yV6fD7LYkF",
    "arxiv_id": "2401.08501",
    "GitHub": [
      "https://github.com/IML-DKFZ/values"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19788,
    "title": "Provable Compositional Generalization for Object-Centric Learning",
    "authors": [
      "Thadd\u00e4us Wiedemer",
      "Jack Brady",
      "Alexander Panfilov",
      "Attila Juhos",
      "Matthias Bethge",
      "Wieland Brendel"
    ],
    "abstract": "Learning representations that generalize to novel compositions of known concepts is crucial for bridging the gap between human and machine perception. One prominent effort is learning object-centric representations, which are widely conjectured to enable compositional generalization. Yet, it remains unclear when this conjecture will be true, as a principled theoretical or empirical understanding of compositional generalization is lacking. In this work, we investigate when compositional generalization is guaranteed for object-centric representations through the lens of identifiability theory. We show that autoencoders that satisfy structural assumptions on the decoder and enforce encoder-decoder consistency will learn object-centric representations that provably generalize compositionally. We validate our theoretical result and highlight the practical relevance of our assumptions through experiments on synthetic image data.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=7VPTUWkiDQ",
    "arxiv_id": "2310.05327",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19744,
    "title": "Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization",
    "authors": [
      "Ian Gemp",
      "Luke Marris",
      "Georgios Piliouras"
    ],
    "abstract": "We propose the first loss function for approximate Nash equilibria of normal-form games that is amenable to unbiased Monte Carlo estimation. This construction allows us to deploy standard non-convex stochastic optimization techniques for approximating Nash equilibria, resulting in novel algorithms  with provable guarantees. We complement our theoretical analysis with experiments demonstrating that stochastic gradient descent can outperform previous state-of-the-art approaches.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=cc8h3I3V4E",
    "arxiv_id": "2310.06689",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19747,
    "title": "Phenomenal Yet Puzzling: Testing Inductive Reasoning Capabilities of Language Models with Hypothesis Refinement",
    "authors": [
      "Linlu Qiu",
      "Liwei Jiang",
      "Ximing Lu",
      "Melanie Sclar",
      "Valentina Pyatkin",
      "Chandra Bhagavatula",
      "Bailin Wang",
      "Yoon Kim",
      "Yejin Choi",
      "Nouha Dziri",
      "Xiang Ren"
    ],
    "abstract": "The ability to derive the underlying principles from a handful of observations and then generalize to novel situations---known as inductive reasoning---is central to human intelligence. Prior work suggests that language models (LMs) often fall short on inductive reasoning, despite achieving impressive success on research benchmarks. In this work, we conduct a systematic study of  the inductive reasoning capabilities of LMs through $\\textit{iterative hypothesis refinement}$, a technique that more closely mirrors  the human inductive process than standard input-output prompting. Iterative hypothesis refinement employs a three-step process: proposing, selecting, and refining hypotheses in the form of textual rules. By examining the intermediate rules, we observe that LMs are phenomenal $\\textit{hypothesis proposers}$ (i.e., generating candidate rules), and when coupled with a (task-specific) symbolic interpreter that is able to systematically filter the proposed set of rules, this hybrid approach achieves strong results across inductive reasoning benchmarks that require inducing causal relations, language-like instructions, and symbolic concepts. However, they also behave as puzzling $\\textit{inductive reasoners}$, showing notable performance gaps in rule induction (i.e., identifying plausible rules) and rule application (i.e., applying proposed rules to instances), suggesting that LMs are proposing hypotheses without being able to actually apply the rules. Through extensive empirical and human analyses, we further reveal several discrepancies between the inductive reasoning processes of LMs and humans, shedding light on both the potentials and limitations of using LMs in inductive reasoning tasks.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=bNt7oajl2a",
    "arxiv_id": "2310.08559",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19749,
    "title": "The mechanistic basis of data dependence and abrupt learning in an in-context classification task",
    "authors": [
      "Gautam Reddy"
    ],
    "abstract": "Transformer models exhibit in-context learning: the ability to accurately predict the response to a novel query based on illustrative examples in the input sequence, which contrasts with traditional in-weights learning of query-output relationships. What aspects of the training data distribution and architecture favor in-context vs in-weights learning? Recent work has shown that specific distributional properties inherent in language, such as burstiness, large dictionaries and skewed rank-frequency distributions, control the trade-off or simultaneous appearance of these two forms of learning. We first show that these results are recapitulated in a minimal attention-only network trained on a simplified dataset. In-context learning (ICL) is driven by the abrupt emergence of an induction head, which subsequently competes with in-weights learning. By identifying progress measures that precede in-context learning and targeted experiments, we construct a two-parameter model of an induction head which emulates the full data distributional dependencies displayed by the attention-based network. A phenomenological model of induction head formation traces its abrupt emergence to the sequential learning of three nested logits enabled by an intrinsic curriculum. We propose that the sharp transitions in attention-based networks arise due to a specific chain of multi-layer operations necessary to achieve ICL, which is implemented by nested nonlinearities sequentially learned during training.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=aN4Jf6Cx69",
    "arxiv_id": "2312.03002",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19755,
    "title": "Lipschitz Singularities in Diffusion Models",
    "authors": [
      "Zhantao Yang",
      "Ruili Feng",
      "Han Zhang",
      "Yujun Shen",
      "Kai Zhu",
      "Lianghua Huang",
      "Yifei Zhang",
      "Yu Liu",
      "Deli Zhao",
      "Jingren Zhou",
      "Fan Cheng"
    ],
    "abstract": "Diffusion models, which employ stochastic differential equations to sample images through integrals, have emerged as a dominant class of generative models. However, the rationality of the diffusion process itself receives limited attention, leaving the question of whether the problem is well-posed and well-conditioned. In this paper, we uncover a vexing propensity of diffusion models: they frequently exhibit the infinite Lipschitz near the zero point of timesteps. We provide theoretical proofs to illustrate the presence of infinite Lipschitz constants and empirical results to confirm it. The Lipschitz singularities pose a threat to the stability and accuracy during both the training and inference processes of diffusion models. Therefore, the mitigation of Lipschitz singularities holds great potential for enhancing the performance of diffusion models. To address this challenge, we propose a novel approach, dubbed E-TSDM, which alleviates the Lipschitz singularities of the diffusion model near the zero point. Remarkably, our technique yields a substantial improvement in performance. Moreover, as a byproduct of our method, we achieve a dramatic reduction in the Fr\u00e9chet Inception Distance of acceleration methods relying on network Lipschitz, including DDIM and DPM-Solver, by over 33\\%. Extensive experiments on diverse datasets validate our theory and method. Our work may advance the understanding of the general diffusion process, and also provide insights for the design of diffusion models.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=WNkW0cOwiz",
    "arxiv_id": "2306.11251",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19754,
    "title": "Improved Techniques for Training Consistency Models",
    "authors": [
      "Yang Song",
      "Prafulla Dhariwal"
    ],
    "abstract": "Consistency models are a nascent family of generative models that can sample high quality data in one step without the need for adversarial training. Current consistency models achieve optimal sample quality by distilling from pre-trained diffusion models, and employing learned metrics such as LPIPS. However, distillation limits the quality of consistency models to that of the pre-trained diffusion model, and LPIPS causes undesirable bias in evaluation. To tackle these challenges, we present improved techniques for consistency training, where consistency models learn directly from data without distillation. We delve into the theory behind consistency training and identify a previously overlooked flaw, which we address by eliminating Exponential Moving Average from the teacher consistency model. To replace learned metrics like LPIPS, we borrow Pseudo-Huber losses from robust statistics. Additionally, we introduce a new noise schedule for the consistency training objective, and propose a new curriculum for total discretization steps. Collectively, these modifications enable consistency models to achieve FID scores of 2.62 and 3.91 on CIFAR-10 and ImageNet $64\\times 64$ respectively in a single sampling step. These scores mark a 3.3$\\times$ improvement compared to prior consistency training approaches. Through two-step sampling, we further reduce FID scores to 2.28 and 3.64, surpassing those obtained via distillation in both one-step and two-step settings, while narrowing the gap between consistency models and state-of-the-art generative models on both datasets.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=WNzy9bRDvG",
    "arxiv_id": "2310.14189",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19782,
    "title": "Ghost on the Shell: An Expressive Representation of General 3D Shapes",
    "authors": [
      "Zhen Liu",
      "Yao Feng",
      "Yuliang Xiu",
      "Weiyang Liu",
      "Liam Paull",
      "Michael J. Black",
      "Bernhard Sch\u00f6lkopf"
    ],
    "abstract": "The creation of photorealistic virtual worlds requires the accurate modeling of 3D surface geometry for a wide range of objects. For this, meshes are appealing since they enable 1) fast physics-based rendering with realistic material and lighting, 2) physical simulation, and 3) are memory-efficient for modern graphics pipelines. Recent work on reconstructing and statistically modeling 3D shape, however, has critiqued meshes as being topologically inflexible. To capture a wide range of object shapes, any 3D representation must be able to model solid, watertight, shapes as well as thin, open, surfaces. Recent work has focused on the former, and methods for reconstructing open surfaces do not support fast reconstruction with material and lighting or unconditional generative modelling. Inspired by the observation that open surfaces can be seen as islands floating on watertight surfaces, we parametrize open surfaces by defining a manifold signed distance field on watertight templates. With this parametrization, we further develop a grid-based and differentiable representation that parametrizes both watertight and non-watertight meshes of arbitrary topology. Our new representation, called Ghost-on-the-Shell (G-Shell), enables two important applications:  differentiable rasterization-based reconstruction from multiview images and generative modelling of non-watertight meshes. We empirically demonstrate that G-Shell achieves state-of-the-art performance on non-watertight mesh reconstruction and generation tasks, while also performing effectively for watertight meshes.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=Ad87VjRqUw",
    "arxiv_id": "2310.15168",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19736,
    "title": "Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection",
    "authors": [
      "Akari Asai",
      "Zeqiu Wu",
      "Yizhong Wang",
      "Avirup Sil",
      "Hannaneh Hajishirzi"
    ],
    "abstract": "Retrieval-Augmented Generation (RAG), an ad hoc approach that augments Language Models (LMs)  with retrieval, decreases hallucination issues of large LMs. However, indiscriminately retrieving and incorporating a fixed number of retrieved passages, regardless of whether retrieval is necessary, or passages are relevant, diminishes LM versatility or can lead to unhelpful response generation.In this work, we introduce a new framework called **Self-Reflective Retrieval-Augmented Generation (Self-RAG)** that enhances an LM's quality and factuality through retrieval and self-reflection.  Our framework trains a single arbitrary LM that adaptively retrieves passages on-demand, and generates and reflects on retrieved passages and its own generations using special tokens, called *reflection* tokens. Generating reflection tokens makes the LM controllable during the inference phase, enabling it to tailor its behavior to diverse task requirements. Experiments show that Self-RAG (7B and 13B parameters) significantly outperforms state-of-the-art LLMs and retrieval-augmented models on a diverse set of tasks. Specifically, Self-RAG outperforms ChatGPT and retrieval-augmented Llama2-chat on multiple tasks including Open-domain QA and fact verification, and it shows significant gains in factuality scores and citation accuracy for long-form generations relative to these models.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=hSyW5go0v8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19724,
    "title": "Robust agents learn causal world models",
    "authors": [
      "Jonathan Richens",
      "Tom Everitt"
    ],
    "abstract": "It has long been hypothesised that causal reasoning plays a fundamental role in robust and general intelligence. However, it is not known if agents must learn causal models in order to generalise to new domains, or if other inductive biases are sufficient. We answer this question, showing that any agent capable of satisfying a regret bound under a large set of distributional shifts must have learned an approximate causal model of the data generating process, which converges to the true causal model for optimal agents. We discuss the implications of this result for several research areas including transfer learning and causal inference.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=pOoKI3ouv1",
    "arxiv_id": "2402.10877",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19768,
    "title": "MathVista: Evaluating Mathematical Reasoning of Foundation Models in Visual Contexts",
    "authors": [
      "Pan Lu",
      "Hritik Bansal",
      "Tony Xia",
      "Jiacheng Liu",
      "Chunyuan Li",
      "Hannaneh Hajishirzi",
      "Hao Cheng",
      "Kai-Wei Chang",
      "Michel Galley",
      "Jianfeng Gao"
    ],
    "abstract": "Although Large Language Models (LLMs) and Large Multimodal Models (LMMs) exhibit impressive skills in various domains, their ability for mathematical reasoning within visual contexts has not been formally examined. Equipping LLMs and LMMs with this capability is vital for general-purpose AI assistants and showcases promising potential in education, data analysis, and scientific discovery. To bridge this gap, we present MathVista, a benchmark designed to amalgamate challenges from diverse mathematical and visual tasks. We first taxonomize the key task types, reasoning skills, and visual contexts from the literature to guide our selection from 28 existing math-focused and visual question answering datasets. Then, we construct three new datasets, IQTest, FunctionQA, and PaperQA, to accommodate for missing types of visual contexts. The problems featured often require deep visual understanding beyond OCR or image captioning, and compositional reasoning with rich domain-specific tools, thus posing a notable challenge to existing models. We conduct a comprehensive evaluation of 11 prominent open-source and proprietary foundation models (LLMs, LLMs augmented with tools, and LMMs). The best-performing model, Multimodal Bard, achieves only 58\\% of human performance (34.8\\% vs 60.3\\%), indicating ample room for further improvement. Given this significant gap, MathVista fuels future research in the development of general-purpose AI agents capable of tackling mathematically intensive and visually rich real-world tasks.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=KUNzEQMWU7",
    "arxiv_id": "2310.02255",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19785,
    "title": "A Real-World WebAgent with Planning, Long Context Understanding, and Program Synthesis",
    "authors": [
      "Izzeddin Gur",
      "Hiroki Furuta",
      "Austin V Huang",
      "Mustafa Safdari",
      "Yutaka Matsuo",
      "Douglas Eck",
      "Aleksandra Faust"
    ],
    "abstract": "Pre-trained large language models (LLMs) have recently achieved better generalization and sample efficiency in autonomous web automation.However, the performance on real-world websites has still suffered from (1) open domainness, (2) limited context length, and (3) lack of inductive bias on HTML.We introduce WebAgent, an LLM-driven agent that learns from self-experience to complete tasks on real websites following natural language instructions.WebAgent plans ahead by decomposing instructions into canonical sub-instructions, summarizes long HTML documents into task-relevant snippets, and acts on websites via Python programs generated from those.We design WebAgent with Flan-U-PaLM, for grounded code generation, and HTML-T5, new pre-trained LLMs for long HTML documents using local and global attention mechanisms and a mixture of long-span denoising objectives, for planning and summarization.We empirically demonstrate that our modular recipe improves the success on real websites by over 50%, and that HTML-T5 is the best model to solve various HTML understanding tasks; achieving 18.7% higher success rate than the prior method on MiniWoB web automation benchmark, and SoTA performance on Mind2Web, an offline task planning evaluation.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=9JQtrumvg8",
    "arxiv_id": "2307.12856",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19732,
    "title": "ASID: Active Exploration for System Identification in Robotic Manipulation",
    "authors": [
      "Marius Memmel",
      "Andrew Wagenmaker",
      "Chuning Zhu",
      "Dieter Fox",
      "Abhishek Gupta"
    ],
    "abstract": "Model-free control strategies such as reinforcement learning have shown the ability to learn control strategies without requiring an accurate model or simulator of the world. While this is appealing due to the lack of modeling requirements, real-world RL can be unsafe and sample inefficient, making it impractical in many safety-critical domains. On the other hand, model-based control techniques leveraging accurate simulators can circumvent these challenges and use a large amount of cheap simulation data to learn controllers that can effectively transfer to the real world. The challenge with such model-based techniques is the requirement for an extremely accurate simulation, requiring both the specification of appropriate simulation assets and physical parameters. This requires considerable human effort to design for every environment being considered. In this work, we propose a learning system that can leverage a small amount of real-world data to autonomously refine a simulation model, and then plan an accurate control strategy that can be deployed in the real world. Our approach critically relies on utilizing an initial (possibly inaccurate) simulator to design effective exploration policies that, when deployed in the real world, collect high-quality data. We demonstrate the efficacy of this paradigm in identifying articulation, mass, and other physical parameters in several challenging robotic manipulation tasks, and illustrate that only a small amount of real-world data can allow for effective sim-to-real transfer.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=jNR6s6OSBT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19748,
    "title": "Predictive auxiliary objectives in deep RL mimic learning in the brain",
    "authors": [
      "Ching Fang",
      "Kim Stachenfeld"
    ],
    "abstract": "The ability to predict upcoming events has been hypothesized to comprise a key aspect of natural and machine cognition. This is supported by trends in deep reinforcement learning (RL), where self-supervised auxiliary objectives such as prediction are widely used to support representation learning and improve task performance. Here, we study the effects predictive auxiliary objectives have on representation learning across different modules of an RL system and how these mimic representational changes observed in the brain. We find that predictive objectives improve and stabilize learning particularly in resource-limited architectures, and we identify settings where longer predictive horizons better support representational transfer. Furthermore, we find that representational changes in this RL system bear a striking resemblance to changes in neural activity observed in the brain across various experiments. Specifically, we draw a connection between the auxiliary predictive model of the RL system and hippocampus, an area thought to learn a predictive model to support memory-guided behavior. We also connect the encoder network and the value learning network of the RL system to visual cortex and striatum in the brain, respectively. This work demonstrates how representation learning in deep RL systems can provide an interpretable framework for modeling multi-region interactions in the brain. The deep RL perspective taken here also suggests an additional role of the hippocampus in the brain-- that of an auxiliary learning system that benefits representation learning in other regions.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=agPpmEgf8C",
    "arxiv_id": "2310.06089",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19720,
    "title": "Generative Modeling with Phase Stochastic Bridge",
    "authors": [
      "Tianrong Chen",
      "Jiatao Gu",
      "Laurent Dinh",
      "Evangelos Theodorou",
      "Joshua M. Susskind",
      "Shuangfei Zhai"
    ],
    "abstract": "Diffusion models (DMs) represent state-of-the-art generative models for continuous inputs. DMs work by constructing a Stochastic Differential Equation (SDE) in the input space (ie, position space), and using a neural network to reverse it. In this work, we introduce a novel generative modeling framework grounded in \\textbf{phase space dynamics}, where a phase space is defined as {an augmented space encompassing both position and velocity.} Leveraging insights from Stochastic Optimal Control, we construct a path measure in the phase space that enables efficient sampling. {In contrast to DMs, our framework demonstrates the capability to generate realistic data points at an early stage of dynamics propagation.} This early prediction sets the stage for efficient data generation by leveraging additional velocity information along the trajectory. On standard image generation benchmarks, our model yields favorable performance over baselines in the regime of small Number of Function Evaluations (NFEs). Furthermore, our approach rivals the performance of diffusion models equipped with efficient sampling techniques, underscoring its potential as a new tool generative modeling.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=tUtGjQEDd4",
    "arxiv_id": "2310.07805",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19767,
    "title": "Improving Convergence and Generalization Using Parameter Symmetries",
    "authors": [
      "Bo Zhao",
      "Robert M. Gower",
      "Robin Walters",
      "Rose Yu"
    ],
    "abstract": "In overparametrized models, different values of the parameters may result in the same loss value. Parameter space symmetries are loss-invariant transformations that change the model parameters. Teleportation applies such transformations to accelerate optimization. However, the exact mechanism behind this algorithm's success is not well understood. In this paper, we show that teleportation not only speeds up optimization in the short-term, but gives overall faster time to convergence. Additionally, teleporting to minima with different curvatures improves generalization, which suggests a connection between the curvature of the minima and generalization ability. Finally, we show that integrating teleportation into a wide range of optimization algorithms and optimization-based meta-learning improves convergence. Our results showcase the versatility of teleportation and demonstrate the potential of incorporating symmetry in optimization.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=L0r0GphlIL",
    "arxiv_id": "2305.13404",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18596,
    "title": "Incremental Randomized Smoothing Certification",
    "authors": [
      "Shubham Ugare",
      "Tarun Suresh",
      "Debangshu Banerjee",
      "Gagandeep Singh",
      "Sasa Misailovic"
    ],
    "abstract": "Randomized smoothing-based certification is an effective approach for obtaining robustness certificates of deep neural networks (DNNs) against adversarial attacks. This method constructs a smoothed DNN model and certifies its robustness through statistical sampling, but it is computationally expensive, especially when certifying with a large number of samples. Furthermore, when the smoothed model is modified (e.g., quantized or pruned), certification guarantees may not hold for the modified DNN, and recertifying from scratch can be prohibitively expensive.We present the first approach for incremental robustness certification for randomized smoothing, IRS. We show how to reuse the certification guarantees for the original smoothed model to certify an approximated model with very few samples. IRS significantly reduces the computational cost of certifying modified DNNs while maintaining strong robustness guarantees. We experimentally demonstrate the effectiveness of our approach, showing up to 4.1x certification speedup over the certification that applies randomized smoothing of the approximate model from scratch.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SdeAPV1irk",
    "arxiv_id": "2305.19521",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19741,
    "title": "Understanding In-Context Learning in Transformers and LLMs by Learning to Learn Discrete Functions",
    "authors": [
      "Satwik Bhattamishra",
      "Arkil Patel",
      "Phil Blunsom",
      "Varun Kanade"
    ],
    "abstract": "In order to understand the in-context learning phenomenon, recent works have adopted a stylized experimental framework and demonstrated that Transformers can learn gradient-based learning algorithms for various classes of real-valued functions. However, the limitations of Transformers in implementing learning algorithms, and their ability to learn other forms of algorithms are not well understood. Additionally, the degree to which these capabilities are confined to attention-based models is unclear. Furthermore, it remains to be seen whether the insights derived from these stylized settings can be extrapolated to pretrained Large Language Models (LLMs). In this work, we take a step towards answering these questions by demonstrating the following: (a) On a test-bed with a variety of Boolean function classes, we find that Transformers can nearly match the optimal learning algorithm for 'simpler' tasks, while their performance deteriorates on more 'complex' tasks. Additionally, we find that certain attention-free models perform (almost) identically to Transformers on a range of tasks. (b) When provided a *teaching sequence*, i.e. a set of examples that uniquely identifies a function in a class, we show that Transformers learn more sample-efficiently. Interestingly, our results show that Transformers can learn to implement *two distinct* algorithms to solve a *single* task, and can adaptively select the more sample-efficient algorithm depending on the sequence of in-context examples. (c) Lastly, we show that extant LLMs, e.g. LLaMA-2, GPT-4, can compete with nearest-neighbor baselines on prediction tasks that are guaranteed to not be in their training set.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=ekeyCgeRfC",
    "arxiv_id": "2310.03016",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18595,
    "title": "Dropout-Based Rashomon Set Exploration for Efficient Predictive Multiplicity Estimation",
    "authors": [
      "Hsiang Hsu",
      "Guihong Li",
      "Shaohan Hu",
      "Chun-Fu Chen"
    ],
    "abstract": "Predictive multiplicity refers to the phenomenon in which classification tasks may admit multiple competing models that achieve almost-equally-optimal performance, yet generate conflicting outputs for individual samples.This presents significant concerns, as it can potentially result in systemic exclusion, inexplicable discrimination, and unfairness in practical applications.Measuring and mitigating predictive multiplicity, however, is computationally challenging due to the need to explore all such almost-equally-optimal models, known as the Rashomon set, in potentially huge hypothesis spaces. To address this challenge, we propose a novel framework that utilizes dropout techniques for exploring models in the Rashomon set.We provide rigorous theoretical derivations to connect the dropout parameters to properties of the Rashomon set, and empirically evaluate our framework through extensive experimentation.Numerical results show that our technique consistently outperforms baselines in terms of the effectiveness of predictive multiplicity metric estimation, with runtime speedup up to $20\\times \\sim 5000\\times$.With efficient Rashomon set exploration and metric estimation, mitigation of predictive multiplicity is then achieved through dropout ensemble and model selection.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Sf2A2PUXO3",
    "arxiv_id": "2402.00728",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18680,
    "title": "Guaranteed Approximation Bounds for Mixed-Precision Neural Operators",
    "authors": [
      "Renbo Tu",
      "Colin White",
      "Jean Kossaifi",
      "Boris Bonev",
      "Gennady Pekhimenko",
      "Kamyar Azizzadenesheli",
      "Anima Anandkumar"
    ],
    "abstract": "Neural operators, such as Fourier Neural Operators (FNO), form a principled approach for learning solution operators for partial differential equations (PDE) and other mappings between function spaces. However, many real-world problems require high-resolution training data, and the training time and limited GPU memory pose big barriers. One solution is to train neural operators in mixed precision to reduce the memory requirement and increase training speed. However, existing mixed-precision training techniques are designed for standard neural networks, and we find that their direct application to FNO leads to numerical overflow and poor memory efficiency. Further, at first glance, it may appear that mixed precision in FNO will lead to drastic accuracy degradation since reducing the precision of the Fourier transform yields poor results in classical numerical solvers. We show that this is not the case; in fact, we prove that reducing the precision in FNO still guarantees a good approximation bound, when done in a targeted manner. Specifically, we build on the intuition that neural operator learning inherently induces an approximation error, arising from discretizing the infinite-dimensional ground-truth input function, implying that training in full precision is not needed. We formalize this intuition by rigorously characterizing the approximation and precision errors of FNO and bounding these errors for general input functions. We prove that the precision error is asymptotically comparable to the approximation error. Based on this, we design a simple method to optimize the memory-intensive half-precision tensor contractions by greedily finding the optimal contraction order. Through extensive experiments on different state-of-the-art neural operators, datasets, and GPUs, we demonstrate that our approach reduces GPU memory usage by up to 50% and improves throughput by 58% with little or no reduction in accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QJGj07PD9C",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19772,
    "title": "Towards a statistical theory of data selection under weak supervision",
    "authors": [
      "Germain Kolossov",
      "Andrea Montanari",
      "Pulkit Tandon"
    ],
    "abstract": "Given a sample of size $N$, it is often useful to select a subsample of smaller size $n<N$ to be used for statistical estimation or learning.  Such a data selection step is useful to reduce the requirements of data labeling and the computational complexity of learning. We assume to be given $N$ unlabeled samples $x_{i}$, and to be given access to a  `surrogate model' that can predict labels $y_i$ better than random guessing. Our goal is to select a subset of the samples, to be denoted by {$x_{i}$}$_{i\\in G}$, of size $|G|=n<N$. We then acquire labels for this set and we use them to train a model via regularized empirical risk minimization. By using a mixture of numerical experiments on real and synthetic data, and mathematical derivations under low- and high- dimensional asymptotics, we show that: $(i)$ Data selection can be very effective, in particular beating training on the full sample in some cases; $(ii)$ Certain popular choices in data selection methods (e.g. unbiased reweighted subsampling, or influence function-based subsampling) can be substantially suboptimal.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=HhfcNgQn6p",
    "arxiv_id": "2309.14563",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17847,
    "title": "Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo",
    "authors": [
      "Haque Ishfaq",
      "Qingfeng Lan",
      "Pan Xu",
      "A. Rupam Mahmood",
      "Doina Precup",
      "Anima Anandkumar",
      "Kamyar Azizzadenesheli"
    ],
    "abstract": "We present a scalable and effective exploration strategy based on Thompson sampling for reinforcement learning (RL). One of the key shortcomings of  existing Thompson sampling algorithms is the need to perform a Gaussian approximation of the posterior distribution, which is not a good surrogate in most practical settings. We instead directly sample the Q-function from its posterior distribution, by using  Langevin Monte Carlo, an efficient type of Markov Chain Monte Carlo (MCMC) method. Our method only needs to perform noisy gradient descent updates to learn the exact posterior distribution of the Q-function, which makes our approach easy to deploy in deep RL.  Our theoretical analysis shows that, in the linear Markov decision process (linear MDP) setting, the proposed method has a regret bound of $\\tilde{O}(d^{3/2}H^{5/2}\\sqrt{T})$, where $d$ is the dimension of the feature mapping, $H$ is the planning horizon, and $T$ is the total number of steps. We apply the proposed approach to deep RL, by using the Adam optimizer to perform gradient updates. Our approach achieves better or similar results compared with state-of-the-art deep RL algorithms on several challenging exploration tasks from the Atari57 suite.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nfIAEJFiBZ",
    "arxiv_id": "2305.18246",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18992,
    "title": "In-Context Learning through the Bayesian Prism",
    "authors": [
      "Madhur Panwar",
      "Kabir Ahuja",
      "Navin Goyal"
    ],
    "abstract": "In-context learning (ICL) is one of the surprising and useful features of large language models and subject of intense research. Recently, stylized meta-learning-like ICL setups have been devised that train transformers on sequences of input-output pairs $(x, f(x))$ using the language modeling loss. The function $f$ comes from a function class and generalization is checked by evaluation on sequences for unseen functions from the same class. One of the main discoveries in this line of research has been that for several function classes, such as linear regression, transformers successfully generalize to new functions in the class. However, the inductive biases of these models resulting in this behavior are not clearly understood. A model with unlimited training data and compute is a Bayesian predictor: it learns the pretraining distribution.In this paper we empirically examine how far this Bayesian perspective can help us understand ICL. To this end, we generalize the previous meta-ICL setup to hierarchical meta-ICL setup which involve unions of multiple task families. We instantiate this setup on a diverse range of linear and nonlinear function families and find that transformers can do ICL in this setting as well. Where Bayesian inference is tractable, we find evidence that high-capacity transformers mimic the Bayesian predictor. The Bayesian perspective provides insights into the inductive bias of ICL and how transformers perform a particular task when they are trained on multiple tasks. We also find that transformers can learn to generalize to new function classes that were not seen during pretraining. This involves deviation from the Bayesian predictor. We examine deviations from the Bayesian predictor in more depth offering new insights and hypotheses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HX5ujdsSon",
    "arxiv_id": "2306.04891",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19354,
    "title": "Flag Aggregator: Scalable Distributed Training under Failures and Augmented Losses using Convex Optimization",
    "authors": [
      "Hamidreza Almasi",
      "Harsh Mishra",
      "Balajee Vamanan",
      "Sathya N. Ravi"
    ],
    "abstract": "Modern ML applications increasingly rely on complex deep learning models and large datasets. There has been an exponential growth in the amount of computation needed to train the largest models. Therefore, to scale computation and data, these models are inevitably trained in a distributed manner in clusters of nodes, and their updates are aggregated before being applied to the model. However, a distributed setup is prone to Byzantine failures of individual nodes, components, and software. With data augmentation added to these settings, there is a critical need for robust and efficient aggregation systems. We define the quality of workers as reconstruction ratios $\\in (0,1]$, and formulate aggregation as a Maximum Likelihood Estimation procedure using Beta densities. We show that the Regularized form of log-likelihood wrt subspace can be approximately solved using iterative least squares solver, and provide convergence guarantees using recent Convex Optimization landscape results. Our empirical findings demonstrate that our approach significantly enhances the robustness of state-of-the-art Byzantine resilient aggregators. We evaluate our method in a distributed setup with a parameter server, and show simultaneous improvements in communication efficiency and accuracy across various tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7avlrpzWqo",
    "arxiv_id": "2302.05865",
    "GitHub": [
      "https://github.com/hamidralmasi/FlagAggregator"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18837,
    "title": "Improving Offline RL by Blending Heuristics",
    "authors": [
      "Sinong Geng",
      "Aldo Pacchiano",
      "Andrey Kolobov",
      "Ching-An Cheng"
    ],
    "abstract": "We propose **H**e**u**ristic **Bl**ending (HUBL), a simple performance-improving technique for a broad class of offline RL algorithms based on value bootstrapping. HUBL modifies the Bellman operators used in these algorithms, partially replacing the bootstrapped values with heuristic ones that are estimated with Monte-Carlo returns. For trajectories with higher returns, HUBL relies more on the heuristic values and less on bootstrapping; otherwise, it leans more heavily on bootstrapping. HUBL is very easy to combine with many existing offline RL implementations by relabeling the offline datasets with adjusted rewards and discount factors. We derive a theory that explains HUBL's effect on offline RL as reducing offline RL's complexity and thus increasing its finite-sample performance.  Furthermore, we empirically demonstrate that HUBL consistently improves the policy quality of four state-of-the-art bootstrapping-based offline RL algorithms (ATAC, CQL, TD3+BC, and IQL), by 9% on average over 27 datasets of the D4RL and Meta-World benchmarks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MCl0TLboP1",
    "arxiv_id": "2306.00321",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18429,
    "title": "TEMPO: Prompt-based Generative Pre-trained Transformer for Time Series Forecasting",
    "authors": [
      "Defu Cao",
      "Furong Jia",
      "Sercan O Arik",
      "Tomas Pfister",
      "Yixiang Zheng",
      "Wen Ye",
      "Yan Liu"
    ],
    "abstract": "The past decade has witnessed significant advances in time series modeling with deep learning. While achieving state-of-the-art results, the best-performing architectures vary highly across applications and domains. On the other hand, for natural language processing, Generative Pre-trained Transformer (GPT) has demonstrated impressive performance via training one general-purpose model across various textual datasets. It is intriguing to explore whether GPT-type architectures can be effective for time series, capturing the intrinsic dynamic attributes and leading to significant accuracy improvements. In this paper, we propose a novel framework, TEMPO, that can effectively learn time series representations. We focus on utilizing two essential inductive biases of the time series task for pre-trained models: (i) decomposition of the complex interaction between trend, seasonal, and residual components; and (ii) introducing the selection-based prompts to facilitate distribution adaptation in non-stationary time series. TEMPO expands the capability for dynamically modeling real-world temporal phenomena from data within diverse domains. Our experiments demonstrate the superior performance of TEMPO, with 20%-60% improvement over state-of-the-art methods on a number of time series benchmark datasets. This performance gain is observed not only in standard supervised learning settings but also in scenarios involving previously unseen datasets. This compelling finding highlights TEMPO\u2019s potential to constitute a foundational model building framework.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YH5w12OUuU",
    "arxiv_id": "2310.04948",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18594,
    "title": "OpenNeRF: Open Set 3D Neural Scene Segmentation with Pixel-Wise Features and Rendered Novel Views",
    "authors": [
      "Francis Engelmann",
      "Fabian Manhardt",
      "Michael Niemeyer",
      "Keisuke Tateno",
      "Federico Tombari"
    ],
    "abstract": "Large visual-language models (VLMs), like CLIP, enable open-set image segmentation to segment arbitrary concepts from an image in a zero-shot manner. This goes beyond the traditional closed-set assumption, i.e., where models can only segment classes from a pre-defined training set. More recently, first works on open-set segmentation in 3D scenes have appeared in the literature. These methods are heavily influenced by closed-set 3D convolutional approaches that process point clouds or polygon meshes. However, these 3D scene representations do not align well with the image-based nature of the visual-language models. Indeed, point cloud and 3D meshes typically have a lower resolution than images and the reconstructed 3D scene geometry might not project well to the underlying 2D image sequences used to compute pixel-aligned CLIP features. To address these challenges, we propose OpenNeRF which naturally operates on posed images and directly encodes the VLM features within the NeRF. This is similar in spirit to LERF, however our work shows that using pixel-wise VLM features (instead of global CLIP features) results in an overall less complex architecture without the need for additional DINO regularization. Our OpenNeRF further leverages NeRF\u2019s ability to render novel views and extract open-set VLM features from areas that are not well observed in the initial posed images. For 3D point cloud segmentation on the Replica dataset, OpenNeRF outperforms recent open-vocabulary methods such as LERF and OpenScene by at least +4.9 mIoU.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SgjAojPKb3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19625,
    "title": "Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing",
    "authors": [
      "Dujian Ding",
      "Ankur Mallick",
      "Chi Wang",
      "Robert Sim",
      "Subhabrata Mukherjee",
      "Victor R\u00fchle",
      "Laks V. S. Lakshmanan",
      "Ahmed Hassan Awadallah"
    ],
    "abstract": "Large language models (LLMs) excel in most NLP tasks but also require expensive cloud servers for deployment due to their size, while smaller models that can be deployed on lower cost (e.g., edge) devices, tend to lag behind in terms of response quality. Therefore in this work we propose a hybrid inference approach which combines their respective strengths to save cost and maintain quality. Our approach uses a router that assigns queries to the small or large model based on the predicted query difficulty and the desired quality level. The desired quality level can be tuned dynamically at test time to seamlessly trade  quality for cost as per the scenario requirements. In experiments our approach allows us to make up to 40% fewer calls to the large model, with no drop in response quality.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=02f3mUtqnM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19624,
    "title": "Dropout Enhanced Bilevel Training",
    "authors": [
      "Peiran Yu",
      "Junyi Li",
      "Heng Huang"
    ],
    "abstract": "Bilevel optimization problems appear in many widely used machine learning tasks. Bilevel optimization models are sensitive to small changes, and bilevel training tasks typically involve limited datasets. Therefore, overfitting is a common challenge in bilevel training tasks. This paper considers the use of dropout to address this problem. We propose a bilevel optimization model that depends on the distribution of dropout masks. We investigate how the dropout rate affects the hypergradient of this model. We propose a dropout bilevel method to solve the dropout bilevel optimization model. Subsequently, we analyze the resulting dropout bilevel method from an optimization perspective. Analyzing the optimization properties of methods with dropout is essential because it provides convergence guarantees for methods using dropout. However, there has been limited investigation in this research direction. We provide the complexity of the resulting dropout bilevel method in terms of reaching an $\\epsilon$ stationary point of the proposed stochastic bilevel model. Empirically, we demonstrate that overfitting occurs in data cleaning problems, and the method proposed in this work mitigates this issue.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=06lrITXVAx",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19623,
    "title": "Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning",
    "authors": [
      "Mengzhou Xia",
      "Tianyu Gao",
      "Zhiyuan Zeng",
      "Danqi Chen"
    ],
    "abstract": "The popularity of LLaMA (Touvron et al., 2023a;b) and other recently emerged moderate-sized large language models (LLMs) highlights the potential of building smaller yet powerful LLMs. Regardless, the cost of training such models from scratch on trillions of tokens remains high. In this work, we study structured pruning as an effective means to develop smaller LLMs from pre-trained, larger models. Our approach employs two key techniques: (1) targeted structured pruning, which prunes a larger model to a specified target shape by removing layers, heads, intermediate and hidden dimensions in an end-to-end manner, and (2) dynamic batch loading, which dynamically updates the composition of sampled data in each training batch based on varying losses across different domains. We demonstrate the efficacy of our approach by presenting the Sheared-LLaMA series, pruning the LLaMA2-7B model down to 1.3B and 2.7B parameters. Sheared-LLaMA models outperform state-of-the-art open-source models of equivalent sizes, such as Pythia, INCITE, and OpenLLaMA models, on a wide range of downstream and instruction tuning evaluations, while requiring less than 3% of compute compared to training such models from scratch. This work provides compelling evidence that leveraging existing LLMs with structured pruning is a far more cost-effective approach for building smaller LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=09iOdaeOzp",
    "arxiv_id": "2310.06694",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19622,
    "title": "AutoLoRa: An Automated Robust Fine-Tuning Framework",
    "authors": [
      "Xilie Xu",
      "Jingfeng Zhang",
      "Mohan Kankanhalli"
    ],
    "abstract": "Robust Fine-Tuning (RFT) is a low-cost strategy to obtain adversarial robustness in downstream applications, without requiring a lot of computational resources and collecting significant amounts of data. This paper uncovers an issue with the existing RFT, where optimizing both adversarial and natural objectives through the feature extractor (FE) yields significantly divergent gradient directions. This divergence introduces instability in the optimization process, thereby hindering the attainment of adversarial robustness and rendering RFT highly sensitive to hyperparameters. To mitigate this issue, we propose a low-rank (LoRa) branch that disentangles RFT into two distinct components: optimizing natural objectives via the LoRa branch and adversarial objectives via the FE. Besides, we introduce heuristic strategies for automating the scheduling of the learning rate and the scalars of loss terms. Extensive empirical evaluations demonstrate that our proposed automated RFT disentangled via the LoRa branch (AutoLoRa) achieves new state-of-the-art results across a range of downstream tasks. AutoLoRa holds significant practical utility, as it automatically converts a pre-trained FE into an adversarially robust model for downstream tasks without the need for searching hyperparameters. Our source code is available at Anonymous GitHub.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=09xFexjhqE",
    "arxiv_id": "2310.01818",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19781,
    "title": "How Well Do Supervised Models Transfer to 3D Image Segmentation?",
    "authors": [
      "Wenxuan Li",
      "Alan Yuille",
      "Zongwei Zhou"
    ],
    "abstract": "The pre-training and fine-tuning paradigm has become prominent in transfer learning. For example, if the model is pre-trained on ImageNet and then fine-tuned to PASCAL, it can significantly outperform that trained directly on PASCAL. While ImageNet pre-training has shown enormous success, it is formed in 2D and the learned features are for classification tasks. Therefore, when transferring to more diverse tasks, like 3D image segmentation, its performance is inevitably compromised due to the deviation from the original ImageNet context. A significant challenge lies in the lack of large, annotated 3D datasets rivaling the scale of ImageNet for model pre-training. To overcome this challenge, we make two contributions. Firstly, we construct ImageNetCT-9K that comprises 9,262 three-dimensional computed tomography (CT) volumes with high-quality, per-voxel annotations. Secondly, we develop a suite of models that is supervised pre-trained on our ImageNetCT-9K. Our preliminary analyses indicate that the model trained only with 20 CT volumes, 640 masks, and 40 GPU hours has a transfer learning ability similar to the model trained with 5,050 CT volumes and 1,152 GPU hours. More importantly, the transfer learning ability of supervised models can further scale up with larger annotated datasets (i.e., SPT), achieving significantly better performance than all existing 3D models, irrespective of their pre-training methodologies or sources. We hope this study can facilitate collective efforts in constructing larger 3D vision datasets and more releases of supervised pre-trained models. Our code is attached as supplementary and will be publicly available.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=AhizIPytk4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19620,
    "title": "Language Control Diffusion: Efficiently Scaling through Space, Time, and Tasks",
    "authors": [
      "Edwin Zhang",
      "Yujie Lu",
      "Shinda Huang",
      "William Yang Wang",
      "Amy Zhang"
    ],
    "abstract": "Training generalist agents is difficult across several axes, requiring us to deal with high-dimensional inputs (space), long horizons (time), and generalization to novel tasks. Recent advances with architectures have allowed for improved scaling along one or two of these axes, but are still computationally prohibitive to use. In this paper, we propose to address all three axes by leveraging Language to Control Diffusion models as a hierarchical planner conditioned on language (LCD). We effectively and efficiently scale diffusion models for planning in extended temporal, state, and task dimensions to tackle long horizon control problems conditioned on natural language instructions, as a step towards generalist agents. Comparing LCD with other state-of-the-art models on the CALVIN language benchmark finds that LCD outperforms other SOTA methods in multi-task success rates, whilst improving inference speed over other comparable diffusion models by 3.3x~15x. We show that LCD can successfully leverage the unique strength of diffusion models to produce coherent long range plans while addressing their weakness in generating low-level details and control.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0H6DFoZZXZ",
    "arxiv_id": "2210.15629",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19497,
    "title": "Towards Principled Representation Learning from Videos for Reinforcement Learning",
    "authors": [
      "Dipendra Misra",
      "Akanksha Saran",
      "Tengyang Xie",
      "Alex Lamb",
      "John Langford"
    ],
    "abstract": "We study pre-training representations for decision-making using video data, which is abundantly available for tasks such as game agents and software testing. Even though significant empirical advances have been made on this problem, a theoretical understanding remains absent. We initiate the theoretical investigation into principled approaches for representation learning and focus on learning the latent state representations of the underlying MDP using video data. We study two types of settings: one where there is iid noise in the observation, and a more challenging setting where there is also the presence of exogenous noise, which is non-iid noise that is temporally correlated, such as the motion of people or cars in the background. We study three commonly used approaches: autoencoding, temporal contrastive learning, and forward modeling. We prove upper bounds for temporal contrastive and forward modeling in the presence of only iid noise.  We show that these approaches can learn the latent state and use it to do efficient downstream RL with polynomial sample complexity. When exogenous noise is also present, we establish a lower bound result showing that learning from video data can be exponentially worse than learning from action-labeled trajectory data. This partially explains why reinforcement learning with video pre-training is hard. We evaluate these representational learning methods in two visual domains, proving our theoretical findings.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=3mnWvUZIXt",
    "arxiv_id": "2403.13765",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18789,
    "title": "Learning Over Molecular Conformer Ensembles: Datasets and Benchmarks",
    "authors": [
      "Yanqiao Zhu",
      "Jeehyun Hwang",
      "Keir Adams",
      "Zhen Liu",
      "Bozhao Nan",
      "Brock Stenfors",
      "Yuanqi Du",
      "Jatin Chauhan",
      "Olaf Wiest",
      "Olexandr Isayev",
      "Connor W. Coley",
      "Yizhou Sun",
      "Wei Wang"
    ],
    "abstract": "Molecular Representation Learning (MRL) has proven impactful in numerous biochemical applications such as drug discovery and enzyme design. While Graph Neural Networks (GNNs) are effective at learning molecular representations from a 2D molecular graph or a single 3D structure, existing works often overlook the flexible nature of molecules, which continuously interconvert across conformations via chemical bond rotations and minor vibrational perturbations. To better account for molecular flexibility, some recent works formulate MRL as an ensemble learning problem, focusing on explicitly learning from a set of conformer structures. However, most of these studies have limited datasets, tasks, and models. In this work, we introduce the first MoleculAR Conformer Ensemble Learning (MARCEL) benchmark to thoroughly evaluate the potential of learning on con- former ensembles and suggest promising research directions. MARCEL includes four datasets covering diverse molecule- and reaction-level properties of chemically diverse molecules including organocatalysts and transition-metal catalysts, extending beyond the scope of common GNN benchmarks that are confined to drug-like molecules. In addition, we conduct a comprehensive empirical study, which benchmarks representative 1D, 2D, and 3D MRL models, along with two strategies that explicitly incorporate conformer ensembles into 3D models. Our findings reveal that direct learning from an accessible conformer space can improve performance on a variety of tasks and models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NSDszJ2uIV",
    "arxiv_id": "2310.00115",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19619,
    "title": "From Latent Graph to Latent Topology Inference: Differentiable Cell Complex Module",
    "authors": [
      "Claudio Battiloro",
      "Indro Spinelli",
      "Lev Telyatnikov",
      "Michael M. Bronstein",
      "Simone Scardapane",
      "Paolo Di Lorenzo"
    ],
    "abstract": "Latent Graph Inference (LGI) relaxed the reliance of Graph Neural Networks (GNNs) on a given graph topology by dynamically learning it. However, most of LGI methods assume to have a (noisy, incomplete, improvable, ...) input graph to rewire and can solely learn regular graph topologies. In the wake of the success of  Topological Deep Learning (TDL), we study Latent Topology Inference (LTI) for learning higher-order cell complexes (with sparse and not regular topology) describing multi-way interactions between data points. To this aim, we introduce the Differentiable Cell Complex Module (DCM), a novel learnable function that computes cell probabilities in the complex to improve the downstream task. We show how to integrate DCM with cell complex message-passing networks layers and train it in an end-to-end fashion, thanks to a two-step inference procedure that avoids an exhaustive search across all possible cells in the input, thus maintaining scalability. Our model is tested on several homophilic and heterophilic graph datasets and it is shown to outperform other state-of-the-art techniques, offering significant improvements especially in cases where an input graph is not provided.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0JsRZEGZ7L",
    "arxiv_id": "2305.16174",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19618,
    "title": "Making LLaMA SEE and Draw with SEED Tokenizer",
    "authors": [
      "Yuying Ge",
      "Sijie Zhao",
      "Ziyun Zeng",
      "Yixiao Ge",
      "Chen Li",
      "Xintao Wang",
      "Ying Shan"
    ],
    "abstract": "The great success of Large Language Models (LLMs) has expanded the potential of multimodality, contributing to the gradual evolution of General Artificial Intelligence (AGI). A true AGI agent should not only possess the capability to perform predefined multi-tasks but also exhibit emergent abilities in an open-world context. However, despite the considerable advancements made by recent multimodal LLMs, they still fall short in effectively unifying comprehension and generation tasks, let alone open-world emergent abilities. We contend that the key to overcoming the present impasse lies in enabling text and images to be represented and processed interchangeably within a unified autoregressive Transformer. To this end, we introduce $\\textbf{SEED}$, an elaborate image tokenizer that empowers LLMs with the ability to $\\textbf{SEE}$ and $\\textbf{D}$raw at the same time. We identify two crucial design principles: (1) Image tokens should be independent of 2D physical patch positions and instead be produced with a $\\textit{1D causal dependency}$, exhibiting intrinsic interdependence that aligns with the left-to-right autoregressive prediction mechanism in LLMs. (2) Image tokens should capture $\\textit{high-level semantics}$ consistent with the degree of semantic abstraction in words, and be optimized for both discriminativeness and reconstruction during the tokenizer training phase. With SEED tokens, LLM is able to perform scalable multimodal autoregression under its original training recipe, i.e., next-word prediction. SEED-LLaMA is therefore produced by large-scale pretraining and instruction tuning on the interleaved textual and visual data, demonstrating impressive performance on a broad range of multimodal comprehension and generation tasks. More importantly, SEED-LLaMA has exhibited compositional emergent abilities such as multi-turn in-context multimodal generation, acting like your AI assistant. The code and models will be publicly released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0Nui91LBQS",
    "arxiv_id": "2310.01218",
    "GitHub": [
      "https://github.com/AILab-CVC/SEED"
    ],
    "Space": [
      "AILab-CVC/SEED-LLaMA"
    ],
    "Model": [
      "AILab-CVC/SEED"
    ],
    "Dataset": []
  },
  {
    "id": 19617,
    "title": "Inner Classifier-Free Guidance and Its Taylor Expansion for Diffusion Models",
    "authors": [
      "Shikun Sun",
      "Longhui Wei",
      "Zhicai Wang",
      "Zixuan Wang",
      "Junliang Xing",
      "Jia Jia",
      "Qi Tian"
    ],
    "abstract": "Classifier-free guidance (CFG) is a pivotal technique for balancing the diversity and fidelity of samples in conditional diffusion models. This approach involves utilizing a single model to jointly optimize the conditional score predictor and unconditional score predictor, eliminating the need for additional classifiers. It delivers impressive results and can be employed for continuous and discrete condition representations. However, when the condition is continuous, it prompts the question of whether the trade-off can be further enhanced. Our proposed inner classifier-free guidance (ICFG) provides an alternative perspective on the CFG method when the condition has a specific structure, demonstrating that CFG represents a first-order case of ICFG. Additionally, we offer a second-order implementation, highlighting that even without altering the training policy, our second-order approach can introduce new valuable information and achieve an improved balance between fidelity and diversity for Stable Diffusion.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0QAzIMq32X",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19144,
    "title": "Prediction Error-based Classification for Class-Incremental Learning",
    "authors": [
      "Micha\u0142 Zaj\u0105c",
      "Tinne Tuytelaars",
      "Gido M van de Ven"
    ],
    "abstract": "Class-incremental learning (CIL) is a particularly challenging variant of continual learning, where the goal is to learn to discriminate between all classes presented in an incremental fashion. Existing approaches often suffer from excessive forgetting and imbalance of the scores assigned to classes that have not been seen together during training. In this study, we introduce a novel approach, Prediction Error-based Classification (PEC), which differs from traditional discriminative and generative classification paradigms. PEC computes a class score by measuring the prediction error of a model trained to replicate the outputs of a frozen random neural network on data from that class. The method can be interpreted as approximating a classification rule based on Gaussian Process posterior variance. PEC offers several practical advantages, including sample efficiency, ease of tuning, and effectiveness even when data are presented one class at a time. Our empirical results show that PEC performs strongly in single-pass-through-data CIL, outperforming other rehearsal-free baselines in all cases and rehearsal-based methods with moderate replay buffer size in most cases across multiple benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DJZDgMOLXQ",
    "arxiv_id": "2305.18806",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19615,
    "title": "MOFDiff: Coarse-grained Diffusion for Metal-Organic Framework Design",
    "authors": [
      "Xiang Fu",
      "Tian Xie",
      "Andrew Scott Rosen",
      "Tommi S. Jaakkola",
      "Jake Allen Smith"
    ],
    "abstract": "Metal-organic frameworks (MOFs) are of immense interest in applications such as gas storage and carbon capture due to their exceptional porosity and tunable chemistry. Their modular nature has enabled the use of template-based methods to generate hypothetical MOFs by combining molecular building blocks in accordance with known network topologies. However, the ability of these methods to identify top-performing MOFs is often hindered by the limited diversity of the resulting chemical space. In this work, we propose MOFDiff: a coarse-grained (CG) diffusion model that generates CG MOF structures through a denoising diffusion process over the coordinates and identities of the building blocks. The all-atom MOF structure is then determined through a novel assembly algorithm. As the diffusion model generates 3D MOF structures by predicting scores in E(3), we employ equivariant graph neural networks that respect the permutational and roto-translational symmetries. We comprehensively evaluate our model's capability to generate valid and novel MOF structures and its effectiveness in designing outstanding MOF materials for carbon capture applications with molecular simulations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0VBsoluxR2",
    "arxiv_id": "2310.10732",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19614,
    "title": "Revisiting Plasticity in Visual Reinforcement Learning: Data, Modules and Training Stages",
    "authors": [
      "Guozheng Ma",
      "Lu Li",
      "Sen Zhang",
      "Zixuan Liu",
      "Zhen Wang",
      "Yixin Chen",
      "Li Shen",
      "Xueqian Wang",
      "Dacheng Tao"
    ],
    "abstract": "Plasticity, the ability of a neural network to evolve with new data, is crucial for high-performance and sample-efficient visual reinforcement learning (VRL). Although methods like resetting and regularization can potentially mitigate plasticity loss, the influences of various components within the VRL framework on the agent's plasticity are still poorly understood. In this work, we conduct a systematic empirical exploration focusing on three primary underexplored facets and derive the following insightful conclusions: (1) data augmentation is essential in maintaining plasticity; (2) the critic's plasticity loss serves as the principal bottleneck impeding efficient training; and (3) without timely intervention to recover critic's plasticity in the early stages, its loss becomes catastrophic. These insights suggest a novel strategy to address the high replay ratio (RR) dilemma, where exacerbated plasticity loss hinders the potential improvements of sample efficiency brought by increased reuse frequency. Rather than setting a static RR for the entire training process, we propose Adaptive RR, which dynamically adjusts the RR based on the critic\u2019s plasticity level. Extensive evaluations indicate that Adaptive RR not only avoids catastrophic plasticity loss in the early stages but also benefits from more frequent reuse in later phases, resulting in superior sample efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0aR1s9YxoL",
    "arxiv_id": "2310.07418",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19613,
    "title": "Contrastive Difference Predictive Coding",
    "authors": [
      "Chongyi Zheng",
      "Ruslan Salakhutdinov",
      "Benjamin Eysenbach"
    ],
    "abstract": "Predicting and reasoning about the future lies at the heart of many time-series questions. For example, goal-conditioned reinforcement learning can be viewed as learning representations to predict which states are likely to be visited in the future. While prior methods have used contrastive predictive coding to model time series data, learning representations that encode long-term dependencies usually requires large amounts of data. In this paper, we introduce a temporal difference version of contrastive predictive coding that stitching together pieces of different time series data to decrease the amount of data required to learn to predict future events. We apply this representation learning method to derive an off-policy algorithm for goal-conditioned RL. Experiments demonstrate that, compared with prior RL methods, ours achieves higher success rates with less data, and can better cope with stochastic environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0akLDTFR9x",
    "arxiv_id": "2310.20141",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19612,
    "title": "NEFTune: Noisy Embeddings Improve Instruction Finetuning",
    "authors": [
      "Neel Jain",
      "Ping-yeh Chiang",
      "Yuxin Wen",
      "John Kirchenbauer",
      "Hong-Min Chu",
      "Gowthami Somepalli",
      "Brian R. Bartoldson",
      "Bhavya Kailkhura",
      "Avi Schwarzschild",
      "Aniruddha Saha",
      "Micah Goldblum",
      "Jonas Geiping",
      "Tom Goldstein"
    ],
    "abstract": "We show that language model finetuning can be improved, sometimes dramatically, with a simple augmentation. NEFTune adds noise to the embedding vectors during training.Standard finetuning of LLaMA-2-7B using Alpaca achieves $29.79$\\% on AlpacaEval, which rises to $64.69$\\% using noisy embeddings.NEFTune also improves over strong baselines on modern instruction datasets.Models trained with Evol-Instruct see a $10$\\% improvement, with ShareGPT an $8$\\% improvement, and with OpenPlatypus an $8$\\% improvement. Even powerful models further refined with RLHF such as LLaMA-2-Chat benefit from additional training with NEFTune.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0bMmZ3fkCk",
    "arxiv_id": "2310.05914",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19611,
    "title": "LiDAR-PTQ: Post-Training Quantization for Point Cloud 3D Object Detection",
    "authors": [
      "Sifan Zhou",
      "Liang Li",
      "Xinyu Zhang",
      "Bo Zhang",
      "Shipeng Bai",
      "Miao Sun",
      "Ziyu Zhao",
      "Xiaobo Lu",
      "Xiangxiang Chu"
    ],
    "abstract": "Due to highly constrained computing power and memory, deploying 3D lidar-based detectors on edge devices equipped in autonomous vehicles and robots poses a crucial challenge. Being a convenient and straightforward model compression approach, Post-Training Quantization (PTQ) has been widely adopted in 2D vision tasks. However, applying it directly to 3D lidar-based tasks inevitably leads to performance degradation. As a remedy, we propose an effective PTQ method called LiDAR-PTQ, which is particularly curated for 3D lidar detection (both SPConv-based and SPConv-free). Our LiDAR-PTQ features three main components, (1) a sparsity-based calibration method to determine the initialization of quantization parameters, (2) an adaptive rounding-to-nearest operation to minimize the layerwise reconstruction error, (3) a Task-guided Global Positive Loss (TGPL) to reduce the disparity between the final predictions before and after quantization. Extensive experiments demonstrate that our LiDAR-PTQ can achieve state-of-the-art quantization performance when applied to CenterPoint (both Pillar-based and Voxel-based). To our knowledge, for the very first time in lidar-based 3D detection tasks, the PTQ INT8 model's accuracy is almost the same as the FP32 model while enjoying 3X inference speedup. Moreover, our LiDAR-PTQ is cost-effective being 6X faster than the quantization-aware training method. The code will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0d1gQI114C",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19608,
    "title": "UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models",
    "authors": [
      "Hyunju Kang",
      "Geonhee Han",
      "Hogun Park"
    ],
    "abstract": "Node representation learning, such as Graph Neural Networks (GNNs), has become one of the important learning methods in machine learning, and the demand for reliable explanation generation is growing. Despite extensive research on explanation generation for supervised node representation learning, explaining unsupervised models has been less explored. To address this gap, we propose a method for generating counterfactual (CF) explanations in unsupervised node representation learning, aiming to identify the most important subgraphs that cause a significant change in the $k$-nearest neighbors of a node of interest in the learned embedding space upon perturbation. The $k$-nearest neighbor-based CF explanation method provides simple, yet pivotal, information for understanding unsupervised downstream tasks, such as top-$k$ link prediction and clustering. Furthermore, we introduce a Monte Carlo Tree Search (MCTS)-based explainability method for generating expressive CF explanations for **U**nsupervised **N**ode **R**epresentation learning methods, which we call **UNR-Explainer**. The proposed method demonstrates improved performance on six datasets for both unsupervised GraphSAGE and DGI.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0j9ZDzMPqr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19607,
    "title": "Magic123: One Image to High-Quality 3D Object Generation Using Both 2D and 3D Diffusion Priors",
    "authors": [
      "Guocheng Qian",
      "Jinjie Mai",
      "Abdullah Hamdi",
      "Jian Ren",
      "Aliaksandr Siarohin",
      "Bing Li",
      "Hsin-Ying Lee",
      "Ivan Skorokhodov",
      "Peter Wonka",
      "Sergey Tulyakov",
      "Bernard Ghanem"
    ],
    "abstract": "We present ``Magic123'', a two-stage coarse-to-fine approach for high-quality, textured 3D mesh generation from a single image in the wild using both 2D and 3D priors. In the first stage, we optimize a neural radiance field to produce a coarse geometry. In the second stage, we adopt a memory-efficient differentiable mesh representation to yield a high-resolution mesh with a visually appealing texture. In both stages, the 3D content is learned through reference-view supervision and novel-view guidance by a joint 2D and 3D diffusion prior. We introduce a trade-off parameter between the 2D and 3D priors to control the details and 3D consistencies of the generation. Magic123 demonstrates a significant improvement over previous image-to-3D techniques, as validated through extensive experiments on diverse synthetic and real-world images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0jHkUDyEO9",
    "arxiv_id": "2306.17843",
    "GitHub": [
      "https://github.com/guochengqian/Magic123"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19606,
    "title": "Sparse Spiking Neural Network: Exploiting Heterogeneity in Timescales for Pruning Recurrent SNN",
    "authors": [
      "Biswadeep Chakraborty",
      "Beomseok Kang",
      "Harshit Kumar",
      "Saibal Mukhopadhyay"
    ],
    "abstract": "Recurrent Spiking Neural Networks (RSNNs) have emerged as a computationally efficient and brain-inspired machine learning model. The design of sparse RSNNs with fewer neurons and synapses helps reduce the computational complexity of RSNNs. Traditionally, sparse SNNs are obtained by first training a dense and complex SNN for a target task and, next, eliminating neurons with low activity (activity-based pruning) while maintaining task performance. In contrast, this paper presents a task-agnostic methodology for designing sparse RSNNs by pruning an untrained (arbitrarily initialized) large model. We introduce a novel Lyapunov Noise Pruning (LNP) algorithm that uses graph sparsification methods and utilizes Lyapunov exponents to design a stable sparse RSNN from an untrained RSNN. We show that the LNP can leverage diversity in neuronal timescales to design a sparse Heterogeneous RSNN (HRSNN). Further, we show that the same sparse HRSNN model can be trained for different tasks, such as image classification and time-series prediction. The experimental results show that, in spite of being task-agnostic, LNP increases computational efficiency (fewer neurons and synapses) and prediction performance of RSNNs compared to traditional activity-based pruning of trained dense models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0jsfesDZDq",
    "arxiv_id": "2403.03409",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19605,
    "title": "MINDE: Mutual Information Neural Diffusion Estimation",
    "authors": [
      "Giulio Franzese",
      "Mustapha BOUNOUA",
      "Pietro Michiardi"
    ],
    "abstract": "In this work we present a new method for the estimation of Mutual Information (MI) between random variables. Our approach is based on an original interpretation of the Girsanov theorem, which allows us to use score-based diffusion models to estimate the KL divergence between two densities as a difference between their score functions. As a by-product, our method also enables the estimation of the entropy of random variables. Armed with such building blocks, we present a general recipe to measure MI, which unfolds in two directions: one uses conditional diffusion process, whereas the other uses joint diffusion processes that allow  simultaneous modelling of two random variables. Our results, which derive from a thorough experimental protocol over all the variants of our approach, indicate that our method is more accurate than the main alternatives from the literature, especially for challenging distributions. Furthermore, our methods pass MI self-consistency tests, including data processing and additivity under independence, which instead are a pain-point of existing methods",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0kWd8SJq8d",
    "arxiv_id": "2310.09031",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19604,
    "title": "Retrieval-Guided Reinforcement Learning for Boolean Circuit Minimization",
    "authors": [
      "Animesh Basak Chowdhury",
      "Marco Romanelli",
      "Benjamin Tan",
      "Ramesh Karri",
      "Siddharth Garg"
    ],
    "abstract": "Logic synthesis, a pivotal stage in chip design, entails optimizing chip specifications encoded in hardware description languages like Verilog into highly efficient implementations using Boolean logic gates. The process involves a sequential application of logic minimization heuristics (``synthesis recipe\"), with their arrangement significantly impacting crucial metrics such as area and delay. Addressing the challenge posed by the broad spectrum of hardware design complexities \u2014 from variations of past designs (e.g., adders and multipliers) to entirely novel configurations (e.g., innovative processor instructions) \u2014 requires a nuanced 'synthesis recipe' guided by human expertise and intuition. This study conducts a thorough examination of learning and search techniques for logic synthesis, unearthing a surprising revelation: pre-trained agents, when confronted with entirely novel designs, may veer off course, detrimentally affecting the search trajectory. We present RGLS, a meticulously tuned $\\alpha$ parameter that adeptly adjusts recommendations from pre-trained agents during the search process. Computed based on similarity scores through nearest neighbor retrieval from the training dataset, RGLS yields superior synthesis recipes tailored for a wide array of hardware designs. Our findings showcase substantial enhancements in the Quality of Result (QoR) of synthesized circuits, boasting improvements of up to 24.8\\% compared to state-of-the-art techniques. Furthermore, RGLS achieves an impressive up to 9x reduction in runtime (iso-QoR) when compared to current state-of-the-art methodologies.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0t1O8ziRZp",
    "arxiv_id": "2401.12205",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19765,
    "title": "LoftQ: LoRA-Fine-Tuning-aware Quantization for Large Language Models",
    "authors": [
      "Yixiao Li",
      "Yifan Yu",
      "Chen Liang",
      "Nikos Karampatziakis",
      "Pengcheng He",
      "Weizhu Chen",
      "Tuo Zhao"
    ],
    "abstract": "Quantization is an indispensable technique for serving Large Language Models (LLMs) and has recently found its way into LoRA fine-tuning (Dettmers et al., 2023). In this work we focus on the scenario where quantization and LoRA fine- tuning are applied together on a pre-trained model. In such cases it is common to observe a consistent gap in the performance on downstream tasks between full fine-tuning and quantization plus LoRA fine-tuning approach. In response, we propose LoftQ (LoRA-Fine-Tuning-aware Quantization), a novel quantization framework that simultaneously quantizes an LLM and finds a proper low-rank initialization for LoRA fine-tuning. Such an initialization alleviates the discrep- ancy between the quantized and full-precision model and significantly improves the generalization in downstream tasks. We evaluate our method on natural lan- guage understanding, question answering, summarization, and natural language generation tasks. Experiments show that our method is highly effective and out- performs existing quantization methods, especially in the challenging 2-bit and 2/4-bit mixed precision regimes. We will release our code.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=LzPWWPAdY4",
    "arxiv_id": "2310.08659",
    "GitHub": [
      "https://github.com/yxli2123/LoftQ"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19603,
    "title": "Understanding Hidden Context in Preference Learning: Consequences for RLHF",
    "authors": [
      "Anand Siththaranjan",
      "Cassidy Laidlaw",
      "Dylan Hadfield-Menell"
    ],
    "abstract": "In practice, preference learning from human feedback depends on incomplete data with hidden context. Hidden context refers to data that affects the feedback received, but which is not represented in the data used to train a preference model. This captures common issues of data collection, such as having human annotators with varied preferences, cognitive processes that result in seemingly irrational behavior, and combining data labeled according to different criteria. We prove that standard applications of preference learning, including reinforcement learning from human feedback (RLHF), implicitly aggregate over hidden contexts according to a well-known voting rule called *Borda count*. We show this can produce counter-intuitive results that are very different from other methods which implicitly aggregate via expected utility. Furthermore, our analysis formalizes the way that preference learning from users with diverse values tacitly implements a social choice function. A key implication of this result is that annotators have an incentive to misreport their preferences in order to influence the learned model, leading to vulnerabilities in the deployment of RLHF. As a step towards mitigating these problems, we introduce a class of methods called *distributional preference learning* (DPL). DPL methods estimate a distribution of possible score values for each alternative in order to better account for hidden context. Experimental results indicate that applying DPL to RLHF for LLM chatbots identifies hidden context in the data and significantly reduces subsequent jailbreak vulnerability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0tWTxYYPnW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19602,
    "title": "Linear attention is (maybe) all you need (to understand Transformer optimization)",
    "authors": [
      "Kwangjun Ahn",
      "Xiang Cheng",
      "Minhak Song",
      "Chulhee Yun",
      "Ali Jadbabaie",
      "Suvrit Sra"
    ],
    "abstract": "Transformer training is notoriously difficult, requiring a careful design of optimizers and use of various heuristics. We make progress towards understanding the subtleties of training Transformers by carefully studying a simple yet canonical linearized *shallow* Transformer model. Specifically, we train linear Transformers to solve regression tasks, inspired by J. von Oswald et al. (ICML 2023), and K. Ahn et al. (NeurIPS 2023). Most importantly, we observe that our proposed linearized models can reproduce several prominent aspects of Transformer training dynamics. Consequently, the results obtained in this paper suggest that a simple linearized Transformer model could actually be a valuable, realistic abstraction for understanding Transformer optimization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0uI5415ry7",
    "arxiv_id": "2310.01082",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19601,
    "title": "LipSim: A Provably Robust Perceptual Similarity Metric",
    "authors": [
      "Sara Ghazanfari",
      "Alexandre Araujo",
      "Prashanth Krishnamurthy",
      "Farshad Khorrami",
      "Siddharth Garg"
    ],
    "abstract": "Recent years have seen growing interest in developing and applying perceptual similarity metrics. Research has shown the superiority of perceptual metrics over pixel-wise metrics in aligning with human perception and serving as a proxy for the human visual system.On the other hand, as perceptual metrics rely on neural networks, there is a growing concern regarding their resilience, given the established vulnerability of neural networks to adversarial attacks. It is indeed logical to infer that perceptual metrics may inherit both the strengths and shortcomings of neural networks.In this work, we demonstrate the vulnerability of state-of-the-art perceptual similarity metrics based on an ensemble of ViT-based feature extractors to adversarial attacks. We then propose a framework to train a robust perceptual similarity metric called LipSim (Lipschitz Similarity Metric) with provable guarantees. By leveraging 1-Lipschitz neural networks as the backbone, LipSim provides guarded areas around each data point and certificates for all perturbations within an $\\ell_2$ ball. Finally, a comprehensive set of experiments shows the performance of LipSim in terms of natural and certified scores and on the image retrieval application.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0w42S2Gp70",
    "arxiv_id": "2310.18274",
    "GitHub": [
      "https://github.com/SaraGhazanfari/LipSim"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19600,
    "title": "SALMONN: Towards Generic Hearing Abilities for Large Language Models",
    "authors": [
      "Changli Tang",
      "Wenyi Yu",
      "Guangzhi Sun",
      "Xianzhao Chen",
      "Tian Tan",
      "Wei Li",
      "Lu Lu",
      "Zejun MA",
      "Chao Zhang"
    ],
    "abstract": "Hearing is arguably an essential ability of artificial intelligence (AI) agents in the physical world, which refers to the perception and understanding of general auditory information consisting of at least three types of sounds: speech, audio events, and music. In this paper, we propose SALMONN, a speech audio language music open neural network, built by integrating a pre-trained text-based large language model (LLM) with speech and audio encoders into a single multimodal model. SALMONN enables the LLM to directly process and understand general audio inputs and achieve competitive performances on a number of speech and audio tasks used in training, such as automatic speech recognition and translation, auditory-information-based question answering, emotion recognition, speaker verification, and music and audio captioning etc. SALMONN also has a diverse set of emergent abilities unseen in the training, which includes but is not limited to speech translation to untrained languages, speech-based slot filling, spoken question answering, audio-based storytelling, and speech audio co-reasoning etc. The presence of the cross-modal emergent abilities is studied, and a novel few-shot activation tuning approach is proposed to activate such abilities of SALMONN. To our knowledge, SALMONN is the first model of its type and can be regarded as a step towards AI with generic hearing abilities. An interactive demo of SALMONN is available at https://github.com/the-anonymous-account/SALMONN, and the training code and model checkpoints will be released upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=14rn7HpKVk",
    "arxiv_id": "2310.13289",
    "GitHub": [
      "https://github.com/bytedance/SALMONN"
    ],
    "Space": [],
    "Model": [
      "tsinghua-ee/SALMONN",
      "tsinghua-ee/SALMONN-7B"
    ],
    "Dataset": []
  },
  {
    "id": 19599,
    "title": "Tensor Programs VI: Feature Learning in Infinite Depth Neural Networks",
    "authors": [
      "Greg Yang",
      "Dingli Yu",
      "Chen Zhu",
      "Soufiane Hayou"
    ],
    "abstract": "Empirical studies have consistently demonstrated that increasing the size of neural networks often yields superior performance in practical applications. However, there is a lack of consensus regarding the appropriate scaling strategy, particularly when it comes to increasing the depth of neural networks. In practice, excessively large depths can lead to model performance degradation. In this paper, we introduce Depth-$\\mu$P, a principled approach for depth scaling, allowing for the training of arbitrarily deep architectures while maximizing feature learning and diversity among nearby layers. Our method involves dividing the contribution of each residual block and the parameter update by the square root of the depth. Through the use of Tensor Programs, we rigorously establish the existence of a limit for infinitely deep neural networks under the proposed scaling scheme. This scaling strategy ensures more stable training for deep neural networks and guarantees the transferability of hyperparameters from shallow to deep models. To substantiate the efficacy of our scaling method, we conduct empirical validation on neural networks with depths up to $2^{10}$.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=17pVDnpwwl",
    "arxiv_id": "2310.02244",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19598,
    "title": "Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictors",
    "authors": [
      "Hang Yin",
      "Zihao Wang",
      "Yangqiu Song"
    ],
    "abstract": "Reasoning on knowledge graphs is a challenging task because it utilizes observed information to predict the missing one. Particularly, answering complex queries based on first-order logic is one of the crucial tasks to verify learning to reason abilities for generalization and composition.Recently, the prevailing method is query embedding which learns the embedding of a set of entities and treats logic operations as set operations and has shown great empirical success. Though there has been much research following the same formulation, many of its claims lack a formal and systematic inspection. In this paper, we rethink this formulation and justify many of the previous claims by characterizing the scope of queries investigated previously and precisely identifying the gap between its formulation and its goal, as well as providing complexity analysis for the currently investigated queries. Moreover, we develop a new dataset containing ten new types of queries with features that have never been considered and therefore can provide a thorough investigation of complex queries. Finally, we propose a new neural-symbolic method, Fuzzy Inference with Truth value (FIT), where we equip the neural link predictors with fuzzy logic theory to support end-to-end learning using complex queries with provable reasoning capability. Empirical results show that our method outperforms previous methods significantly in the new dataset and also surpasses previous methods in the existing dataset at the same time.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1BmveEMNbG",
    "arxiv_id": "2304.07063",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19597,
    "title": "Enhancing Transferable Adversarial Attacks on Vision Transformers through Gradient Normalization Scaling and High-Frequency Adaptation",
    "authors": [
      "Zhiyu Zhu",
      "Xinyi Wang",
      "Zhibo Jin",
      "Jiayu Zhang",
      "Huaming Chen"
    ],
    "abstract": "At present, various variants of Vision Transformers (ViTs) models have been widely applied in fields such as computer vision, natural language processing, and cross-modal applications. A primary rationale behind this is that applying gradient propagation and gradient regularization across different functional regions in the transformer structure can enhance the transferability of adversarial samples. However, in practice, substantial gradient disparities exist even within the same functional region across different layers. In this paper, we introduce a novel Gradient Normalization Scaling method for fine-grained gradient editing to enhance the transferability of adversarial attacks on ViTs. More importantly, we highlight that ViTs, unlike conventional CNNs, exhibit distinct attention points in the frequency domain. Leveraging this insight, we delve into exploring frequency domain  to further enhance the algorithm's transferability. Through extensive experimentation on various ViT variants and traditional CNN models, we substantiate that the new approach achieves state-of-the-art performance, with an average performance improvement of 33.54\\% and 42.05\\% on ViT and CNN models, respectively. Our code is available at: https://anonymous.4open.science/r/GNS-HFE-DD2D/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1BuWv9poWz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19596,
    "title": "Unsupervised Order Learning",
    "authors": [
      "Seon-Ho Lee",
      "Nyeong-Ho Shin",
      "Chang-Su Kim"
    ],
    "abstract": "A novel clustering algorithm for ordered data, called unsupervised order learning (UOL), is proposed in this paper. First, we develop the ordered $k$-means to group objects into ordered clusters by reducing the deviation of an object from consecutive clusters. Then, we train a network to construct an embedding space, in which objects are sorted compactly along a chain of line segments, determined by the cluster centroids. We alternate the clustering and the network training until convergence. Moreover, we perform unsupervised rank estimation via a simple nearest neighbor search in the embedding space. Extensive experiments on various ordered datasets demonstrate that UOL provides reliable ordered clustering results and decent rank estimation performances with no supervision.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1CK45cqkEh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19595,
    "title": "Adaptive Retrieval and Scalable Indexing for k-NN Search with Cross-Encoders",
    "authors": [
      "Nishant Yadav",
      "Nicholas Monath",
      "Manzil Zaheer",
      "Rob Fergus",
      "Andrew McCallum"
    ],
    "abstract": "Cross-encoder (CE) models which compute similarity by jointly encoding a query-item pair perform better than using dot-product with embedding-based models (dual-encoders) at estimating query-item relevance.  Existing approaches perform $k$-NN search with cross-encoders by approximating the CE similarity with a vector embedding space fit either with dual-encoders (DE) or CUR matrix factorization. DE-based retrieve-and-rerank approaches suffer from poor recall as DE generalize poorly to new domains and the test-time retrieval with DE is decoupled from the CE.  While CUR-based approaches can be more accurate than the DE-based retrieve-and-rerank approach, such approaches require prohibitively large number of CE calls to compute item embeddings, thus making it impractical for deployment as scale.  In this paper, we address these shortcomings with our proposed sparse-matrix factorization based method that efficiently computes latent query and item representations to approximate CE scores and performs $k$-NN search with the approximate CE similarity.  In an offline indexing stage, we compute item embeddings by factorizing a sparse matrix containing query-item CE scores for a set of train queries.  Our method produces a high quality approximation while requiring only a fraction of CE similarity calls as compared to CUR-based methods, and allows for leveraging DE models to initialize the embedding space while avoiding compute- and resource-intensive finetuning of DE via distillation.  At test-time, we keep item embeddings fixed and perform retrieval over multiple rounds, alternating between a) estimating the test-query embedding by minimizing error in approximating CE scores of items retrieved thus far, and b) using the updated test-query embedding for retrieving more items in the next round.  Our proposed $k$-NN search method can achieve up to 5\\% and 54\\% improvement in $k$-NN recall for $k=1$ and 100 respectively over the widely-used DE-based retrieve-and-rerank approach. Furthermore, our proposed approach to index the items by aligning item embeddings with the CE achieves up to 100$\\times$ and 5$\\times$ speedup over CUR-based and dual-encoder distillation based approaches respectively while matching or improving $k$-NN search recall over baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1CPta0bfN2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19594,
    "title": "Denoising Diffusion via Image-Based Rendering",
    "authors": [
      "Titas Anciukevi\u010dius",
      "Fabian Manhardt",
      "Federico Tombari",
      "Paul Henderson"
    ],
    "abstract": "Generating and reconstructing 3D scenes is a challenging open problem, which requires synthesizing plausible content that is fully consistent in 3D space. While recent methods such as neural radiance fields excel at view synthesis and 3D reconstruction, they cannot synthesize plausible details in unobserved regions since they lack a generative capability. Conversely, existing generative methods are typically not capable of reconstructing detailed, large-scale scenes in the wild, as they use limited-capacity 3D scene representations, require aligned camera poses, or rely on additional regularizers. In this work, we introduce the first diffusion model able to perform fast, detailed reconstruction and generation of real-world 3D scenes. To achieve this, we make three contributions. First, we introduce a new neural scene representation that can efficiently and accurately represent large 3D scenes, dynamically allocating more capacity as needed to capture details visible in each image. Second, we propose a denoising-diffusion framework to learn a prior over this novel 3D scene representation, using only 2D images without the need for any additional supervision signal such as masks, depths, or regularizers, required by prior works. Third, we introduce a fast and unified architecture that supports conditioning on varying numbers of images, including a priori generation of 3D scenes and reconstruction from one or several images. We evaluate the model on several challenging datasets of real and synthetic images, and demonstrate superior results on generation, novel view synthesis and 3D reconstruction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1JbsdayvhO",
    "arxiv_id": "2402.03445",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19593,
    "title": "Neural Architecture Retrieval",
    "authors": [
      "Xiaohuan Pei",
      "Yanxi Li",
      "Minjing Dong",
      "Chang Xu"
    ],
    "abstract": "With the increasing number of new neural architecture designs and substantial existing neural architectures, it becomes difficult for the researchers to situate their contributions compared with existing neural architectures or establish the connections between their designs and other relevant ones. To discover similar neural architectures in an efficient and automatic manner, we define a new problem Neural Architecture Retrieval which retrieves a set of existing neural architectures which have similar designs to the query neural architecture. Existing graph pre-training strategies cannot address the computational graph in neural architectures due to the graph size and motifs. To fulfill this potential, we propose to divide the graph into motifs which are used to rebuild the macro graph to tackle these issues, and introduce multi-level contrastive learning to achieve accurate graph representation learning. Extensive evaluations on both human-designed and synthesized neural architectures demonstrate the superiority of our algorithm. Such a dataset which contains 12k real-world network architectures, as well as their embedding, is built for neural architecture retrieval.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1JtTPYBKqt",
    "arxiv_id": "2307.07919",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19592,
    "title": "Data Distillation Can Be Like Vodka: Distilling More Times For Better Quality",
    "authors": [
      "Xuxi Chen",
      "Yu Yang",
      "Zhangyang Wang",
      "Baharan Mirzasoleiman"
    ],
    "abstract": "Dataset distillation aims to reduce the time and memory requirement of training deep networks on large datasets by synthesizing a small number of synthetic images that can provide a similar generalization performance to that of the full data. Despite the recent efforts, existing dataset distillation methods suffer from a significant performance gap compared to training on the original data. In this work, we argue that distilling the entire data into one synthetic subset cannot achieve a superior generalization performance. This is because the training dynamics of deep networks drastically change during the training. Hence, multiple synthetic subsets are required to capture the training dynamics at different phases of training. To improve the distillation performance, we propose progressive dataset distillation (PDD), which synthesizes multiple small sets of synthetic images conditioned on the previous ones and trains the model on the union of the subsets generated so far. Our extensive experiments show that PDD can effectively improve the performance of existing dataset distillation methods by up to 4.3%. In addition, our method for the first time enable generating considerably larger synthetic datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1NHgmKqOzZ",
    "arxiv_id": "2310.06982",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19591,
    "title": "Backdoor Secrets Unveiled: Identifying Backdoor Data with Optimized Scaled Prediction Consistency",
    "authors": [
      "Soumyadeep Pal",
      "Yuguang Yao",
      "Ren Wang",
      "Bingquan Shen",
      "Sijia Liu"
    ],
    "abstract": "Modern machine learning (ML) systems demand substantial training data, often resorting to external sources. Nevertheless, this practice renders them vulnerable to backdoor poisoning attacks. Prior backdoor defense strategies have primarily focused on the identification of backdoored models or poisoned data characteristics, typically operating under the assumption of access to clean data. In this work, we delve into a relatively underexplored challenge: the automatic identification of backdoor data within a poisoned dataset, all under realistic conditions, *i.e.*,  without the need for additional clean data or manually defining a threshold for backdoor detection. We draw an inspiration from the scaled prediction consistency (SPC) technique, which exposes the prediction invariance of poisoned data to an input scaling factor. Based on this, we resolve the backdoor data identification problem as a hierarchical data splitting optimization problem, leveraging a novel SPC-based loss function as the primary optimization objective. Our innovation unfolds in several key aspects. First, we revisit the vanilla SPC method, unveiling its limitations in addressing the proposed backdoor identification problem. Subsequently, we develop a bi-level optimization-based approach to precisely identify backdoor data by minimizing the advanced SPC loss. Finally, we demonstrate the efficacy of our proposal against a spectrum of backdoor attacks, encompassing basic label-corrupted attacks as well as more sophisticated clean-label attacks, evaluated across various benchmark datasets. Experiment results show that our approach often surpasses the performance of current baselines in identifying backdoor data points, resulting in about an average 4\\%-20\\% improvement in AUROC.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1OfAO2mes1",
    "arxiv_id": "2403.10717",
    "GitHub": [
      "https://github.com/OPTML-Group/BackdoorMSPC"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19590,
    "title": "Bespoke Solvers for Generative Flow Models",
    "authors": [
      "Neta Shaul",
      "Juan Perez",
      "Ricky T. Q. Chen",
      "Ali Thabet",
      "Albert Pumarola",
      "Yaron Lipman"
    ],
    "abstract": "Diffusion or flow-based models are powerful generative paradigms that are notoriously hard to sample as samples are defined as solutions to high-dimensional Ordinary or Stochastic Differential Equations (ODEs/SDEs) which require a large Number of Function Evaluations (NFE) to approximate well. Existing methods to alleviate the costly sampling process include model distillation and designing dedicated ODE solvers. However, distillation is costly to train and sometimes can deteriorate quality, while dedicated solvers still require relatively large NFE to produce high quality samples. In this paper we introduce ``Bespoke solvers'', a novel framework for constructing custom ODE solvers tailored to the ODE of a given pre-trained flow model. Our approach optimizes an order consistent and parameter-efficient solver (e.g., with 80 learnable parameters), is trained for roughly 1\\% of the GPU time required for training the pre-trained model, and significantly improves approximation and generation quality compared to dedicated solvers. For example, a Bespoke solver for a CIFAR10 model produces samples with Fr\u00e9chet Inception Distance (FID) of 2.73 with 10 NFE, and gets to 1\\% of the Ground Truth (GT) FID (2.59) for this model with only 20 NFE. On the more challenging ImageNet-64$\\times$64, Bespoke samples at 2.2 FID with 10 NFE, and gets within 2\\% of GT FID (1.71) with 20 NFE.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=1PXEY7ofFX",
    "arxiv_id": "2310.19075",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19588,
    "title": "Network Memory Footprint Compression Through Jointly Learnable Codebooks and Mappings",
    "authors": [
      "Edouard YVINEC",
      "Arnaud Dapogny",
      "Kevin Bailly"
    ],
    "abstract": "The massive interest in deep neural networks (DNNs) for both computer vision and natural language processing has been sparked by the growth in computational power. However, this led to an increase in the memory footprint, to a point where it can be challenging to simply load a model on commodity devices such as mobile phones. To address this limitation, quantization is a favored solution as it maps high precision tensors to a low precision, memory efficient format. In terms of memory footprint reduction, its most effective variants are based on codebooks. These methods, however, suffer from two limitations. First, they either define a single codebook for each tensor, or use a memory-expensive mapping to multiple codebooks. Second, gradient descent optimization of the mapping favors jumps toward extreme values, hence not defining a proximal search. In this work, we propose to address these two limitations. First, we initially group similarly distributed neurons and leverage the re-ordered structure to either apply different scale factors to the different groups, or map weights that fall in these groups to several codebooks, without any mapping overhead. Second, stemming from this initialization, we propose a joint learning of the codebook and weight mappings that bears similarities with recent gradient-based post-training quantization techniques. Third, drawing estimation from straight-through estimation techniques, we introduce a novel gradient update definition to enable a proximal search of the codebooks and their mappings. The proposed jointly learnable codebooks and mappings (JLCM) method allows a very efficient approximation of any DNN: as such, a Llama 7B can be compressed down to 2Go and loaded on 5-year-old smartphones.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1RrOtCmuKr",
    "arxiv_id": "2309.17361",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19587,
    "title": "Spike-driven Transformer V2: Meta Spiking Neural Network Architecture Inspiring the Design of Next-generation Neuromorphic Chips",
    "authors": [
      "Man Yao",
      "JiaKui Hu",
      "Tianxiang Hu",
      "Yifan Xu",
      "Zhaokun Zhou",
      "Yonghong Tian",
      "Bo XU",
      "Guoqi Li"
    ],
    "abstract": "Neuromorphic computing, which exploits Spiking Neural Networks (SNNs) on neuromorphic chips, is a promising energy-efficient alternative to traditional AI. CNN-based SNNs are the current mainstream of neuromorphic computing. By contrast, no neuromorphic chips are designed especially for Transformer-based SNNs, which have just emerged, and their performance is only on par with CNN-based SNNs, offering no distinct advantage. In this work, we propose a general Transformer-based SNN architecture, termed as ``Meta-SpikeFormer\", whose goals are: (1) *Lower-power*, supports the spike-driven paradigm that there is only sparse addition in the network; (2) *Versatility*, handles various vision tasks; (3) *High-performance*, shows overwhelming performance advantages over CNN-based SNNs; (4) *Meta-architecture*, provides inspiration for future next-generation Transformer-based neuromorphic chip designs. Specifically, we extend the Spike-driven Transformer in \\citet{yao2023spike} into a meta architecture, and explore the impact of structure, spike-driven self-attention, and skip connection on its performance. On ImageNet-1K, Meta-SpikeFormer achieves 80.0\\% top-1 accuracy (55M), surpassing the current state-of-the-art (SOTA) SNN baselines (66M) by 3.7\\%. This is the first direct training SNN backbone that can simultaneously supports classification, detection, and segmentation, obtaining SOTA results in SNNs. Finally, we discuss the inspiration of the meta SNN architecture for neuromorphic chip design.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1SIBN5Xyw7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19586,
    "title": "Be Careful What You Smooth For: Label Smoothing Can Be a Privacy Shield but Also a Catalyst for Model Inversion Attacks",
    "authors": [
      "Lukas Struppek",
      "Dominik Hintersdorf",
      "Kristian Kersting"
    ],
    "abstract": "Label smoothing \u2013 using softened labels instead of hard ones \u2013 is a widely adopted regularization method for deep learning, showing diverse benefits such as enhanced generalization and calibration. Its implications for preserving model privacy, however, have remained unexplored. To fill this gap, we investigate the impact of label smoothing on model inversion attacks (MIAs), which aim to generate class-representative samples by exploiting the knowledge encoded in a classifier, thereby inferring sensitive information about its training data. Through extensive analyses, we uncover that traditional label smoothing fosters MIAs, thereby increasing a model's privacy leakage. Even more, we reveal that smoothing with negative factors counters this trend, impeding the extraction of class-related information and leading to privacy preservation, beating state-of-the-art defenses. This establishes a practical and powerful novel way for enhancing model resilience against MIAs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1SbkubNdbW",
    "arxiv_id": "2310.06549",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19585,
    "title": "Beyond Stationarity: Convergence Analysis of Stochastic Softmax Policy Gradient Methods",
    "authors": [
      "Sara Klein",
      "Simon Weissmann",
      "Leif D\u00f6ring"
    ],
    "abstract": "Markov Decision Processes (MDPs) are a formal framework for modeling and solving sequential decision-making problems. In finite time horizons such problems are relevant for instance for optimal stopping or specific supply chain problems, but also in the training of large language models. In contrast to infinite horizon MDPs optimal policies are not stationary, policies must be learned for every single epoch. In practice all parameters are often trained simultaneously, ignoring the inherent structure suggested by dynamic programming. This paper introduces a combination of dynamic programming and policy gradient called dynamical policy gradient, where the parameters are trained backwards in time.       For the tabular softmax parametrization we carry out convergence analysis for simultaneous and step-wise training towards global optima, both in the exact and sampled gradient settings without regularization. It turns out that the use of dynamic programming much better exploits the structure of finite time problems which is reflected in improved convergence bounds. The constants in the error bounds can be improved, where the powers of the time horizon $H$ reduce from $5$ to $3$. Moreover, a model-dependent constant (which also appears in the convergence rate of the discounted setting and can be arbitrarily small) can be omitted for the step-wise policy gradient approach but not for the simultaneous approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1VeQ6VBbev",
    "arxiv_id": "2310.02671",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19584,
    "title": "Beyond IID weights: sparse and low-rank deep Neural Networks are also Gaussian Processes",
    "authors": [
      "Thiziri Nait Saada",
      "Alireza Naderi",
      "Jared Tanner"
    ],
    "abstract": "The infinitely wide neural network has been proven a useful and manageable mathematical model that enables the understanding of many phenomena appearing in deep learning. One example is the convergence of random deep networks to Gaussian processes that enables a rigorous analysis of the way the choice of activation function and network weights impacts the training dynamics. In this paper, we extend the seminal proof of Matthews et al., 2018 to a larger class of initial weight distributions (which we call pseudo-iid), including the established cases of iid and orthogonal weights, as well as the emerging low-rank and structured sparse settings celebrated for their computational speed-up benefits. We show that fully-connected and convolutional networks initialised with pseudo-iid distributions are all effectively equivalent up to their variance. Using our results, one can identify the Edge of Chaos for a broader class of neural networks and tune them at criticality in order to enhance their training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1Wi0Ys33Nm",
    "arxiv_id": "2310.16597",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19581,
    "title": "DreamTime: An Improved Optimization Strategy for Diffusion-Guided 3D Generation",
    "authors": [
      "Yukun Huang",
      "Jianan Wang",
      "Yukai Shi",
      "Boshi Tang",
      "Xianbiao Qi",
      "Lei Zhang"
    ],
    "abstract": "Text-to-image diffusion models pre-trained on billions of image-text pairs have recently enabled 3D content creation by optimizing a randomly initialized differentiable 3D representation with score distillation. However, the optimization process suffers slow convergence and the resultant 3D models often exhibit two limitations: (a) quality concerns such as missing attributes and distorted shape and textures; (b) extremely low diversity comparing to text-guided image synthesis. In this paper, we show that the conflict between the 3D optimization process and uniform timestep sampling in score distillation is the main reason for these limitations. To resolve this conflict, we propose to prioritize timestep sampling with monotonically non-increasing functions, which aligns the 3D optimization process with the sampling process of diffusion model. Extensive experiments show that our simple redesign significantly improves 3D content creation with faster convergence, better quality and diversity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1bAUywYJTU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19580,
    "title": "I-PHYRE: Interactive Physical Reasoning",
    "authors": [
      "Shiqian Li",
      "Kewen Wu",
      "Chi Zhang",
      "Yixin Zhu"
    ],
    "abstract": "Current evaluation protocols predominantly assess physical reasoning in stationary scenes, creating a gap in evaluating agents' abilities to interact with dynamic events. While contemporary methods allow agents to modify initial scene configurations and observe consequences, they lack the capability to interact with events in real time. To address this, we introduce I-PHYRE, a framework that challenges agents to simultaneously exhibit intuitive physical reasoning, multi-step planning, and in-situ intervention. Here, intuitive physical reasoning refers to a quick, approximate understanding of physics to address complex problems; multi-step denotes the need for extensive sequence planning in I-PHYRE, considering each intervention can significantly alter subsequent choices; and in-situ implies the necessity for timely object manipulation within a scene, where minor timing deviations can result in task failure. We formulate four game splits to scrutinize agents' learning and generalization of essential principles of interactive physical reasoning, fostering learning through interaction with representative scenarios. Our exploration involves three planning strategies and examines several supervised and reinforcement agents' zero-shot generalization proficiency on I-PHYRE. The outcomes highlight a notable gap between existing learning algorithms and human performance, emphasizing the imperative for more research in enhancing agents with interactive physical reasoning capabilities. The environment and baselines will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1bbPQShCT2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19579,
    "title": "ReSimAD: Zero-Shot 3D Domain Transfer for Autonomous Driving with Source Reconstruction and Target Simulation",
    "authors": [
      "Bo Zhang",
      "Xinyu Cai",
      "Jiakang Yuan",
      "Donglin Yang",
      "Jianfei Guo",
      "Xiangchao Yan",
      "Renqiu Xia",
      "Botian Shi",
      "Min Dou",
      "Tao Chen",
      "Si Liu",
      "Junchi Yan",
      "Yu Qiao"
    ],
    "abstract": "Domain shifts such as sensor type changes and geographical situation variations are prevalent in Autonomous Driving (AD), which poses a challenge since AD model relying on the previous domain knowledge can be hardly directly deployed to a new domain without additional costs. In this paper, we provide a new perspective and approach of alleviating the domain shifts, by proposing a Reconstruction-Simulation-Perception (ReSimAD) scheme. Specifically, the implicit reconstruction process is based on the knowledge from the previous old domain, aiming to convert the domain-related knowledge into domain-invariant representations, e.g., 3D scene-level meshes. Besides, the point clouds simulation process of multiple new domains is conditioned on the above reconstructed 3D meshes, where the target-domain-like simulation samples can be obtained, thus reducing the cost of collecting and annotating new-domain data for the subsequent perception process. For experiments, we consider different cross-domain situations such as Waymo-to-KITTI, Waymo-to-nuScenes, etc, to verify the zero-shot target-domain perception using ReSimAD. Results demonstrate that our method is beneficial to boost the domain generalization ability, even promising for 3D pre-training. Code and simulated points are available at: https://github.com/PJLab-ADG/3DTrans",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1d2cLKeNgY",
    "arxiv_id": "2309.05527",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19578,
    "title": "Sample-Efficient Learning of POMDPs with Multiple Observations In Hindsight",
    "authors": [
      "Jiacheng Guo",
      "Minshuo Chen",
      "Huan Wang",
      "Caiming Xiong",
      "Mengdi Wang",
      "Yu Bai"
    ],
    "abstract": "This paper studies the sample-efficiency of learning in Partially Observable Markov Decision Processes (POMDPs), a challenging problem in reinforcement learning that is known to be exponentially hard in the worst-case. Motivated by real-world settings such as loading in game playing, we propose an enhanced feedback model called ``multiple observations in hindsight'', where after each episode of interaction with the POMDP, the learner may collect multiple additional observations emitted from the encountered latent states, but may not observe the latent states themselves. We show that sample-efficient learning under this feedback model is possible for two new subclasses of POMDPs: \\emph{multi-observation revealing POMDPs} and \\emph{distinguishable POMDPs}. Both subclasses generalize and substantially relax \\emph{revealing POMDPs}---a widely studied subclass for which sample-efficient learning is possible under standard trajectory feedback. Notably, distinguishable POMDPs only require the emission distributions from different latent states to be \\emph{different} instead of \\emph{linearly independent} as required in revealing POMDPs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1hsVvgW0rU",
    "arxiv_id": "2307.02884",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19577,
    "title": "Simple Minimax Optimal Byzantine Robust Algorithm for Nonconvex Objectives with Uniform Gradient Heterogeneity",
    "authors": [
      "Tomoya Murata",
      "Kenta Niwa",
      "Takumi Fukami",
      "Iifan Tyou"
    ],
    "abstract": "In this study, we consider nonconvex federated learning problems with the existence of Byzantine workers. We propose a new simple Byzantine robust algorithm called Momentum Screening. The algorithm is adaptive to the Byzantine fraction, i.e., all its hyperparameters do not depend on the number of Byzantine workers. We show that our method achieves the best optimization error of $O(\\delta^2\\zeta_\\mathrm{max}^2)$ for nonconvex smooth local objectives satisfying $\\zeta_\\mathrm{max}$-uniform gradient heterogeneity condition under $\\delta$-Byzantine fraction, which can be better than the best known error rate of $O(\\delta\\zeta_\\mathrm{mean}^2)$ for local objectives satisfying $\\zeta_\\mathrm{mean}$-mean heterogeneity condition when $\\delta \\leq (\\zeta_\\mathrm{max}/\\zeta_\\mathrm{mean})^2$. Furthermore, we derive an algorithm independent lower bound for local objectives satisfying $\\zeta_\\mathrm{max}$-uniform gradient heterogeneity condition and show the minimax optimality of our proposed method on this class. In numerical experiments, we validate the superiority of our method over the existing robust aggregation algorithms and verify our theoretical results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1ii8idH4tH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19576,
    "title": "Towards Few-Shot Adaptation of Foundation Models via Multitask Finetuning",
    "authors": [
      "Zhuoyan Xu",
      "Zhenmei Shi",
      "Junyi Wei",
      "Fangzhou Mu",
      "Yin Li",
      "Yingyu Liang"
    ],
    "abstract": "Foundation models have emerged as a powerful tool for many AI problems. Despite the tremendous success of foundation models, effective adaptation to new tasks, particularly those with limited labels, remains an open question and lacks theoretical understanding.   An emerging solution with recent success in vision and NLP involves finetuning a foundation model on a selection of relevant tasks, before its adaptation to a target task with limited labeled samples. In this paper, we study the theoretical justification of this multitask finetuning approach. Our theoretical analysis reveals that with a diverse set of related tasks, this multitask finetuning leads to reduced error in the target task, in comparison to directly adapting the same pretrained model. We quantify the relationship between finetuning tasks and target tasks by diversity and consistency metrics, and further propose a practical task selection algorithm.  We substantiate our theoretical claims with extensive empirical evidence.Further, we present results affirming our task selection algorithm adeptly chooses related finetuning tasks, providing advantages to the model performance on target tasks.  We believe our study shed new light on the effective adaptation of foundation models to new tasks that lack abundant labels.  Our code is available at https://github.com/OliverXUZY/Foudation-Model_Multitask.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1jbh2e0b2K",
    "arxiv_id": "2402.15017",
    "GitHub": [
      "https://github.com/OliverXUZY/Foudation-Model_Multitask"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19575,
    "title": "InstaFlow: One Step is Enough for High-Quality Diffusion-Based Text-to-Image Generation",
    "authors": [
      "Xingchao Liu",
      "Xiwen Zhang",
      "Jianzhu Ma",
      "Jian Peng",
      "qiang liu"
    ],
    "abstract": "Diffusion models have revolutionized text-to-image generation with its exceptional quality and creativity. However, its multi-step sampling process is known to be slow, often requiring tens of inference steps to obtain satisfactory results. Previous attempts to improve its sampling speed and reduce computational costs through distillation have been unsuccessful in achieving a functional one-step model.In this paper, we explore a recent method called Rectified Flow, which, thus far, has only been applied to small datasets. The core of Rectified Flow lies in its \\emph{reflow} procedure, which straightens the trajectories of probability flows, refines the coupling between noises and images, and facilitates the distillation process with student models. We propose a novel text-conditioned pipeline to turn Stable Diffusion (SD) into an ultra-fast one-step model, in which we find reflow plays a critical role in improving the assignment between noise and images. Leveraging our new pipeline, we create, to the best of our knowledge, the first one-step diffusion-based text-to-image generator with SD-level image quality, achieving an FID (Fr\u00e9chet Inception Distance) of $23.3$ on MS COCO 2017-5k, surpassing the previous state-of-the-art technique, progressive distillation, by a significant margin ($37.2$ $\\rightarrow$ $23.3$ in FID). By utilizing an expanded network with 1.7B parameters, we further improve the FID to $22.4$. We call our one-step models \\emph{InstaFlow}. On MS COCO 2014-30k, InstaFlow yields an FID of $13.1$ in just $0.09$ second, the best in $\\leq 0.1$ second regime, outperforming the recent StyleGAN-T ($13.9$ in $0.1$ second). Notably, the training of InstaFlow only costs 199 A100 GPU days.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1k4yZbbDqX",
    "arxiv_id": "2309.06380",
    "GitHub": [
      "https://github.com/gnobitab/InstaFlow"
    ],
    "Space": [
      "XCLiu/InstaFlow"
    ],
    "Model": [
      "XCLiu/instaflow_0_9B_from_sd_1_5",
      "XCLiu/2_rectified_flow_from_sd_1_5"
    ],
    "Dataset": []
  },
  {
    "id": 19574,
    "title": "Domain constraints improve risk prediction when outcome data is missing",
    "authors": [
      "Sidhika Balachandar",
      "Nikhil Garg",
      "Emma Pierson"
    ],
    "abstract": "Machine learning models are often trained to predict the outcome resulting from a human decision. For example, if a doctor decides to test a patient for disease, will the patient test positive? A challenge is that the human decision censors the outcome data: we only observe test outcomes for patients doctors historically tested. Untested patients, for whom outcomes are unobserved, may differ from tested patients along observed and unobserved dimensions. We propose a Bayesian model which captures this setting. The purpose of the model is to accurately estimate risk for both tested and untested patients. Estimating this model is challenging due to the wide range of possibilities for untested patients. To address this, we propose two domain constraints which are plausible in health settings: a prevalence constraint, where the overall disease prevalence is known, and an expertise constraint, where the human decision-maker deviates from purely risk-based decision-making only along a constrained feature set. We show theoretically and on synthetic data that domain constraints improve parameter inference. We apply our model to a case study of cancer risk prediction, showing that the model's inferred risk predicts cancer diagnoses, its inferred testing policy captures known public health policies, and it can identify suboptimalities in test allocation. Though our case study is in healthcare, our analysis reveals a general class of domain constraints which can improve model estimation in many settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1mNFsbvo2P",
    "arxiv_id": "2312.03878",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19573,
    "title": "Unsupervised Pretraining for Fact Verification by Language Model Distillation",
    "authors": [
      "Adri\u00e1n Bazaga",
      "Pietro Lio",
      "Gos Micklem"
    ],
    "abstract": "Unsupervised fact verification aims to verify a claim using evidence from a trustworthy knowledge base without any kind of data annotation. To address this challenge, algorithms must produce features for every claim that are both semantically meaningful, and compact enough to find a semantic alignment with the source information. In contrast to previous work, which tackled the alignment problem by learning over annotated corpora of claims and their corresponding labels, we propose SFAVEL ($\\underline{S}$elf-supervised $\\underline{Fa}$ct $\\underline{Ve}$rification via $\\underline{L}$anguage Model Distillation), a novel unsupervised framework that leverages pre-trained language models to distil self-supervised features into high-quality claim-evidence alignments without the need for annotations. This is enabled by a novel contrastive loss function that encourages features to attain high-quality claim and evidence alignments whilst preserving the semantic relationships across the corpora. Notably, we present results that achieve a new state-of-the-art on the standard FEVER fact verification benchmark (+8% accuracy) with linear evaluation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1mjsP8RYAw",
    "arxiv_id": "2309.16540",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19572,
    "title": "Dynamic Sparse No Training:  Training-Free Fine-tuning for Sparse LLMs",
    "authors": [
      "Yuxin Zhang",
      "Lirui Zhao",
      "Mingbao Lin",
      "Sun Yunyun",
      "Yiwu Yao",
      "Xingjia Han",
      "Jared Tanner",
      "Shiwei Liu",
      "Rongrong Ji"
    ],
    "abstract": "The ever-increasing large language models (LLMs), though opening a potential path for the upcoming artificial general intelligence, sadly drops a daunting obstacle on the way towards their on-device deployment. As one of the most well-established pre-LLMs approaches in reducing model complexity, network pruning appears to lag behind in the era of LLMs, due mostly to its costly fine-tuning (or re-training) necessity under the massive volumes of model parameter and training data. To close this industry-academia gap, we introduce Dynamic Sparse No Training ($\\texttt{DSNT}$), a training-free fine-tuning approach that slightly updates sparse LLMs without the expensive backpropagation and any weight updates. Inspired by the Dynamic Sparse Training, $\\texttt{DSNT}$ minimizes the reconstruction error between the dense and sparse LLMs, in the fashion of performing iterative weight pruning-and-growing on top of sparse LLMs. To accomplish this purpose, $\\texttt{DSNT}$ particularly takes into account the anticipated reduction in reconstruction error for pruning and growing, as well as the variance w.r.t. different input data for growing each weight. This practice can be executed efficiently in linear time since its obviates the need of backpropagation for fine-tuning LLMs. Extensive experiments on LLaMA-V1/V2, Vicuna, and OPT across various benchmarks demonstrate the effectiveness of $\\texttt{DSNT}$ in enhancing the performance of sparse LLMs, especially at high sparsity levels. For instance, $\\texttt{DSNT}$ is able to outperform the state-of-the-art Wanda by 26.79 perplexity at 70% sparsity with LLaMA-7B. Our paper offers fresh insights into how to fine-tune sparse LLMs in an efficient training-free manner and open new venues to scale the great potential of sparsity to LLMs. Codes will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1ndDmZdT4g",
    "arxiv_id": "2310.08915",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19570,
    "title": "Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach",
    "authors": [
      "Shaopeng Fu",
      "Di Wang"
    ],
    "abstract": "Adversarial training (AT) is a canonical method for enhancing the robustness of deep neural networks (DNNs). However, recent studies empirically demonstrated that it suffers from robust overfitting, i.e., a long time AT can be detrimental to the robustness of DNNs. This paper presents a theoretical explanation of robust overfitting for DNNs. Specifically, we non-trivially extend the neural tangent kernel (NTK) theory to AT and prove that an adversarially trained wide DNN can be well approximated by a linearized DNN. Moreover, for squared loss, closed-form AT dynamics for the linearized DNN can be derived, which reveals a new AT degeneration phenomenon: a long-term AT will result in a wide DNN degenerates to that obtained without AT and thus cause robust overfitting. Based on our theoretical results, we further design a method namely Adv-NTK, the first AT algorithm for infinite-width DNNs. Experiments on real-world datasets show that Adv-NTK can help infinite-width DNNs enhance comparable robustness to that of their finite-width counterparts, which in turn justifies our theoretical findings. The code is available at https://github.com/fshp971/adv-ntk.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1op5YGZu8X",
    "arxiv_id": "2310.06112",
    "GitHub": [
      "https://github.com/fshp971/adv-ntk"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19569,
    "title": "Convolutional Deep Kernel Machines",
    "authors": [
      "Edward Milsom",
      "Ben Anson",
      "Laurence Aitchison"
    ],
    "abstract": "Standard infinite-width limits of neural networks sacrifice the ability for intermediate layers to learn representations from data. Recent work (\"A theory of representation learning gives a deep generalisation of kernel methods\", Yang et al. 2023) modified the Neural Network Gaussian Process (NNGP) limit of Bayesian neural networks so that representation learning is retained. Furthermore, they found that applying this modified limit to a deep Gaussian process gives a practical learning algorithm which they dubbed the \"deep kernel machine\" (DKM). However, they only considered the simplest possible setting: regression in small, fully connected networks with e.g. 10 input features.  Here, we introduce convolutional deep kernel machines. This required us to develop a novel inter-domain inducing point approximation, as well as introducing and experimentally assessing a number of techniques not previously seen in DKMs, including analogues to batch normalisation, different likelihoods, and different types of top-layer. The resulting model trains in roughly 28 GPU hours, achieving around 99\\% test accuracy on MNIST, 71\\% on CIFAR-100, and 92\\% on CIFAR-10, which is SOTA for kernel methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1oqedRt6Z7",
    "arxiv_id": "2309.09814",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19567,
    "title": "MiniGPT-4: Enhancing Vision-Language Understanding with Advanced Large Language Models",
    "authors": [
      "Deyao Zhu",
      "Jun Chen",
      "Xiaoqian Shen",
      "Xiang Li",
      "Mohamed Elhoseiny"
    ],
    "abstract": "The recent GPT-4 has demonstrated extraordinary multi-modal abilities, such as directly generating websites from handwritten text and identifying humorous elements within images. These features are rarely observed in previous vision-language models. However, the technical details behind GPT-4 continue to remain undisclosed.We believe that the enhanced multi-modal generation capabilities of GPT-4 stem from the utilization of sophisticated large language models (LLM). To examine this phenomenon, we present MiniGPT-4, which aligns a frozen visual encoder with a frozen advanced LLM, Vicuna, using one projection layer. Our work, for the first time, uncovers that properly aligning the visual features with an advanced large language model can possess numerous advanced multi-modal abilities demonstrated by GPT-4, such as detailed image description generation and website creation from hand-drawn drafts.Furthermore, we also observe other emerging capabilities in MiniGPT-4, including writing stories and poems inspired by given images, teaching users how to cook based on food photos, and so on. In our experiment, we found that the model trained on short image caption pairs could produce unnatural language outputs (e.g., repetition and fragmentation). To address this problem, we curate a detailed image description dataset in the second stage to finetune the model, which consequently improves the model's generation reliability and overall usability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1tZbq88f27",
    "arxiv_id": "2304.10592",
    "GitHub": [
      "https://github.com/Vision-CAIR/MiniGPT-4"
    ],
    "Space": [
      "Vision-CAIR/minigpt4"
    ],
    "Model": [
      "Vision-CAIR/MiniGPT-4"
    ],
    "Dataset": []
  },
  {
    "id": 18593,
    "title": "Accurate Forgetting for Heterogeneous Federated Continual Learning",
    "authors": [
      "Abudukelimu Wuerkaixi",
      "Sen Cui",
      "Jingfeng Zhang",
      "Kunda Yan",
      "Bo Han",
      "Gang Niu",
      "Lei Fang",
      "Changshui Zhang",
      "Masashi Sugiyama"
    ],
    "abstract": "Recent years have witnessed a burgeoning interest in federated learning (FL).However, the contexts in which clients engage in sequential learning remain under-explored.Bridging FL and continual learning (CL) gives rise to a challenging practical problem: federated continual learning (FCL).Existing research in FCL primarily focuses on mitigating the catastrophic forgetting issue of continual learning while collaborating with other clients. We argue that the forgetting phenomena are not invariably detrimental.In this paper, we consider a more practical and challenging FCL setting characterized by potentially unrelated or even antagonistic data/tasks across different clients.In the FL scenario, statistical heterogeneity and data noise among clients may exhibit spurious correlations which result in biased feature learning.While existing CL strategies focus on a complete utilization of previous knowledge, we found that forgetting biased information is beneficial in our study. Therefore, we propose the new concept accurate forgetting (AF) and develop a novel generative-replay method AF-FCL which selectively utilizes previous knowledge in federated networks.We employ a probabilistic framework based on a normalizing flow model to quantify the credibility of previous knowledge.Comprehensive experiments affirm the superiority of our method over various baselines.Code is at: https://anonymous.4open.science/r/AF-FCL-7D65.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ShQrnAsbPI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19566,
    "title": "Unified Human-Scene Interaction via Prompted Chain-of-Contacts",
    "authors": [
      "Zeqi Xiao",
      "Tai Wang",
      "Jingbo Wang",
      "Jinkun Cao",
      "Wenwei Zhang",
      "Bo Dai",
      "Dahua Lin",
      "Jiangmiao Pang"
    ],
    "abstract": "Human-Scene Interaction (HSI) is a vital component of fields like embodied AI and virtual reality. Despite advancements in motion quality and physical plausibility, two pivotal factors, versatile interaction control and the development of a user-friendly interface, require further exploration before the practical application of HSI. This paper presents a unified HSI framework, UniHSI, which supports unified control of diverse interactions through language commands. This framework is built upon the definition of interaction as Chain of Contacts (CoC): steps of human joint-object part pairs, which is inspired by the strong correlation between interaction types and human-object contact regions.Based on the definition, UniHSI constitutes a Large Language Model (LLM) Planner to translate language prompts into task plans in the form of CoC, and a Unified Controller that turns CoC into uniform task execution. To facilitate training and evaluation, we collect a new dataset named ScenePlan that encompasses thousands of task plans generated by LLMs based on diverse scenarios. Comprehensive experiments demonstrate the effectiveness of our framework in versatile task execution and generalizability to real scanned scenes.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=1vCnDyQkjg",
    "arxiv_id": "2309.07918",
    "GitHub": [
      "https://github.com/OpenRobotLab/UniHSI"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19795,
    "title": "Mastering Memory Tasks with World Models",
    "authors": [
      "Mohammad Reza Samsami",
      "Artem Zholus",
      "Janarthanan Rajendran",
      "Sarath Chandar"
    ],
    "abstract": "Current model-based reinforcement learning (MBRL) agents struggle with long-term dependencies. This limits their ability to effectively solve tasks involving extended time gaps between actions and outcomes, or tasks demanding the recalling of distant observations to inform current actions. To improve temporal coherence, we integrate a new family of state space models (SSMs) in world models of MBRL agents to present a new method, Recall to Imagine (R2I). This integration aims to enhance both long-term memory and long-horizon credit assignment. Through a diverse set of illustrative tasks, we systematically demonstrate that R2I establishes a new state-of-the-art performance in challenging memory and credit assignment RL tasks, such as Memory Maze, BSuite, and POPGym. At the same time, it upholds comparable performance in classic RL tasks, such as Atari and DMC, suggesting the generality of our method. We also show that R2I is faster than the state-of-the-art MBRL method, DreamerV3, resulting in faster wall-time convergence.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=1vDArHJ68h",
    "arxiv_id": "2403.04253",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19564,
    "title": "Directly Fine-Tuning Diffusion Models on Differentiable Rewards",
    "authors": [
      "Kevin Clark",
      "Paul Vicol",
      "Kevin Swersky",
      "David J. Fleet"
    ],
    "abstract": "We present Direct Reward Fine-Tuning (DRaFT), a simple and effective method for fine-tuning diffusion models to maximize differentiable reward functions, such as scores from human preference models. We first show that it is possible to backpropagate the reward gradient through the full sampling procedure, and that doing so achieves strong performance on a variety of reward functions, outperforming reinforcement learning-based approaches. We then propose more efficient variants of DRaFT: DRaFT-K, which truncates backpropagation to only the last K steps of sampling, and DRaFT-LV, which obtains lower-variance gradient estimates for the case when K=1. We show that our methods work well for a variety of reward functions and can be used to substantially improve the aesthetic quality of images generated by Stable Diffusion 1.4. Finally, we draw connections between our approach and prior work, providing a unifying perspective on the design space of gradient-based fine-tuning algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1vmSEVL19f",
    "arxiv_id": "2309.17400",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19563,
    "title": "MUFFIN: Curating Multi-Faceted Instructions for Improving Instruction Following",
    "authors": [
      "Renze Lou",
      "Kai Zhang",
      "Jian Xie",
      "Yuxuan Sun",
      "Janice Ahn",
      "Hanzi Xu",
      "Yu Su",
      "Wenpeng Yin"
    ],
    "abstract": "In the realm of large language models (LLMs), enhancing instruction-following capability often involves curating expansive training data. This is achieved through two primary schemes: i) Scaling-Inputs: Amplifying (input, output) pairs per task instruction, aiming for better instruction adherence. ii) Scaling Input-Free Tasks: Enlarging tasks, each composed of an (instruction, output) pair (without requiring a separate input anymore). However, LLMs under Scaling-Inputs tend to be overly sensitive to inputs, leading to misinterpretation or non-compliance with instructions. Conversely, Scaling Input-Free Tasks demands a substantial number of tasks but is less effective in instruction following when dealing with instances in Scaling-Inputs. This work introduces MUFFIN, a new scheme of instruction-following dataset curation. Specifically, we automatically Scale Tasks per Input by diversifying these tasks with various input facets. Experimental results across four zero-shot benchmarks, spanning both Scaling-Inputs and Scaling Input-Free Tasks schemes, reveal that LLMs, at various scales, trained on MUFFIN generally demonstrate superior instruction-following capabilities compared to those trained on the two aforementioned schemes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=1vrS1zwekw",
    "arxiv_id": "2312.02436",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18019,
    "title": "Jointly-Learned Exit and Inference for a Dynamic Neural Network",
    "authors": [
      "florence regol",
      "Joud Chataoui",
      "Mark Coates"
    ],
    "abstract": "Large pretrained models, coupled with fine-tuning, are slowly becoming established as the dominant architecture in machine learning. Even though these models offer impressive performance, their practical application is often limited by the prohibitive amount of resources required for $\\textit{every}$ inference. Early-exiting dynamic neural networks (EDNN) circumvent this issue by allowing a model to make some of its predictions from intermediate layers (i.e., early-exit). Training an EDNN architecture is challenging as it consists of two intertwined components: the gating mechanism (GM) that controls early-exiting decisions and the intermediate inference modules (IMs) that perform inference from intermediate representations. As a result, most existing approaches rely on thresholding confidence metrics for the gating mechanism and strive to improve the underlying backbone network and the inference modules. Although successful, this approach has two fundamental shortcomings: 1) the GMs and the IMs are decoupled during training, leading to a train-test mismatch; and 2) the thresholding gating mechanism introduces a positive bias into the predictive probabilities, making it difficult to readily extract uncertainty information. We propose a novel architecture that connects these two modules. This leads to significant performance improvements on classification datasets and enables better uncertainty characterization capabilities.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jX2DT7qDam",
    "arxiv_id": "2310.09163",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19561,
    "title": "PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt Optimization",
    "authors": [
      "Xinyuan Wang",
      "Chenxi Li",
      "Zhen Wang",
      "Fan Bai",
      "Haotian Luo",
      "Jiayou Zhang",
      "Nebojsa Jojic",
      "Eric Xing",
      "Zhiting Hu"
    ],
    "abstract": "Expert-level prompts, carefully engineered by human experts who have a deep understanding of both large language models (LLMs) and domain knowledge, are the future of prompting and pivotal to harnessing the full power of advanced LLMs. Discovering such prompts with an automated process remains a sought-after and unresolved challenge. Existing prompt optimization techniques, though automated through iterative sampling, often fall short in injecting domain knowledge and exploring the vast prompt space for complex expert-level prompts efficiently. To address this pressing need and achieve expert-level prompting, we introduce PromptAgent, which autonomously discovers prompts equivalent in quality to those handcrafted by experts. At its core, PromptAgent views prompt optimization as a strategic planning problem and employs a principled planning algorithm (rooted in Monte Carlo Tree Search) to strategically explore the vast expert-level prompt space. PromptAgent interacts with the LLM in a human-like trial-and-error manner during the planning, and injects expert-level knowledge by reflecting on model errors and generating insightful error feedback. This novel formulation allows it to iteratively evaluate intermediate prompts, refine them based on errors, simulate future rewards, and search for high-reward paths leading to expert-level prompts. We apply PromptAgent to 12 tasks spanning three practical domains: BIG-Bench Hard (BBH), domain-expert, and general NLU tasks, showing PromptAgent consistently outperforms strong prompting and prompt optimization baselines by great margins. Our qualitative analysis further emphasizes PromptAgent's capability to distill insightful errors into expert-level prompts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=22pyNMuIoa",
    "arxiv_id": "2310.16427",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19560,
    "title": "RETSim: Resilient and Efficient Text Similarity",
    "authors": [
      "Marina Zhang",
      "Owen Skipper Vallis",
      "Aysegul Bumin",
      "Tanay Vakharia",
      "Elie Bursztein"
    ],
    "abstract": "This paper introduces RETSim (Resilient and Efficient Text Similarity), a lightweight, multilingual deep learning model trained to produce robust metric embeddings for near-duplicate text retrieval, clustering, and dataset deduplication tasks. We demonstrate that RETSim is significantly more robust and accurate than MinHash and neural text embeddings, achieving new state-of-the-art performance on dataset deduplication, adversarial text retrieval benchmarks, and spam clustering tasks. Additionally, we introduce the \\wa benchmark (Wiki-40B 4dversarial Near-T3xt Dataset), enabling the evaluation of models on typo-laden near-duplicate text retrieval in a multilingual setting. \\rs and the \\wa are open-sourced under the Apache 2 license at https://github.com/[anonymized].",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=23b9KSNQTX",
    "arxiv_id": "2311.17264",
    "GitHub": [
      "https://github.com/google/unisim"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19558,
    "title": "Ground-A-Video: Zero-shot Grounded Video Editing using Text-to-image Diffusion Models",
    "authors": [
      "Hyeonho Jeong",
      "Jong Chul Ye"
    ],
    "abstract": "This paper introduces a novel grounding-guided video-to-video translation framework called Ground-A-Video for multi-attribute video editing.Recent endeavors in video editing have showcased promising results in single-attribute editing or style transfer tasks, either by training T2V models on text-video data or adopting training-free methods.However, when confronted with the complexities of multi-attribute editing scenarios, they exhibit shortcomings such as omitting or overlooking intended attribute changes, modifying the wrong elements of the input video, and failing to preserve regions of the input video that should remain intact.Ground-A-Video attains temporally consistent multi-attribute editing of input videos in a training-free manner without aforementioned shortcomings.Central to our method is the introduction of cross-frame gated attention which incorporates groundings information into the latent representations in a temporally consistent fashion, along with Modulated Cross-Attention and optical flow guided inverted latents smoothing.Extensive experiments and applications demonstrate that Ground-A-Video's zero-shot capacity outperforms other baseline methods in terms of edit-accuracy and frame consistency.Further results and code are available at our project page ( http://ground-a-video.github.io )",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=28L2FCtMWq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19557,
    "title": "Neural Spectral Methods: Self-supervised learning in the spectral domain",
    "authors": [
      "Yiheng Du",
      "Nithin Chalapathi",
      "Aditi S. Krishnapriyan"
    ],
    "abstract": "We present Neural Spectral Methods, a technique to solve parametric Partial Differential Equations (PDEs), grounded in classical spectral methods. Our method uses orthogonal bases to learn PDE solutions as mappings between spectral coefficients. In contrast to current machine learning approaches which enforce PDE constraints by minimizing the numerical quadrature of the residuals in the spatiotemporal domain, we leverage Parseval's identity and introduce a new training strategy through a spectral loss. Our spectral loss enables more efficient differentiation through the neural network, and substantially reduces training complexity. At inference time, the computational cost of our method remains constant, regardless of the spatiotemporal resolution of the domain.  Our experimental results demonstrate that our method significantly outperforms previous machine learning approaches in terms of speed and accuracy by one to two orders of magnitude on multiple different problems, including reaction-diffusion, and forced and unforced Navier-Stokes equations. When compared to numerical solvers of the same accuracy, our method demonstrates a $10\\times$ increase in performance speed.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2DbVeuoa6a",
    "arxiv_id": "2312.05225",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19556,
    "title": "What does the Knowledge Neuron Thesis Have to do with Knowledge?",
    "authors": [
      "Jingcheng Niu",
      "Andrew Liu",
      "Zining Zhu",
      "Gerald Penn"
    ],
    "abstract": "We reassess the Knowledge Neuron (KN) Thesis: an interpretation of the mechanism underlying the ability of large language models to recall facts from a training corpus. This nascent thesis proposes that facts are recalled from the training corpus through the MLP weights in a manner resembling key-value memory, implying in effect that \"knowledge\" is stored in the network. Furthermore, by modifying the MLP modules, one can control the language model's generation of factual information. The plausibility of the KN thesis has been demonstrated by the success of KN-inspired model editing methods (Dai et al., 2022; Meng et al., 2022).We find that this thesis is, at best, an oversimplification. Not only have we found that we can edit the expression of certain linguistic phenomena using the same model editing methods but, through a more comprehensive evaluation, we have found that the KN thesis does not adequately explain the process of factual expression. While it is possible to argue that the MLP weights store complex patterns that are interpretable both syntactically and semantically, these patterns do not constitute \"knowledge.\" To gain a more comprehensive understanding of the knowledge representation process, we must look beyond the MLP weights and explore recent models' complex layer structures  and attention mechanisms.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=2HJRwwbV3G",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19242,
    "title": "OMNI: Open-endedness via Models of human Notions of Interestingness",
    "authors": [
      "Jenny Zhang",
      "Joel Lehman",
      "Kenneth Stanley",
      "Jeff Clune"
    ],
    "abstract": "Open-ended algorithms aim to learn new, interesting behaviors forever. That requires a vast environment search space, but there are thus infinitely many possible tasks. Even after filtering for tasks the current agent can learn (i.e., learning progress), countless learnable yet uninteresting tasks remain (e.g., minor variations of previously learned tasks). An Achilles Heel of open-endedness research is the inability to quantify (and thus prioritize) tasks that are not just learnable, but also $\\textit{interesting}$ (e.g., worthwhile and novel). We propose solving this problem by $\\textit{Open-endedness via Models of human Notions of Interestingness}$ (OMNI). The insight is that we can utilize large (language) models (LMs) as a model of interestingness (MoI), because they $\\textit{already}$ internalize human concepts of interestingness from training on vast amounts of human-generated data, where humans naturally write about what they find interesting or boring. We show that LM-based MoIs improve open-ended learning by focusing on tasks that are both learnable $\\textit{and interesting}$, outperforming baselines based on uniform task sampling or learning progress alone. This approach has the potential to dramatically advance the ability to intelligently select which tasks to focus on next (i.e., auto-curricula), and could be seen as AI selecting its own next task to learn, facilitating self-improving AI and AI-Generating Algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AgM3MzT99c",
    "arxiv_id": "2306.01711",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19718,
    "title": "Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs",
    "authors": [
      "Suyu Ge",
      "Yunan Zhang",
      "Liyuan Liu",
      "Minjia Zhang",
      "Jiawei Han",
      "Jianfeng Gao"
    ],
    "abstract": "In this study, we introduce adaptive KV cache compression, a plug-and-play method that reduces the memory footprint of generative inference for Large Language Models (LLMs). Different from the conventional KV cache that retains key and value vectors for all context tokens, we conduct targeted profiling to discern the intrinsic structure of attention modules. Based on the recognized structure, we then construct the KV cache in an adaptive manner: evicting long-range contexts on attention heads emphasizing local contexts, discarding non-special tokens on attention heads centered on special tokens, and only employing the standard KV cache for attention heads that broadly attend to all tokens. Moreover, with the lightweight attention profiling used to guide the construction of the adaptive KV cache, FastGen can be deployed without resource-intensive fine-tuning or re-training. In our experiments across various asks, FastGen demonstrates substantial reduction on GPU memory consumption with negligible generation quality loss. We will release our code and the compatible CUDA kernel for reproducibility.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=uNrFpDPMyo",
    "arxiv_id": "2310.01801",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19555,
    "title": "Lipsum-FT: Robust Fine-Tuning of Zero-Shot Models Using Random Text Guidance",
    "authors": [
      "Giung Nam",
      "Byeongho Heo",
      "Juho Lee"
    ],
    "abstract": "Large-scale contrastive vision-language pre-trained models provide the zero-shot model achieving competitive performance across a range of image classification tasks without requiring training on downstream data. Recent works have confirmed that while additional fine-tuning of the zero-shot model on the reference data results in enhanced downstream performance, it compromises the model's robustness against distribution shifts. Our investigation begins by examining the conditions required to achieve the goals of robust fine-tuning, employing descriptions based on feature distortion theory and joint energy-based models. Subsequently, we propose a novel robust fine-tuning algorithm, Lipsum-FT, that effectively utilizes the language modeling aspect of the vision-language pre-trained models. Extensive experiments conducted on distribution shift scenarios in DomainNet and ImageNet confirm the superiority of our proposed Lipsum-FT approach over existing robust fine-tuning methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2JF8mJRJ7M",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19758,
    "title": "DreamGaussian: Generative Gaussian Splatting for Efficient 3D Content Creation",
    "authors": [
      "Jiaxiang Tang",
      "Jiawei Ren",
      "Hang Zhou",
      "Ziwei Liu",
      "Gang Zeng"
    ],
    "abstract": "Recent advances in 3D content creation mostly leverage optimization-based 3D generation via score distillation sampling (SDS).Though promising results have been exhibited, these methods often suffer from slow per-sample optimization, limiting their practical usage. In this paper, we propose DreamGaussian, a novel 3D content generation framework that achieves both efficiency and quality simultaneously. Our key insight is to design a generative 3D Gaussian Splatting model with companioned mesh extraction and texture refinement in UV space.In contrast to the occupancy pruning used in Neural Radiance Fields, we demonstrate that the progressive densification of 3D Gaussians converges significantly faster for 3D generative tasks.To further enhance the texture quality and facilitate downstream applications, we introduce an efficient algorithm to convert 3D Gaussians into textured meshes and apply a fine-tuning stage to refine the details.Extensive experiments demonstrate the superior efficiency and competitive generation quality of our proposed approach.Notably, DreamGaussian produces high-quality textured meshes in just 2 minutes from a single-view image, achieving approximately 10 times acceleration compared to existing methods.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=UyNXMqnN3c",
    "arxiv_id": "2309.16653",
    "GitHub": [
      "https://github.com/dreamgaussian/dreamgaussian"
    ],
    "Space": [
      "jiawei011/dreamgaussian"
    ],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19554,
    "title": "Pooling Image Datasets with Multiple Covariate Shift and Imbalance",
    "authors": [
      "Sotirios Panagiotis Chytas",
      "Vishnu Suresh Lokhande",
      "Vikas Singh"
    ],
    "abstract": "Small sample sizes are common in many disciplines, which necessitates pooling roughly similar datasets across multiple sites/institutions to study weak but relevant associations between images and disease incidence. Such data often manifest shifts and imbalances in covariates (secondary non-imaging data). These issues are well-studied for classical models, but the ideas simply do not apply to overparameterized DNN models. Consequently, recent work has shown how strategies from fairness and invariant representation learning provides a meaningful starting point, but the current repertoire of methods remains limited to accounting for shifts/imbalances in just a couple of covariates at a time. In this paper, we show how viewing this problem from the perspective of Category theory provides a simple and effective solution that completely avoids elaborate multi-stage training pipelines that would otherwise be needed. We show the effectiveness of this approach via extensive experiments on real datasets. Further, we discuss how our style of formulation offers a unified perspective on at least 5+ distinct problem settings in vision, from self-supervised learningto matching problems in 3D reconstruction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2Mo7v69otj",
    "arxiv_id": "2403.02598",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19553,
    "title": "Neural Neighborhood Search for Multi-agent Path Finding",
    "authors": [
      "Zhongxia Yan",
      "Cathy Wu"
    ],
    "abstract": "Multi-agent path finding (MAPF) is the combinatorial problem of planning optimal collision-avoiding paths for multiple agents, with application to robotics, logistics, and transportation. Though many recent learning-based works have focused on large-scale combinatorial problems by guiding their decomposition into sequences of smaller subproblems, the combined spatiotemporal and time-restricted nature of MAPF poses a particular challenge for learning-based guidance of iterative approaches like large neighborhood search (LNS), which is already a state-of-the-art approach for MAPF even without learning. We address this challenge of neural-guided LNS for MAPF by designing an architecture which interleaves convolution and attention to efficiently represent MAPF subproblems, enabling practical guidance of LNS in benchmark settings. We demonstrate the speedup of our method over existing state-of-the-art LNS-based methods for MAPF as well as the robustness of our method to unseen settings. Our proposed method expands the horizon of effective deep learning-guided LNS methods into multi-path planning problems, and our proposed representation may be more broadly applicable for representing path-wise interactions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2NpAw2QJBY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18592,
    "title": "Self-Consuming Generative Models Go MAD",
    "authors": [
      "Sina Alemohammad",
      "Josue Casco-Rodriguez",
      "Lorenzo Luzi",
      "Ahmed Imtiaz Humayun",
      "Hossein Babaei",
      "Daniel LeJeune",
      "Ali Siahkoohi",
      "Richard Baraniuk"
    ],
    "abstract": "Seismic advances in generative AI algorithms for imagery, text, and other data types have led to the temptation to use AI-synthesized data to train next-generation models. Repeating this process creates an autophagous (\"self-consuming\") loop  whose properties are poorly understood. We conduct a thorough analytical and empirical analysis using state-of-the-art generative image models of three families of autophagous loops that differ in how fixed or fresh real training data is available through the generations of training and whether the samples from previous-generation models have been biased to trade off data quality versus diversity.  Our primary conclusion across all scenarios is that *without enough fresh real data in each generation of an autophagous loop, future generative models are doomed to have their quality (precision) or diversity (recall) progressively decrease.* We term this condition Model Autophagy Disorder (MAD), by analogy to mad cow disease, and show that appreciable MADness arises in just a few generations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ShjMHfmPs0",
    "arxiv_id": "2307.01850",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18591,
    "title": "R-EDL: Relaxing Nonessential Settings of Evidential Deep Learning",
    "authors": [
      "Mengyuan Chen",
      "Junyu Gao",
      "Changsheng Xu"
    ],
    "abstract": "A newly-arising uncertainty estimation method named Evidential Deep Learning (EDL), which can obtain reliable predictive uncertainty in a single forward pass, has garnered increasing interest. Guided by the subjective logic theory, EDL obtains Dirichlet concentration parameters from deep neural networks, thus constructing a Dirichlet probability density function (PDF) to model the distribution of class probabilities. Despite its great success, we argue that EDL keeps nonessential settings in both stages of model construction and optimization.In this work, our analysis indicates that (1) in the construction of the Dirichlet PDF, a commonly ignored parameter termed prior weight governs the balance between leveraging the proportion of evidence and its magnitude in deriving predictive scores, and (2) in model optimization, a variance-minimized regularization term adopted by traditional EDL encourages the Dirichlet PDF to approach a Dirac delta function, potentially exacerbating overconfidence. Therefore, we propose the R-EDL (Relaxed-EDL) method by relaxing these nonessential settings. Specifically, R-EDL treats the prior weight as an adjustable hyper-parameter instead of a fixed scalar, and directly optimizes the expectation of the Dirichlet PDF provided to deprecate the variance-minimized regularization term. Extensive experiments and SOTA performances demonstrate the effectiveness of our method. Source codes are provided in Appendix E.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Si3YFA641c",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19552,
    "title": "PerceptionCLIP: Visual Classification by Inferring and Conditioning on Contexts",
    "authors": [
      "Bang An",
      "Sicheng Zhu",
      "Michael-Andrei Panaitescu-Liess",
      "Chaithanya Kumar Mummadi",
      "Furong Huang"
    ],
    "abstract": "Vision-language models like CLIP are widely used in zero-shot image classification due to their ability to understand various visual concepts and natural language descriptions. However, how to fully leverage CLIP's unprecedented human-like understanding capabilities to achieve better performance is still an open question. This paper draws inspiration from the human visual perception process: when classifying an object, humans first infer contextual attributes (e.g., background and orientation) which help separate the foreground object from the background, and then classify the object based on this information. Inspired by it, we observe that providing CLIP with contextual attributes improves zero-shot image classification and mitigates reliance on spurious features. We also observe that CLIP itself can reasonably infer the attributes from an image. With these observations, we propose a training-free, two-step zero-shot classification method PerceptionCLIP. Given an image, it first infers contextual attributes (e.g., background) and then performs object classification conditioning on them. Our experiments show that PerceptionCLIP achieves better generalization, group robustness, and interpretability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2Oiee202rd",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19551,
    "title": "GOAt: Explaining Graph Neural Networks via Graph Output Attribution",
    "authors": [
      "Shengyao Lu",
      "Keith G Mills",
      "Jiao He",
      "Bang Liu",
      "Di Niu"
    ],
    "abstract": "Understanding the decision-making process of Graph Neural Networks (GNNs) is crucial to their interpretability. Most existing methods for explaining GNNs typically rely on training auxiliary models, resulting in the explanations remain black-boxed. This paper introduces Graph Output Attribution (GOAt), a novel method to attribute graph outputs to input graph features, creating GNN explanations that are faithful, discriminative, as well as stable across similar samples. By expanding the GNN as a sum of scalar products involving node features, edge features and activation patterns, we propose an efficient analytical method to compute contribution of each node or edge feature to each scalar product and aggregate the contributions from all scalar products in the expansion form to derive the importance of each node and edge. Through extensive experiments on synthetic and real-world data, we show that our method not only outperforms various state-of-the-art GNN explainers in terms of the commonly used fidelity metric, but also exhibits stronger discriminability, and stability by a remarkable margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2Q8TZWAHv4",
    "arxiv_id": "2401.14578",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19550,
    "title": "Time Travel in LLMs: Tracing Data Contamination in Large Language Models",
    "authors": [
      "Shahriar Golchin",
      "Mihai Surdeanu"
    ],
    "abstract": "Data contamination, i.e., the presence of test data from downstream tasks in the training data of large language models (LLMs), is a potential major issue in measuring LLMs' real effectiveness on other tasks. We propose a straightforward yet effective method for identifying data contamination within LLMs. At its core, our approach starts by identifying potential contamination at the instance level; using this information, our approach then assesses wider contamination at the partition level. To estimate contamination of individual instances, we employ \"guided instruction:\" a prompt consisting of the dataset name, partition type, and the random-length initial segment of a reference instance, asking the LLM to complete it. An instance is flagged as contaminated if the LLM's output either exactly or nearly matches the latter segment of the reference. To understand if an entire partition is contaminated, we propose two ideas. The first idea marks a dataset partition as contaminated if the average overlap score with the reference instances (as measured by ROUGE-L or BLEURT) is statistically significantly better with the completions from guided instruction compared to a \"general instruction\" that does not include the dataset and partition name. The second idea marks a dataset partition as contaminated if a classifier based on GPT-4 with few-shot in-context learning prompt marks multiple generated completions as exact/near-exact matches of the corresponding reference instances. Our best method achieves an accuracy between 92% and 100% in detecting if an LLM is contaminated with seven datasets, containing train and test/validation partitions, when contrasted with manual evaluation by human experts. Further, our findings indicate that GPT-4 is contaminated with AG News, WNLI, and XSum datasets.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=2Rwq6c3tvr",
    "arxiv_id": "2308.08493",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19549,
    "title": "Towards Offline Opponent Modeling with In-context Learning",
    "authors": [
      "Yuheng Jing",
      "Kai Li",
      "Bingyun Liu",
      "Yifan Zang",
      "Haobo Fu",
      "QIANG FU",
      "Junliang Xing",
      "Jian Cheng"
    ],
    "abstract": "Opponent modeling aims at learning the opponent's behaviors, goals, or beliefs to reduce the uncertainty of the competitive environment and assist decision-making. Existing work has mostly focused on learning opponent models online, which is impractical and inefficient in practical scenarios. To this end, we formalize an Offline Opponent Modeling (OOM) problem with the objective of utilizing pre-collected offline datasets to learn opponent models that characterize the opponent from the viewpoint of the controlled agent, which aids in adapting to the unknown fixed policies of the opponent. Drawing on the promises of the Transformers for decision-making, we introduce a general approach, Transformer Against Opponent (TAO), for OOM. Essentially, TAO tackles the problem by harnessing the full potential of the supervised pre-trained Transformers' in-context learning capabilities. The foundation of TAO lies in three stages: an innovative offline policy embedding learning stage, an offline opponent-aware response policy training stage, and a deployment stage for opponent adaptation with in-context learning. Theoretical analysis establishes TAO's equivalence to Bayesian posterior sampling in opponent modeling and guarantees TAO's convergence in opponent policy recognition. Extensive experiments and ablation studies on competitive environments with sparse and dense rewards demonstrate the impressive performance of TAO. Our approach manifests remarkable prowess for fast adaptation, especially in the face of unseen opponent policies, confirming its in-context learning potency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2SwHngthig",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19548,
    "title": "Unbalancedness in Neural Monge Maps Improves Unpaired Domain Translation",
    "authors": [
      "Luca Eyring",
      "Dominik Klein",
      "Th\u00e9o Uscidda",
      "Giovanni Palla",
      "Niki Kilbertus",
      "Zeynep Akata",
      "Fabian J Theis"
    ],
    "abstract": "In optimal transport (OT), a Monge map is known as a mapping that transports a source distribution to a target distribution in the most cost-efficient way. Recently, multiple neural estimators for Monge maps have been developed and applied in diverse unpaired domain translation tasks, e.g. in single-cell biology and computer vision. However, the classic OT framework enforces mass conservation, whichmakes it prone to outliers and limits its applicability in real-world scenarios. The latter can be particularly harmful in OT domain translation tasks, where the relative position of a sample within a distribution is explicitly taken into account. While unbalanced OT tackles this challenge in the discrete setting, its integration into neural Monge map estimators has received limited attention. We propose a theoreticallygrounded method to incorporate unbalancedness into any Monge map estimator. We improve existing estimators to model cell trajectories over time and to predict cellular responses to perturbations. Moreover, our approach seamlessly integrates with the OT flow matching (OT-FM) framework. While we show that OT-FM performs competitively in image translation, we further improve performance byincorporating unbalancedness (UOT-FM), which better preserves relevant features. We hence establish UOT-FM as a principled method for unpaired image translation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2UnCj3jeao",
    "arxiv_id": "2311.15100",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19109,
    "title": "AgentVerse: Facilitating Multi-Agent Collaboration and Exploring Emergent Behaviors",
    "authors": [
      "Weize Chen",
      "Yusheng Su",
      "Jingwei Zuo",
      "Cheng Yang",
      "Chenfei Yuan",
      "Chi-Min Chan",
      "Heyang Yu",
      "Yaxi Lu",
      "Yi-Hsin Hung",
      "Chen Qian",
      "Yujia Qin",
      "Xin Cong",
      "Ruobing Xie",
      "Zhiyuan Liu",
      "Maosong Sun",
      "Jie Zhou"
    ],
    "abstract": "Autonomous agents empowered by Large Language Models (LLMs) have undergone significant improvements, enabling them to generalize across a broad spectrum of tasks. However, in real-world scenarios, cooperation among individuals is often required to enhance the efficiency and effectiveness of task accomplishment. Hence, inspired by human group dynamics, we propose a multi-agent framework AgentVerse that can effectively orchestrate a collaborative group of expert agents as a greater-than-the-sum-of-its-parts system. Our experiments demonstrate that AgentVerse can proficiently deploy multi-agent groups that outperform a single agent. Extensive experiments on text understanding, reasoning, coding, tool utilization, and embodied AI confirm the effectiveness of AgentVerse. Moreover, our analysis of agent interactions within AgentVerse reveals the emergence of specific collaborative behaviors, contributing to heightened group efficiency. We will release our codebase, AgentVerse, to further facilitate multi-agent research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EHg5GDnyq1",
    "arxiv_id": "2308.10848",
    "GitHub": [
      "https://github.com/OpenBMB/AgentVerse"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17919,
    "title": "Bounding Box Stability against Feature Dropout Reflects Detector Generalization across Environments",
    "authors": [
      "Yang Yang",
      "Wenhai Wang",
      "Zhe Chen",
      "Jifeng Dai",
      "Liang Zheng"
    ],
    "abstract": "Bounding boxes uniquely characterize object detection, where a good detector gives accurate bounding boxes of categories of interest. However, in the real-world where test ground truths are not provided, it is non-trivial to find out whether bounding boxes are accurate, thus preventing us from assessing the detector generalization ability. In this work, we find under feature map dropout, good detectors tend to output bounding boxes whose locations do not change much, while bounding boxes of poor detectors will undergo noticeable position changes. We compute the box stability score (BS score) to reflect this stability. Specifically, given an image, we compute a normal set of bounding boxes and a second set after feature map dropout. To obtain BS score, we use bipartite matching to find the corresponding boxes between the two sets and compute the average Intersection over Union (IoU) across the entire test set. We contribute to finding that BS score has a strong, positive correlation with detection accuracy measured by mean average precision (mAP) under various test environments. This relationship allows us to predict the accuracy of detectors on various real-world test sets without accessing test ground truths, verified on canonical detection tasks such as vehicle detection and pedestrian detection.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=lmM4Ecm4HJ",
    "arxiv_id": "2403.13803",
    "GitHub": [
      "https://github.com/YangYangGirl/BoS"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19547,
    "title": "On the Over-Memorization During Natural, Robust and Catastrophic Overfitting",
    "authors": [
      "Runqi Lin",
      "Chaojian Yu",
      "Bo Han",
      "Tongliang Liu"
    ],
    "abstract": "Overfitting negatively impacts the generalization ability of deep neural networks (DNNs) in both natural and adversarial training. Existing methods struggle to consistently address different types of overfitting, typically designing strategies that focus separately on either natural or adversarial patterns. In this work, we adopt a unified perspective by solely focusing on natural patterns to explore different types of overfitting. Specifically, we examine the memorization effect in DNNs and reveal a shared behaviour termed over-memorization, which impairs their generalization capacity. This behaviour manifests as DNNs suddenly becoming high-confidence in predicting certain training patterns and retaining a persistent memory for them. Furthermore, when DNNs over-memorize an adversarial pattern, they tend to simultaneously exhibit high-confidence prediction for the corresponding natural pattern. These findings motivate us to holistically mitigate different types of overfitting by hindering the DNNs from over-memorization natural patterns. To this end, we propose a general framework, Distraction Over-Memorization (DOM), which explicitly prevents over-memorization by either removing or augmenting the high-confidence natural patterns. Extensive experiments demonstrate the effectiveness of our proposed method in mitigating overfitting across various training paradigms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2V1Z0Jdmss",
    "arxiv_id": "2310.08847",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19545,
    "title": "Efficient and Scalable Graph Generation through Iterative Local Expansion",
    "authors": [
      "Andreas Bergmeister",
      "Karolis Martinkus",
      "Nathana\u00ebl Perraudin",
      "Roger Wattenhofer"
    ],
    "abstract": "In the realm of generative models for graphs, extensive research has been conducted. However, most existing methods struggle with large graphs due to the complexity of representing the entire joint distribution across all node pairs and capturing both global and local graph structures simultaneously.To overcome these issues, we introduce a method that generates a graph by progressively expanding a single node to a target graph. In each step, nodes and edges are added in a localized manner through denoising diffusion, building first the global structure, and then refining the local details. The local generation avoids modeling the entire joint distribution over all node pairs, achieving substantial computational savings with subquadratic runtime relative to node count while maintaining high expressivity through multiscale generation.Our experiments show that our model achieves state-of-the-art performance on well-established benchmark datasets while successfully scaling to graphs with at least 5000 nodes. Our method is also the first to successfully extrapolate to graphs outside of the training distribution, showcasing a much better generalization capability over existing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2XkTz7gdpc",
    "arxiv_id": "2312.11529",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19717,
    "title": "Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming",
    "authors": [
      "Yubo Zhuang",
      "Xiaohui Chen",
      "Yun Yang",
      "Richard Y. Zhang"
    ],
    "abstract": "$K$-means clustering is a widely used machine learning method for identifying patterns in large datasets.    Semidefinite programming (SDP) relaxations have recently been proposed for solving  the $K$-means optimization problem that enjoy strong statistical optimality guarantees, but the prohibitive cost of implementing an SDP solver renders these guarantees inaccessible to practical datasets.    By contrast, nonnegative matrix factorization (NMF) is a simple clustering algorithm that is widely used by machine learning practitioners, but without a solid statistical underpinning nor rigorous guarantees. In this paper, we describe an NMF-like algorithm that works by solving a \\emph{nonnegative} low-rank restriction of the SDP relaxed $K$-means formulation using a nonconvex Burer--Monteiro factorization approach. The resulting algorithm is just as simple and scalable as state-of-the-art NMF algorithms, while also enjoying the same strong statistical optimality guarantees as the SDP.     In our experiments, we observe that our algorithm achieves substantially smaller mis-clustering errors compared to the existing state-of-the-art.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=v7ZPwoHU1j",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19544,
    "title": "MEND: Meta Demonstration Distillation for Efficient and Effective In-Context Learning",
    "authors": [
      "Yichuan Li",
      "Xiyao Ma",
      "Sixing Lu",
      "Kyumin Lee",
      "Xiaohu Liu",
      "Chenlei Guo"
    ],
    "abstract": "Large Language models (LLMs) have demonstrated impressive in-context learning (ICL) capabilities, where a LLM makes predictions for a given test input together with a few input-output pairs (demonstrations).Nevertheless, the inclusion of demonstrations poses a challenge, leading to a quadratic increase in the computational overhead of the self-attention mechanism.Existing solutions attempt to condense lengthy demonstrations into compact vectors. However, they often require task-specific retraining or compromise LLM's in-context learning performance. To mitigate these challenges, we present Meta Demonstration Distillation (MEND), where a language model learns to distill any lengthy demonstrations into vectors without retraining for a new downstream task. We exploit the knowledge distillation to enhance alignment between MEND and MEND, achieving both efficiency and effectiveness concurrently. MEND is endowed with the meta-knowledge of distilling demonstrations through a two-stage training process, which includes meta-distillation pretraining and fine-tuning.Comprehensive evaluations across seven diverse ICL settings using decoder-only (GPT-2) and encoder-decoder (T5) attest to MEND's prowess.It not only matches but often outperforms the Vanilla ICL as well as other state-of-the-art distillation models, while significantly reducing the computational demands. This innovation promises enhanced scalability and efficiency for the practical deployment of large language models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2Y5kBPtU0o",
    "arxiv_id": "2403.06914",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19543,
    "title": "Beyond Reverse KL: Generalizing Direct Preference Optimization with Diverse Divergence Constraints",
    "authors": [
      "Chaoqi Wang",
      "Yibo Jiang",
      "Chenghao Yang",
      "Han Liu",
      "Yuxin Chen"
    ],
    "abstract": "The increasing capabilities of large language models (LLMs) raise opportunities for artificial general intelligence but concurrently amplify safety concerns, such as potential misuse of AI systems, necessitating effective AI alignment. Reinforcement Learning from Human Feedback (RLHF) has emerged as a promising pathway towards AI alignment but brings forth challenges due to its complexity and dependence on a separate reward model. Direct Preference Optimization (DPO) has been proposed as an alternative; and it remains equivalent to RLHF under the reverse KL regularization constraint. This paper presents $f$-DPO, a generalized approach to DPO by incorporating diverse divergence constraints. We show that under certain $f$-divergences, including Jensen-Shannon divergence, forward KL divergences and $\\alpha$-divergences, the complex relationship between the reward and optimal policy can also be simplified by addressing the Karush\u2013Kuhn\u2013Tucker conditions. This eliminates the need for estimating the normalizing constant in the Bradley-Terry model and enables a tractable mapping between the reward function and the optimal policy. Our approach optimizes LLMs to align with human preferences in a more efficient and supervised manner under a broad set of divergence constraints. Empirically, adopting these divergences ensures a balance between alignment performance and generation diversity. Importantly, our $f$-DPO outperforms PPO-based methods in divergence efficiency, and divergence constraints directly influence expected calibration error (ECE).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=2cRzmWXK9N",
    "arxiv_id": "2309.16240",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19542,
    "title": "Function-space Parameterization of Neural Networks for Sequential Learning",
    "authors": [
      "Aidan Scannell",
      "Riccardo Mereu",
      "Paul Edmund Chang",
      "Ella Tamir",
      "Joni Pajarinen",
      "Arno Solin"
    ],
    "abstract": "Sequential learning paradigms pose challenges for gradient-based deep learning due to difficulties incorporating new data and retaining prior knowledge. While Gaussian processes elegantly tackle these problems, they struggle with scalability and handling rich inputs, such as images. To address these issues, we introduce a technique that converts neural networks from weight space to function space, through a dual parameterization. Our parameterization offers: (i) a way to scale function-space methods to large data sets via sparsification, (ii) retention of prior knowledge when access to past data is limited, and (iii) a mechanism to incorporate new data without retraining. Our experiments demonstrate that we can retain knowledge in continual learning and incorporate new data efficiently. We further show its strengths in uncertainty quantification and guiding exploration in model-based RL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2dhxxIKhqz",
    "arxiv_id": "2403.10929",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19794,
    "title": "Vision Transformers Need Registers",
    "authors": [
      "Timoth\u00e9e Darcet",
      "Maxime Oquab",
      "Julien Mairal",
      "Piotr Bojanowski"
    ],
    "abstract": "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 background areas of images, that are repurposed for internal computations. We propose a simple yet effective solution based on providing additional tokens to the input sequence of the Vision Transformer to fill that role. We show that this solution fixes that problem entirely for both supervised and self-supervised models, sets a new state of the art for self-supervised visual models on dense visual prediction tasks, enables object discovery methods with larger models, and most importantly leads to smoother feature maps and attention maps for downstream visual processing.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=2dnO3LLiJ1",
    "arxiv_id": "2309.16588",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19540,
    "title": "BroGNet: Momentum-Conserving Graph Neural Stochastic Differential Equation for Learning Brownian Dynamics",
    "authors": [
      "Suresh Bishnoi",
      "Jayadeva Jayadeva",
      "Sayan Ranu",
      "N M Anoop Krishnan"
    ],
    "abstract": "Neural networks (NNs) that exploit strong inductive biases based on physical laws and symmetries have shown remarkable success in learning the dynamics of physical systems directly from their trajectory. However, these works focus only on the systems that follow deterministic dynamics, such as Newtonian or Hamiltonian. Here, we propose a framework, namely Brownian graph neural networks (BroGNet), combining stochastic differential equations (SDEs) and GNNs to learn Brownian dynamics directly from the trajectory. We modify the architecture of BroGNet to enforce linear momentum conservation of the system, which, in turn, provides superior performance on learning dynamics as revealed empirically. We demonstrate this approach on several systems, namely, linear spring, linear spring with binary particle types, and non-linear spring systems, all following Brownian dynamics at finite temperatures. We show that BroGNet significantly outperforms proposed baselines across all the benchmarked Brownian systems. In addition, we demonstrate zero-shot generalizability of BroGNet to simulate unseen system sizes that are two orders of magnitude larger and to different temperatures than those used during training. Finally, we show that BroGNet conserves the momentum of the system resulting in superior performance and data efficiency. Altogether, our study contributes to advancing the understanding of the intricate dynamics of Brownian motion and demonstrates the effectiveness of graph neural networks in modeling such complex systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2iGiSHmeAN",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19539,
    "title": "Deep SE(3)-Equivariant Geometric Reasoning for Precise Placement Tasks",
    "authors": [
      "Ben Eisner",
      "Yi Yang",
      "Todor Davchev",
      "Mel Vecerik",
      "Jonathan Scholz",
      "David Held"
    ],
    "abstract": "Many robot manipulation tasks can be framed as geometric reasoning tasks, where an agent must be able to precisely manipulate an object into a position that satisfies the task from a set of initial conditions. Often, task success is defined based on the relationship between two objects - for instance, hanging a mug on a rack.  In such cases, the solution should be equivariant to the initial position of the objects as well as the agent, and invariant to the pose of the camera. This poses a challenge for learning systems which attempt to solve this task by learning directly from high-dimensional demonstrations: the agent must learn to be both equivariant as well as precise, which can be challenging without any inductive biases about the problem. In this work, we propose a method for precise relative pose prediction which is provably SE(3)-equivariant, can be learned from only a few demonstrations, and can generalize across variations in a class of objects. We accomplish this by factoring the problem into learning an SE(3) invariant task-specific representation of the scene and then interpreting this representation with novel geometric reasoning layers which are provably SE(3) equivariant. We demonstrate that our method can yield substantially more precise placement predictions in simulated placement tasks than previous methods trained with the same amount of data, and can accurately represent relative placement relationships data collected from real-world demonstrations. Supplementary information and videos can be found at https://sites.google.com/view/reldist-iclr-2023.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2inBuwTyL2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19538,
    "title": "Instant3D: Fast Text-to-3D with Sparse-view Generation and Large Reconstruction Model",
    "authors": [
      "Jiahao Li",
      "Hao Tan",
      "Kai Zhang",
      "Zexiang Xu",
      "Fujun Luan",
      "Yinghao Xu",
      "Yicong Hong",
      "Kalyan Sunkavalli",
      "Greg Shakhnarovich",
      "Sai Bi"
    ],
    "abstract": "Text-to-3D with diffusion models have achieved remarkable progress in recent years. However, existing methods either rely on score distillation-based optimization which suffer from slow inference, low diversity and Janus problems, or are feed-forward methods that generate low quality results due to the scarcity of 3D training data. In this paper, we propose Instant3D, a novel method that generates high-quality and diverse 3D assets from text prompts in a feed-forward manner. We adopt a two-stage paradigm, which first generates a sparse set of four structured and consistent views from text in one shot with a fine-tuned 2D text-to-image diffusion model, and then directly regresses the NeRF from the generated images with a novel transformer-based sparse-view reconstructor. Through extensive experiments, we demonstrate that our method can generate high-quality, diverse and Janus-free 3D assets within 20 seconds, which is two order of magnitude faster than previous optimization-based methods that can take 1 to 10 hours. Our project webpage: https://instant-3d.github.io/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2lDQLiH1W4",
    "arxiv_id": "2311.06214",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19536,
    "title": "Light-MILPopt: Solving Large-scale Mixed Integer Linear Programs with Lightweight Optimizer and Small-scale Training Dataset",
    "authors": [
      "Huigen Ye",
      "Hua Xu",
      "Hongyan Wang"
    ],
    "abstract": "Machine Learning (ML)-based optimization approaches emerge as a promising technique for solving large-scale Mixed Integer Linear Programs (MILPs). However, existing ML-based frameworks suffer from high model computation complexity, weak problem reduction, and reliance on large-scale optimizers and large training datasets, resulting in performance bottlenecks for large-scale MILPs. This paper proposes Light-MILPopt, a lightweight large-scale optimization framework that only uses a small-scale optimizer and small training dataset to solve large-scale MILPs. Specifically, Light-MILPopt can be divided into four stages: Problem Formulation for problem division to reduce model computational costs, Model-based Initial Solution Prediction for predicting and constructing the initial solution using a small-scale training dataset, Problem Reduction for both variable and constraint reduction, and Data-driven Optimization for current solution improvement employing a small-scale optimizer. Experimental evaluations on four large-scale benchmark MILPs and a real-world case study demonstrate that Light-MILPopt, leveraging a small-scale optimizer and small training dataset, outperforms the state-of-the-art ML-based optimization framework and advanced large-scale solvers (e.g. Gurobi, SCIP). The results and further analyses substantiate the ML-based framework's feasibility and effectiveness in solving large-scale MILPs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2oWRumm67L",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19534,
    "title": "Enabling Lanuguage Models to Implicitly Learn Self-Improvement",
    "authors": [
      "Ziqi Wang",
      "Le Hou",
      "Tianjian Lu",
      "Yuexin Wu",
      "Yunxuan Li",
      "Hongkun Yu",
      "Heng Ji"
    ],
    "abstract": "Large Language Models (LLMs) have demonstrated remarkable capabilities in open-ended text generation tasks. However, the inherent open-ended nature of these tasks implies that there is always room for improvement in the quality of model responses. To address this challenge, various approaches have been proposed to enhance the performance of LLMs. There has been a growing focus on enabling LLMs to self-improve their response quality, thereby reducing the reliance on extensive human annotation efforts for collecting diverse and high-quality training data. Recently, prompting-based methods have been widely explored among self-improvement methods owing to their effectiveness, efficiency, and convenience. However, those methods usually require explicitly and thoroughly written rubrics as inputs to LLMs. It is expensive and challenging to manually derive and provide all necessary rubrics with a real-world complex goal for improvement (e.g., being more helpfulness and less harmful). To this end, we propose an imPlicit self-ImprovemenT (PIT) framework that implicitly learns the improvement goal from human preference data. PIT only requires preference data that are used to train reward models with no extra human efforts. Specifically, we reformulate the training objective of reinforcement learning from human feedback (RLHF) -- instead of maximizing response quality for a given input, we maximize the quality gap of the response conditioned on a reference response. In this way, PIT is implicitly trained with the improvement goal of better aligning with human preferences. Experiments on two real-world datasets and one synthetic dataset show that our method significantly outperforms prompting-based methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2tVHNRZuCs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19290,
    "title": "Bootstrapping Variational Information Pursuit with Large Language and Vision Models for Interpretable Image Classification",
    "authors": [
      "Aditya Chattopadhyay",
      "Kwan Ho Ryan Chan",
      "Rene Vidal"
    ],
    "abstract": "Variational Information Pursuit (V-IP) is an interpretable-by-design framework that makes predictions by sequentially selecting a short chain of task-relevant, user-defined interpretable queries about the data that are most informative for the task. The selected query-answer chain serves as an explanation for the prediction. Applying the framework to any task requires (i) specification of a query set, and (ii) densely annotated data with query answers to train classifiers to answer queries at test time. This limits V-IP's application to small-scale tasks where manual data annotation is feasible. In this work, we focus on image classification tasks and propose to relieve this bottleneck by leveraging Foundation Models. Specifically, following recent work, we propose to use GPT, a Large Language Model, to propose semantic concepts as queries for a given classification task. To answer these queries, we propose a Concept Question-Answering network (Concept-QA) which learns to answer binary queries about semantic concepts in images. We design pseudo-labels to train our Concept-QA model using GPT and CLIP (a Vision-Language Model). Empirically, we find our Concept-QA model to be competitive with state-of-the-art VQA models in terms of answering accuracy but with an order of magnitude fewer parameters. This allows for seamless integration of Concept-QA into the V-IP framework as a fast-answering mechanism. We name this method Concept-QA+V-IP. Finally, we show on several datasets that Concept-QA+V-IP produces shorter query chains which are more interpretable and accurate than V-IP trained with a baseline CLIP-based answering mechanism.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9bmTbVaA2A",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19533,
    "title": "Separating common from salient patterns with Contrastive Representation Learning",
    "authors": [
      "Robin Louiset",
      "Edouard Duchesnay",
      "Antoine Grigis",
      "Pietro Gori"
    ],
    "abstract": "Contrastive Analysis is a sub-field of Representation Learning that aims at separating 1) salient factors of variation - that only exist in the target dataset (i.e., diseased subjects) in contrast with 2) common factors of variation between target and background (i.e., healthy subjects) datasets. Despite their relevance, current models based on Variational Auto-Encoders have shown poor performance in learning semantically-expressive representations. On the other hand, Contrastive Representation Learning has shown tremendous performance leaps in various applications (classification, clustering, etc.). In this work, we propose to leverage the ability of Contrastive Learning to learn semantically expressive representations when performing Contrastive Analysis. Namely, we reformulate Contrastive Analysis under the lens of the InfoMax Principle and identify two Mutual Information terms to maximize and one to minimize. We decompose the two first terms into an Alignment and a Uniformity term, as commonly done in Contrastive Learning. Then, we motivate a novel Mutual Information minimization strategy to prevent information leakage between common and salient distributions. We validate our method on datasets designed to assess the pattern separation capability in Contrastive Analysis, including MNIST superimposed on CIFAR10, CelebA accessories, dSprites item superimposed on a digit grid, and three medical datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=30N3bNAiw3",
    "arxiv_id": "2402.11928",
    "GitHub": [
      "https://github.com/neurospin-projects/2024_rlouiset_sep_clr"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19532,
    "title": "Matrix Manifold Neural Networks++",
    "authors": [
      "Xuan Son Nguyen",
      "Shuo Yang",
      "Aymeric Histace"
    ],
    "abstract": "Deep neural networks (DNNs) on Riemannian manifolds have garnered increasing interest in various applied areas. For instance, DNNs on spherical and hyperbolic manifolds have been designed to solve a wide range of computer vision and nature language processing tasks. One of the key factors that contribute to the success of these networks is that spherical and hyperbolic manifolds have the rich algebraic structures of gyrogroups and gyrovector spaces. This enables principled and effective generalizations of the most successful DNNs to these manifolds. Recently, some works have shown that many concepts in the theory of gyrogroups and gyrovector spaces can also be generalized to matrix manifolds such as Symmetric Positive Definite (SPD) and Grassmann manifolds. As a result, some building blocks for SPD and Grassmann neural networks, e.g., isometric models and multinomial logistic regression (MLR) can be derived in a way that is fully analogous to their spherical and hyperbolic counterparts. Building upon these works, in this paper, we design fully-connected (FC) and convolutional layers for SPD neural networks. We also develop MLR on Symmetric Positive Semi-definite (SPSD) manifolds, and propose a method for performing backpropagation with the Grassmann logarithmic map in the projector perspective. We demonstrate the effectiveness of the proposed approach in the human action recognition and node classification tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=30aSE3FB3L",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18671,
    "title": "Early Neuron Alignment in Two-layer ReLU Networks with Small Initialization",
    "authors": [
      "Hancheng Min",
      "Enrique Mallada",
      "Rene Vidal"
    ],
    "abstract": "This paper studies the problem of training a two-layer ReLU network for binary classification using gradient flow with small initialization. We consider a training dataset with well-separated input vectors: Any pair of input data with the same label are positively correlated, and any pair with different labels are negatively correlated. Our analysis shows that, during the early phase of training, neurons in the first layer try to align with either the positive data or the negative data, depending on its corresponding weight on the second layer. A careful analysis of the neurons' directional dynamics allows us to provide an $\\mathcal{O}(\\frac{\\log n}{\\sqrt{\\mu}})$ upper bound on the time it takes for all neurons to achieve good alignment with the input data, where $n$ is the number of data points and $\\mu$ measures how well the data are separated. After the early alignment phase, the loss converges to zero at a $\\mathcal{O}(\\frac{1}{t})$ rate, and the weight matrix on the first layer is approximately low-rank. Numerical experiments on the MNIST dataset illustrate our theoretical findings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QibPzdVrRu",
    "arxiv_id": "2307.12851",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19531,
    "title": "Repelling Random Walks",
    "authors": [
      "Isaac Reid",
      "Eli Berger",
      "Krzysztof Marcin Choromanski",
      "Adrian Weller"
    ],
    "abstract": "We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks. By inducing correlations between the trajectories of an interacting ensemble such that their marginal transition probabilities are unmodified, we are able  to explore the graph more efficiently, improving the concentration of statistical estimators whilst leaving them unbiased. The mechanism has a trivial drop-in implementation. We showcase the effectiveness of repelling random walks in a range of settings including estimation of graph kernels, the PageRank vector and graphlet concentrations. We provide detailed experimental evaluation and robust theoretical guarantees. To our knowledge, repelling random walks constitute the first rigorously studied quasi-Monte Carlo scheme correlating the directions of walkers on a graph, inviting new research in this exciting nascent domain.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=31IOmrnoP4",
    "arxiv_id": "2310.04854",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17763,
    "title": "Image Clustering via the Principle of Rate Reduction in the Age of Pretrained Models",
    "authors": [
      "Tianzhe Chu",
      "Shengbang Tong",
      "Tianjiao Ding",
      "Xili Dai",
      "Benjamin David Haeffele",
      "Rene Vidal",
      "Yi Ma"
    ],
    "abstract": "The advent of large pre-trained models has brought about a paradigm shift in both visual representation learning and natural language processing. However, clustering unlabeled images, as a fundamental and classic machine learning problem, still lacks an effective solution, particularly for large-scale datasets. In this paper, we propose a novel image clustering pipeline that leverages the powerful feature representation of large pre-trained models such as CLIP and cluster images effectively and efficiently at scale. We first developed a novel algorithm to estimate the number of clusters in a given dataset. We then show that the pre-trained features are significantly more structured by further optimizing the rate reduction objective. The resulting features may significantly improve the clustering accuracy, e.g., from 57\\% to  66\\% on ImageNet-1k. Furthermore, by leveraging CLIP's multimodality bridge between image and text, we develop a simple yet effective self-labeling algorithm that produces meaningful text labels for the clusters. Through extensive experiments, we show that our pipeline works well on standard datasets such as CIFAR-10, CIFAR-100, and ImageNet-1k. It also extends to datasets without predefined labels, such as LAION-Aesthetics and WikiArts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ptCIlV24YZ",
    "arxiv_id": "2306.05272",
    "GitHub": [
      "https://github.com/LeslieTrue/CPP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19530,
    "title": "DDMI: Domain-agnostic Latent Diffusion Models for Synthesizing High-Quality Implicit Neural Representations",
    "authors": [
      "Dogyun Park",
      "Sihyeon Kim",
      "Sojin Lee",
      "Hyunwoo J. Kim"
    ],
    "abstract": "Recent studies have introduced a new class of generative models for synthesizing implicit neural representations (INRs) that capture arbitrary continuous signals in various domains.These models opened the door for domain-agnostic generative models, but they often fail to achieve high-quality generation.We observed that the existing methods generate the weights of neural networks to parameterize INRs and evaluate the network with fixed positional embeddings (PEs).Arguably, this architecture limits the expressive power of generative models and results in low-quality INR generation.To address this limitation, we propose Domain-agnostic Latent Diffusion Model for INRs (DDMI) that generates adaptive positional embeddings instead of neural networks' weights.Specifically, we develop a Discrete-to-continuous space Variational AutoEncoder (D2C-VAE), which seamlessly connects discrete data and the continuous signal functions in the shared latent space. Additionally, we introduce a novel conditioning mechanism for evaluating INRs with the generated hierarchically decomposed basis fields to further enhance expressive power.Extensive experiments across four modalities, \\eg, 2D images, 3D shapes, Neural Radiance Fields, and videos, with seven benchmark datasets, demonstrate the versatility of DDMI and its superior performance compared to the existing INR generative models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=327tbF3S65",
    "arxiv_id": "2401.12517",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19529,
    "title": "Conformal Risk Control",
    "authors": [
      "Anastasios Nikolas Angelopoulos",
      "Stephen Bates",
      "Adam Fisch",
      "Lihua Lei",
      "Tal Schuster"
    ],
    "abstract": "We extend conformal prediction to control the expected value of any monotone loss function. The algorithm generalizes split conformal prediction together with its coverage guarantee. Like conformal prediction, the conformal risk control procedure is tight up to an $\\mathcal{O}(1/n)$ factor. We also introduce extensions of the idea to distribution shift, quantile risk control, multiple and adversarial risk control, and expectations of U-statistics. Worked examples from computer vision and natural language processing demonstrate the usage of our algorithm to bound the false negative rate, graph distance, and token-level F1-score.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=33XGfHLtZg",
    "arxiv_id": "2208.02814",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19528,
    "title": "Polynomial Width is Sufficient for Set Representation with High-dimensional Features",
    "authors": [
      "Peihao Wang",
      "Shenghao Yang",
      "Shu Li",
      "Zhangyang Wang",
      "Pan Li"
    ],
    "abstract": "Set representation has become ubiquitous in deep learning for modeling the inductive bias of neural networks that are insensitive to the input order. DeepSets is the most widely used neural network architecture for set representation. It involves embedding each set element into a latent space with dimension $L$, followed by a sum pooling to obtain a whole-set embedding, and finally mapping the whole-set embedding to the output. In this work, we investigate the impact of the dimension $L$ on the expressive power of DeepSets. Previous analyses either oversimplified high-dimensional features to be one-dimensional features or were limited to analytic activations, thereby diverging from practical use or resulting in $L$ that grows exponentially with the set size $N$ and feature dimension $D$. To investigate the minimal value of $L$ that achieves sufficient expressive power, we present two set-element embedding layers: (a) linear + power activation (LP) and (b) linear + exponential activations (LE). We demonstrate that $L$ being $\\operatorname{poly}(N, D)$ is sufficient for set representation using both embedding layers. We also provide a lower bound of $L$ for the LP embedding layer. Furthermore, we extend our results to permutation-equivariant set functions and the complex field.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=34STseLBrQ",
    "arxiv_id": "2307.04001",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19527,
    "title": "Beating Price of Anarchy and Gradient Descent without Regret in Potential Games",
    "authors": [
      "Iosif Sakos",
      "Stefanos Leonardos",
      "Stelios Andrew Stavroulakis",
      "William Overman",
      "Ioannis Panageas",
      "Georgios Piliouras"
    ],
    "abstract": "Arguably one of the thorniest problems in game theory is that of equilibrium selection. Specifically, in the presence of multiple equilibria do self-interested learning dynamics typically select the socially optimal ones? We study a rich class of continuous-time no-regret dynamics in potential games (PGs). Our class of dynamics, *Q-Replicator Dynamics* (QRD), include gradient descent (GD), log-barrier and replicator dynamics (RD) as special cases. We start by establishing *pointwise convergence* of all QRD to Nash equilibria in almost all PGs. In the case of GD, we show a tight average case performance within a factor of two of optimal, for a class of symmetric $2\\times2$ potential games with unbounded Price of Anarchy (PoA). Despite this positive result, we show that GD is not always the optimal choice even in this restricted setting. Specifically, GD outperforms RD, if and only if *risk-* and *payoff-dominance* equilibria coincide. Finally, we experimentally show how these insights extend to all QRD dynamics and that unbounded gaps between average case performance and PoA analysis are common even in larger settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=36L7W3ri4U",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19756,
    "title": "MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework",
    "authors": [
      "Sirui Hong",
      "Mingchen Zhuge",
      "Jonathan Chen",
      "Xiawu Zheng",
      "Yuheng Cheng",
      "Jinlin Wang",
      "Ceyao Zhang",
      "Zili Wang",
      "Steven Ka Shing Yau",
      "Zijuan Lin",
      "Liyang Zhou",
      "Chenyu Ran",
      "Lingfeng Xiao",
      "Chenglin Wu",
      "J\u00fcrgen Schmidhuber"
    ],
    "abstract": "Recently, remarkable progress has been made on automated problem solving through societies of agents based on large language models (LLMs). Previous LLM-based multi-agent systems can already solve simple dialogue tasks. More complex tasks, however, face challenges through logic inconsistencies due to cascading hallucinations caused by naively chaining LLMs. Here we introduce MetaGPT, an innovative meta-programming framework incorporating efficient human workflows into LLM-based multi-agent collaborations. MetaGPT encodes Standardized Operating Procedures (SOPs) into prompt sequences for more streamlined workflows, thus allowing agents with human-like domain expertise to verify intermediate results and reduce errors.  MetaGPT utilizes an assembly line paradigm to assign diverse roles to various agents, efficiently breaking down complex tasks into subtasks involving many agents working together.  On collaborative software engineering benchmarks, MetaGPT generates more coherent solutions than previous chat-based multi-agent systems.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=VtmBAGCN7o",
    "arxiv_id": "2308.00352",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17379,
    "title": "On the Limitations of Temperature Scaling for Distributions with Overlaps",
    "authors": [
      "Muthu Chidambaram",
      "Rong Ge"
    ],
    "abstract": "Despite the impressive generalization capabilities of deep neural networks, they have been repeatedly shown to be overconfident when they are wrong. Fixing this issue is known as model calibration, and has consequently received much attention in the form of modified training schemes and post-training calibration procedures such as temperature scaling. While temperature scaling is frequently used because of its simplicity, it is often outperformed by modified training schemes. In this work, we identify a specific bottleneck for the performance of temperature scaling.  We show that for empirical risk minimizers for a general set of distributions in which the supports of classes have overlaps, the performance of temperature scaling degrades with the amount of overlap between classes, and asymptotically becomes no better than random when there are a large number of classes. On the other hand, we prove that optimizing a modified form of the empirical risk induced by the Mixup data augmentation technique can in fact lead to reasonably good calibration performance, showing that training-time calibration may be necessary in some situations. We also verify that our theoretical results reflect practice by showing that Mixup significantly outperforms empirical risk minimization (with respect to multiple calibration metrics) on image classification benchmarks with class overlaps introduced in the form of label noise.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zavLQJ1XjB",
    "arxiv_id": "2306.00740",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19525,
    "title": "Training Unbiased Diffusion Models From Biased Dataset",
    "authors": [
      "Yeongmin Kim",
      "Byeonghu Na",
      "Minsang Park",
      "JoonHo Jang",
      "Dongjun Kim",
      "Wanmo Kang",
      "Il-chul Moon"
    ],
    "abstract": "With significant advancements in diffusion models, addressing the potential risks of dataset bias becomes increasingly important. Since generated outputs directly suffer from dataset bias, mitigating latent bias becomes a key factor in improving sample quality and proportion. This paper proposes time-dependent importance reweighting to mitigate the bias for the diffusion models. We demonstrate that the time-dependent density ratio becomes more precise than previous approaches, thereby minimizing error propagation in generative learning. While directly applying it to score-matching is intractable, we discover that using the time-dependent density ratio both for reweighting and score correction can lead to a tractable form of the objective function to regenerate the unbiased data density. Furthermore, we theoretically establish a connection with traditional score-matching, and we demonstrate its convergence to an unbiased distribution. The experimental evidence supports the usefulness of the proposed method, which outperforms baselines including time-independent importance reweighting on CIFAR-10, CIFAR-100, FFHQ, and CelebA with various bias settings. Our code is available at https://github.com/alsdudrla10/TIW-DSM.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=39cPKijBed",
    "arxiv_id": "2403.01189",
    "GitHub": [
      "https://github.com/alsdudrla10/TIW-DSM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19524,
    "title": "Chain of Thought Empowers Transformers to Solve Inherently Serial Problems",
    "authors": [
      "Zhiyuan Li",
      "Hong Liu",
      "Denny Zhou",
      "Tengyu Ma"
    ],
    "abstract": "Generating a sequence of intermediate steps, \\emph{a.k.a.}, a chain of thought (CoT), is a highly effective method to improve the accuracy of large language models (LLMs) on arithmetics and symbolic reasoning tasks. However, the mechanism behind CoT remains unclear. This work provides a theoretical understanding of the power of CoT for decoder-only transformers through the lens of expressiveness. Conceptually, CoT empowers the model with the ability to perform inherently serial computation, which is otherwise lacking in transformers, especially when depth is low. Given input length $n$, previous works have constant-depth transformers with finite precision $\\mathsf{poly}(n)$ embedding size can only solve problems in $\\mathsf{TC}^0$ without CoT. We first show an even tighter expressiveness upper bound for constant-depth transformers with constant-bit precision, which can only solve problems in $\\mathsf{AC}^0$, a proper subset of $ \\mathsf{TC}^0$. However, with $T$ steps of CoT, constant-depth transformers using constant-bit precision and $O(\\log n)$ embedding size can solve any problem solvable by boolean circuits of size $T$. Empirically, enabling CoT dramatically improves the accuracy for tasks that are hard for parallel computation, including the composition of permutation groups, iterated squaring, and circuit value problems, especially for low-depth transformers.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3EWTEy9MTM",
    "arxiv_id": "2402.12875",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19523,
    "title": "Self-Supervised Heterogeneous Graph Learning:  a Homophily and Heterogeneity View",
    "authors": [
      "Yujie Mo",
      "Feiping Nie",
      "Ping Hu",
      "Heng Tao Shen",
      "Zheng Zhang",
      "Xinchao Wang",
      "Xiaofeng Zhu"
    ],
    "abstract": "Self-supervised heterogeneous graph learning has achieved promising results in various real applications, but it still suffers from the following issues: (i)  meta-paths can be employed to capture the homophily in the heterogeneous graph, but meta-paths are human-defined, requiring substantial expert knowledge and computational costs; and (ii) the heterogeneity in the heterogeneous graph is usually underutilized, leading to the loss of task-related information. To solve these issues, this paper proposes to capture both homophily and  heterogeneity in the heterogeneous graph without pre-defined meta-paths. Specifically, we propose to learn a self-expressive matrix to capture the homophily from the subspace and nearby neighbors. Meanwhile, we propose to capture the heterogeneity by aggregating the information of nodes from different types. We further design a consistency loss and a specificity loss, respectively, to extract the consistent information between homophily and heterogeneity and to preserve their specific task-related information. We theoretically analyze that the learned homophilous representations exhibit the grouping effect to capture the homophily, and considering both homophily and heterogeneity introduces more task-related information. Extensive experimental results verify the superiority of the proposed method on different downstream tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3FJOKjooIj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19522,
    "title": "On Harmonizing Implicit Subpopulations",
    "authors": [
      "Feng Hong",
      "Jiangchao Yao",
      "Yueming Lyu",
      "Zhihan Zhou",
      "Ivor Tsang",
      "Ya Zhang",
      "Yanfeng Wang"
    ],
    "abstract": "Machine learning algorithms under skew distributions usually suffer from poor generalization, especially when the performance parity acts as an important criterion. This is more challenging on the class-balanced data that has some hidden imbalanced subpopulations, since prevalent techniques mainly conduct the class-level calibration and cannot perform the subpopulation-level adjustment without the explicit quantity. Regarding the implicit subpopulation imbalance, we reveal that the key to alleviating the detrimental effect lies in an effective subpopulation discovery with proper rebalancing. We then propose a novel subpopulation-imbalanced learning method, termed as Scatter and HarmonizE (SHE). Our method is built upon the guiding principle of optimal data partition, which involves assigning data to subpopulations in a manner that maximizes the predictive information from inputs to labels. With theoretical guarantees and empirical evidences, SHE succeeds in identifying the hidden subpopulations and encourages subpopulation-balanced predictions. Extensive experiments on various benchmark datasets show the effectiveness of SHE compared with a broad range of baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3GurO0kRue",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19521,
    "title": "The Marginal Value of Momentum for Small Learning Rate SGD",
    "authors": [
      "Runzhe Wang",
      "Sadhika Malladi",
      "Tianhao Wang",
      "Kaifeng Lyu",
      "Zhiyuan Li"
    ],
    "abstract": "Momentum is known to accelerate the convergence of gradient descent in strongly convex settings without stochastic gradient noise. In stochastic optimization, such as training neural networks, folklore suggests that momentum may help deep learning optimization by reducing the variance of the stochastic gradient update, but previous theoretical analyses do not find momentum to offer any provable acceleration. Theoretical results in this paper clarify the role of momentum in stochastic settings where the learning rate is small and gradient noise is the dominant source of instability, suggesting that SGD with and without momentum behave similarly in the short and long time horizons. Experiments show that momentum indeed has limited benefits for both optimization and generalization in practical training regimes where the optimal learning rate is not very large, including small- to medium-batch training from scratch on ImageNet and fine-tuning language models on downstream tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3JjJezzVkT",
    "arxiv_id": "2307.15196",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19520,
    "title": "On Representation Complexity of Model-based and Model-free Reinforcement Learning",
    "authors": [
      "Hanlin Zhu",
      "Baihe Huang",
      "Stuart Russell"
    ],
    "abstract": "We study the representation complexity of model-based and model-free reinforcement learning (RL) in the context of circuit complexity. We prove theoretically that there exists a broad class of MDPs such that their underlying transition and reward functions can be represented by constant depth circuits with polynomial size, while the optimal $Q$-function suffers an exponential circuit complexity in constant-depth circuits. By drawing attention to the approximation errors and building connections to complexity theory, our theory provides unique insights into why model-based algorithms usually enjoy better sample complexity than model-free algorithms from a novel representation complexity perspective: in some cases, the ground-truth rule (model) of the environment is simple to represent, while other quantities, such as $Q$-function, appear complex. We empirically corroborate our theory by comparing the approximation error of the transition kernel, reward function, and optimal $Q$-function in various Mujoco environments, which demonstrates that the approximation errors of the transition kernel and reward function are consistently lower than those of the optimal $Q$-function. To the best of our knowledge, this work is the first to study the circuit complexity of RL, which also provides a rigorous framework for future research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3K3s9qxSn7",
    "arxiv_id": "2310.01706",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19072,
    "title": "SequenceMatch: Imitation Learning for Autoregressive Sequence Modelling with Backtracking",
    "authors": [
      "Chris Cundy",
      "Stefano Ermon"
    ],
    "abstract": "In many domains, autoregressive models can attain high likelihood on the task of predicting the next observation. However, this maximum-likelihood (MLE) objective does not necessarily match a downstream use-case of autoregressively generating high-quality sequences. The MLE objective weights sequences proportionally to their frequency under the data distribution, with no guidance for the model's behaviour out of distribution (OOD): leading to compounding error during autoregressive generation. In order to address this compounding error problem, we formulate sequence generation as an imitation learning (IL) problem. This allows us to minimize a variety of divergences between the distribution of sequences generated by an autoregressive model and sequences from a dataset, including divergences with weight on OOD generated sequences. The IL framework also allows us to incorporate backtracking by introducing a backspace action into the generation process. This further mitigates the compounding error problem by allowing the model to revert a sampled token if it takes the sequence OOD. Our resulting method, SequenceMatch, can be implemented without adversarial training or major architectural changes. We identify the SequenceMatch-\u03c72 divergence as a more suitable training objective for autoregressive models which are used for generation. We show that empirically, SequenceMatch training leads to improvements over MLE on text generation with language models and arithmetic",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FJWT0692hw",
    "arxiv_id": "2306.05426",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18551,
    "title": "GeoLLM: Extracting Geospatial Knowledge from Large Language Models",
    "authors": [
      "Rohin Manvi",
      "Samar Khanna",
      "Gengchen Mai",
      "Marshall Burke",
      "David B. Lobell",
      "Stefano Ermon"
    ],
    "abstract": "The application of machine learning (ML) in a range of geospatial tasks is increasingly common but often relies on globally available covariates such as satellite imagery that can either be expensive or lack predictive power.Here we explore the question of whether the vast amounts of knowledge found in Internet language corpora, now compressed within large language models (LLMs), can be leveraged for geospatial prediction tasks. We first demonstrate that LLMs embed remarkable spatial information about locations, but naively querying LLMs using geographic coordinates alone is ineffective in predicting key indicators like population density. We then present GeoLLM, a novel method that can effectively extract geospatial knowledge from LLMs with auxiliary map data from OpenStreetMap.We demonstrate the utility of our approach across multiple tasks of central interest to the international community, including the measurement of population density and economic livelihoods.Across these tasks, our method demonstrates a 70\\% improvement in performance (measured using Pearson's $r^2$) relative to baselines that use nearest neighbors or use information directly from the prompt, and performance equal to or exceeding satellite-based benchmarks in the literature.With GeoLLM, we observe that GPT-3.5 outperforms Llama 2 and RoBERTa by 19\\% and 51\\% respectively, suggesting that the performance of our method scales well with the size of the model and its pretraining dataset.Our experiments reveal that LLMs are remarkably sample-efficient, rich in geospatial information, and robust across the globe.Crucially, GeoLLM shows promise in mitigating the limitations of existing geospatial covariates and complementing them well.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TqL2xBwXP3",
    "arxiv_id": "2310.06213",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17865,
    "title": "Cross-Modal Contextualized Diffusion Models for Text-Guided Visual Generation and Editing",
    "authors": [
      "Ling Yang",
      "Zhilong Zhang",
      "Zhaochen Yu",
      "Jingwei Liu",
      "Minkai Xu",
      "Stefano Ermon",
      "Bin CUI"
    ],
    "abstract": "Conditional diffusion models have exhibited superior performance in high-fidelity text-guided visual generation and editing. Nevertheless, prevailing text-guided visual diffusion models primarily focus on incorporating text-visual relationships exclusively into the reverse process, often disregarding their relevance in the forward process. This inconsistency between forward and reverse processes maylimit the precise conveyance of textual semantics in visual synthesis results. To address this issue, we propose a novel and general contextualized diffusion model (ContextDiff) by incorporating the cross-modal context encompassing interactions and alignments between text condition and visual sample into forward and reverse processes. We propagate this context to all timesteps in the two processes to adapt their trajectories, thereby facilitating cross-modal conditional modeling. We generalize our contextualized diffusion to both DDPMs and DDIMs with theoretical derivations, and demonstrate the effectiveness of our model in evaluations with two challenging tasks: text-to-image generation, and text-to-video editing. In each task, our ContextDiff achieves new state-of-the-art performance, significantly enhancing the semantic alignment between text condition and generated samples, as evidenced by quantitative and qualitative evaluations. Our code is available at https://github.com/YangLing0818/ContextDiff",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nFMS6wF2xq",
    "arxiv_id": "2402.16627",
    "GitHub": [
      "https://github.com/YangLing0818/ContextDiff"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19453,
    "title": "Language Model Detectors Are Easily Optimized Against",
    "authors": [
      "Charlotte Nicks",
      "Eric Mitchell",
      "Rafael Rafailov",
      "Archit Sharma",
      "Christopher D Manning",
      "Chelsea Finn",
      "Stefano Ermon"
    ],
    "abstract": "The fluency and general applicability of large language models (LLMs) has motivated significant interest in detecting whether a piece of text was written by a language model. While both academic and commercial detectors have been deployed in some settings, particularly education, other research has highlighted the fragility of these systems. In this paper, we demonstrate a data-efficient attack that fine-tunes language models to confuse existing detectors, leveraging recent developments in reinforcement learning of language models. We use the 'human-ness' score (often just a log probability) of various open-source and commercial detectors as a reward function for reinforcement learning, subject to a KL-divergence constraint that the resulting model does not differ significantly from the original. For a 7B parameter Llama-2 model, fine-tuning for under a day reduces the AUROC of the OpenAI RoBERTa-Large detector from 0.84 to 0.62, while perplexity on OpenWebText increases from 8.7 to only 9.0; with a larger perplexity budget, we reduce AUROC to 0.30 (worse than random), with a perplexity increase to 9.9. Similar to traditional adversarial attacks, we find that this increase in 'detector evasion' generalizes to other detectors not used during training. In light of our empirical results, we advise against continued reliance on LLM-generated text detectors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4eJDMjYZZG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19519,
    "title": "The Reasonableness Behind Unreasonable Translation Capability of Large Language Model",
    "authors": [
      "Tingchen Fu",
      "Lemao Liu",
      "Deng Cai",
      "Guoping Huang",
      "Shuming Shi",
      "Rui Yan"
    ],
    "abstract": "Multilingual large language models trained on non-parallel data yield impressive translation capabilities. Existing studies demonstrate that incidental sentence-level bilingualism within pre-training data contributes to the LLM's translation abilities. However, it has also been observed that LLM's translation capabilities persist even when incidental sentence-level bilingualism are excluded from the training corpus.In this study, we comprehensively investigate the unreasonable effectiveness and the underlying mechanism for LLM's translation abilities, specifically addressing the question why large language models learn to translate without parallel data, using the BLOOM model series as a representative example. Through extensive experiments, our findings suggest the existence of unintentional bilingualism in the pre-training corpus, especially word alignment data significantly contributes to the large language model's acquisition of translation ability. Moreover, the translation signal derived from word alignment data is comparable to that from sentence-level bilingualism. Additionally, we study the effects of monolingual data and parameter-sharing in assisting large language model to learn to translate. Together, these findings present another piece of the broader puzzle of trying to understand how large language models acquire translation capability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3KDbIWT26J",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18972,
    "title": "DiffusionSat: A Generative Foundation Model for Satellite Imagery",
    "authors": [
      "Samar Khanna",
      "Patrick Liu",
      "Linqi Zhou",
      "Chenlin Meng",
      "Robin Rombach",
      "Marshall Burke",
      "David B. Lobell",
      "Stefano Ermon"
    ],
    "abstract": "Diffusion models have achieved state-of-the-art results on many modalities including images, speech, and video. However, existing models are not tailored to support remote sensing data, which is widely used in important applications including environmental monitoring and crop-yield prediction. Satellite images are significantly different from natural images -- they can be multi-spectral, irregularly sampled across time -- and existing diffusion models trained on images from the Web do not support them. Furthermore, remote sensing data is inherently spatio-temporal, requiring conditional generation tasks not supported by traditional methods based on captions or images. In this paper, we present DiffusionSat, to date the largest generative foundation model trained on a collection of publicly available large, high-resolution remote sensing datasets .As text-based captions are sparsely available for satellite images, we incorporate the associated metadata such as geolocation as conditioning information. Our method produces realistic samples and can be used to solve multiple generative tasks including temporal generation, multi-spectral superrresolution and in-painting. Our method outperforms previous state-of-the-art methods for satellite image generation and is the first large-scale _generative_ foundation model for satellite imagery.The project website can be found here: https://samar-khanna.github.io/DiffusionSat/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=I5webNFDgQ",
    "arxiv_id": "2312.03606",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19766,
    "title": "Efficient Episodic Memory Utilization of Cooperative Multi-Agent Reinforcement Learning",
    "authors": [
      "Hyungho Na",
      "Yunkyeong Seo",
      "Il-chul Moon"
    ],
    "abstract": "In cooperative multi-agent reinforcement learning (MARL), agents aim to achieve a common goal, such as defeating enemies or scoring a goal. Existing MARL algorithms are effective but still require significant learning time and often get trapped in local optima by complex tasks, subsequently failing to discover a goal-reaching policy. To address this, we introduce Efficient episodic Memory Utilization (EMU) for MARL, with two primary objectives: (a) accelerating reinforcement learning by leveraging semantically coherent memory from an episodic buffer and (b) selectively promoting desirable transitions to prevent local convergence. To achieve (a), EMU incorporates a trainable encoder/decoder structure alongside MARL, creating coherent memory embeddings that facilitate exploratory memory recall. To achieve (b), EMU introduces a novel reward structure called episodic incentive based on the desirability of states. This reward improves the TD target in Q-learning and acts as an additional incentive for desirable transitions. We provide theoretical support for the proposed incentive and demonstrate the effectiveness of EMU compared to conventional episodic control. The proposed method is evaluated in StarCraft II and Google Research Football, and empirical results indicate further performance improvement over state-of-the-art methods.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=LjivA1SLZ6",
    "arxiv_id": "2403.01112",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19518,
    "title": "CrIBo: Self-Supervised Learning via Cross-Image Object-Level Bootstrapping",
    "authors": [
      "Tim Lebailly",
      "Thomas Stegm\u00fcller",
      "Behzad Bozorgtabar",
      "Jean-Philippe Thiran",
      "Tinne Tuytelaars"
    ],
    "abstract": "Leveraging nearest neighbor retrieval for self-supervised representation learning has proven beneficial with object-centric images. However, this approach faces limitations when applied to scene-centric datasets, where multiple objects within an image are only implicitly captured in the global representation. Such global bootstrapping can lead to undesirable entanglement of object representations. Furthermore, even object-centric datasets stand to benefit from a finer-grained bootstrapping approach. In response to these challenges, we introduce a novel $\\textbf{Cr}$oss-$\\textbf{I}$mage Object-Level $\\textbf{Bo}$otstrapping method tailored to enhance dense visual representation learning. By employing object-level nearest neighbor bootstrapping throughout the training, CrIBo emerges as a notably strong and adequate candidate for in-context learning, leveraging nearest neighbor retrieval at test time. CrIBo shows state-of-the-art performance on the latter task while being highly competitive in more standard downstream segmentation tasks. Our code and pretrained models will be publicly available upon acceptance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=3M0GXoUEzP",
    "arxiv_id": "2310.07855",
    "GitHub": [
      "https://github.com/tileb1/CrIBo"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19517,
    "title": "Don't Play Favorites: Minority Guidance for Diffusion Models",
    "authors": [
      "Soobin Um",
      "Suhyeon Lee",
      "Jong Chul Ye"
    ],
    "abstract": "We explore the problem of generating minority samples using diffusion models. The minority samples are instances that lie on low-density regions of a data manifold. Generating a sufficient number of such minority instances is important, since they often contain some unique attributes of the data. However, the conventional generation process of the diffusion models mostly yields majority samples (that lie on high-density regions of the manifold) due to their high likelihoods, making themselves ineffective and time-consuming for the minority generating task. In this work, we present a novel framework that can make the generation process of the diffusion models focus on the minority samples. We first highlight that Tweedie's denoising formula yields favorable results for majority samples. The observation motivates us to introduce a metric that describes the uniqueness of a given sample. To address the inherent preference of the diffusion models w.r.t. the majority samples, we further develop *minority guidance*, a sampling technique that can guide the generation process toward regions with desired likelihood levels. Experiments on benchmark real datasets demonstrate that our minority guidance can greatly improve the capability of generating high-quality minority samples over existing generative samplers. We showcase that the performance benefit of our framework persists even in demanding real-world scenarios such as medical imaging, further underscoring the practical significance of our work. Code is available at https://github.com/soobin-um/minority-guidance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3NmO9lY4Jn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19515,
    "title": "SPTNet: An Efficient Alternative Framework for Generalized Category Discovery with Spatial Prompt Tuning",
    "authors": [
      "Hongjun Wang",
      "Sagar Vaze",
      "Kai Han"
    ],
    "abstract": "Generalized Category Discovery (GCD) aims to classify unlabelled images from both seen and unseen classes by transferring knowledge from a set of labelled seen class images. A key theme in existing GCD approaches is adapting large-scale pretrained models for the GCD task. An alternate perspective, however, is to adapt the data representation itself for better alignment with the pretrained model.As such, in this paper, we introduce a two-stage adaptation approach termed SPTNet, which iteratively optimizes model parameters (i.e., model-finetuning) and data parameters (i.e., prompt learning). Furthermore, we propose a novel spatial prompt tuning method (SPT) which considers the spatial property of image data, enabling the method to better focus on object parts, which can transfer between seen and unseen classes. We thoroughly evaluate our SPTNet on standard benchmarks and demonstrate that our method outperforms existing GCD methods. Notably, we find our method achieving an average accuracy of 61.4\\% on the SSB, surpassing prior state-of-the-art methods by approximately 10\\%. The improvement is particularly remarkable as our method yields extra parameters amounting to only 0.042\\% of those in the backbone architecture.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3QLkwU40EE",
    "arxiv_id": "2403.13684",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18590,
    "title": "Generalized Schr\u00f6dinger Bridge Matching",
    "authors": [
      "Guan-Horng Liu",
      "Yaron Lipman",
      "Maximilian Nickel",
      "Brian Karrer",
      "Evangelos Theodorou",
      "Ricky T. Q. Chen"
    ],
    "abstract": "Modern distribution matching algorithms for training diffusion or flow models directly prescribe the time evolution of the marginal distributions between two boundary distributions. In this work, we consider a generalized distribution matching setup, where these marginals are only implicitly described as a solution to some task-specific objective function. The problem setup, known as the Generalized Schr\u00f6dinger Bridge (GSB), appears prevalently in many scientific areas both within and without machine learning. We propose Generalized Sch\u00f6dinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances, generalizing them beyond kinetic energy minimization and to account for nonlinear state costs. We show that such a generalization can be cast as solving conditional stochastic optimal control, for which efficient variational approximations can be used, and further debiased with the aid of path integral theory. Compared to prior methods for solving GSB problems, our GSBM algorithm always preserves a feasible transport map between the boundary distributions throughout training, thereby enabling stable convergence and significantly improved scalability. We empirically validate our claims on an extensive suite of experimental setups, including crowd navigation, opinion depolarization, LiDAR manifolds, and image domain transfer. Our work brings new algorithmic opportunities for training diffusion models enhanced with task-specific optimality structures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SoismgeX7z",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17404,
    "title": "Consistency Trajectory Models: Learning Probability Flow ODE Trajectory of Diffusion",
    "authors": [
      "Dongjun Kim",
      "Chieh-Hsin Lai",
      "Wei-Hsiang Liao",
      "Naoki Murata",
      "Yuhta Takida",
      "Toshimitsu Uesaka",
      "Yutong He",
      "Yuki Mitsufuji",
      "Stefano Ermon"
    ],
    "abstract": "Consistency Models (CM) (Song et al., 2023) accelerate score-based diffusion model sampling at the cost of sample quality but lack a natural way to trade-off quality for speed. To address this limitation, we propose Consistency Trajectory Model (CTM), a generalization encompassing CM and score-based models as special cases. CTM trains a single neural network that can -- in a single forward pass -- output scores (i.e., gradients of log-density) and enables unrestricted traversal between any initial and final time along the Probability Flow Ordinary Differential Equation (ODE) in a diffusion process. CTM enables the efficient combination of adversarial training and denoising score matching loss to enhance performance and achieves new state-of-the-art FIDs for single-step diffusion model sampling on CIFAR-10 (FID 1.73) and ImageNet at 64X64 resolution (FID 2.13). CTM also enables a new family of sampling schemes, both deterministic and stochastic, involving long jumps along the ODE solution trajectories. It consistently improves sample quality as computational budgets increase, avoiding the degradation seen in CM. Furthermore, CTM's access to the score accommodates all diffusion model inference techniques, including exact likelihood computation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ymjI8feDTD",
    "arxiv_id": "2310.02279",
    "GitHub": [
      "https://github.com/sony/ctm"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19514,
    "title": "Universal Backdoor Attacks",
    "authors": [
      "Benjamin Schneider",
      "Nils Lukas",
      "Florian Kerschbaum"
    ],
    "abstract": "Web-scraped datasets are vulnerable to data poisoning, which can be used for backdooring deep image classifiers during training. Since training on large datasets is expensive, a model is trained once and re-used many times. Unlike adversarial examples, backdoor attacks often target specific classes rather than any class learned by the model. One might expect that targeting many classes through a na\u00efve composition of attacks vastly increases the number of poison samples. We show this is not necessarily true and more efficient,  universal data poisoning attacks exist that allow controlling misclassifications from any source class into any target class with a small increase in poison samples. Our idea is to generate triggers with salient characteristics that the model can learn. The triggers we craft exploit a phenomenon we call inter-class poison transferability, where learning a trigger from one class makes the model more vulnerable to learning triggers for other classes. We demonstrate the effectiveness and robustness of our universal backdoor attacks by controlling models with up to 6,000 classes while poisoning only 0.15% of the training dataset. Our source code will be made available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3QkzYBSWqL",
    "arxiv_id": "2312.00157",
    "GitHub": [
      "https://github.com/Ben-Schneider-code/Universal-Backdoor-Attacks"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19513,
    "title": "Grokking as a First Order Phase Transition in Two Layer Networks",
    "authors": [
      "Noa Rubin",
      "Inbar Seroussi",
      "Zohar Ringel"
    ],
    "abstract": "A key property of deep neural networks (DNNs) is their ability to learn new features during training. This intriguing aspect of deep learning stands out most clearly in recently reported Grokking phenomena. While mainly reflected as a sudden increase in test accuracy, Grokking is also believed to be a beyond lazy-learning/Gaussian Process (GP) phenomenon involving feature learning. Here we apply a recent development in the theory of feature learning, the adaptive kernel approach, to two teacher-student models with cubic-polynomial and modular addition teachers. We provide analytical predictions on feature learning and Grokking properties of these models and demonstrate a mapping between Grokking and the theory of phase transitions. We show that after Grokking, the state of the DNN is analogous to the mixed phase following a first-order phase transition. In this mixed phase, the DNN generates useful internal representations of the teacher that are sharply distinct from those before the transition.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3ROGsTX3IR",
    "arxiv_id": "2310.03789",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17837,
    "title": "Manifold Preserving Guided Diffusion",
    "authors": [
      "Yutong He",
      "Naoki Murata",
      "Chieh-Hsin Lai",
      "Yuhta Takida",
      "Toshimitsu Uesaka",
      "Dongjun Kim",
      "Wei-Hsiang Liao",
      "Yuki Mitsufuji",
      "J Zico Kolter",
      "Ruslan Salakhutdinov",
      "Stefano Ermon"
    ],
    "abstract": "Despite the recent advancements, conditional image generation still faces challenges of cost, generalizability, and the need for task-specific training. In this paper, we propose Manifold Preserving Guided Diffusion (MPGD), a training-free conditional generation framework that leverages pretrained diffusion models and off-the-shelf neural networks with minimal additional inference cost for a broad range of tasks. Specifically, we leverage the manifold hypothesis to refine the guided diffusion steps and introduce a shortcut algorithm in the process. We then propose two methods for on-manifold training-free guidance using pre-trained autoencoders and demonstrate that our shortcut inherently preserves the manifolds when applied to latent diffusion models. Our experiments show that MPGD is efficient and effective for solving a variety of conditional generation applications in low-compute settings, and can consistently offer up to 3.8\u00d7 speed-ups with the same number of diffusion steps while maintaining high sample quality compared to the baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=o3BxOLoxm1",
    "arxiv_id": "2311.16424",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19512,
    "title": "Generalization error of spectral algorithms",
    "authors": [
      "Maksim Velikanov",
      "Maxim Panov",
      "Dmitry Yarotsky"
    ],
    "abstract": "The asymptotically precise estimation of the generalization of kernel methods has recently received attention due to the parallels between neural networks and their associated kernels. However, prior works derive such estimates for training by kernel ridge regression (KRR), whereas neural networks are typically trained with gradient descent (GD). In the present work, we consider the training of kernels with a family of \\emph{spectral algorithms} specified by profile $h(\\lambda)$, and including KRR and GD as special cases. Then, we derive the generalization error as a functional of learning profile $h(\\lambda)$ for two data models: high-dimensional Gaussian and low-dimensional translation-invariant model. Under power-law assumptions on the spectrum of the kernel and target, we use our framework to (i) give full loss asymptotics for both noisy and noiseless observations (ii) show that the loss localizes on certain spectral scales, giving a new perspective on the KRR saturation phenomenon (iii) conjecture, and demonstrate for the considered data models, the universality of the loss w.r.t. non-spectral details of the problem, but only in case of noisy observation.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=3SJE1WLB4M",
    "arxiv_id": "2403.11696",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19511,
    "title": "BTR: Binary Token Representations for Efficient Retrieval Augmented Language Models",
    "authors": [
      "Qingqing Cao",
      "Sewon Min",
      "Yizhong Wang",
      "Hannaneh Hajishirzi"
    ],
    "abstract": "Retrieval augmentation addresses many critical problems in large language models such as hallucination, staleness, and privacy leaks.However, running retrieval-augmented language models (LMs) is slow and difficult to scale due to processing large amounts of retrieved text. We introduce binary token representations (BTR), which use 1-bit vectors to precompute every token in passages, significantly reducing computation during inference. Despite the potential loss of accuracy, our new calibration techniques and training objectives restore performance. Combined with offline and runtime compression, this only requires 127GB of disk space for encoding 3 billion tokens in Wikipedia.Our experiments show that on five knowledge-intensive NLP tasks, BTR accelerates state-of-the-art inference by up to 4x and reduces storage by over 100x while maintaining over 95% task performance. Our code will be publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=3TO3TtnOFl",
    "arxiv_id": "2310.01329",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19609,
    "title": "Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions",
    "authors": [
      "Xufeng Cai",
      "Ahmet Alacaoglu",
      "Jelena Diakonikolas"
    ],
    "abstract": "Machine learning approaches relying on such criteria as adversarial robustness or multi-agent settings have raised the need for solving game-theoretic equilibrium problems. Of particular relevance to these applications are methods targeting finite-sum structure, which generically arises in empirical variants of learning problems in these contexts. Further, methods with computable approximation errors are highly desirable, as they provide verifiable exit criteria. Motivated by these applications, we study finite-sum monotone inclusion problems, which model broad classes of equilibrium problems. Our main contributions are variants of the classical Halpern iteration that employ variance reduction to obtain improved complexity guarantees in which $n$ component operators in the finite sum are ``on average'' either cocoercive or Lipschitz continuous and monotone, with parameter $L$. The resulting oracle complexity of our methods, which provide guarantees for the last iterate and for a (computable) operator norm residual, is $\\widetilde{\\mathcal{O}}( n + \\sqrt{n}L\\varepsilon^{-1})$, which improves upon existing methods by a factor up to $\\sqrt{n}$. This constitutes the first variance reduction-type result for general finite-sum monotone inclusions and for more specific problems such as convex-concave optimization when operator norm residual is the optimality measure. We further argue that, up to poly-logarithmic factors, this complexity is unimprovable in the monotone Lipschitz setting; i.e., the provided result is near-optimal.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=0i6Z9N5MLY",
    "arxiv_id": "2310.02987",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19510,
    "title": "Learning Planning Abstractions from Language",
    "authors": [
      "Weiyu Liu",
      "Geng Chen",
      "Joy Hsu",
      "Jiayuan Mao",
      "Jiajun Wu"
    ],
    "abstract": "This paper presents a framework for learning state and action abstractions in sequential decision-making domains. Our framework, planning abstraction from language (PARL), utilizes language-annotated demonstrations to automatically discover a symbolic and abstract action space and induce a latent state abstraction based on it. PARL consists of three stages: 1) recovering object-level and action concepts, 2) learning state abstractions, abstract action feasibility, and transition models, and 3) applying low-level policies for abstract actions. During inference, given the task description, PARL first makes abstract action plans using the latent transition and feasibility functions, then refines the high-level plan using low-level policies. PARL generalizes across scenarios involving novel object instances and environments, unseen concept compositions, and tasks that require longer planning horizons than settings it is trained on.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3UWuFoksGb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19508,
    "title": "LEMON: Lossless model expansion",
    "authors": [
      "Yite Wang",
      "Jiahao Su",
      "Hanlin Lu",
      "Cong Xie",
      "Tianyi Liu",
      "Jianbo Yuan",
      "Haibin Lin",
      "Ruoyu Sun",
      "Hongxia Yang"
    ],
    "abstract": "Scaling of deep neural networks, especially Transformers, is pivotal for their surging performance and has further led to the emergence of sophisticated reasoning capabilities in foundation models.Such scaling generally requires training large models from scratch with random initialization, failing to leverage the knowledge acquired by their smaller counterparts, which are already resource-intensive to obtain.To tackle this inefficiency, we present $\\textbf{L}$ossl$\\textbf{E}$ss $\\textbf{MO}$del Expansio$\\textbf{N}$ (LEMON), a recipe to initialize scaled models using the weights of their smaller but pre-trained counterparts. This is followed by model training with an optimized learning rate scheduler tailored explicitly for the scaled models, substantially reducing the training time compared to training from scratch.Notably, LEMON is versatile, ensuring compatibility with various network structures, including models like Vision Transformers and BERT.Our empirical results demonstrate that LEMON reduces computational costs by 56.7\\% for Vision Transformers and 33.2\\% for BERT when compared to training from scratch.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3Vw7DQqq7U",
    "arxiv_id": "2310.07999",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19506,
    "title": "PoSE: Efficient Context Window Extension of LLMs via Positional Skip-wise Training",
    "authors": [
      "Dawei Zhu",
      "Nan Yang",
      "Liang Wang",
      "Yifan Song",
      "Wenhao Wu",
      "Furu Wei",
      "Sujian Li"
    ],
    "abstract": "Large Language Models (LLMs) are trained with a pre-defined context length, restricting their use in scenarios requiring long inputs. Previous efforts for adapting LLMs to a longer length usually requires fine-tuning with this target length (Full-length fine-tuning), suffering intensive training cost. To decouple train length from target length for efficient context window extension, we propose Positional Skip-wisE (PoSE) training that smartly simulates long inputs using a fixed context window. This is achieved by first dividing the original context window into several chunks, then designing distinct skipping bias terms to manipulate the position indices of each chunk. These bias terms and the lengths of each chunk are altered for every training example, allowing the model to adapt to all positions within target length. Experimental results show that PoSE greatly reduces memory and time overhead compared with Full-length fine-tuning, with minimal impact on performance. Leveraging this advantage, we have successfully extended the LLaMA model to 128k tokens using a 2k training context window. Furthermore, we empirically confirm that PoSE is compatible with all RoPE-based LLMs and position interpolation strategies. Notably, our method can potentially support infinite length, limited only by memory usage in inference. With ongoing progress for efficient inference, we believe PoSE can further scale the context window beyond 128k.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3Z1gxuAQrA",
    "arxiv_id": "2309.10400",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19505,
    "title": "Evaluating Language Model Agency Through Negotiations",
    "authors": [
      "Tim Ruben Davidson",
      "Veniamin Veselovsky",
      "Michal Kosinski",
      "Robert West"
    ],
    "abstract": "Commercial interests are racing to exploit language models' remarkable capability to display agent-like behavior. Indeed, a future where personal LM-based agents are widely adopted to perform complicated tasks involving planning and negotiating appears increasingly plausible. Current, predominantly static evaluation methods are ill-suited to evaluate such dynamic, multi-step applications. In this work, we therefore propose jointly evaluating LM performance and alignment through the lens of negotiation games. We argue that this common real-world task provides scalable, difficult-to-hack performance metrics while offering non-trivial insights into model decision-making. Crucially, negotiation games allow us to study both competitive and cooperative performance, modulate complexity, and side-step accidental evaluation data leakage. Using our evaluation setup, we report results for publicly accessible LMs from all major providers on a variety of negotiation games. Noteworthy takeaways include: (i) open-source models are currently unable to complete this task, (ii) cooperative bargaining games prove challenging, and (iii) the most powerful models do not always 'win'. Evaluation through negotiations complements existing evaluation efforts by providing a novel evaluation paradigm to study evolving language model agency. We release an open-source library to accelerate research in this critical direction and lower the technical boundaries for researchers outside of the machine learning field to contribute.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3ZqKxMHcAg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19503,
    "title": "Take a Step Back: Evoking Reasoning via Abstraction in Large Language Models",
    "authors": [
      "Huaixiu Steven Zheng",
      "Swaroop Mishra",
      "Xinyun Chen",
      "Heng-Tze Cheng",
      "Ed H. Chi",
      "Quoc V Le",
      "Denny Zhou"
    ],
    "abstract": "We present Step-Back Prompting, a simple prompting technique that enables LLMs to do abstractions to derive high-level concepts and first principles from instances containing specific details. Using the concepts and principles to guide the reasoning steps, LLMs significantly improve their abilities in following a correct reasoning path towards the solution. We conduct experiments of Step-Back Prompting with PaLM-2 models and observe substantial performance gains on a wide range of challenging reasoning-intensive tasks including STEM, Knowledge QA, and Multi-Hop Reasoning. For instance, Step-Back Prompting improves PaLM-2L performance on MMLU Physics and Chemistry by 7% and 11%, TimeQA by 34%, and MuSiQue by 7%.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3bq3jsvcQ1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19502,
    "title": "Identifying Representations for Intervention Extrapolation",
    "authors": [
      "Sorawit Saengkyongam",
      "Elan Rosenfeld",
      "Pradeep Kumar Ravikumar",
      "Niklas Pfister",
      "Jonas Peters"
    ],
    "abstract": "The premise of identifiable and causal representation learning is to improve the current representation learning paradigm in terms of generalizability or robustness. Despite recent progress in questions of identifiability, more theoretical results demonstrating concrete advantages of these methods for downstream tasks are needed. In this paper, we consider the task of intervention extrapolation: predicting how interventions affect an outcome, even when those interventions are not observed at training time, and show that identifiable representations can provide an effective solution to this task even if the interventions affect the outcome non-linearly. Our setup includes an outcome variable $Y$, observed features $X$, which are generated as a non-linear transformation of latent features $Z$, and exogenous action variables $A$, which influence $Z$. The objective of intervention extrapolation is then to predict how interventions on $A$ that lie outside the training support of $A$ affect $Y$. Here, extrapolation becomes possible if the effect of $A$ on $Z$ is linear and the residual when regressing Z on A has full support. As $Z$ is latent, we combine the task of intervention extrapolation with identifiable representation learning, which we call $\\texttt{Rep4Ex}$: we aim to map the observed features $X$ into a subspace that allows for non-linear extrapolation in $A$. We show using Wiener\u2019s Tauberian theorem that the hidden representation is identifiable up to an affine transformation in $Z$-space, which, we prove, is sufficient for intervention extrapolation. The identifiability is characterized by a novel constraint describing the linearity assumption of $A$ on $Z$. Based on this insight, we propose a flexible method that enforces the linear invariance constraint and can be combined with any type of autoencoder. We validate our theoretical findings through a series of synthetic experiments and show that our approach can indeed succeed in predicting the effects of unseen interventions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3cuJwmPxXj",
    "arxiv_id": "2310.04295",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19501,
    "title": "Privately Aligning Language Models with Reinforcement Learning",
    "authors": [
      "Fan Wu",
      "Huseyin A Inan",
      "Arturs Backurs",
      "Varun Chandrasekaran",
      "Janardhan Kulkarni",
      "Robert Sim"
    ],
    "abstract": "Positioned between pre-training and user deployment, aligning large language models (LLMs) through reinforcement learning (RL) has emerged as a prevailing strategy for training instruction following-models such as ChatGPT. In this work, we initiate the study of privacy-preserving alignment of LLMs through Differential Privacy (DP) in conjunction with RL. Following the influential work of Ziegler et al. (2020), we study two dominant paradigms: (i) alignment via RL without human in the loop (e.g., positive review generation) and (ii) alignment via RL from human feedback (RLHF) (e.g., summarization in a human-preferred way). We give a new DP framework to achieve alignment via RL, and prove its correctness. Our experimental results validate the effectiveness of our approach, offering competitive utility while ensuring strong privacy protections.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3d0OmYTNui",
    "arxiv_id": "2310.16960",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19500,
    "title": "Efficient-3Dim: Learning a Generalizable Single-image Novel-view Synthesizer in One Day",
    "authors": [
      "Yifan Jiang",
      "Hao Tang",
      "Jen-Hao Rick Chang",
      "Liangchen Song",
      "Zhangyang Wang",
      "Liangliang Cao"
    ],
    "abstract": "The task of novel view synthesis aims to generate unseen perspectives of an object or scene from a limited set of input images. Nevertheless, synthesizing novel views from a single image still remains a significant challenge in the realm of computer vision. Previous approaches tackle this problem by adopting mesh prediction, multi-plain image construction, or more advanced techniques such as neural radiance fields. Recently, a pre-trained diffusion model that is specifically designed for 2D image synthesis has demonstrated its capability in producing photorealistic novel views, if sufficiently optimized on a 3D finetuning task. Although the fidelity and generalizability are greatly improved, training such a powerful diffusion model requires a vast volume of training data and model parameters, resulting in a notoriously long time and high computational costs. To tackle this issue, we propose Efficient-3DiM, a simple but effective framework to learn single-image novel-view generative models.  Motivated by our in-depth visual analysis of the inference process of diffusion models, we propose several pragmatic strategies to reduce the training overhead to a manageable scale, including a crafted timestep sampling strategy, a superior 3D feature extractor, and an enhanced training scheme. When combined, our framework is able to reduce the total training time from 10 days to less than 1 day, significantly accelerating the training process under the same computational platform (one instance with 8 Nvidia A100 GPUs). Comprehensive experiments are conducted to demonstrate the efficiency and generalizability of our proposed method on several common benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3eFMnZ3N4J",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19498,
    "title": "Detecting Machine-Generated Texts by Multi-Population Aware Optimization for Maximum Mean Discrepancy",
    "authors": [
      "Shuhai Zhang",
      "Yiliao Song",
      "Jiahao Yang",
      "Yuanqing Li",
      "Bo Han",
      "Mingkui Tan"
    ],
    "abstract": "Large language models (LLMs) such as ChatGPT have exhibited remarkable performance in generating human-like texts. However, machine-generated texts (MGTs) may carry critical risks, such as plagiarism issues and hallucination information. Therefore, it is very urgent and important to detect MGTs in many situations. Unfortunately, it is challenging to distinguish MGTs and human-written texts because the distributional discrepancy between them is often very subtle due to the remarkable performance of LLMS. In this paper, we seek to exploit \\textit{maximum mean discrepancy} (MMD) to address this issue in the sense that MMD can well identify distributional discrepancies. However,  directly training a detector with MMD using diverse MGTs will incur a significantly increased variance of MMD since MGTs may contain \\textit{multiple text populations} due to various LLMs. This will severely impair MMD's ability to measure the difference between two samples. To tackle this, we propose a novel \\textit{multi-population} aware optimization method for MMD called MMD-MP, which can \\textit{avoid variance increases} and thus improve the stability to measure the distributional discrepancy. Relying on MMD-MP, we develop two methods for paragraph-based and sentence-based detection, respectively. Extensive experiments on various LLMs, \\eg,  GPT2 and ChatGPT, show superior detection performance of our MMD-MP.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3fEKavFsnv",
    "arxiv_id": "2402.16041",
    "GitHub": [
      "https://github.com/ZSHsh98/MMD-MP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19493,
    "title": "LRR: Language-Driven Resamplable Continuous Representation against Adversarial Tracking Attacks",
    "authors": [
      "Jianlang Chen",
      "Xuhong Ren",
      "Qing Guo",
      "Felix Juefei-Xu",
      "Di Lin",
      "Wei Feng",
      "Lei Ma",
      "Jianjun Zhao"
    ],
    "abstract": "Visual object tracking plays a critical role in visual-based autonomous systems, as it aims to estimate the position and size of the object of interest within a live video. Despite significant progress made in this field, state-of-the-art (SOTA) trackers often fail when faced with adversarial perturbations in the incoming frames. This can lead to significant robustness and security issues when these trackers are deployed in the real world. To achieve high accuracy on both clean and adversarial data, we propose building a spatial-temporal continuous representation using the semantic text guidance of the object of interest. This novel continuous representation enables us to reconstruct incoming frames to maintain semantic and appearance consistency with the object of interest and its clean counterparts. As a result, our proposed method successfully defends against different SOTA adversarial tracking attacks while maintaining high accuracy on clean data. In particular, our method significantly increases tracking accuracy under adversarial attacks with around 90% relative improvement on UAV123, which is even higher than the accuracy on clean data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3qo1pJHabg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18735,
    "title": "TapMo: Shape-aware Motion Generation of Skeleton-free Characters",
    "authors": [
      "Jiaxu Zhang",
      "Shaoli Huang",
      "Zhigang Tu",
      "Xin Chen",
      "Xiaohang Zhan",
      "Gang YU",
      "Ying Shan"
    ],
    "abstract": "Previous motion generation methods are limited to the pre-rigged 3D human model, hindering their applications in the animation of various non-rigged characters. In this work, we present TapMo, a Text-driven Animation PIpeline for synthesizing Motion in a broad spectrum of skeleton-free 3D characters. The pivotal innovation in TapMo is its use of shape deformation-aware features as a condition to guide the diffusion model, thereby enabling the generation of mesh-specific motions for various characters. Specifically, TapMo comprises two main components - Mesh Handle Predictor and Shape-aware Diffusion Module. Mesh Handle Predictor predicts the skinning weights and clusters mesh vertices into adaptive handles for deformation control, which eliminates the need for traditional skeletal rigging. Shape-aware Motion Diffusion synthesizes motion with mesh-specific adaptations. This module employs text-guided motions and mesh features extracted during the first stage, preserving the geometric integrity of the animations by accounting for the character's shape and deformation. Trained in a weakly-supervised manner, TapMo can accommodate a multitude of non-human meshes, both with and without associated text motions. We demonstrate the effectiveness and generalizability of TapMo through rigorous qualitative and quantitative experiments. Our results reveal that TapMo consistently outperforms existing auto-animation methods, delivering superior-quality animations for both seen or unseen heterogeneous 3D characters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OeH6Fdhv7q",
    "arxiv_id": "2310.12678",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19722,
    "title": "Learning Interactive Real-World Simulators",
    "authors": [
      "Sherry Yang",
      "Yilun Du",
      "Seyed Kamyar Seyed Ghasemipour",
      "Jonathan Tompson",
      "Leslie Pack Kaelbling",
      "Dale Schuurmans",
      "Pieter Abbeel"
    ],
    "abstract": "Generative models trained on internet data have revolutionized how text, image, and video content can be created. Perhaps the next milestone for generative models is to simulate realistic experience in response to actions taken by humans, robots, and other interactive agents. Applications of a real-world simulator range from controllable content creation in games and movies, to training embodied agents purely in simulation that can be directly deployed in the real world. We explore the possibility of learning a universal simulator (UniSim) of real-world interaction through generative modeling. We first make the important observation that natural datasets available for learning a real-world simulator are often rich along different axes (e.g., abundant objects in image data, densely sampled actions in robotics data, and diverse movements in navigation data). With careful orchestration of diverse datasets, each providing a different aspect of the overall experience, UniSim can emulate how humans and agents interact with the world by simulating the visual outcome of both high-level instructions such as \u201copen the drawer\u201d and low-level controls such as \u201cmove by x,y\u201d from otherwise static scenes and objects. There are numerous use cases for such a real-world simulator. As an example, we use UniSim to train both high-level vision-language planners and low-level reinforcement learning policies, each of which exhibit zero-shot real-world transfer after training purely in a learned real-world simulator. We also show that other types of intelligence such as video captioning models can benefit from training with simulated experience in UniSim, opening up even wider applications.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=sFyTZEqmUY",
    "arxiv_id": "2310.06114",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19492,
    "title": "Boosting Vanilla Lightweight Vision Transformers via Re-parameterization",
    "authors": [
      "Zhentao Tan",
      "Xiaodan Li",
      "Yue Wu",
      "Qi Chu",
      "Le Lu",
      "Nenghai Yu",
      "Jieping Ye"
    ],
    "abstract": "Large-scale Vision Transformers have achieved promising performance on downstream tasks through feature pre-training. However, the performance of vanilla lightweight Vision Transformers (ViTs) is still far from satisfactory compared to that of recent lightweight CNNs or hybrid networks. In this paper, we aim to unlock the potential of vanilla lightweight ViTs by exploring the adaptation of the widely-used re-parameterization technology to ViTs for improving learning ability during training without increasing the inference cost. The main challenge comes from the fact that CNNs perfectly complement with re-parameterization over convolution and batch normalization, while vanilla Transformer architectures are mainly comprised of linear and layer normalization layers. We propose to incorporate the nonlinear ensemble into linear layers by expanding the depth of the linear layers with batch normalization and fusing multiple linear features with hierarchical representation ability through a pyramid structure. We also discover and solve a new transformer-specific distribution rectification problem caused by multi-branch re-parameterization. Finally, we propose our Two-Dimensional Re-parameterized Linear module (TDRL) for ViTs. Under the popular self-supervised pre-training and supervised fine-tuning strategy, our TDRL can be used in these two stages to enhance both generic and task-specific representation. Experiments demonstrate that our proposed method not only boosts the performance of vanilla Vit-Tiny on various vision tasks to new state-of-the-art (SOTA) but also shows promising generality ability on other networks. Code will be available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3rmpixOjPS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19491,
    "title": "Generative Learning for Solving Non-Convex Problem with Multi-Valued Input-Solution Mapping",
    "authors": [
      "Enming Liang",
      "Minghua Chen"
    ],
    "abstract": "General non-convex problems often present multiple optimal solutions for identical inputs, signifying a complex, multi-valued input-solution mapping. Conventional learning techniques, primarily tailored to learn single-valued mappings, struggle to train neural networks (NN) to accurately decipher multi-valued ones, leading to inferior solutions. We address this fundamental issue by developing a generative learning approach using a rectified flow (RectFlow) model built upon ordinary differential equations. In contrast to learning input-solution mapping, we learn the mapping from input to solution-distribution, exploiting the universal approximation capability of the RectFlow model. Upon receiving a new input, we employ the trained RectFlow model to sample high-quality solutions from the input-dependent distribution it has learned. Our approach outperforms conceivable GAN and Diffusion models in terms of training stability and run-time complexity. We provide a detailed characterization of the optimality loss and runtime complexity associated with our generative approach. Simulation results for solving non-convex problems show that our method achieves significantly better solution optimality than recent NN schemes, with comparable feasibility and speedup performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3tM1l5tSbv",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19490,
    "title": "The Generalization Gap in Offline Reinforcement Learning",
    "authors": [
      "Ishita Mediratta",
      "Qingfei You",
      "Minqi Jiang",
      "Roberta Raileanu"
    ],
    "abstract": "Despite the recent progress in offline reinforcement learning (RL) algorithms, agents are usually trained and tested on the same environment. In this paper, we perform an in-depth study of the generalization abilities of offline RL algorithms, showing that they struggle to generalize to new environments. We also introduce the first benchmark for evaluating generalization in offline learning, collecting datasets with varying sizes and skill-levels from Procgen (2D video games) and WebShop (e-commerce websites). The datasets contain trajectories for a limited number of game levels or natural language instructions and at test time, the agent has to generalize to new levels or instructions. Our experiments reveal that existing offline learning algorithms perform significantly worse than online RL on both train and test environments. Behavioral cloning is a strong baseline, typically outperforming offline RL and sequence modeling approaches when trained on data from multiple environments and tested on new ones. Finally, we find that increasing the diversity of the data, rather than its size, improves generalization for all algorithms. Our study demonstrates the limited generalization of current offline learning algorithms highlighting the need for more research in this area.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3w6xuXDOdY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19713,
    "title": "Protein Discovery with Discrete Walk-Jump Sampling",
    "authors": [
      "Nathan C. Frey",
      "Dan Berenberg",
      "Karina Zadorozhny",
      "Joseph Kleinhenz",
      "Julien Lafrance-Vanasse",
      "Isidro Hotzel",
      "Yan Wu",
      "Stephen Ra",
      "Richard Bonneau",
      "Kyunghyun Cho",
      "Andreas Loukas",
      "Vladimir Gligorijevic",
      "Saeed Saremi"
    ],
    "abstract": "We resolve difficulties in training and sampling from a discrete generative model by learning a smoothed energy function, sampling from the smoothed data manifold with Langevin Markov chain Monte Carlo (MCMC), and projecting back to the true data manifold with one-step denoising. Our $\\textit{Discrete Walk-Jump Sampling}$ formalism combines the contrastive divergence training of an energy-based model and improved sample quality of a score-based model, while simplifying training and sampling by requiring only a single noise level. We evaluate the robustness of our approach on generative modeling of antibody proteins and introduce the $\\textit{distributional conformity score}$ to benchmark protein generative models. By optimizing and sampling from our models for the proposed distributional conformity score, 97-100\\% of generated samples are successfully expressed and purified and 70\\% of functional designs show equal or improved binding affinity compared to known functional antibodies on the first attempt in a single round of laboratory experiments. We also report the first demonstration of long-run fast-mixing MCMC chains where diverse antibody protein classes are visited in a single MCMC chain.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=zMPHKOmQNb",
    "arxiv_id": "2306.12360",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19488,
    "title": "Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-training",
    "authors": [
      "Hong Liu",
      "Zhiyuan Li",
      "David Leo Wright Hall",
      "Percy Liang",
      "Tengyu Ma"
    ],
    "abstract": "Given the massive cost of language model pre-training, a non-trivial improvement of the optimization algorithm would lead to a material reduction on the time and cost of training. Adam and its variants have been state-of-the-art for years, and more sophisticated second-order (Hessian-based) optimizers often incur too much per-step overhead. In this paper, we propose Sophia, a simple scalable second-order optimizer that uses a light-weight estimate of the diagonal Hessian as the pre-conditioner. The update is the moving average of the gradients divided by the moving average of the estimated Hessian, followed by element-wise clipping. The clipping controls the worst-case update size and tames the negative impact of non-convexity and rapid change of Hessian along the trajectory. Sophia only estimates the diagonal Hessian every handful of iterations, which has negligible average per-step time and memory overhead. On language modeling with GPT models of sizes ranging from 125M to 1.5B, Sophia achieves a 2x speed-up compared to Adam in the number of steps, total compute, and wall-clock time, achieving the same perplexity with 50\\% fewer steps, less total compute, and reduced wall-clock time.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3xHDeA8Noi",
    "arxiv_id": "2305.14342",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19486,
    "title": "T-Rep: Representation Learning for Time Series using Time-Embeddings",
    "authors": [
      "Archibald Felix Fraikin",
      "Adrien Bennetot",
      "Stephanie Allassonniere"
    ],
    "abstract": "Multivariate time series present challenges to standard machine learning techniques, as they are often unlabeled, high dimensional, noisy, and contain missing data. To address this, we propose T-Rep, a self-supervised method to learn time series representations at a timestep granularity. T-Rep learns vector embeddings of time alongside its feature extractor, to extract temporal features such as trend, periodicity, or distribution shifts from the signal. These time-embeddings are leveraged in pretext tasks, to incorporate smooth and fine-grained temporal dependencies in the representations, as well as reinforce robustness to missing data. We evaluate T-Rep on downstream classification, forecasting, and anomaly detection tasks. It is compared to existing self-supervised algorithms for time series, which it outperforms in all three tasks. We test T-Rep in missing data regimes, where it proves more resilient than its counterparts. Finally, we provide latent space visualisation experiments, highlighting the interpretability of the learned representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3y2TfP966N",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19485,
    "title": "Geometrically Aligned Transfer Encoder for Inductive Transfer in Regression Tasks",
    "authors": [
      "Sung Moon Ko",
      "Sumin Lee",
      "Dae-Woong Jeong",
      "Woohyung Lim",
      "Sehui Han"
    ],
    "abstract": "Transfer learning is a crucial technique for handling a small amount of data that is potentially related to other abundant data. However, most of the existing methods are focused on classification tasks using images and language datasets. Therefore, in order to expand the transfer learning scheme to regression tasks, we propose a novel transfer technique based on differential geometry, namely the Geometrically Aligned Transfer Encoder (${\\it GATE}$). In this method, we interpret the latent vectors from the model to exist on a Riemannian curved manifold. We find a proper diffeomorphism between pairs of tasks to ensure that every arbitrary point maps to a locally flat coordinate in the overlapping region, allowing the transfer of knowledge from the source to the target data. This also serves as an effective regularizer for the model to behave in extrapolation regions. In this article, we demonstrate that ${\\it GATE}$ outperforms conventional methods and exhibits stable behavior in both the latent space and extrapolation regions for various molecular graph datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3z60EWfh1p",
    "arxiv_id": "2310.06369",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19484,
    "title": "On-Policy Distillation of Language Models: Learning from Self-Generated Mistakes",
    "authors": [
      "Rishabh Agarwal",
      "Nino Vieillard",
      "Yongchao Zhou",
      "Piotr Stanczyk",
      "Sabela Ramos Garea",
      "Matthieu Geist",
      "Olivier Bachem"
    ],
    "abstract": "Knowledge distillation (KD) is widely used for compressing a teacher model to reduce its inference cost and memory footprint, by training a smaller student model. However, current KD methods for auto-regressive sequence models suffer from distribution mismatch between output sequences seen during training and those generated by the student during inference. To address this issue, we introduce Generalized Knowledge Distillation (GKD). Instead of solely relying on a fixed set of output sequences, GKD trains the student on its self-generated output sequences by leveraging feedback from the teacher on such sequences. Unlike supervised KD approaches, GKD also offers the flexibility to employ alternative loss functions between the student and teacher, which can be useful when the student lacks the expressivity to mimic the teacher's distribution. Furthermore, GKD facilitates the seamless integration of distillation with RL fine-tuning (RLHF). We demonstrate the efficacy of GKD for distilling auto-regressive T5 language models on summarization, translation, and arithmetic reasoning tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3zKtaqxLhW",
    "arxiv_id": "2306.13649",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19483,
    "title": "REBAR: Retrieval-Based Reconstruction for Time-series Contrastive Learning",
    "authors": [
      "Maxwell Xu",
      "Alexander Moreno",
      "Hui Wei",
      "Benjamin Marlin",
      "James Matthew Rehg"
    ],
    "abstract": "The success of self-supervised contrastive learning hinges on identifying positive data pairs that, when pushed together in embedding space, encode useful information for subsequent downstream tasks. However, in time-series, this is challenging because creating positive pairs via augmentations may break the original semantic meaning. We hypothesize that if we can retrieve information from one subsequence to successfully reconstruct another subsequence, then they should form a positive pair. Harnessing this intuition, we introduce our novel approach: REtrieval-BAsed Reconstruction (REBAR) contrastive learning. First, we utilize a convolutional cross-attention architecture to calculate the REBAR error between two different time-series. Then, through validation experiments, we show that REBAR error is a predictor for mutual class membership, justifying its usage as a positive/negative labeler. Finally, once integrated into a contrastive learning framework, our REBAR method is able to learn an embedding that achieves state-of-the-art performance on downstream tasks across diverse modalities.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3zQo5oUvia",
    "arxiv_id": "2311.00519",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17681,
    "title": "An Efficient Membership Inference Attack for the Diffusion Model by Proximal Initialization",
    "authors": [
      "Fei Kong",
      "Jinhao Duan",
      "RuiPeng Ma",
      "Heng Tao Shen",
      "Xiaoshuang Shi",
      "Xiaofeng Zhu",
      "Kaidi Xu"
    ],
    "abstract": "Recently, diffusion models have achieved remarkable success in generating tasks, including image and audio generation. However, like other generative models, diffusion models are prone to privacy issues. In this paper, we propose an efficient query-based membership inference attack (MIA), namely Proximal Initialization Attack (PIA), which utilizes groundtruth trajectory obtained by $\\epsilon$ initialized in $t=0$ and predicted point to infer memberships. Experimental results indicate that the proposed method can achieve competitive performance with only two queries on both discrete-time and continuous-time diffusion models. Moreover, previous works on the privacy of diffusion models have focused on vision tasks without considering audio tasks. Therefore, we also explore the robustness of diffusion models to MIA in the text-to-speech (TTS) task, which is an audio generation task. To the best of our knowledge, this work is the first to study the robustness of diffusion models to MIA in the TTS task. Experimental results indicate that models with mel-spectrogram (image-like) output are vulnerable to MIA, while models with audio output are relatively robust to MIA.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rpH9FcCEV6",
    "arxiv_id": "2305.18355",
    "GitHub": [
      "https://github.com/kong13661/PIA"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19482,
    "title": "DORSal: Diffusion for Object-centric Representations of Scenes $\\textit{et al.}$",
    "authors": [
      "Allan Jabri",
      "Sjoerd van Steenkiste",
      "Emiel Hoogeboom",
      "Mehdi S. M. Sajjadi",
      "Thomas Kipf"
    ],
    "abstract": "Recent progress in 3D scene understanding enables scalable learning of representations across large datasets of diverse scenes. As a consequence, generalization to unseen scenes and objects, rendering novel views from just a single or a handful of input images, and controllable scene generation that supports editing, is now possible. However, training jointly on a large number of scenes typically compromises rendering quality when compared to single-scene optimized models such as NeRFs. In this paper, we leverage recent progress in diffusion models to equip 3D scene representation learning models with the ability to render high-fidelity novel views, while retaining benefits such as object-level scene editing to a large degree. In particular, we propose DORSal, which adapts a video diffusion architecture for 3D scene generation conditioned on frozen object-centric slot-based representations of scenes. On both complex synthetic multi-object scenes and on the real-world large-scale Street View dataset, we show that DORSal enables scalable neural rendering of 3D scenes with object-level editing and improves upon existing approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3zvB14IF6D",
    "arxiv_id": "2306.08068",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19481,
    "title": "Neural Rate Control for Learned Video Compression",
    "authors": [
      "Yiwei Zhang",
      "Guo Lu",
      "Yunuo Chen",
      "Shen Wang",
      "Yibo Shi",
      "Jing Wang",
      "Li Song"
    ],
    "abstract": "The learning-based video compression method has made significant progress in recent years, exhibiting promising compression performance compared with traditional video codecs. However, prior works have primarily focused on advanced compression architectures while neglecting the rate control technique. Rate control can precisely control the coding bitrate with optimal compression performance, which is a critical technique in practical deployment. To address this issue, we present a fully neural network-based rate control system for learned video compression methods. Our system accurately encodes videos at a given bitrate while enhancing the rate-distortion performance. Specifically, we first design a rate allocation model to assign optimal bitrates to each frame based on their varying spatial and temporal characteristics. Then, we propose a deep learning-based rate implementation network to perform the rate-parameter mapping, precisely predicting coding parameters for a given rate. Our proposed rate control system can be easily integrated into existing learning-based video compression methods. The extensive experimental results show that the proposed method achieves accurate rate control on several baseline methods while also improving overall rate-distortion performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=42lcaojZug",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19480,
    "title": "Understanding Expressivity of GNN in Rule Learning",
    "authors": [
      "Haiquan Qiu",
      "Yongqi Zhang",
      "Yong Li",
      "quanming yao"
    ],
    "abstract": "Knowledge graph (KG) reasoning refers to the task of deducing new facts from the existing facts in KG, which has been applied in many fields. Recently, Graph Neural Networks (GNNs) with tail entity scoring achieve the state-of-the-art performance on KG reasoning. However, the theoretical understandings for these GNNs are either lacking or focusing on single-relational graphs, leaving what the kind of rule structures these GNNs can learn an open problem. We propose to fill the above gap in this paper. Specifically, GNNs with tail entity scoring are unified into a common framework. Then, we analyze their expressivity by formally describing the rule structures they can learn and theoretically demonstrating their superiority. These results further inspire us to propose a novel labeling strategy to learn more rule structures in KG reasoning. Experimental results are consistent with our theoretical findings and verify the effectiveness of our proposed method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=43cYe4oogi",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19479,
    "title": "OPTIMAL ROBUST MEMORIZATION WITH RELU NEURAL NETWORKS",
    "authors": [
      "Lijia Yu",
      "Xiao-Shan Gao",
      "Lijun Zhang"
    ],
    "abstract": "Memorization with neural networks is to study the expressive power of neural networks to interpolate a finite classification data set, which is closely related to the generalizability of deep learning. However, the important problem of robust memorization has not been thoroughly studied. In this paper, several basic problems about robust memorization are solved. First, we prove that it is NP-hard to compute neural networks with certain simple structures, which are robust memorization. A network hypothesis space is called optimal robust memorization for a data set if it can achieve robust memorization for any budget less than half the separation bound of the data set. Second, we explicitly construct neural networks with O(N n) parameters for optimal robust memorization of any data set with dimension n and size N . We also give a lower bound for the width of networks to achieve optimal robust memorization. Finally, we explicitly construct neural networks withO(N n log n) parameters for optimal robust memorization of any binary classification data set by controlling the Lipschitz constant of the network.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=47hDbAMLbc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19478,
    "title": "Language Model Decoding as Direct Metrics Optimization",
    "authors": [
      "Haozhe Ji",
      "Pei Ke",
      "Hongning Wang",
      "Minlie Huang"
    ],
    "abstract": "Despite the remarkable advances in language modeling, current mainstream decoding methods still struggle to generate texts that align with human texts across different aspects. In particular, sampling-based methods produce less-repetitive texts which are often disjunctive in discourse, while search-based methods maintain topic coherence at the cost of increased repetition. Overall, these methods fall short in achieving holistic alignment across a broad range of aspects. In this work, we frame decoding from a language model as an optimization problem with the goal of strictly matching the expected performance with human texts measured by multiple metrics of desired aspects simultaneously. The resulting decoding distribution enjoys an analytical solution that scales the input language model distribution via a sequence-level energy function defined by these metrics. And most importantly, we prove that this induced distribution is guaranteed to improve the perplexity on human texts, which suggests a better approximation to the underlying distribution of human texts. To facilitate tractable sampling from this globally normalized distribution, we adopt the Sampling-Importance-Resampling technique. Experiments on various domains and model scales demonstrate the superiority of our method in metrics alignment with human texts and human evaluation over strong baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=488A64eOf6",
    "arxiv_id": "2310.01041",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18091,
    "title": "Kosmos-G: Generating Images in Context with Multimodal Large Language Models",
    "authors": [
      "Xichen Pan",
      "Li Dong",
      "Shaohan Huang",
      "Zhiliang Peng",
      "Wenhu Chen",
      "Furu Wei"
    ],
    "abstract": "Recent advancements in text-to-image (T2I) and vision-language-to-image (VL2I) generation have made significant strides. However, the generation from generalized vision-language inputs, especially involving multiple images, remains under-explored. This paper presents Kosmos-G, a model that leverages the advanced perception capabilities of Multimodal Large Language Models (MLLMs) to tackle the aforementioned challenge. Our approach aligns the output space of MLLM with CLIP using the textual modality as an anchor and performs compositional instruction tuning on curated data. Kosmos-G demonstrates a unique capability of zero-shot multi-entity subject-driven generation. Notably, the score distillation instruction tuning requires no modifications to the image decoder. This allows for a seamless substitution of CLIP and effortless integration with a myriad of U-Net techniques ranging from fine-grained controls to personalized image decoder variants. We posit Kosmos-G as an initial attempt towards the goal of ``image as a foreign language in image generation.''",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=he6mX9LTyE",
    "arxiv_id": "2310.02992",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19477,
    "title": "LCOT: Linear Circular Optimal Transport",
    "authors": [
      "Rocio P Diaz Martin",
      "Ivan Vladimir Medri",
      "Yikun Bai",
      "Xinran Liu",
      "Kangbai Yan",
      "Gustavo Rohde",
      "Soheil Kolouri"
    ],
    "abstract": "The optimal transport problem for measures supported on non-Euclidean spaces has recently gained ample interest in diverse applications involving representation learning. In this paper, we focus on circular probability measures, i.e., probability measures supported on the unit circle, and introduce a new computationally efficient metric for these measures, denoted as Linear Circular Optimal Transport (LCOT). The proposed metric comes with an explicit linear embedding that allows one to apply Machine Learning (ML) algorithms to the embedded measures and seamlessly modify the underlying metric for the ML algorithm to LCOT. We show that the proposed metric is rooted in the Circular Optimal Transport (COT) and can be considered the linearization of the COT metric with respect to a fixed reference measure. We provide a theoretical analysis of the proposed metric and derive the computational complexities for pairwise comparison of circular probability measures. Lastly, through a set of numerical experiments, we demonstrate the benefits of LCOT in learning representations from circular measures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=49z97Y9lMq",
    "arxiv_id": "2310.06002",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17934,
    "title": "Grounding Multimodal Large Language Models to the World",
    "authors": [
      "Zhiliang Peng",
      "Wenhui Wang",
      "Li Dong",
      "Yaru Hao",
      "Shaohan Huang",
      "Shuming Ma",
      "Qixiang Ye",
      "Furu Wei"
    ],
    "abstract": "We introduce Kosmos-2, a Multimodal Large Language Model (MLLM), enabling new capabilities of perceiving object descriptions (e.g., bounding boxes) and grounding text to the visual world. Specifically, we represent text spans (i.e., referring expressions and noun phrases) as links in Markdown, i.e., [text span](bounding boxes), where object descriptions are sequences of location tokens. To train the model, we construct a large-scale dataset about grounded image-text pairs (GrIT) together with multimodal corpora. In addition to the existing capabilities of MLLMs (e.g., perceiving general modalities, following instructions, and performing in-context learning), Kosmos-2 integrates the grounding capability to downstream applications, while maintaining the conventional capabilities of MLLMs (e.g., perceiving general modalities, following instructions, and performing in-context learning). Kosmos-2 is evaluated on a wide range of tasks, including (i) multimodal grounding, such as referring expression comprehension and phrase grounding, (ii) multimodal referring, such as referring expression generation, (iii) perception-language tasks, and (iv) language understanding and generation. This study sheds a light on the big convergence of language, multimodal perception, and world modeling, which is a key step toward artificial general intelligence. Code can be found in the supplementary material.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lLmqxkfSIw",
    "arxiv_id": "2306.14824",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19475,
    "title": "Chameleon: Increasing Label-Only Membership Leakage with Adaptive Poisoning",
    "authors": [
      "Harsh Chaudhari",
      "Giorgio Severi",
      "Alina Oprea",
      "Jonathan Ullman"
    ],
    "abstract": "Integration of Machine Learning (ML) in numerous critical applications introduces a range of privacy concerns for individuals who provide their datasets for ML training purposes. One such privacy risk is Membership Inference (MI), in which an adversary seeks to determine whether a particular data point was included in the training dataset of a model. Current state-of-the-art MI approaches capitalize on access to the model\u2019s predicted confidence scores to successfully perform membership inference, and employ data poisoning to further enhance their effectiveness. In this work, we  focus on the less explored and more realistic label-only setting, where the model provides only the predicted label as output. We show that existing label-only attacks are ineffective at inferring membership in the low False Positive Rate (FPR) regime. To address this challenge,  we propose a new attack Chameleon that leverages a novel data poisoning strategy and an efficient query selection method to achieve significantly more accurate membership inference than existing label-only attacks, especially for low FPRs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4DoSULcfG6",
    "arxiv_id": "2310.03838",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19474,
    "title": "One For All: Towards Training One Graph Model For All Classification Tasks",
    "authors": [
      "Hao Liu",
      "Jiarui Feng",
      "Lecheng Kong",
      "Ningyue Liang",
      "Dacheng Tao",
      "Yixin Chen",
      "Muhan Zhang"
    ],
    "abstract": "Designing a single model that addresses multiple tasks has been a long-standing objective in artificial intelligence. Recently, large language models have demonstrated exceptional capability in integrating and solving different tasks within the language domain. However, a unified model for various tasks on graphs remains underexplored, primarily due to the challenges unique to the graph learning domain. First, graph data from different areas carry distinct attributes and follow different distributions. Such discrepancy makes it difficult to represent graphs in a single representation space. Second, tasks on graphs diversify into node, link, and graph tasks, requiring distinct embedding strategies. Finally, an appropriate graph prompting paradigm for in-context learning is unclear. Striving to handle all the aforementioned challenges, we propose **One for All (OFA)**, the first general framework that can use a single graph model to address the above challenges. Specifically, OFA proposes text-attributed graphs to unify different graph data by describing nodes and edges with natural language and uses language models to encode the diverse and possibly cross-domain text attributes to feature vectors in the same embedding space. Furthermore, OFA introduces the concept of nodes-of-interest to standardize different tasks with a single task representation. For in-context learning on graphs, OFA introduces a novel graph prompting paradigm that appends prompting substructures to the input graph, which enables it to address varied tasks without fine-tuning. We train the OFA model using graph data from multiple domains (including citation networks, molecular graphs, knowledge graphs, etc.) simultaneously and evaluate its ability in supervised, few-shot, and zero-shot learning scenarios. OFA performs well across different tasks, making it the first general-purpose graph classification model across domains.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=4IT2pgc9v6",
    "arxiv_id": "2310.00149",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19473,
    "title": "The Devil is in the Object Boundary: Towards Annotation-free Instance Segmentation using Foundation Models",
    "authors": [
      "Cheng Shi",
      "Sibei Yang"
    ],
    "abstract": "Foundation models, pre-trained on a large amount of data have demonstrated impressive zero-shot capabilities in various downstream tasks. However, in object detection and instance segmentation, two fundamental computer vision tasks heavily reliant on extensive human annotations, foundation models such as SAM and DINO struggle to achieve satisfactory performance. In this study, we reveal that the devil is in the object boundary, $\\textit{i.e.}$, these foundation models fail to discern boundaries between individual objects. For the first time, we probe that CLIP, which has never accessed any instance-level annotations, can provide a highly beneficial and strong instance-level boundary prior in the clustering results of its particular intermediate layer. Following this surprising observation, we propose $\\textbf{\\textit{Zip}}$ which $\\textbf{Z}$ips up CL$\\textbf{ip}$ and SAM in a novel classification-first-then-discovery pipeline, enabling annotation-free, complex-scene-capable, open-vocabulary object detection and instance segmentation. Our Zip significantly boosts SAM's mask AP on COCO dataset by 12.5\\% and establishes state-of-the-art performance in various settings, including training-free, self-training, and label-efficient finetuning. Furthermore, annotation-free Zip even achieves comparable performance to the best-performing open-vocabulary object detecters using base annotations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4JbrdrHxYy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19472,
    "title": "Neurosymbolic Grounding for Compositional World Models",
    "authors": [
      "Atharva Sehgal",
      "Arya Grayeli",
      "Jennifer J. Sun",
      "Swarat Chaudhuri"
    ],
    "abstract": "We introduce Cosmos, a framework for object-centric world modeling that is designed for compositional generalization (CG), i.e., high performance on unseen input scenes obtained through the composition of known visual \"atoms.\" The central insight behind Cosmos is the use of a novel form of neurosymbolic grounding. Specifically, the framework introduces two new tools: (i) neurosymbolic scene encodings, which represent each entity in a scene using a real vector computed using a neural encoder, as well as a vector of composable symbols describing attributes of the entity, and (ii) a neurosymbolic attention mechanism that binds these entities to learned rules of interaction. Cosmos is end-to-end differentiable; also, unlike traditional neurosymbolic methods that require representations to be manually mapped to symbols, it computes an entity's symbolic attributes using vision-language foundation models. Through an evaluation that considers two different forms of CG on an established blocks-pushing domain, we show that the framework establishes a new state-of-the-art for CG in world modeling.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4KZpDGD4Nh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17640,
    "title": "Let Models Speak Ciphers: Multiagent Debate through Embeddings",
    "authors": [
      "Chau Pham",
      "Boyi Liu",
      "Yingxiang Yang",
      "Zhengyu Chen",
      "Tianyi Liu",
      "Jianbo Yuan",
      "Bryan A. Plummer",
      "Zhaoran Wang",
      "Hongxia Yang"
    ],
    "abstract": "Discussion and debate among Large Language Models (LLMs) have gained considerable attention due to their potential to enhance the reasoning ability of LLMs. Although natural language is an obvious choice for communication due to LLM's language understanding capability, the token sampling step needed when generating natural language poses a potential risk of information loss, as it uses only one token to represent the model's belief across the entire vocabulary. In this paper, we introduce a communication regime named CIPHER (Communicative Inter-Model Protocol Through Embedding Representation) to address this issue. Specifically, we remove the token sampling step from LLMs and let them communicate their beliefs across the vocabulary through the expectation of the raw transformer output embeddings. Remarkably, by deviating from natural language, CIPHER offers an advantage of encoding a broader spectrum of information without any modification to the model weights, outperforming the state-of-the-art LLM debate methods using natural language by 1-3.5% across five reasoning tasks and multiple open-source LLMs of varying sizes. This showcases the superiority and robustness of embeddings as an alternative ``language\" for communication among LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sehRvaIPQQ",
    "arxiv_id": "2310.06272",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19471,
    "title": "Curiosity-driven Red-teaming for Large Language Models",
    "authors": [
      "Zhang-Wei Hong",
      "Idan Shenfeld",
      "Tsun-Hsuan Wang",
      "Yung-Sung Chuang",
      "Aldo Pareja",
      "James R. Glass",
      "Akash Srivastava",
      "Pulkit Agrawal"
    ],
    "abstract": "Large language models (LLMs) hold great potential for various natural language applications but risk generating incorrect or toxic content. In order to probe when an LLM generates unwanted content, the current paradigm is to recruit human testers to create input prompts (i.e., test cases) designed to elicit unfavorable responses from LLMs. This procedure is called red teaming. However, relying solely on human testers can be both expensive and time-consuming. Recent works automate red teaming by training LLMs (i.e., red team LLMs) with reinforcement learning (RL) to maximize the chance of eliciting undesirable responses (i.e., successful test cases) from the target LLMs being evaluated. However, while effective at provoking undesired responses, current RL methods lack test case diversity as RL-based methods tend to consistently generate the same few successful test cases once found. To overcome this limitation, we introduce curiosity-driven exploration to train red team models. This approach jointly maximizes the test case effectiveness and novelty. Maximizing novelty motivates the red-team model to search for new and diverse test cases. We evaluate our method by performing red teaming against LLMs in text continuation and instruction following tasks. Our experiments show that curiosity-driven exploration achieves greater diversity in all the experiments compared to existing RL-based red team methods while maintaining effectiveness. Remarkably, curiosity-driven exploration also enhances the effectiveness when performing red teaming in instruction following test cases, generating a higher number of successful test cases. We even demonstrate that curiosity-driven exploration successfully provokes toxic responses from the LLaMA2 model that has undergone finetuning based on human preferences.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4KqkizXgXU",
    "arxiv_id": "2402.19464",
    "GitHub": [
      "https://github.com/Improbable-AI/curiosity_redteam"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19181,
    "title": "Energy-based Automated Model Evaluation",
    "authors": [
      "Ru Peng",
      "Heming Zou",
      "Haobo Wang",
      "Yawen Zeng",
      "Zenan Huang",
      "Junbo Zhao"
    ],
    "abstract": "The conventional evaluation protocols on machine learning models rely heavily on a labeled, i.i.d-assumed testing dataset, which is not often present in real-world applications.The Automated Model Evaluation (AutoEval) shows an alternative to this traditional workflow, by forming a proximal prediction pipeline of the testing performance without the presence of ground-truth labels.Despite its recent successes, the AutoEval frameworks still suffer from an overconfidence issue, substantial storage and computational cost.In that regard, we propose a novel measure --- Meta-Distribution Energy (MDE) that allows the AutoEval framework to be both more efficient and effective.The core of the MDE is to establish a meta-distribution statistic, on the information (energy) associated with individual samples, then offer a smoother representation enabled by energy-based learning.We further provide our theoretical insights by connecting the MDE with the classification loss.We provide extensive experiments across modalities, datasets and different architectural backbones to validate MDE's validity, together with its superiority compared with prior approaches.We also prove MDE's versatility by showing its seamless integration with large-scale models, and easy adaption to learning scenarios with noisy- or imbalanced- labels.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CHGcP6lVWd",
    "arxiv_id": "2401.12689",
    "GitHub": [
      "https://github.com/pengr/Energy_AutoEval"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19469,
    "title": "Deep Reinforcement Learning for Modelling Protein Complexes",
    "authors": [
      "Ziqi Gao",
      "Tao Feng",
      "Jiaxuan You",
      "Chenyi Zi",
      "Yan Zhou",
      "Chen Zhang",
      "Jia Li"
    ],
    "abstract": "Structure prediction of large protein complexes (a.k.a., protein multimer mod-elling, PMM) can be achieved through the one-by-one assembly using provideddimer structures and predicted docking paths. However, existing PMM methodsstruggle with vast search spaces and generalization challenges: (1) The assemblyof a N -chain multimer can be depicted using graph structured data, with eachchain represented as a node and assembly actions as edges. Thus the assemblygraph can be arbitrary acyclic undirected connected graph, leading to the com-binatorial optimization space of N^(N \u22122) for the PMM problem. (2) Knowledgetransfer in the PMM task is non-trivial. The gradually limited data availability asthe chain number increases necessitates PMM models that can generalize acrossmultimers of various chains. To address these challenges, we propose GAPN, aGenerative Adversarial Policy Network powered by domain-specific rewards andadversarial loss through policy gradient for automatic PMM prediction. Specifi-cally, GAPN learns to efficiently search through the immense assembly space andoptimize the direct docking reward through policy gradient. Importantly, we de-sign a adversarial reward function to enhance the receptive field of our model. Inthis way, GAPN will simultaneously focus on a specific batch of multimers andthe global assembly rules learned from multimers with varying chain numbers.Empirically, we have achieved both significant accuracy (measured by RMSDand TM-Score) and efficiency improvements compared to leading complex mod-eling software. GAPN outperforms the state-of-the-art method (MoLPC) with upto 27% improvement in TM-Score, with a speed-up of 600\u00d7.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4MsfQ2H0lP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19468,
    "title": "Weakly-supervised Audio Separation via Bi-modal Semantic Similarity",
    "authors": [
      "Tanvir Mahmud",
      "Saeed Amizadeh",
      "Kazuhito Koishida",
      "Diana Marculescu"
    ],
    "abstract": "Conditional sound separation in multi-source audio mixtures without having access to single source sound data during training is a long standing challenge. Existing mix-and-separate based methods suffer from significant performance drop with multi-source training mixtures due to the lack of supervision signal for single source separation cases during training. However, in the case of language-conditional audio separation, we do have access to corresponding text descriptions for each audio mixture in our training data, which can be seen as (rough) representations of the audio samples in the language modality. That raises the curious question of how to generate supervision signal for single-source audio extraction by leveraging the fact that single-source sounding language entities can be easily extracted from the text description. To this end, in this paper, we propose a generic bi-modal separation framework which can enhance the existing unsupervised frameworks to separate single-source signals in a target modality (i.e., audio) using the easily separable corresponding signals in the conditioning modality (i.e., language), without having access to single-source samples in the target modality during training. We empirically show that this is well within reach if we have access to a pretrained joint embedding model between the two modalities (i.e., CLAP). Furthermore, we propose to incorporate our framework into two fundamental scenarios to enhance separation performance. First, we show that our proposed methodology significantly improves the performance of purely unsupervised baselines by reducing the distribution shift between training and test samples. In particular, we show that our framework can achieve 71% boost in terms of Signal-to-Distortion Ratio (SDR) over the baseline, reaching 97.5% of the supervised learning performance. Second, we show that we can further improve the performance of the supervised learning itself by 17% if we augment it by our proposed weakly-supervised framework. Our framework achieves this by making large corpora of unsupervised data available to the supervised learning model as well as utilizing a natural, robust regularization mechanism through weak supervision from the language modality, and hence enabling a powerful semi-supervised framework for audio separation. Our code base and checkpoints will be released for further research and reproducibility.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4N97bz1sP6",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18944,
    "title": "Koopman-based generalization bound: New aspect for full-rank weights",
    "authors": [
      "Yuka Hashimoto",
      "Sho Sonoda",
      "Isao Ishikawa",
      "Atsushi Nitanda",
      "Taiji Suzuki"
    ],
    "abstract": "We propose a new bound for generalization of neural networks using Koopman operators. Whereas most of existing works focus on low-rank weight matrices, we focus on full-rank weight matrices. Our bound is tighter than existing norm-based bounds when the condition numbers of weight matrices are small. Especially, it is completely independent of the width of the network if the weight matrices are orthogonal. Our bound does not contradict to the existing bounds but is a complement to the existing bounds. As supported by several existing empirical results, low-rankness is not the only reason for generalization. Furthermore, our bound can be combined with the existing bounds to obtain a tighter bound. Our result sheds new light on understanding generalization of neural networks with full-rank weight matrices, and it provides a connection between operator-theoretic analysis and generalization of neural networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JN7TcCm9LF",
    "arxiv_id": "2302.05825",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19467,
    "title": "DAM: Towards a Foundation Model for Forecasting",
    "authors": [
      "Luke Nicholas Darlow",
      "Qiwen Deng",
      "Ahmed Hassan",
      "Martin Asenov",
      "Rajkarn Singh",
      "Artjom Joosen",
      "Adam Barker",
      "Amos Storkey"
    ],
    "abstract": "It is challenging to scale time series forecasting models such that they forecast accurately for multiple distinct domains and datasets, all with potentially different underlying collection procedures (e.g., sample resolution), patterns (e.g., periodicity), and prediction requirements (e.g., reconstruction vs. forecasting). We call this general task universal forecasting. Existing methods usually assume that input data is regularly sampled, and they forecast to pre-determined horizons, resulting in failure to generalise outside of the scope of their training. We propose the DAM - a neural model that takes randomly sampled histories and outputs an adjustable basis composition as a continuous function of time for forecasting to non-fixed horizons. It involves three key components: (1) a flexible approach for using randomly sampled histories, from a long-tail distribution, that enables an efficient global perspective of the underlying temporal dynamics while retaining focus on the recent history; (2) a transformer backbone that is trained on these actively sampled histories to produce, as representational output, (3) the basis coefficients of a continuous function of time. We show that a single DAM, trained on 10 common time series datasets, either outperformed or closely matched existing SoTA models, even though those models were trained to specialise on specific dataset and horizon combinations. The DAM also performs well at imputation, transfers well to held-out datasets, is interpretable via its basis function composition and the attention mechanism it uses, can be tuned for different inference-cost requirements, is easy to deploy, is robust to missing and irregularly sampled data by design, and can forecast effectively to distant horizons without adaptation or repeated autoregressive prediction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4NhMhElWqP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19466,
    "title": "Rayleigh Quotient Graph Neural Networks for Graph-level Anomaly Detection",
    "authors": [
      "Xiangyu Dong",
      "Xingyi Zhang",
      "Sibo Wang"
    ],
    "abstract": "Graph-level anomaly detection has gained significant attention as it finds many applications in various domains, such as cancer diagnosis and enzyme prediction. However, existing methods fail to capture the underlying properties of graph anomalies, resulting in unexplainable framework design and unsatisfying performance. In this paper, we take a step back and re-investigate the spectral differences between anomalous and normal graphs. Our main observation shows a significant disparity in the accumulated spectral energy between these two classes. Moreover, we prove that the accumulated spectral energy of the graph signal can be represented by its Rayleigh Quotient, indicating that the Rayleigh Quotient is a driving factor behind the anomalous properties of graphs. Motivated by this, we propose Rayleigh Quotient Graph Neural Network (RQGNN), the first spectral GNN for graph-level anomaly detection, providing a new perspective on exploring the inherent spectral features of anomalous graphs. Specifically, we introduce a novel framework that consists of two components: the Rayleigh Quotient learning component (RQL) and Chebyshev Wavelet GNN with RQ-pooling (CWGNN-RQ). RQL explicitly captures the Rayleigh Quotient of graphs and CWGNN-RQ implicitly explores the spectral space of graphs. Extensive experiments on 10 real-world datasets show that RQGNN outperforms the best rival by 6.74% in Macro-F1 score and 1.44% in AUC, demonstrating the effectiveness of our framework.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4UIBysXjVq",
    "arxiv_id": "2310.02861",
    "GitHub": [
      "https://github.com/xydong127/RQGNN"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19465,
    "title": "Locality-Aware Graph Rewiring in GNNs",
    "authors": [
      "Federico Barbero",
      "Ameya Velingker",
      "Amin Saberi",
      "Michael M. Bronstein",
      "Francesco Di Giovanni"
    ],
    "abstract": "Graph Neural Networks (GNNs) are popular models for machine learning on graphs that typically follow the message-passing paradigm, whereby the feature of a node is updated recursively upon aggregating information over its neighbors. While exchanging messages over the input graph endows GNNs with a strong inductive bias, it can also make GNNs susceptible to \\emph{over-squashing}, thereby preventing them from capturing long-range interactions in the given graph. To rectify this issue, {\\em graph rewiring} techniques have been proposed as a means of improving information flow by altering the graph connectivity. In this work, we identify three desiderata for graph-rewiring: (i) reduce over-squashing, (ii) respect the locality of the graph, and (iii) preserve the sparsity of the graph. We highlight fundamental trade-offs that occur between {\\em spatial} and {\\em spectral} rewiring techniques; while the former often satisfy (i) and (ii) but not (iii), the latter generally satisfy (i) and (iii) at the expense of (ii). We propose a novel rewiring framework that satisfies all of (i)--(iii) through a locality-aware sequence of rewiring operations. We then discuss a specific instance of such rewiring framework and validate its effectiveness on several real-world benchmarks, showing that it either matches or significantly outperforms existing rewiring approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4Ua4hKiAJX",
    "arxiv_id": "2310.01668",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19464,
    "title": "Coordinate-Aware Modulation for Neural Fields",
    "authors": [
      "Joo Chan Lee",
      "Daniel Rho",
      "Seungtae Nam",
      "Jong Hwan Ko",
      "Eunbyung Park"
    ],
    "abstract": "Neural fields, mapping low-dimensional input coordinates to corresponding signals, have shown promising results in representing various signals. Numerous methodologies have been proposed, and techniques employing MLPs and grid representations have achieved substantial success. MLPs allow compact and high expressibility, yet often suffer from spectral bias and slow convergence speed. On the other hand, methods using grids are free from spectral bias and achieve fast training speed, however, at the expense of high spatial complexity. In this work, we propose a novel way for exploiting both MLPs and grid representations in neural fields. Unlike the prevalent methods that combine them sequentially (extract features from the grids first and feed them to the MLP), we inject spectral bias-free grid representations into the intermediate features in the MLP. More specifically, we suggest a Coordinate-Aware Modulation (CAM), which modulates the intermediate features using scale and shift parameters extracted from the grid representations. This can maintain the strengths of MLPs while mitigating any remaining potential biases, facilitating the rapid learning of high-frequency components. In addition, we empirically found that the feature normalizations, which have not been successful in neural filed literature, proved to be effective when applied in conjunction with the proposed CAM. Experimental results demonstrate that CAM enhances the performance of neural representation and improves learning stability across a range of signals. Especially in the novel view synthesis task, we achieved state-of-the-art performance with the least number of parameters and fast training speed for dynamic scenes and the best performance under 1MB memory for static scenes. CAM also outperforms the best-performing video compression methods using neural fields by a large margin.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=4UiLqimGm5",
    "arxiv_id": "2311.14993",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19463,
    "title": "Towards Non-Asymptotic Convergence for Diffusion-Based Generative Models",
    "authors": [
      "Gen Li",
      "Yuting Wei",
      "Yuxin Chen",
      "Yuejie Chi"
    ],
    "abstract": "Diffusion models, which convert noise into new data instances by learning to reverse a Markov diffusion process, have become a cornerstone in contemporary generative modeling. While their practical power has now been widely recognized, the theoretical underpinnings remain far from mature.  In this work, we develop a suite of non-asymptotic theory towards understanding the data generation process of diffusion models in discrete time, assuming access to $\\ell_2$-accurate estimates of the (Stein) score functions. For a popular deterministic sampler (based on the probability flow ODE), we establish a convergence rate proportional to $1/T$ (with $T$ the total number of steps), improving upon past results; for another mainstream stochastic sampler (i.e., a type of the denoising diffusion probabilistic model), we derive a convergence rate proportional to $1/\\sqrt{T}$, matching the state-of-the-art theory. Imposing only minimal assumptions on the target data distribution (e.g., no smoothness assumption is imposed), our results characterize how $\\ell_2$ score estimation errors affect the quality of the data generation process.  In contrast to prior works, our theory is developed based on an elementary yet versatile non-asymptotic approach without resorting to toolboxes for SDEs and ODEs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4VGEeER6W9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19462,
    "title": "Stable Neural Stochastic Differential Equations in Analyzing Irregular Time Series Data",
    "authors": [
      "YongKyung Oh",
      "Dongyoung Lim",
      "Sungil Kim"
    ],
    "abstract": "Irregular sampling intervals and missing values in real-world time series data present challenges for conventional methods that assume consistent intervals and complete data. Neural Ordinary Differential Equations (Neural ODEs) offer an alternative approach, utilizing neural networks combined with ODE solvers to learn continuous latent representations through parameterized vector fields. Neural Stochastic Differential Equations (Neural SDEs) extend Neural ODEs by incorporating a diffusion term, although this addition is not trivial, particularly when addressing irregular intervals and missing values. Consequently, careful design of drift and diffusion functions is crucial for maintaining stability and enhancing performance, while incautious choices can result in adverse properties such as the absence of strong solutions, stochastic destabilization, or unstable Euler discretizations, significantly affecting Neural SDEs' performance. In this study, we propose three stable classes of Neural SDEs: Langevin-type SDE, Linear Noise SDE, and Geometric SDE. Then, we rigorously demonstrate their robustness in maintaining excellent performance under distribution shift, while effectively preventing overfitting. To assess the effectiveness of our approach, we conduct extensive experiments on four benchmark datasets for interpolation, forecasting, and classification tasks, and analyze the robustness of our methods with 30 public datasets under different missing rates. Our results demonstrate the efficacy of the proposed method in handling real-world irregular time series data.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=4VIgNuQ1pY",
    "arxiv_id": "2402.14989",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19460,
    "title": "Learning from Sparse Offline Datasets via Conservative Density Estimation",
    "authors": [
      "Zhepeng Cen",
      "Zuxin Liu",
      "Zitong Wang",
      "Yihang Yao",
      "Henry Lam",
      "Ding Zhao"
    ],
    "abstract": "Offline reinforcement learning (RL) offers a promising direction for learning policies from pre-collected datasets without requiring further interactions with the environment. However, existing methods struggle to handle out-of-distribution (OOD) extrapolation errors, especially in sparse reward or scarce data settings. In this paper, we propose a novel training algorithm called Conservative Density Estimation (CDE), which addresses this challenge by explicitly imposing constraints on the state-action occupancy stationary distribution. CDE overcomes the limitations of existing approaches, such as the stationary distribution correction method, by addressing the support mismatch issue in marginal importance sampling. Our method achieves state-of-the-art performance on the D4RL benchmark. Notably, CDE consistently outperforms baselines in challenging tasks with sparse rewards or insufficient data, demonstrating the advantages of our approach in addressing the extrapolation error problem in offline RL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4WM0OogPTx",
    "arxiv_id": "2401.08819",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19459,
    "title": "Llemma: An Open Language Model for Mathematics",
    "authors": [
      "Zhangir Azerbayev",
      "Hailey Schoelkopf",
      "Keiran Paster",
      "Marco Dos Santos",
      "Stephen Marcus McAleer",
      "Albert Q. Jiang",
      "Jia Deng",
      "Stella Biderman",
      "Sean Welleck"
    ],
    "abstract": "We present Llemma, a large language model for mathematics. We continue pretraining Code Llama on the Proof-Pile-2, a mixture of scientific papers, web data containing mathematics, and mathematical code, yielding Llemma. On the MATH benchmark Llemma outperforms all known openly released models, as well as the unreleased Minerva model suite on an equi-parameter basis. Moreover, Llemma is capable of tool use and formal theorem proving without any finetuning. We openly release all artifacts, including 7 billion and 34 billion parameter models, the Proof-Pile-2, and code to replicate our experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4WnqRR915j",
    "arxiv_id": "2310.10631",
    "GitHub": [
      "https://github.com/EleutherAI/math-lm"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19458,
    "title": "NfgTransformer: Equivariant Representation Learning for Normal-form Games",
    "authors": [
      "Siqi Liu",
      "Luke Marris",
      "Georgios Piliouras",
      "Ian Gemp",
      "Nicolas Heess"
    ],
    "abstract": "Normal-form games (NFGs) are the fundamental model of *strategic interaction*. We study their representation using neural networks. We describe the inherent equivariance of NFGs --- any permutation of strategies describes an equivalent game --- as well as the challenges this poses for representation learning. We then propose the NfgTransformer architecture that leverages this equivariance, leading to state-of-the-art performance in a range of game-theoretic tasks including equilibrium-solving, deviation gain estimation and ranking, with a common approach to NFG representation. We show that the resulting model is interpretable and versatile, paving the way towards deep learning systems capable of game-theoretic reasoning when interacting with humans and with each other.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4YESQqIys7",
    "arxiv_id": "2402.08393",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19457,
    "title": "Adaptive Instrument Design for Indirect Experiments",
    "authors": [
      "Yash Chandak",
      "Shiv Shankar",
      "Vasilis Syrgkanis",
      "Emma Brunskill"
    ],
    "abstract": "Indirect experiments provide a valuable framework for estimating treatment effects in situations where conducting randomized control trials (RCTs) is impractical or unethical. Unlike RCTs, indirect experiments estimate treatment effects by leveraging (conditional) instrumental variables, enabling estimation through encouragement and recommendation rather than strict treatment assignment.  However, the sample efficiency of such estimators depends not only on the inherent variability in outcomes but also on the varying compliance levels of users with the instrumental variables and the choice of estimator being used, especially when dealing with numerous instrumental variables.  While adaptive experiment design has a rich literature for \\textit{direct} experiments, in this paper we take the initial steps towards enhancing sample efficiency for \\textit{indirect} experiments by adaptively designing a data collection policy over instrumental variables.  Our main contribution is a practical computational procedure that utilizes influence functions to search for an optimal data collection policy, minimizing the mean-squared error of the desired (non-linear) estimator. Through experiments conducted in various domains inspired by real-world applications, we showcase how our method can significantly improve the sample efficiency of indirect experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4Zz5UELkIt",
    "arxiv_id": "2312.02438",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19456,
    "title": "Tackling the Data Heterogeneity in Asynchronous Federated Learning with Cached Update Calibration",
    "authors": [
      "Yujia Wang",
      "Yuanpu Cao",
      "Jingcheng Wu",
      "Ruoyu Chen",
      "Jinghui Chen"
    ],
    "abstract": "Asynchronous federated learning, which enables local clients to send their model update asynchronously to the server without waiting for others, has recently emerged for its improved efficiency and scalability over traditional synchronized federated learning. In this paper, we study how the asynchronous delay affects the convergence of asynchronous federated learning under non-i.i.d. distributed data across clients. Through the theoretical convergence analysis of one representative asynchronous federated learning algorithm under standard nonconvex stochastic settings, we show that the asynchronous delay can largely slow down the convergence, especially with high data heterogeneity. To further improve the convergence of asynchronous federated learning under heterogeneous data distributions, we propose a novel asynchronous federated learning method with a cached update calibration. Specifically, we let the server cache the latest update for each client and reuse these variables for calibrating the global update at each round. We theoretically prove the convergence acceleration for our proposed method under nonconvex stochastic settings. Extensive experiments on several vision and language tasks demonstrate our superior performances compared to other asynchronous federated learning baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4aywmeb97I",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19455,
    "title": "EMO: EARTH MOVER DISTANCE OPTIMIZATION FOR AUTO-REGRESSIVE LANGUAGE MODELING",
    "authors": [
      "Siyu Ren",
      "Zhiyong Wu",
      "Kenny Q. Zhu"
    ],
    "abstract": "Neural language models are probabilistic models of human text. They are predominantly trained using maximum likelihood estimation (MLE), which is equivalent to minimizing the forward cross-entropy between the empirical data distribution and the model distribution. However, various degeneration phenomena are still widely observed when decoding from the distributions learned by such models. We establish that the forward cross-entropy is suboptimal as a distance metric for aligning human and model distribution due to its (1) recall-prioritization (2) negative diversity ignorance and (3) train-test mismatch. In this paper, we propose Earth Mover Distance Optimization (EMO) for auto-regressive language modeling. EMO capitalizes on the inherent properties of earth mover distance to address the aforementioned challenges. Due to the high complexity of direct computation, we further introduce a feasible upper bound for EMO to ease end-to-end training. Upon extensive evaluation of language models trained using EMO and MLE. We find that EMO demonstrates a consistently better language modeling performance than MLE across domains. Moreover, EMO demonstrates noteworthy enhancements in downstream performance with minimal fine-tuning on merely 25,000 sentences. This highlights the tremendous potential of EMO as a lightweight calibration method for enhancing large-scale pre-trained language models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4bLXfRd0CX",
    "arxiv_id": "2310.04691",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19452,
    "title": "The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicry",
    "authors": [
      "Michael Zhang",
      "Kush Bhatia",
      "Hermann Kumbong",
      "Christopher Re"
    ],
    "abstract": "Linear attentions have shown promise for improving Transformer efficiency, reducing attention's quadratic complexity to linear in sequence length. This holds exciting promise for (1) training linear Transformers from scratch, (2) `inetuned-conversion of task-specific Transformers into linear versions that recover task performance, and (3) pretrained-conversion of Transformers, such as language models, into linear versions readily finetunable on downstream tasks. However, linear attentions often underperform compared to standard softmax attention. To close this performance gap, we study the behaviors of softmax and linear attentions in various train-from-scratch and finetuned-conversion settings. We find prior linear attentions lack key properties of softmax attention tied to good performance: low-entropy (or spiky) weights and dot-product monotonicity. We further observe surprisingly simple feature maps that retain these properties match softmax performance, but are inefficient to compute in linear attention. We thus propose Hedgehog, a learnable linear attention that retains the spiky and monotonic properties of softmax attention while maintaining linear complexity. Hedgehog uses simple, trainable MLPs to produce attention weights mimicking softmax attention. Experiments show Hedgehog recovers over 99\\% of standard Transformer performance in train-from-scratch and finetuned-conversion settings, outperforming prior linear attentions by up to 6 perplexity points on WikiText-103 when training causal GPT models from scratch, and up to 8.7 GLUE score points when converting finetuned bidirectional BERT models. Hedgehog also enables direct pretrained-conversion, achieving a new state-of-the-art WikiText-103 perplexity of 16.7 for 125M decoder-only Transformers by converting pretrained GPT-2 into a linear attention Transformer.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4g02l2N2Nx",
    "arxiv_id": "2402.04347",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19450,
    "title": "Scalable Neural Network Kernels",
    "authors": [
      "Arijit Sehanobish",
      "Krzysztof Marcin Choromanski",
      "YUNFAN ZHAO",
      "Kumar Avinava Dubey",
      "Valerii Likhosherstov"
    ],
    "abstract": "We introduce the concept of scalable neural network kernels (SNNKs), the replacements of regular feedforward layers (FFLs), capable of approximating the latter, but with favorable computational properties. SNNKs effectively disentangle the inputs from the parameters of the neural network in the FFL, only to connect them in the final computation via the dot-product kernel. They are also strictly more expressive, as allowing to model complicated relationships beyond the functions of the dot-products of parameter-input vectors. We also introduce the neural network bundling process that applies SNNKs to compactify deep neural network architectures, resulting in additional compression gains. In its extreme version, it leads to the fully bundled network whose optimal parameters can be expressed via explicit formulae for several loss functions (e.g. mean squared error), opening a possibility to bypass backpropagation. As a by-product of our analysis, we introduce the mechanism of the universal random features (or URFs), applied to instantiate several SNNK variants, and interesting on its own in the context of scalable kernel methods. We provide rigorous theoretical analysis of all these concepts as well as an extensive empirical evaluation, ranging from point-wise kernel estimation to Transformers' fine-tuning with novel adapter layers inspired by SNNKs. Our mechanism provides up to 5x reduction in the number of trainable parameters, while maintaining competitive accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4iPw1klFWa",
    "arxiv_id": "2310.13225",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19448,
    "title": "DREAM: Dual Structured Exploration with Mixup for Open-set Graph Domain Adaption",
    "authors": [
      "Nan Yin",
      "Mengzhu Wang",
      "Zhenghan Chen",
      "Li Shen",
      "Huan Xiong",
      "Bin Gu",
      "Xiao Luo"
    ],
    "abstract": "Recently, numerous graph neural network methods have been developed to tackle domain shifts in graph data. However, these methods presuppose that unlabeled target graphs belong to categories previously seen in the source domain. This assumption could not hold true for in-the-wild target graphs. In this paper, we delve deeper to explore a more realistic problem open-set graph domain adaptation. Our objective is to not only identify target graphs from new categories but also accurately classify remaining target graphs into their respective categories under domain shift and label scarcity. To address this challenging problem, we introduce a novel method named Dual Structured Exploration with Mixup (DREAM). DREAM incorporates a graph-level representation learning branch as well as a subgraph-enhanced branch, which jointly explores graph topological structures from both global and local viewpoints. To maximize the use of unlabeled target graphs, we train these two branches simultaneously using posterior regularization to enhance their inter-module consistency. To accommodate the open-set setting, we amalgamate dissimilar samples to generate virtual unknown samples belonging to novel classes. Moreover, to alleviate domain shift, we establish a k nearest neighbor-based graph-of-graphs and blend multiple neighbors of each sample to produce cross-domain virtual samples for inter-domain consistency learning. Extensive experiments validate the effectiveness of our proposed DREAM compared with various state-of-the-art approaches in different settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4olqbTBt1Y",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19447,
    "title": "Learning Delays in Spiking Neural Networks using Dilated Convolutions with Learnable Spacings",
    "authors": [
      "Ilyass Hammouamri",
      "Ismail Khalfaoui-Hassani",
      "Timoth\u00e9e Masquelier"
    ],
    "abstract": "Spiking Neural Networks (SNNs) are a promising research direction for building power-efficient information processing systems, especially for temporal tasks such as speech recognition. In SNNs, delays refer to the time needed for one spike to travel from one neuron to another. These delays matter because they influence the spike arrival times, and it is well-known that spiking neurons respond more strongly to coincident input spikes. More formally, it has been shown theoretically that plastic delays greatly increase the expressivity in SNNs. Yet, efficient algorithms to learn these delays have been lacking. Here, we propose a new discrete-time algorithm that addresses this issue in deep feedforward SNNs using backpropagation, in an offline manner. To simulate delays between consecutive layers, we use 1D convolutions across time. The kernels contain only a few non-zero weights \u2013 one per synapse \u2013 whose positions correspond to the delays. These positions are learned together with the weights using the recently proposed Dilated Convolution with Learnable Spacings (DCLS). We evaluated our method on three datasets: the Spiking Heidelberg Dataset (SHD), the Spiking Speech Commands (SSC) and its non spiking version Google Speech Commands v0.02 (GSC) benchmarks, which require detecting temporal patterns. We used feedforward SNNs with two or three hidden fully connected layers, and vanilla leaky integrate-and-fire neurons. We showed that fixed random delays help and that learning them helps even more. Furthermore, our method outperformed the state-of-the-art in the three datasets without using recurrent connections and with substantially fewer parameters. Our work demonstrates the potential of delay learning in developing accurate and precise models for temporal data processing. Our code is based on PyTorch / SpikingJelly and available at: https://github.com/Thvnvtos/SNN-delays",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4r2ybzJnmN",
    "arxiv_id": "2306.17670",
    "GitHub": [
      "https://github.com/Thvnvtos/SNN-delays"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19446,
    "title": "Learning 3D Particle-based Simulators from RGB-D Videos",
    "authors": [
      "William F Whitney",
      "Tatiana Lopez-Guevara",
      "Tobias Pfaff",
      "Yulia Rubanova",
      "Thomas Kipf",
      "Kim Stachenfeld",
      "Kelsey R Allen"
    ],
    "abstract": "Realistic simulation is critical for applications ranging from robotics to animation. Traditional analytic simulators sometimes struggle to capture sufficiently realistic simulation which can lead to problems including the well known \"sim-to-real\" gap in robotics. Learned simulators have emerged as an alternative for better capturing real-world physical dynamics, but require access to privileged ground truth physics information such as precise object geometry or particle tracks. Here we propose a method for learning simulators directly from observations. Visual Particle Dynamics (VPD) jointly learns a latent particle-based representation of 3D scenes, a neural simulator of the latent particle dynamics, and a renderer that can produce images of the scene from arbitrary views. VPD learns end to end from posed RGB-D videos and does not require access to privileged information. Unlike existing 2D video prediction models, we show that VPD's 3D structure enables scene editing and long-term predictions. These results pave the way for downstream applications ranging from video editing to robotic planning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4rBEgZCubP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19444,
    "title": "Space and time continuous physics simulation from partial observations",
    "authors": [
      "Steeven JANNY",
      "Madiha Nadri",
      "Julie Digne",
      "Christian Wolf"
    ],
    "abstract": "Modern techniques for physical simulations rely on numerical schemes and mesh-refinement methods to address trade-offs between precision and complexity, but these handcrafted solutions are tedious and require high computational power. Data-driven methods based on large-scale machine learning promise high adaptivity by integrating long-range dependencies more directly and efficiently. In this work, we focus on computational fluid dynamics and address the shortcomings of a large part of the literature, which are based on fixed support for computations and predictions in the form of regular or irregular grids. We propose a novel setup to perform predictions in a continuous spatial and temporal domain while being trained on sparse observations. We formulate the task as a double observation problem and propose a solution with two interlinked dynamical systems defined on, respectively, the sparse positions and the continuous domain, which allows to forecast and interpolate a solution from the initial condition. Our practical implementation involves recurrent GNNs and a spatio-temporal attention observer capable of interpolating the solution at arbitrary locations. Our model not only generalizes to new initial conditions (as standard auto-regressive models do) but also performs evaluation at arbitrary space and time locations. We evaluate on three standard datasets in fluid dynamics and compare to strong baselines, which are outperformed in classical settings and the extended new task requiring continuous predictions.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=4yaFQ7181M",
    "arxiv_id": "2401.09198",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17639,
    "title": "ARGS: Alignment as Reward-Guided Search",
    "authors": [
      "Maxim Khanov",
      "Jirayu Burapacheep",
      "Yixuan Li"
    ],
    "abstract": "Aligning large language models with human objectives is paramount, yet common approaches including RLHF suffer from unstable and resource-intensive training. In response to this challenge, we introduce ARGS, Alignment as Reward-Guided Search, a novel framework that integrates alignment into the decoding process, eliminating the need for expensive RL training. By adjusting the model\u2019s probabilistic predictions using a reward signal, ARGS generates texts with semantic diversity while being aligned with human preferences, offering a promising and flexible solution for aligning language models. Notably, our method demonstrates consistent enhancements in average reward compared to baselines across diverse alignment tasks and various model dimensions. For example, under the same greedy-based decoding strategy, our method improves the average reward by 19.56% relative to the baseline and secures a preference or tie score of 64.33% in GPT-4 evaluation. We believe that our framework, emphasizing test-time alignment, paves the way for more responsive language models in the future.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=shgx0eqdw6",
    "arxiv_id": "2402.01694",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19442,
    "title": "Habitat 3.0: A Co-Habitat for Humans, Avatars, and Robots",
    "authors": [
      "Xavier Puig",
      "Eric Undersander",
      "Andrew Szot",
      "Mikael Dallaire Cote",
      "Tsung-Yen Yang",
      "Ruslan Partsey",
      "Ruta Desai",
      "Alexander Clegg",
      "Michal Hlavac",
      "So Yeon Min",
      "Vladim\u00edr Vondru\u0161",
      "Theophile Gervet",
      "Vincent-Pierre Berges",
      "John M Turner",
      "Oleksandr Maksymets",
      "Zsolt Kira",
      "Mrinal Kalakrishnan",
      "Jitendra Malik",
      "Devendra Singh Chaplot",
      "Unnat Jain",
      "Dhruv Batra",
      "Akshara Rai",
      "Roozbeh Mottaghi"
    ],
    "abstract": "We present Habitat 3.0: a simulation platform for studying collaborative human-robot tasks in home environments. Habitat 3.0 offers contributions across three dimensions: (1) Accurate humanoid simulation: addressing challenges in modeling complex deformable bodies and diversity in appearance and motion, all while ensuring high simulation speed. (2) Human-in-the-loop infrastructure: enabling real human interaction with simulated robots via mouse/keyboard or a VR interface, facilitating evaluation of robot policies with human input. (3) Collaborative tasks: studying two collaborative tasks, Social Navigation and Social Rearrangement. Social Navigation investigates a robot's ability to locate and follow humanoid avatars in unseen environments, whereas Social Rearrangement addresses collaboration between a humanoid and robot while rearranging a scene. These contributions allow us to study end-to-end learned and heuristic baselines for human-robot collaboration in-depth, as well as evaluate them with humans in the loop. Our experiments demonstrate that learned robot policies lead to efficient task completion when collaborating with unseen humanoid agents and human partners that might exhibit behaviors that the robot has not seen before. Additionally, we observe emergent behaviors during collaborative task execution, such as the robot yielding space when obstructing a humanoid agent, thereby allowing the effective completion of the task by the humanoid agent. Furthermore, our experiments using the human-in-the-loop tool demonstrate that our automated evaluation with humanoids can provide an indication of the relative ordering of different policies when evaluated with real human collaborators. Habitat 3.0 unlocks interesting new features in simulators for Embodied AI, and we hope it paves the way for a new frontier of embodied human-AI interaction capabilities.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4znwzG92CE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19389,
    "title": "IceFormer: Accelerated Inference with Long-Sequence Transformers on CPUs",
    "authors": [
      "Yuzhen Mao",
      "Martin Ester",
      "Ke Li"
    ],
    "abstract": "One limitation of existing transformer-based models is that they cannot handle very long sequences as input since their self-attention operations exhibit quadratic time and space complexity. This problem becomes especially acute when transformers are deployed on hardware platforms equipped only with CPUs. To address this issue, we propose a novel method for accelerating self-attention at inference time that works with pretrained transformer models out-of-the-box without requiring retraining. We experiment using our method to accelerate various long-sequence transformers on various benchmarks and demonstrate a greater speedup compared to the baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6RR3wU4mSZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19387,
    "title": "Local Search GFlowNets",
    "authors": [
      "Minsu Kim",
      "Taeyoung Yun",
      "Emmanuel Bengio",
      "Dinghuai Zhang",
      "Yoshua Bengio",
      "Sungsoo Ahn",
      "Jinkyoo Park"
    ],
    "abstract": "Generative Flow Networks (GFlowNets) are amortized sampling methods that learn a distribution over discrete objects proportional to their rewards. GFlowNets exhibit a remarkable ability to generate diverse samples, yet occasionally struggle to consistently produce samples with high rewards due to over-exploration on wide sample space. This paper proposes to train GFlowNets with local search which focuses on exploiting high rewarded sample space to resolve this issue. Our main idea is to explore the local neighborhood via destruction and reconstruction guided by backward and forward policies, respectively. This allows biasing the samples toward high-reward solutions, which is not possible for a typical GFlowNet solution generation scheme which uses the forward policy to generate the solution from scratch. Extensive experiments demonstrate a remarkable performance improvement in several biochemical tasks. Source code is available: \\url{https://anonymous.4open.science/r/ls-gfn-FC9A/README.md}.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=6cFcw1Rxww",
    "arxiv_id": "2310.02710",
    "GitHub": [
      "https://github.com/dbsxodud-11/ls_gfn"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19386,
    "title": "Learning to solve Class-Constrained Bin Packing Problems via Encoder-Decoder Model",
    "authors": [
      "Hanni Cheng",
      "Ya Cong",
      "Weihao Jiang",
      "Shiliang Pu"
    ],
    "abstract": "Neural methods have shown significant merit in solving combinatorial optimization (CO) problems, including the Bin Packing Problem (BPP). However, most existing ML-based approaches focus on geometric BPP like 3DBPP, neglecting complex vector BPP. In this study, we introduce a vector BPP variant called Class-Constrained Bin Packing Problem (CCBPP), dealing with items of both classes and sizes, and the objective is to pack the items in the least amount of bins respecting the bin capacity and the number of different classes that it can hold. To enhance the efficiency and practicality of solving CCBPP, we propose a learning-based Encoder-Decoder Model. The Encoder employs a Graph Convolution Network (GCN) to generate a heat-map, representing probabilities of different items packing together. The  Decoder decodes and fine-tunes the solution through Cluster Decode and Active Search methods, thereby producing high-quality solutions for CCBPP instances. Extensive experiments demonstrate that our proposed method consistently yields high-quality solutions for various kinds of CCBPP with a very small gap from the optimal. Moreover, our Encoder-Decoder Model also shows promising performance on one practical application of CCBPP, the \\emph{Manufacturing Order Consolidation Problem} (OCP).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6hvtSLkKeZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19384,
    "title": "Mixture-of-Experts Meets Instruction Tuning: A Winning Combination for Large Language Models",
    "authors": [
      "Sheng Shen",
      "Le Hou",
      "Yanqi Zhou",
      "Nan Du",
      "Shayne Longpre",
      "Jason Wei",
      "Hyung Won Chung",
      "Barret Zoph",
      "William Fedus",
      "Xinyun Chen",
      "Tu Vu",
      "Yuexin Wu",
      "Wuyang Chen",
      "Albert Webson",
      "Yunxuan Li",
      "Vincent Y Zhao",
      "Hongkun Yu",
      "Kurt Keutzer",
      "Trevor Darrell",
      "Denny Zhou"
    ],
    "abstract": "Sparse Mixture-of-Experts (MoE) is a neural architecture design that can be utilized to add learnable parameters to Large Language Models (LLMs) without increasing inference cost. Instruction tuning is a technique for training LLMs to follow instructions. We advocate combining these two approaches, as we find that MoE models benefit more from instruction tuning than dense models. In particular, we conduct empirical studies across three experimental setups: (i) Direct finetuning on individual downstream tasks devoid of instruction tuning; (ii) Instruction tuning followed by in-context few-shot or zero-shot generalization on downstream tasks; and (iii) Instruction tuning supplemented by further finetuning on individual downstream tasks. In the first scenario, MoE models overall underperform dense models of identical computational capacity. This narrative, however, dramatically changes with the introduction of instruction tuning (second and third scenario), used independently or in conjunction with task-specific finetuning. Our most powerful model, FLAN-MOE32B, surpasses the performance of FLAN-PALM62B on four benchmark tasks, while using only a third of the FLOPs. The advancements embodied by FLAN-MOE inspire a reevaluation of the design principles of large-scale, high-performance language models in the framework of task-agnostic learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6mLjDwYte5",
    "arxiv_id": "2305.14705",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19383,
    "title": "Large Language Model Cascades with Mixture of Thought Representations for Cost-Efficient Reasoning",
    "authors": [
      "Murong Yue",
      "Jie Zhao",
      "Min Zhang",
      "Liang Du",
      "Ziyu Yao"
    ],
    "abstract": "Large language models (LLMs) such as GPT-4 have exhibited remarkable performance in a variety of tasks, but this strong performance often comes with the high expense of using paid API services. In this paper, we are motivated to study building an LLM \"cascade\" to save the cost of using LLMs, particularly for performing (e.g., mathematical, causal) reasoning tasks. Our cascade pipeline follows the intuition that simpler questions can be addressed by a weaker but more affordable LLM, whereas only the most challenging questions necessitate the stronger and more expensive LLM. To realize this decision-making, we consider the \"answer consistency\" of the weaker LLM as a signal of the question difficulty and propose several methods for answering sampling and consistency checking, including one leveraging a mixture of two thought representations (i.e., Chain-of-Thought and Program-of-Thought). Through experiments on six reasoning benchmark datasets, with GPT-3.5-turbo and GPT-4 being the weaker and stronger LLMs, respectively, our cascade pipeline demonstrates comparable performance but reduces about 60% of the cost compared with fully using the stronger LLM.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6okaSfANzh",
    "arxiv_id": "2310.03094",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19382,
    "title": "A Semantic Invariant Robust Watermark for Large Language Models",
    "authors": [
      "Aiwei Liu",
      "Leyi Pan",
      "Xuming Hu",
      "Shiao Meng",
      "Lijie Wen"
    ],
    "abstract": "Watermark algorithms for large language models (LLMs) have achieved extremely high accuracy in detecting text generated by LLMs. Such algorithms typically involve adding extra watermark logits to the LLM's logits at each generation step. However, prior algorithms face a trade-off between attack robustness and security robustness. This is because the watermark logits for a token are determined by a certain number of preceding tokens; a small number leads to low security robustness, while a large number results in insufficient attack robustness. In this work, we propose a semantic invariant watermarking method for LLMs that provides both attack robustness and security robustness. The watermark logits in our work are determined by the semantics of all preceding tokens. Specifically, we utilize another embedding LLM to generate semantic embeddings for all preceding tokens, and then these semantic embeddings are transformed into the watermark logits through our trained watermark model.Subsequent analyses and experiments demonstrated the attack robustness of our method in semantically invariant settings: synonym substitution and text paraphrasing settings. Finally, we also show that our watermark possesses adequate security robustness.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6p8lpe4MNf",
    "arxiv_id": "2310.06356",
    "GitHub": [
      "https://github.com/THU-BPM/Robust_Watermark"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17638,
    "title": "Large Language Models Are Not Robust Multiple Choice Selectors",
    "authors": [
      "Chujie Zheng",
      "Hao Zhou",
      "Fandong Meng",
      "Jie Zhou",
      "Minlie Huang"
    ],
    "abstract": "Multiple choice questions (MCQs) serve as a common yet important task format in the evaluation of large language models (LLMs). This work shows that modern LLMs are vulnerable to option position changes in MCQs due to their inherent \u201cselection bias\u201d, namely, they prefer to select specific option IDs as answers (like \u201cOption A\u201d). Through extensive empirical analyses with 20 LLMs on three benchmarks, we pinpoint that this behavioral bias primarily stems from LLMs\u2019 token bias, where the model a priori assigns more probabilistic mass to specific option ID tokens (e.g., A/B/C/D) when predicting answers from the option IDs. To mitigate selection bias, we propose a label-free, inference-time debiasing method, called PriDe, which separates the model\u2019s prior bias for option IDs from the overall prediction distribution. PriDe first estimates the prior by permutating option contents on a small number of test samples, and then applies the estimated prior to debias the remaining samples. We demonstrate that it achieves interpretable and transferable debiasing with high computational efficiency. We hope this work can draw broader research attention to the bias and robustness of modern LLMs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=shr9PXz7T0",
    "arxiv_id": "2309.03882",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19381,
    "title": "Towards Diverse Behaviors: A Benchmark for Imitation Learning with Human Demonstrations",
    "authors": [
      "Xiaogang Jia",
      "Denis Blessing",
      "Xinkai Jiang",
      "Moritz Reuss",
      "Atalay Donat",
      "Rudolf Lioutikov",
      "Gerhard Neumann"
    ],
    "abstract": "Imitation learning with human data has demonstrated remarkable success in teaching robots in a wide range of skills. However, the inherent diversity in human behavior leads to the emergence of multi-modal data distributions, thereby presenting a formidable challenge for existing imitation learning algorithms. Quantifying a model's capacity to capture and replicate this diversity effectively is still an open problem. In this work, we introduce simulation benchmark environments and the corresponding *Datasets with Diverse human Demonstrations for Imitation Learning (D3IL)*, designed explicitly to evaluate a model's ability to learn multi-modal behavior. Our environments are designed to involve multiple sub-tasks that need to be solved, consider manipulation of multiple objects which increases the diversity of the behavior and can only be solved by policies that rely on closed loop sensory feedback. Other available datasets are missing at least one of these challenging properties.To address the challenge of diversity quantification, we introduce tractable metrics that provide valuable insights into a model's ability to acquire and reproduce diverse behaviors. These metrics offer a practical means to assess the robustness and versatility of imitation learning algorithms. Furthermore, we conduct a thorough evaluation of state-of-the-art methods on the proposed task suite. This evaluation serves as a benchmark for assessing their capability to learn diverse behaviors. Our findings shed light on the effectiveness of these methods in tackling the intricate problem of capturing and generalizing multi-modal human behaviors, offering a valuable reference for the design of future imitation learning algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6pPYRXKPpw",
    "arxiv_id": "2402.14606",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19379,
    "title": "ImplicitSLIM and How it Improves Embedding-based Collaborative Filtering",
    "authors": [
      "Ilya Shenbin",
      "Sergey Nikolenko"
    ],
    "abstract": "We present ImplicitSLIM, a novel unsupervised learning approach for sparse high-dimensional data, with applications to collaborative filtering. Sparse linear methods (SLIM) and their variations show outstanding performance, but they are memory-intensive and hard to scale. ImplicitSLIM improves embedding-based models by extracting embeddings from SLIM-like models in a computationally cheap and memory-efficient way, without explicit learning of heavy SLIM-like models. We show that ImplicitSLIM improves performance and speeds up convergence for both state of the art and classical collaborative filtering methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6vF0ZJGor4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19377,
    "title": "Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback",
    "authors": [
      "Haolin Liu",
      "Chen-Yu Wei",
      "Julian Zimmert"
    ],
    "abstract": "We study online reinforcement learning in linear Markov decision processes with adversarial losses and bandit feedback. We introduce two algorithms that achieve improved regret performance compared to existing approaches. The first algorithm, although computationally inefficient, achieves a regret of $\\widetilde{O}(\\sqrt{K})$ without relying on simulators, where $K$ is the number of episodes. This is the first rate-optimal result in the considered setting. The second algorithm is computationally efficient and achieves a regret of  $\\widetilde{O}(K^{\\frac{3}{4}})$ . These results significantly improve over the prior state-of-the-art: a computationally inefficient algorithm by Kong et al. (2023) with $\\widetilde{O}(K^{\\frac{4}{5}}+1/\\lambda_{\\min})$ regret, and a computationally efficient algorithm by Sherman et al. (2023b) with $\\widetilde{O}(K^{\\frac{6}{7}})$ regret.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=6yv8UHVJn4",
    "arxiv_id": "2310.11550",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19721,
    "title": "LRM: Large Reconstruction Model for Single Image to 3D",
    "authors": [
      "Yicong Hong",
      "Kai Zhang",
      "Jiuxiang Gu",
      "Sai Bi",
      "Yang Zhou",
      "Difan Liu",
      "Feng Liu",
      "Kalyan Sunkavalli",
      "Trung Bui",
      "Hao Tan"
    ],
    "abstract": "We propose the first Large Reconstruction Model (LRM) that predicts the 3D model of an object from a single input image within just 5 seconds. In contrast to many previous methods that are trained on small-scale datasets such as ShapeNet in a category-specific fashion, LRM adopts a highly scalable transformer-based architecture with 500 million learnable parameters to directly predict a neural radiance field (NeRF) from the input image. We train our model in an end-to-end manner on massive multi-view data containing around 1 million objects, including both synthetic renderings from Objaverse and real captures from MVImgNet. This combination of a high-capacity model and large-scale training data empowers our model to be highly generalizable and produce high-quality 3D reconstructions from various testing inputs including real-world in-the-wild captures and images from generative models. Video demos and interactable 3D meshes can be found on this anonymous website: https://scalei3d.github.io/LRM.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=sllU8vvsFF",
    "arxiv_id": "2311.04400",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19376,
    "title": "Continuous Invariance Learning",
    "authors": [
      "LIN Yong",
      "Fan Zhou",
      "Lu Tan",
      "Lintao Ma",
      "Jianmeng Liu",
      "Yansu HE",
      "Yuan Yuan",
      "Yu Liu",
      "James Y. Zhang",
      "Yujiu Yang",
      "Hao Wang"
    ],
    "abstract": "Invariance learning methods aim to learn invariant features in the hope that they generalize under distributional shift. Although many tasks are naturally characterized by continuous domains, current invariance learning techniques generally assume categorically indexed domains. For example, auto-scaling in cloud computing often needs a CPU utilization prediction model that generalizes across different times (e.g., time of a day and date of a year), where `time' is a continuous domain index. In this paper, we start by theoretically showing that existing invariance learning methods can fail for continuous domain problems. Specifically, the naive solution of splitting continuous domains into discrete ones ignores the underlying relationship among domains, and therefore potentially leads to suboptimal performance. To address this challenge, we then propose Continuous Invariance Learning (CIL), which extracts invariant features across continuously indexed domains. CIL is a novel adversarial procedure which measures and controls the conditional independence between the labels and continuous domain indices given the extracted features. Our theoretical analysis demonstrates that CIL learns features that satisfy the invariant constraint with infinite samples. Empirical results on both synthetic and real-world datasets (including data collected from production systems) show that CIL consistently outperforms strong baselines among all the tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=70IgE3tRbu",
    "arxiv_id": "2310.05348",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19375,
    "title": "RetroBridge: Modeling Retrosynthesis with Markov Bridges",
    "authors": [
      "Ilia Igashov",
      "Arne Schneuing",
      "Marwin Segler",
      "Michael M. Bronstein",
      "Bruno Correia"
    ],
    "abstract": "Retrosynthesis planning is a fundamental challenge in chemistry which aims at designing multi-step reaction pathways from commercially available starting materials to a target molecule. Each step in multi-step retrosynthesis planning requires accurate prediction of possible precursor molecules given the target molecule and confidence estimates to guide heuristic search algorithms. We model single-step retrosynthesis as a distribution learning problem in a discrete state space. First, we introduce the Markov Bridge Model, a generative framework aimed to approximate the dependency between two intractable discrete distributions accessible via a finite sample of coupled data points. Our framework is based on the concept of a Markov bridge, a Markov process pinned at its endpoints. Unlike diffusion-based methods, our Markov Bridge Model does not need a tractable noise distribution as a sampling proxy and directly operates on the input product molecules as samples from the intractable prior distribution. We then address the retrosynthesis planning problem with our novel framework and introduce RetroBridge, a template-free retrosynthesis modeling approach that achieves state-of-the-art results on standard evaluation benchmarks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=770DetV8He",
    "arxiv_id": "2308.16212",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19374,
    "title": "Exploring the Common Appearance-Boundary Adaptation for Nighttime Optical Flow",
    "authors": [
      "Hanyu Zhou",
      "Yi Chang",
      "Haoyue Liu",
      "YAN WENDING",
      "Yuxing Duan",
      "Zhiwei Shi",
      "Luxin Yan"
    ],
    "abstract": "We investigate a challenging task of nighttime optical flow, which suffers from weakened texture and amplified noise. These degradations weaken discriminative visual features, thus causing invalid motion feature matching. Typically, existing methods employ domain adaptation to transfer knowledge from auxiliary domain to nighttime domain in either input visual space or output motion space. However, this direct adaptation is ineffective, since there exists a large domain gap due to the intrinsic heterogeneous nature of the feature representations between auxiliary and nighttime domains. To overcome this issue, we explore a common-latent space as the intermediate bridge to reinforce the feature alignment between auxiliary and nighttime domains. In this work, we exploit two auxiliary daytime and event domains, and propose a novel common appearance-boundary adaptation framework for nighttime optical flow. In appearance adaptation, we employ the intrinsic image decomposition to embed the auxiliary daytime image and the nighttime image into a reflectance-aligned common space. We discover that motion distributions of the two reflectance maps are very similar, benefiting us to consistently transfer motion appearance knowledge from daytime to nighttime domain. In boundary adaptation, we theoretically derive the motion correlation formula between nighttime image and accumulated events within a spatiotemporal gradient-aligned common space. We figure out that the correlation of the two spatiotemporal gradient maps shares significant discrepancy, benefitting us to contrastively transfer boundary knowledge from event to nighttime domain. Moreover, appearance adaptation and boundary adaptation are complementary to each other, since they could jointly transfer global motion and local boundary knowledge to the nighttime domain. Extensive experiments have been performed to verify the superiority of the proposed method.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=776lhoaulC",
    "arxiv_id": "2401.17642",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19373,
    "title": "Mirage: Model-agnostic Graph Distillation for Graph Classification",
    "authors": [
      "Mridul Gupta",
      "Sahil Manchanda",
      "HARIPRASAD KODAMANA",
      "Sayan Ranu"
    ],
    "abstract": "GNNs, like other deep learning models, are data and computation hungry. There is a pressing need to scale training of GNNs on large datasets to enable their usage on low-resource environments. Graph distillation is an effort in that direction with the aim to construct a smaller synthetic training set from the original training data without significantly compromising model performance. While initial efforts are promising, this work is motivated by two key observations: (1) Existing graph distillation algorithms themselves rely on training with the full dataset, which undermines the very premise of graph distillation. (2) The distillation process is specific to the target GNN architecture and hyper-parameters and thus not robust to changes in the modeling pipeline. We circumvent these limitations by designing a distillation algorithm called MIRAGE for graph classification. MIRAGE is built on the insight that a message-passing GNN decomposes the input graph into a multiset of computation trees. Furthermore, the frequency distribution of computation trees is often skewed in nature, enabling us to condense this data into a concise distilled summary. By compressing the computation data itself, as opposed to emulating gradient flows on the original training set\u2014a prevalent approach to date\u2014MIRAGE transforms into an unsupervised and architecture-agnostic distillation algorithm. Extensive benchmarking on real-world datasets underscores MIRAGE\u2019s superiority, showcasing enhanced generalization accuracy, data compression, and distillation efficiency when compared to state-of-the-art baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=78iGZdqxYY",
    "arxiv_id": "2310.09486",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19372,
    "title": "A Characterization Theorem for Equivariant Networks with Point-wise Activations",
    "authors": [
      "Marco Pacini",
      "Xiaowen Dong",
      "Bruno Lepri",
      "Gabriele Santin"
    ],
    "abstract": "Equivariant neural networks have shown improved performance, expressiveness and sample complexity on symmetrical domains. But for some specific symmetries, representations, and choice of coordinates, the most common point-wise activations, such as ReLU, are not equivariant, hence they cannot be employed in the design of equivariant neural networks. The theorem we present in this paper describes all possibile combinations of representations, choice of coordinates and point-wise activations to obtain an equivariant layer, generalizing and strengthening existing characterizations.Notable cases of practical relevance are discussed as corollaries. Indeed, we prove that rotation-equivariant networks can only be invariant, as it happens for any network which is equivariant with respect to connected compact groups. Then, we discuss implications of our findings when applied to important instances of equivariant networks. First, we completely characterize permutation equivariant networks such as Invariant Graph Networks with point-wise nonlinearities and their geometric counterparts, highlighting a plethora of models whose expressive power and performance are still unknown. Second, we show that feature spaces of disentangled steerable convolutional neural networks are trivial representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=79FVDdfoSR",
    "arxiv_id": "2401.09235",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19371,
    "title": "Designing Skill-Compatible AI: Methodologies and Frameworks in Chess",
    "authors": [
      "Karim Hamade",
      "Reid McIlroy-Young",
      "Siddhartha Sen",
      "Jon Kleinberg",
      "Ashton Anderson"
    ],
    "abstract": "Powerful artificial intelligence systems are often used in settings where they must interact with agents that are computationally much weaker, for example when they work alongside humans or operate in complex environments where some tasks are handled by algorithms, heuristics, or other entities of varying computational power. For AI agents to successfully interact in these settings, however, achieving superhuman performance alone is not sufficient; they also need to account for suboptimal actions or idiosyncratic style from their less-skilled counterparts. We propose a formal evaluation framework for assessing the compatibility of near-optimal AI with interaction partners who may have much lower levels of skill; we use popular collaborative chess variants as model systems to study and develop AI agents that can successfully interact with lower-skill entities. Traditional chess engines designed to output near-optimal moves prove to be inadequate partners when paired with engines of various lower skill levels in this domain, as they are not designed to consider the presence of other agents. We contribute three methodologies to explicitly create skill-compatible AI agents in complex decision-making settings, and two chess game frameworks designed to foster collaboration between powerful AI agents and less-skilled partners. On these frameworks, our agents outperform state-of-the-art chess AI (based on AlphaZero) despite being weaker in conventional chess, demonstrating that skill-compatibility is a tangible trait that is qualitatively and measurably distinct from raw performance. Our evaluations further explore and clarify the mechanisms by which our agents achieve skill-compatibility.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=79rfgv3jw4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19367,
    "title": "STREAM: Spatio-TempoRal Evaluation and  Analysis Metric for Video Generative Models",
    "authors": [
      "Pum Jun Kim",
      "Seojun Kim",
      "Jaejun Yoo"
    ],
    "abstract": "Image generative models have made significant progress in generating realistic and diverse images, supported by comprehensive guidance from various evaluation metrics. However, current video generative models struggle to generate evenshort video clips, with limited tools that provide insights for improvements. Current video evaluation metrics are simple adaptations of image metrics by switching the embeddings with video embedding networks, which may underestimate the unique characteristics of video. Our analysis reveals that the widely used Frechet Video Distance (FVD) has a stronger emphasis on the spatial aspect than the temporal naturalness of video and is inherently constrained by the input size of the embedding networks used, limiting it to 16 frames. Additionally, it demonstrates considerable instability and diverges from human evaluations. To address the limitations, we propose STREAM, a new video evaluation metric uniquely designed to independently evaluate spatial and temporal aspects. This feature allows comprehensive analysis and evaluation of video generative models from various perspectives, unconstrained by video length. We provide analytical and experimental evidence demonstrating that STREAM provides an effective evaluation tool for both visual and temporal quality of videos, offering insights into area of improvement for video generative models. To the best of our knowledge, STREAM is the first evaluation metric that can separately assess the temporal and spatial aspects of videos. Our code is available at https://anonymous.4open.science/r/STREAM-4200/stream.py.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7JfKCZQPxJ",
    "arxiv_id": "2403.09669",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19734,
    "title": "Finetuning Text-to-Image Diffusion Models for Fairness",
    "authors": [
      "Xudong Shen",
      "Chao Du",
      "Tianyu Pang",
      "Min Lin",
      "Yongkang Wong",
      "Mohan Kankanhalli"
    ],
    "abstract": "The rapid adoption of text-to-image (T2I) diffusion models in society underscores an urgent need to address their biases. Without interventions, these biases propagate a distorted worldview and limit opportunities for minority groups. In this work, we frame fairness as a distributional alignment problem. We propose to end-to-end finetune diffusion models using a distributional alignment loss, steering specific characteristics of the generated images towards a user-defined target distribution. Empirically, our method markedly reduces gender, racial, and their intersectional biases for occupational prompts. Gender bias can be substantially mitigated even when finetuning merely five soft tokens. Acknowledging strict egalitarianism might not always be the desired outcome for fairness, we show that our method can flexibly control age to a $75\\\\%$ young and $25\\\\%$ old distribution while simultaneously debiasing gender and race. Finally, our method is scalable: it can debias multiple concepts at once, such as occupations, sports, and personal descriptors, by simply including these prompts in the finetuning data. We hope our work facilitates the advancement of social alignment for T2I generative AI. We will share code and various debiased diffusion model adaptors.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=hnrB5YHoYu",
    "arxiv_id": "2311.07604",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19364,
    "title": "Online Continual Learning for Interactive Instruction Following Agents",
    "authors": [
      "Byeonghwi Kim",
      "Minhyuk Seo",
      "Jonghyun Choi"
    ],
    "abstract": "In learning an embodied agent executing daily tasks via language directives, the literature largely assumes that the agent learns all training data at the beginning. We argue that such a learning scenario is less realistic, since a robotic agent is supposed to learn the world continuously as it explores and perceives it. To take a step towards a more realistic embodied agent learning scenario, we propose two continual learning setups for embodied agents; learning new behaviors (Behavior Incremental Learning, Behavior-IL) and new environments (Environment Incremental Learning, Environment-IL) For the tasks, previous \u2018data prior\u2019 based continual learning methods maintain logits for the past tasks. However, the stored information is often insufficiently learned information and requires task boundary information, which might not always be available. Here, we propose to update them based on confidence scores without task boundary information (i.e., task-free) in a moving average fashion, named Confidence-Aware Moving Average (CAMA). In the proposed challenging Behavior-IL and Environment-IL setups, our simple CAMA outperforms prior arts in our empirical validations by noticeable margins.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7M0EzjugaN",
    "arxiv_id": "2403.07548",
    "GitHub": [
      "https://github.com/snumprlab/cl-alfred"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19362,
    "title": "Data-independent Module-aware Pruning for Hierarchical Vision Transformers",
    "authors": [
      "Yang He",
      "Joey Tianyi Zhou"
    ],
    "abstract": "Hierarchical vision transformers (ViTs) have two advantages over conventional ViTs. First, hierarchical ViTs achieve linear computational complexity with respect to image size by local self-attention. Second, hierarchical ViTs create hierarchical feature maps by merging image patches in deeper layers for dense prediction. However, existing pruning methods ignore the unique properties of hierarchical ViTs and use the magnitude value as the weight importance. This approach leads to two main drawbacks. First, the \"local\" attention weights are compared at a \"global\" level, which may cause some \"locally\" important weights to be pruned due to their relatively small magnitude \"globally\". The second issue with magnitude pruning is that it fails to consider the distinct weight distributions of the network, which are essential for extracting coarse to fine-grained features at various hierarchical levels. To solve the aforementioned issues, we have developed a Data-independent Module-Aware Pruning method (DIMAP) to compress hierarchical ViTs. To ensure that \"local\" attention weights at different hierarchical levels are compared fairly in terms of their contribution, we treat them as a **module** and examine their contribution by analyzing their information distortion. Furthermore, we introduce a novel weight metric that is solely based on weights and does not require input images, thereby eliminating the **dependence** on the patch merging process. Our method validates its usefulness and strengths on Swin Transformers of different sizes on ImageNet-1k classification. Notably, the top-5 accuracy drop is only 0.07% when we remove 52.5% FLOPs and 52.7% parameters of Swin-B. When we reduce 33.2% FLOPs and 33.2% parameters of Swin-S, we can even achieve a 0.8% higher relative top-5 accuracy than the original model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7Ol6foUi1G",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19361,
    "title": "Adversarial Adaptive Sampling: Unify PINN and Optimal Transport for the Approximation of PDEs",
    "authors": [
      "Kejun Tang",
      "Jiayu Zhai",
      "Xiaoliang Wan",
      "Chao Yang"
    ],
    "abstract": "Solving partial differential equations (PDEs) is a central task in scientific computing. Recently, neural network approximation of PDEs has received increasing attention due to its flexible meshless discretization and its potential for high-dimensional problems. One fundamental numerical difficulty is that random samples in the training set introduce statistical errors into the discretization of the loss functional which may become the dominant error in the final approximation, and therefore overshadow the modeling capability of the neural network. In this work, we propose a new minmax formulation to optimize simultaneously the approximate solution, given by a neural network model, and the random samples in the training set, provided by a deep generative model. The key idea is to use a deep generative model to adjust the random samples in the training set such that the residual induced by the neural network model can maintain a smooth profile in the training process. Such an idea is achieved by implicitly embedding the Wasserstein distance between the residual-induced distribution and the uniform distribution into the loss, which is then minimized together with the residual. A nearly uniform residual profile means that its variance is small for any normalized weight function such that the Monte Carlo approximation error of the loss functional is reduced significantly for a certain sample size. The adversarial adaptive sampling (AAS) approach proposed in this work is the first attempt to formulate two essential components, minimizing the residual and seeking the optimal training set, into one minmax objective functional for the neural network approximation of PDEs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7QI7tVrh2c",
    "arxiv_id": "2305.18702",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19360,
    "title": "Removing Biases from Molecular Representations via Information Maximization",
    "authors": [
      "Chenyu Wang",
      "Sharut Gupta",
      "Caroline Uhler",
      "Tommi S. Jaakkola"
    ],
    "abstract": "High-throughput drug screening -- using cell imaging or gene expression measurements as readouts of drug effect -- is a critical tool in biotechnology to assess and understand the relationship between the chemical structure and biological activity of a drug. Since large-scale screens have to be divided into multiple experiments, a key difficulty is dealing with batch effects, which can introduce systematic errors and non-biological associations in the data. We propose InfoCORE, an Information maximization approach for COnfounder REmoval, to effectively deal with batch effects and obtain refined molecular representations. InfoCORE establishes a variational lower bound on the conditional mutual information of the latent representations given a batch identifier. It adaptively reweights samples to equalize their implied batch distribution. Extensive experiments on drug screening data reveal InfoCORE's superior performance in a multitude of tasks including molecular property prediction and molecule-phenotype retrieval. Additionally, we show results for how InfoCORE offers a versatile framework and resolves general distribution shifts and issues of data fairness by minimizing correlation with spurious features or removing sensitive attributes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7TOs9gjAg1",
    "arxiv_id": "2312.00718",
    "GitHub": [
      "https://github.com/uhlerlab/InfoCORE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19358,
    "title": "Beam Enumeration: Probabilistic Explainability For Sample Efficient Self-conditioned Molecular Design",
    "authors": [
      "Jeff Guo",
      "Philippe Schwaller"
    ],
    "abstract": "Generative molecular design has moved from proof-of-concept to real-world applicability, as marked by the surge in very recent papers reporting experimental validation. Key challenges in explainability and sample efficiency present opportunities to enhance generative design to directly optimize expensive high-fidelity oracles and provide actionable insights to domain experts. Here, we propose Beam Enumeration to exhaustively enumerate the most probable sub-sequences from language-based molecular generative models and show that molecular substructures can be extracted. When coupled with reinforcement learning, extracted substructures become meaningful, providing a source of explainability and improving sample efficiency through self-conditioned generation. Beam Enumeration is generally applicable to any language-based molecular generative model and notably further improves the performance of the recently reported Augmented Memory algorithm, which achieved the new state-of-the-art on the Practical Molecular Optimization benchmark for sample efficiency. The combined algorithm generates more high reward molecules and faster, given a fixed oracle budget. Beam Enumeration is the first method to jointly address explainability and sample efficiency for molecular design.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7UhxsmbdaQ",
    "arxiv_id": "2309.13957",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19355,
    "title": "You Only Query Once: An Efficient Label-Only Membership Inference Attack",
    "authors": [
      "YUTONG WU",
      "Han Qiu",
      "Shangwei Guo",
      "Jiwei Li",
      "Tianwei Zhang"
    ],
    "abstract": "As one of the privacy threats to machine learning models, the membership inference attack (MIA) tries to infer whether a given sample is in the original training set of a victim model by analyzing its outputs. Recent studies only use the predicted hard labels to achieve impressive membership inference accuracy. However, such label-only MIA approach requires very high query budgets to evaluate the distance of the target sample from the victim model's decision boundary.     We propose YOQO, a novel label-only attack to overcome the above limitation.YOQO aims at identifying a special area (called improvement area) around the target sample and crafting a query sample, whose hard label from the victim model can reliably reflect the target sample's membership. YOQO can successfully reduce the query budget from more than 1,000 times to only ONCE. Experiments demonstrate that YOQO is not only as effective as SOTA attack methods, but also performs comparably or even more robustly against many sophisticated defenses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7WsivwyHrS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18112,
    "title": "Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks",
    "authors": [
      "Federico Errica",
      "Mathias Niepert"
    ],
    "abstract": "We introduce Graph-Induced Sum-Product Networks (GSPNs), a new probabilistic framework for graph representation learning that can tractably answer probabilistic queries. Inspired by the computational trees induced by vertices in the context of message-passing neural networks, we build hierarchies of sum-product networks (SPNs) where the parameters of a parent SPN are learnable transformations of the a-posterior mixing probabilities of its children's sum units. Due to weight sharing and the tree-shaped computation graphs of GSPNs, we obtain the efficiency and efficacy of deep graph networks with the additional advantages of a probabilistic model. We show the model's competitiveness on scarce supervision scenarios, under missing data, and for graph classification in comparison to popular neural models. We complement the experiments with qualitative analyses on hyper-parameters and the model's ability to answer probabilistic queries.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h7nOCxFsPg",
    "arxiv_id": "2305.10544",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19353,
    "title": "Can Sensitive Information Be Deleted From LLMs? Objectives for Defending Against Extraction Attacks",
    "authors": [
      "Vaidehi Patil",
      "Peter Hase",
      "Mohit Bansal"
    ],
    "abstract": "Pretrained language models sometimes possess knowledge that we do not wish them to, including memorized personal information and knowledge that could be used to harm people. They can also output toxic or harmful text. To mitigate these safety and informational issues, we propose an attack-and-defense framework for studying the task of deleting sensitive information directly from model weights. We study direct edits to model weights because (1) this approach should guarantee that particular deleted information is never extracted by future prompt attacks, and (2) it should protect against whitebox attacks, which is necessary for making claims about safety/privacy in a setting where publicly available model weights could be used to elicit sensitive information. Our threat model assumes that an attack succeeds if the answer to a sensitive question is located among a set of B generated candidates, based on scenarios where the information would be insecure if the answer is among B candidates. Experimentally, we show that even state-of-the-art model editing methods such as ROME struggle to truly delete factual information from models like GPT-J, as our whitebox and blackbox attacks can recover \u201cdeleted\u201d information from an edited model 38% of the time. These attacks leverage two key observations: (1) that traces of deleted information can be found in intermediate model hidden states, and (2) that applying an editing method for one question may not delete information across rephrased versions of the question. Finally, we provide new defense methods that protect against some extraction attacks, but we do not find a single universally effective defense method. Our results suggest that truly deleting sensitive information is a tractable but difficult problem, since even relatively low attack success rates have potentially severe implications for the deployment of language models in a world where individuals enjoy ownership of their personal data, a right to privacy, and safety from harmful model outputs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=7erlRDoaV8",
    "arxiv_id": "2309.17410",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19352,
    "title": "SpikePoint: An Efficient Point-based Spiking Neural Network for Event Cameras Action Recognition",
    "authors": [
      "Hongwei Ren",
      "Yue Zhou",
      "Xiaopeng LIN",
      "Yulong Huang",
      "Haotian FU",
      "Jie Song",
      "Bojun Cheng"
    ],
    "abstract": "Event cameras are bio-inspired sensors that respond to local changes in light intensity and feature low latency, high energy efficiency, and high dynamic range. Meanwhile, Spiking Neural Networks (SNNs) have gained significant attention due to their remarkable efficiency and fault tolerance. By synergistically harnessing the energy efficiency inherent in event cameras and the spike-based processing capabilities of SNNs, their integration could enable ultra-low-power application scenarios, such as action recognition tasks. However, existing approaches often entail converting asynchronous events into conventional frames, leading to additional data mapping efforts and a loss of sparsity, contradicting the design concept of SNNs and event cameras. To address this challenge, we propose SpikePoint, a novel end-to-end point-based SNN architecture. SpikePoint excels at processing sparse event cloud data, effectively extracting both global and local features through a singular-stage structure. Leveraging the surrogate training method, SpikePoint achieves high accuracy with few parameters and maintains low power consumption, specifically employing the identity mapping feature extractor on diverse datasets. SpikePoint achieves state-of-the-art (SOTA) performance on four event-based action recognition datasets using only 16 timesteps, surpassing other SNN methods. Moreover, it also achieves SOTA performance across all methods on three datasets, utilizing approximately 0.3 % of the parameters and 0.5 % of power consumption employed by artificial neural networks (ANNs). These results emphasize the significance of Point Cloud and pave the way for many ultra-low-power event-based data processing applications.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=7etoNfU9uF",
    "arxiv_id": "2310.07189",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19347,
    "title": "TimeMixer: Decomposable Multiscale Mixing for Time Series Forecasting",
    "authors": [
      "Shiyu Wang",
      "Haixu Wu",
      "Xiaoming Shi",
      "Tengge Hu",
      "Huakun Luo",
      "Lintao Ma",
      "James Y. Zhang",
      "JUN ZHOU"
    ],
    "abstract": "Time series forecasting is widely used in extensive applications, such as traffic planning and weather forecasting. However, real-world time series usually present intricate temporal variations, making forecasting extremely challenging. Going beyond the mainstream paradigms of plain decomposition and multiperiodicity analysis, we analyze temporal variations in a novel view of multiscale-mixing, where time series present distinct patterns in different sampling scales. Specifically, the microscopic and the macroscopic information are reflected in fine and coarse scales, respectively, and thereby complex variations are inherently disentangled. Based on this observation, we propose TimeMixer as a fully MLP-based architecture with Past-Decomposable-Mixing (PDM) and Future-Multipredictor-Mixing (FMM) blocks to take full advantage of disentangled multiscale series in both past extraction and future prediction phases. Concretely, PDM applies the decomposition to multiscale series and further mixes the decomposed seasonal and trend components in fine-to-coarse and coarse-to-fine directions separately, which successively aggregates the microscopic seasonal and macroscopic trend information. FMM further ensembles multiple predictors to utilize complementary forecasting capabilities in multiscale observations. Consequently, our proposed TimeMixer is able to achieve consistent state-of-the-art performances in both long-term and short-term forecasting tasks with favorable run-time efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7oLshfEIC2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19346,
    "title": "Heterogeneous Personalized Federated Learning by Local-Global Updates Mixing via Convergence Rate",
    "authors": [
      "Meirui Jiang",
      "Anjie Le",
      "Xiaoxiao Li",
      "Qi Dou"
    ],
    "abstract": "Personalized federated learning (PFL) has emerged as a promising technique for addressing the challenge of data heterogeneity. While recent studies have made notable progress in mitigating heterogeneity associated with label distributions, the issue of effectively handling feature heterogeneity remains an open question. In this paper, we propose a personalization approach by Local-global updates Mixing (LG-Mix) via Neural Tangent Kernel (NTK)-based convergence. The core idea is to leverage the convergence rate induced by NTK to quantify the importance of local and global updates, and subsequently mix these updates based on their importance. Specifically, we find the trace of the NTK matrix can manifest the convergence rate, and propose an efficient and effective approximation to calculate the trace of a feature matrix instead of the NTK matrix. Such approximation significantly reduces the cost of computing NTK, and the feature matrix explicitly considers the heterogeneous features among samples. We have theoretically analyzed the convergence of our method in the over-parameterize regime, and experimentally evaluated our method on five datasets. These datasets present heterogeneous data features in natural and medical images. With comprehensive comparison to existing state-of-the-art approaches, our LG-Mix has consistently outperformed them across all datasets (largest accuracy improvement of 5.01\\%), demonstrating the outstanding efficacy of our method for model personalization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7pWRLDBAtc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19344,
    "title": "Cauchy-Schwarz Divergence Information Bottleneck for Regression",
    "authors": [
      "Shujian Yu",
      "Xi Yu",
      "Sigurd L\u00f8kse",
      "Robert Jenssen",
      "Jose C Principe"
    ],
    "abstract": "The information bottleneck (IB) approach is popular to improve the generalization, robustness and explainability of deep neural networks. Essentially, it aims to find a minimum sufficient representation $\\mathbf{t}$ by striking a trade-off between a compression term, which is usually characterized by mutual information $I(\\mathbf{x};\\mathbf{t})$ where $\\mathbf{x}$ refers to the input, and a prediction term usually characterized by $I(y;\\mathbf{t})$ where $y$ is the desired response. Mutual information is for the IB for the most part expressed in terms of the Kullback-Leibler (KL) divergence, which in the regression case corresponds to prediction based on mean squared error (MSE) loss with Gaussian assumption and compression approximated by variational inference. In this paper, we study the IB principle for the regression problem and develop a new way to parameterize the IB with deep neural networks by exploiting favorable properties of the Cauchy-Schwarz (CS) divergence. By doing so, we move away from MSE-based regression and ease estimation by avoiding variational approximations or distributional assumptions. We investigate the improved generalization ability of our proposed CS-IB and demonstrate strong adversarial robustness guarantees. We demonstrate its superior performance on six real-world regression tasks over other popular deep IB approaches. We additionally observe that the solutions discovered by CS-IB always achieve the best trade-off between prediction accuracy and compression ratio in the information plane.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7wY67ZDQTE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19343,
    "title": "Free from Bellman Completeness: Trajectory Stitching via Model-based Return-conditioned Supervised Learning",
    "authors": [
      "Zhaoyi Zhou",
      "Chuning Zhu",
      "Runlong Zhou",
      "Qiwen Cui",
      "Abhishek Gupta",
      "Simon Shaolei Du"
    ],
    "abstract": "Off-policy dynamic programming (DP) techniques such as $Q$-learning have proven to be important in sequential decision-making problems. In the presence of function approximation, however, these techniques often diverge due to the absence of Bellman completeness in the function classes considered, a crucial condition for the success of DP-based methods. In this paper, we show how off-policy learning techniques based on return-conditioned supervised learning (RCSL) are able to circumvent these challenges of Bellman completeness, converging under significantly more relaxed assumptions inherited from supervised learning. We prove there exists a natural environment in which if one uses two-layer multilayer perceptron as the function approximator, the layer width needs to grow *linearly* with the state space size to satisfy Bellman completeness while a constant layer width is enough for RCSL. These findings take a step towards explaining the superior empirical performance of RCSL methods compared to DP-based methods in environments with near-optimal datasets. Furthermore, in order to learn from sub-optimal datasets, we propose a simple framework called MBRCSL, granting RCSL methods the ability of dynamic programming to stitch together segments from distinct trajectories. MBRCSL leverages learned dynamics models and forward sampling to accomplish trajectory stitching while avoiding the need for Bellman completeness that plagues all dynamic programming algorithms. We propose both theoretical analysis and experimental evaluation to back these claims, outperforming state-of-the-art model-free and model-based offline RL algorithms across several simulated robotics problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7zY781bMDO",
    "arxiv_id": "2310.19308",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19342,
    "title": "Dynamic Neighborhood Construction for Structured Large Discrete Action Spaces",
    "authors": [
      "Fabian Akkerman",
      "Julius Luy",
      "Wouter van Heeswijk",
      "Maximilian Schiffer"
    ],
    "abstract": "Large discrete action spaces (LDAS) remain a central challenge in reinforcement learning. Existing solution approaches can handle unstructured LDAS with up to a few million actions. However, many real-world applications in logistics, production, and transportation systems have combinatorial action spaces, whose size grows well beyond millions of actions, even on small instances. Fortunately, such action spaces exhibit structure, e.g., equally spaced discrete resource units. With this work, we focus on handling structured LDAS (SLDAS) with sizes that cannot be handled by current benchmarks: we propose Dynamic Neighborhood Construction (DNC), a novel exploitation paradigm for SLDAS. We present a scalable neighborhood exploration heuristic that utilizes this paradigm and efficiently explores the discrete neighborhood around the continuous proxy action in structured action spaces with up to $10^{73}$ actions. We demonstrate the performance of our method by benchmarking it against three state-of-the-art approaches designed for large discrete action spaces across two distinct environments. Our results show that DNC matches or outperforms state-of-the-art approaches while being computationally more  efficient. Furthermore, our method scales to action spaces that so far remained computationally intractable for existing methodologies.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=80wh3jjCZf",
    "arxiv_id": "2305.19891",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19341,
    "title": "FreeDyG: Frequency Enhanced Continuous-Time Dynamic Graph Model for Link Prediction",
    "authors": [
      "Yuxing Tian",
      "Yiyan Qi",
      "Fan Guo"
    ],
    "abstract": "Link prediction is a crucial task in dynamic graph learning. Recent advancements in continuous-time dynamic graph models, primarily by leveraging richer temporal details, have significantly improved link prediction performance. However, due to their complex modules, they still face several challenges, such as overfitting and optimization difficulties. More importantly, it is challenging for these methods to capture the 'shift' phenomenon, where node interaction patterns change over time. To address these issues, we propose a simple yet novel method called \\textbf{Fre}quency \\textbf{E}nhanced Decomposed Continuous-Time \\textbf{Dy}namic \\textbf{G}raph ({\\bf FreeDyG}) model for link prediction. FreeDyG extracts node representations based on their historical first-hop neighbors thus transforming the dynamic graph learning problem into time series analysis where node interactions are observed over sequential time points. Unlike previous works that primarily focus on the time domain, we delve into the frequency domain, allowing a deeper and more nuanced extraction of interaction patterns, revealing periodic and \"shift\" behaviors. Extensive experiments conducted on seven real-world continuous-time dynamic graph datasets validate the effectiveness of FreeDyG. The results consistently demonstrate that FreeDyG outperforms existing methods in both transductive and inductive settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=82Mc5ilInM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19787,
    "title": "Detecting, Explaining, and Mitigating Memorization in Diffusion Models",
    "authors": [
      "Yuxin Wen",
      "Yuchen Liu",
      "Chen Chen",
      "Lingjuan Lyu"
    ],
    "abstract": "Recent breakthroughs in diffusion models have exhibited exceptional image-generation capabilities. However, studies show that some outputs are merely replications of training data. Such replications present potential legal challenges for model owners, especially when the generated content contains proprietary information. In this work, we introduce a straightforward yet effective method for detecting memorized prompts by inspecting the magnitude of text-conditional predictions. Our proposed method seamlessly integrates without disrupting sampling algorithms, and delivers high accuracy even at the first generation step, with a single generation per prompt. Building on our detection strategy, we unveil an explainable approach that shows the contribution of individual words or tokens to memorization. This offers an interactive medium for users to adjust their prompts. Moreover, we propose two strategies i.e., to mitigate memorization by leveraging the magnitude of text-conditional predictions, either through minimization during inference or filtering during training. These proposed strategies effectively counteract memorization while maintaining high-generation quality.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=84n3UwkH7b",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19339,
    "title": "CompA: Addressing the Gap in Compositional Reasoning in Audio-Language Models",
    "authors": [
      "Sreyan Ghosh",
      "Ashish Seth",
      "Sonal Kumar",
      "Utkarsh Tyagi",
      "Chandra Kiran Reddy Evuru",
      "Ramaneswaran S",
      "S Sakshi",
      "Oriol Nieto",
      "Ramani Duraiswami",
      "Dinesh Manocha"
    ],
    "abstract": "A fundamental characteristic of audio is its compositional nature. Audio-language models (ALMs) trained using a contrastive approach (e.g., CLAP) that learns a shared representation between audio and language modalities have improved performance in many downstream applications, including zero-shot audio classification, audio retrieval, etc. However, the ability of these models to effectively perform compositional reasoning remains largely unexplored and necessitates additional research. In this paper, we propose \\textbf{CompA}, a collection of two expert-annotated benchmarks with a majority of real-world audio samples, to evaluate compositional reasoning in ALMs. Our proposed CompA-order evaluates how well an ALM understands the order or occurrence of acoustic events in audio, and CompA-attribute evaluates attribute binding of acoustic events. An instance from either benchmark consists of two audio-caption pairs, where both audios have the same acoustic events but with different compositions. An ALM is evaluated on how well it matches the right audio to the right caption. Using this benchmark, we first show that current ALMs perform only marginally better than random chance, thereby struggling with compositional reasoning. Next, we propose CompA-CLAP, where we fine-tune CLAP using a novel learning method to improve its compositional reasoning abilities. To train CompA-CLAP, we first propose improvements to contrastive training with composition-aware hard negatives, allowing for more focused training. Next, we propose a novel modular contrastive loss that helps the model learn fine-grained compositional understanding and overcomes the acute scarcity of openly available compositional audios. CompA-CLAP significantly improves over all our baseline models on the CompA benchmark, indicating its superior compositional reasoning capabilities.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=86NGO8qeWs",
    "arxiv_id": "2310.08753",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19338,
    "title": "CPPO: Continual Learning for Reinforcement Learning with Human Feedback",
    "authors": [
      "Han Zhang",
      "Yu Lei",
      "Lin Gui",
      "Min Yang",
      "Yulan He",
      "Hui Wang",
      "Ruifeng Xu"
    ],
    "abstract": "The approach of Reinforcement Learning from Human Feedback (RLHF) is widely used for enhancing pre-trained Language Models (LM), enabling them to better align with human preferences. Existing RLHF-based LMs however require complete retraining whenever new queries or feedback are introduced, as human preferences may differ across different domains or topics. LM retraining is often impracticable in most real-world scenarios, due to the substantial time and computational costs involved, as well as data privacy concerns. To address this limitation, we propose Continual Proximal Policy Optimization (CPPO), a novel method that is able to continually align LM with dynamic human preferences. Specifically, CPPO adopts a weighting strategy to decide which samples should be utilized for enhancing policy learning and which should be used for solidifying past experiences. This seeks a good trade-off between policy learning and knowledge retention. Our experimental results show that CPPO outperforms strong Continuous learning (CL) baselines when it comes to consistently aligning with human preferences. Furthermore, compared to PPO, CPPO offers more efficient and stable learning in non-continual scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=86zAUE80pP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19336,
    "title": "A Policy Gradient Method for Confounded POMDPs",
    "authors": [
      "Mao Hong",
      "Zhengling Qi",
      "Yanxun Xu"
    ],
    "abstract": "In this paper, we propose a policy gradient method for confounded partially observable Markov decision processes (POMDPs) with continuous state and observation spaces in the offline setting. We first establish a novel identification result to non-parametrically estimate any history-dependent policy gradient under POMDPs using the offline data. The identification enables us to solve a sequence of conditional moment restrictions and adopt the min-max learning procedure with general function approximation for estimating the policy gradient. We then provide a finite-sample non-asymptotic bound for estimating the gradient uniformly over a pre-specified policy class in terms of the sample size, length of horizon, concentratability coefficient and the measure of ill-posedness in solving the conditional moment restrictions. Lastly, by deploying the proposed gradient estimation in the gradient ascent algorithm, we show the global convergence of the proposed algorithm in finding the history-dependent optimal policy under some technical conditions. To the best of our knowledge, this is the first work studying the policy gradient method for POMDPs under the offline setting.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8BAkNCqpGW",
    "arxiv_id": "2305.17083",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19335,
    "title": "CLAP: Collaborative Adaptation for Patchwork Learning",
    "authors": [
      "Sen Cui",
      "Abudukelimu Wuerkaixi",
      "Weishen Pan",
      "Jian Liang",
      "Lei Fang",
      "Changshui Zhang",
      "Fei Wang"
    ],
    "abstract": "In this paper, we investigate a new practical learning scenario, where the data distributed in different sources/clients are typically generated with various modalities. Existing research on learning from multi-source data mostly assume that each client owns the data of all modalities, which may largely limit its practicability. In light of the expensiveness and sparsity of multimodal data, we propose \"checkerboard learning\" to jointly learn from fragmented multimodal data in distributed clients. Considering the concerns on data privacy, checkerboard learning aims to impute incomplete multimodal data for diverse downstream tasks without accessing the raw data directly. Local clients could miss different modality combinations. Due to the statistical heterogeneity induced by non-i.i.d. data, the imputation is more challenging since the learned dependencies fail to adapt to the imputation of other clients. In this paper, we provide a novel imputation framework to tackle modality combination heterogeneity and statistical heterogeneity simultaneously, called ``collaborative adaptation''. In particular, for two observed modality combinations from two clients, we learn the transformations between their maximal intersection and other modalities by proposing a novel ELBO. We improve the worst-performing required transformations through a Pareto min-max framework. In extensive experiments, we demonstrate the superiority of the proposed method compared to existing related methods on benchmark data sets and a real-world clinical data set.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=8EyRkd3Qj2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19334,
    "title": "Language-Interfaced Tabular Oversampling via Progressive Imputation and Self-Authentication",
    "authors": [
      "June Yong Yang",
      "Geondo Park",
      "Joowon Kim",
      "Hyeongwon Jang",
      "Eunho Yang"
    ],
    "abstract": "Tabular data in the wild are frequently afflicted with class-imbalance, biasing machine learning models towards major classes. A straightforward, data-centric approach to this problem is oversampling - where synthetic minority samples are generated to balance the classes. Although tabular generative models are capable of generating synthetic samples, their integrity suffers when the number of minority samples is low. To this end, language models primed with rich prior knowledge are a fitting candidate for the task at hand. However, an oversampling strategy utilizing the extensive capabilities of such language models is yet to emerge. In this paper, we propose a novel tabular oversampling framework to channel the power of language interfaces. By leveraging its conditional sampling capabilities, we synthesize minority samples by progressively masking the important features of the majority class samples and imputing them towards the minority distribution. To reduce the inclusion of imperfectly converted samples, we utilize the power of the language model itself to self-authenticate the labels of the samples generated by itself, sifting out ill-converted samples. Extensive experiments on a variety of datasets and imbalance ratios reveal that the proposed method successfully generates reliable minority samples to boost the performance of machine learning classifiers, even under heavy imbalance ratios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8F6bws5JBy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17967,
    "title": "Towards Unified Multi-Modal Personalization: Large Vision-Language Models for Generative Recommendation and Beyond",
    "authors": [
      "Tianxin Wei",
      "Bowen Jin",
      "Ruirui Li",
      "Hansi Zeng",
      "Zhengyang Wang",
      "Jianhui Sun",
      "Qingyu Yin",
      "Hanqing Lu",
      "Suhang Wang",
      "Jingrui He",
      "Xianfeng Tang"
    ],
    "abstract": "Developing a universal model that can effectively harness heterogeneous resources and respond to a wide range of personalized needs has been a longstanding community aspiration. Our daily choices, especially in domains like fashion and retail, are substantially shaped by multi-modal data, such as pictures and textual descriptions. These modalities not only offer intuitive guidance but also cater to personalized user preferences. However, the predominant personalization approaches mainly focus on ID or text-based recommendation problem, failing to comprehend the information spanning various tasks or modalities. In this paper, our goal is to establish a Unified paradigm for Multi-modal Personalization systems (UniMP), which effectively leverages multi-modal data while eliminating the complexities associated with task- and modality-specific customization. We argue that the advancements in foundational generative modeling have provided the flexibility and effectiveness necessary to achieve the objective. In light of this, we develop a generic and extensible personalization generative framework, that can handle a wide range of personalized needs including item recommendation, product search, preference prediction, explanation generation, and further user-guided image generation. Our methodology enhances the capabilities of foundational language models for personalized tasks by seamlessly ingesting interleaved cross-modal user history information, ensuring a more precise and customized experience for users. To train and evaluate the proposed multi-modal personalized tasks, we also introduce a novel and comprehensive benchmark covered a variety of user requirements. Our experiments on the real-world benchmark showcase the model's potential, outperforming competitive methods specialized for each task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=khAE1sTMdX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19330,
    "title": "lpNTK: Better Generalisation with Less Data via Sample Interaction During Learning",
    "authors": [
      "Shangmin Guo",
      "Yi Ren",
      "Stefano V Albrecht",
      "Kenny Smith"
    ],
    "abstract": "Although much research has been done on proposing new models or loss functions to improve the generalisation of artificial neural networks (ANNs), less attention has been directed to the impact of the training data on generalisation. In this work, we start from approximating the interaction between samples, i.e. how learning one sample would modify the model's prediction on other samples. Through analysing the terms involved in weight updates in supervised learning, we find that labels influence the interaction between samples. Therefore, we propose the labelled pseudo Neural Tangent Kernel (lpNTK) which takes label information into consideration when measuring the interactions between samples. We first prove that lpNTK asymptotically converges to the empirical neural tangent kernel in terms of the Frobenius norm under certain assumptions. Secondly, we illustrate how lpNTK helps to understand learning phenomena identified in previous work, specifically the learning difficulty of samples and forgetting events during learning. Moreover, we also show that using lpNTK to identify and remove poisoning training samples does not hurt the generalisation performance of ANNs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8Ju0VmvMCW",
    "arxiv_id": "2401.08808",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19329,
    "title": "Fast-ELECTRA for Efficient Pre-training",
    "authors": [
      "Chengyu Dong",
      "Liyuan Liu",
      "Hao Cheng",
      "Jingbo Shang",
      "Jianfeng Gao",
      "Xiaodong Liu"
    ],
    "abstract": "ELECTRA pre-trains language models by detecting tokens in a sequence that have been replaced by an auxiliary model. Although ELECTRA offers a significant boost in efficiency, its potential is constrained by the training cost brought by the auxiliary model. Notably, this model, which is jointly trained with the main model, only serves to assist the training of the main model and is discarded post-training. This results in a substantial amount of training cost being expended in vain. To mitigate this issue, we propose Fast-ELECTRA, which leverages an existing language model as the auxiliary model. To construct a learning curriculum for the main model, we smooth its output distribution via temperature scaling following a descending schedule. Our approach rivals the performance of state-of-the-art ELECTRA-style pre-training methods, while significantly eliminating the computation and memory cost brought by the joint training of the auxiliary model. Our method also reduces the sensitivity to hyper-parameters and enhances the pre-training stability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8OBuqbLb8h",
    "arxiv_id": "2310.07347",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19327,
    "title": "R&B: Region and Boundary Aware Zero-shot Grounded Text-to-image Generation",
    "authors": [
      "Jiayu Xiao",
      "Henglei Lv",
      "Liang Li",
      "Shuhui Wang",
      "Qingming Huang"
    ],
    "abstract": "Recent text-to-image (T2I) diffusion models have achieved remarkable progress in generating high-quality images given text-prompts as input. However, these models fail to convey appropriate spatial composition specified by a layout instruction. In this work, we probe into zero-shot grounded T2I generation with diffusion models, that is, generating images corresponding to the input layout information without training auxiliary modules or finetuning diffusion models. We propose a Region and Boundary (R&B) aware cross-attention guidance approach that gradually modulates the attention maps of diffusion model during generative process, and assists the model to synthesize images (1) with high fidelity, (2) highly compatible with textual input, and (3) interpreting layout instructions accurately. Specifically, we leverage the discrete sampling to bridge the gap between consecutive attention maps and discrete layout constraints, and design a region-aware loss to refine the generative layout during diffusion process. We further propose a boundary-aware loss to strengthen object discriminability within the corresponding regions. Experimental results show that our method outperforms existing state-of-the-art zero-shot grounded T2I generation methods by a large margin both qualitatively and quantitatively on several benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8Q4uVOJ5bX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19326,
    "title": "Class Incremental Learning via Likelihood Ratio Based Task Prediction",
    "authors": [
      "Haowei Lin",
      "Yijia Shao",
      "Weinan Qian",
      "Ningxin Pan",
      "Yiduo Guo",
      "Bing Liu"
    ],
    "abstract": "Class incremental learning (CIL) is a challenging setting of continual learning, which learns a series of tasks sequentially. Each task consists of a set of unique classes. The key feature of CIL is that no task identifier (or task-id) is provided at test time. Predicting the task-id for each test sample is a challenging problem. An emerging theory-guided approach (called TIL+OOD) is to train a task-specific model for each task in a shared network for all tasks based on a task-incremental learning (TIL) method to deal with catastrophic forgetting. The model for each task is an out-of-distribution (OOD) detector rather than a conventional classifier. The OOD detector can perform both within-task (in-distribution (IND)) class prediction and OOD detection. The OOD detection capability is the key to task-id prediction during inference. However, this paper argues that using a traditional OOD detector for task-id prediction is sub-optimal because additional information (e.g., the replay data and the learned tasks) available in CIL can be exploited to design a better and principled method for task-id prediction. We call the new method TPL (Task-id Prediction based on Likelihood Ratio). TPL markedly outperforms strong CIL baselines and has negligible catastrophic forgetting. The code of TPL is publicly available at https://github.com/linhaowei1/TPL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8QfK9Dq4q0",
    "arxiv_id": "2309.15048",
    "GitHub": [
      "https://github.com/linhaowei1/TPL"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19325,
    "title": "Revisiting Link Prediction: a data perspective",
    "authors": [
      "Haitao Mao",
      "Juanhui Li",
      "Harry Shomer",
      "Bingheng Li",
      "Wenqi Fan",
      "Yao Ma",
      "Tong Zhao",
      "Neil Shah",
      "Jiliang Tang"
    ],
    "abstract": "Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction. However, since datasets span a multitude of domains, they could have distinct underlying mechanisms of link formation. Evidence in existing literature underscores the absence of a universally best algorithm suitable for all datasets. In this paper, we endeavor to explore principles of link prediction across diverse datasets from a data-centric perspective. We recognize three fundamental factors critical to link prediction: local structural proximity, global structural proximity, and feature proximity. We then unearth relationships among those factors where (i) global structural proximity only shows effectiveness when local structural proximity is deficient. (ii) The incompatibility can be found between feature and structural proximity. Such incompatibility leads to GNNs for Link Prediction (GNN4LP) consistently underperforming on edges where the feature proximity factor dominates. Inspired by these new insights from a data perspective, we offer practical instruction for GNN4LP model design and guidelines for selecting appropriate benchmark datasets for more comprehensive evaluations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8Ur2xmuw7w",
    "arxiv_id": "2310.00793",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19324,
    "title": "Context is Environment",
    "authors": [
      "Sharut Gupta",
      "Stefanie Jegelka",
      "David Lopez-Paz",
      "Kartik Ahuja"
    ],
    "abstract": "Two lines of work are taking the central stage in AI research. On the one hand, the community is making increasing efforts to build models that discard spurious correlations and generalize better in novel test environments. Unfortunately, the hard lesson so far is that no proposal convincingly outperforms a simple empirical risk minimization baseline. On the other hand, large language models (LLMs) have erupted as algorithms able to learn in-context, generalizing on-the-fly to eclectic contextual circumstances that users enforce by means of prompting. In this paper, we argue that context is environment, and posit that in-context learning holds the key to better domain generalization. Via extensive theory and experiments, we show that paying attention to context$\\unicode{x2013}\\unicode{x2013}$unlabeled examples as they arrive$\\unicode{x2013}\\unicode{x2013}$allows our proposed In-Context Risk Minimization (ICRM) algorithm to zoom-in on the test environment risk minimizer, leading to significant out-of-distribution performance improvements. From all of this, two messages are worth taking home. Researchers in domain generalization should consider environment as context, and harness the adaptive power of in-context learning. Researchers in LLMs should consider context as environment, to better structure data towards generalization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8VPWfqtQMX",
    "arxiv_id": "2309.09888",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19323,
    "title": "OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models",
    "authors": [
      "Wenqi Shao",
      "Mengzhao Chen",
      "Zhaoyang Zhang",
      "Peng Xu",
      "Lirui Zhao",
      "Zhiqian Li",
      "Kaipeng Zhang",
      "Peng Gao",
      "Yu Qiao",
      "Ping Luo"
    ],
    "abstract": "Large language models (LLMs) have revolutionized natural language processing tasks. However, their practical deployment is hindered by their immense memory and computation requirements. Although recent post-training quantization (PTQ) methods are effective in reducing memory footprint and improving the computational efficiency of LLM, they hand-craft quantization parameters, which leads to low performance and fails to deal with extremely low-bit quantization. To tackle this issue, we introduce an Omnidirectionally calibrated Quantization (OmniQuant) technique for LLMs, which achieves good performance in diverse quantization settings while maintaining the computational efficiency of PTQ by efficiently optimizing various quantization parameters. OmniQuant comprises two innovative components including Learnable Weight Clipping (LWC) and Learnable Equivalent Transformation (LET). LWC modulates the extreme values of weights by optimizing the clipping threshold. Meanwhile, LET tackles activation outliers by shifting the challenge of quantization from activations to weights through a learnable equivalent transformation. Operating within a differentiable framework using block-wise error minimization, OmniQuant can optimize the quantization process efficiently for both weight-only and weight-activation quantization. For instance, the LLaMA-2 model family with the size of 7-70B can be processed with OmniQuant on a single A100-40G GPU within 1-16 hours using 128 samples. Extensive experiments validate OmniQuant's superior performance across diverse quantization configurations such as W4A4, W6A6, W4A16, W3A16, and W2A16. Additionally, OmniQuant demonstrates effectiveness in instruction-tuned models and delivers notable improvements in inference speed and memory reduction on real devices. Codes and models are available at https://github.com/anonymous998899/OmniQuant.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=8Wuvhh0LYW",
    "arxiv_id": "2308.13137",
    "GitHub": [
      "https://github.com/OpenGVLab/OmniQuant"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19322,
    "title": "Uncertainty-aware Graph-based Hyperspectral Image Classification",
    "authors": [
      "Linlin Yu",
      "Yifei Lou",
      "Feng Chen"
    ],
    "abstract": "Hyperspectral imaging (HSI) technology captures spectral information across a broad wavelength range, providing richer pixel features compared to traditional color images with only three channels. Although pixel classification in HSI  has been extensively studied, especially using graph convolution neural networks (GCNs), quantifying epistemic and aleatoric uncertainties associated with the HSI classification (HSIC) results remains an unexplored area. These two uncertainties are effective for out-of-distribution (OOD) and misclassification detection, respectively. In this paper, we adapt two advanced uncertainty quantification models, evidential GCNs (EGCN) and graph posterior networks (GPN), designed for node classifications in graphs, into the realm of HSIC. We first analyze theoretically the limitations of a popular uncertainty cross-entropy (UCE) loss function when learning EGCNs for epistemic uncertainty estimation. To mitigate the limitations, we propose two regularization terms. One leverages the inherent property of HSI data where pixel features can be decomposed into weighted sums of various material features, and the other is the total variation (TV) regularization to enforce the spatial smoothness of the evidence with edge-preserving. We demonstrate the effectiveness of the proposed regularization terms on both EGCN and GPN on three real-world HSIC datasets for OOD and misclassification detection tasks. The code is available at \\url{https://anonymous.4open.science/r/HSI_torch-1586/}",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8dN7gApKm3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19321,
    "title": "Prometheus: Inducing Fine-Grained Evaluation Capability in Language Models",
    "authors": [
      "Seungone Kim",
      "Jamin Shin",
      "Yejin Cho",
      "Joel Jang",
      "Shayne Longpre",
      "Hwaran Lee",
      "Sangdoo Yun",
      "Seongjin Shin",
      "Sungdong Kim",
      "James Thorne",
      "Minjoon Seo"
    ],
    "abstract": "Recently, GPT-4 has become the de facto evaluator for long-form text generated by large language models (LLMs). However, for practitioners and researchers with large and custom evaluation tasks, GPT-4 is unreliable due to its closed-source nature, uncontrolled versioning, and prohibitive costs. In this work, we propose PROMETHEUS a fully open-source LLM that is on par with GPT-4\u2019s evaluation capabilities when the appropriate reference materials (reference answer, score rubric) are accompanied. For this purpose, we construct a new dataset \u2013 FEEDBACK COLLECTION \u2013 that consists of 1K fine-grained score rubrics, 20K instructions, and 100K natural language feedback generated by GPT-4. Using the FEEDBACK COLLECTION, we train PROMETHEUS, a 13B evaluation-specific LLM that can assess any given response based on novel and unseen score rubrics and reference materials provided by the user. Our dataset\u2019s versatility and diversity make our model generalize to challenging real-world criteria, such as prioritizing conciseness, child-readability, or varying levels of formality. We show that PROMETHEUS shows a stronger correlation with GPT-4 evaluation compared to ChatGPT on seven evaluation benchmarks (Two Feedback Collection testsets, MT Bench, Vicuna Bench, Flask Eval, MT Bench Human Judgment, and HHH Alignment), showing the efficacy of our model and dataset design. During human evaluation with hand-crafted score rubrics, PROMETHEUS shows a Pearson correlation of 0.897 with human evaluators, which is on par with GPT-4-0613 (0.882), and greatly outperforms ChatGPT (0.392). Remarkably, when assessing the quality of the generated feedback, PROMETHEUS demonstrates a win rate of 58.62% when compared to GPT-4 evaluation and a win rate of 79.57% when compared to ChatGPT evaluation. Our findings suggests that by adding reference materials and training on GPT-4 feedback, we can obtain effective open-source evaluator LMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8euJaTveKw",
    "arxiv_id": "2310.08491",
    "GitHub": [
      "https://github.com/kaistAI/Prometheus"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19319,
    "title": "Neural Auto-designer for Enhanced Quantum Kernels",
    "authors": [
      "Cong Lei",
      "Yuxuan Du",
      "Peng Mi",
      "Jun Yu",
      "Tongliang Liu"
    ],
    "abstract": "Quantum kernels hold great promise for offering computational advantages over classical learners, with the effectiveness of these kernels closely tied to the design of the feature map. However, the challenge of designing effective quantum feature maps for real-world datasets, particularly in the absence of sufficient prior information, remains a significant obstacle. In this study, we present a data-driven approach that automates the design of problem-specific quantum feature maps. Our approach leverages feature-selection techniques to handle high-dimensional data on near-term quantum machines with limited qubits, and incorporates a deep neural predictor to efficiently evaluate the performance of various candidate quantum kernels. Through extensive numerical simulations on different datasets, we demonstrate the superiority of our proposal over prior methods, especially for the capability of eliminating the kernel concentration issue and identifying the feature map with prediction  advantages. Our work not only unlocks the potential of quantum kernels for enhancing real-world tasks, but also highlights the substantial role of deep learning in advancing quantum machine learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8htNAnMSyP",
    "arxiv_id": "2401.11098",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19318,
    "title": "Poisoned Forgery Face: Towards Backdoor Attacks on Face Forgery Detection",
    "authors": [
      "Jiawei Liang",
      "Siyuan Liang",
      "Aishan Liu",
      "Xiaojun Jia",
      "Junhao Kuang",
      "Xiaochun Cao"
    ],
    "abstract": "The proliferation of face forgery techniques has raised significant concerns within society, thereby motivating the development of face forgery detection methods. These methods aim to distinguish forged faces from genuine ones and have proven effective in practical applications. However, this paper introduces a novel and previously unrecognized threat in face forgery detection scenarios caused by backdoor attack. By embedding backdoors into models and incorporating specific trigger patterns into the input, attackers can deceive detectors into producing erroneous predictions for forged faces. To achieve this goal, this paper proposes \\emph{Poisoned Forgery Face} framework, which enables clean-label backdoor attacks on face forgery detectors. Our approach involves constructing a scalable trigger generator and utilizing a novel convolving process to generate translation-sensitive trigger patterns. Moreover, we employ a relative embedding method based on landmark-based regions to enhance the stealthiness of the poisoned samples. Consequently, detectors trained on our poisoned samples are embedded with backdoors. Notably, our approach surpasses SoTA backdoor baselines with a significant improvement in attack success rate (+16.39\\% BD-AUC) and reduction in visibility (-12.65\\% $L_\\infty$). Furthermore, our attack exhibits promising performance against backdoor defenses. We anticipate that this paper will draw greater attention to the potential threats posed by backdoor attacks in face forgery detection scenarios. \\emph{Our codes can be found in the anonymous website\\footnote{\\url{https://anonymous.4open.science/r/iclr24_2182}}.}",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=8iTpB4RNvP",
    "arxiv_id": "2402.11473",
    "GitHub": [
      "https://github.com/JWLiang007/PFF"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19317,
    "title": "Finite Scalar Quantization: VQ-VAE Made Simple",
    "authors": [
      "Fabian Mentzer",
      "David Minnen",
      "Eirikur Agustsson",
      "Michael Tschannen"
    ],
    "abstract": "We propose to replace vector quantization (VQ) in the latent representation of VQ-VAEs with a simple scheme termed finite scalar quantization (FSQ), where we project the VAE representation down to a few dimensions (typically less than 10). Each dimension is quantized to a small set of fixed values, leading to an (implicit) codebook given by the product of these sets. By appropriately choosing the number of dimensions and values each dimension can take, we obtain the same codebook size as in VQ. On top of such discrete representations, we can train the same models that have been trained on VQ-VAE representations. For example, autoregressive and masked transformer models for image generation, multimodal generation, and dense prediction computer vision tasks. Concretely, we employ FSQ with MaskGIT for image generation, and with UViM for depth estimation, colorization, and panoptic segmentation. Despite the much simpler design of FSQ, we obtain competitive performance in all these tasks. We emphasize that FSQ does not suffer from codebook collapse and does not need the complex machinery employed in VQ (commitment losses, codebook reseeding, code splitting, entropy penalties, etc.) to learn expressive discrete representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8ishA3LxN8",
    "arxiv_id": "2309.15505",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19316,
    "title": "Combining Axes Preconditioners through Kronecker Approximation for Deep Learning",
    "authors": [
      "Sai Surya Duvvuri",
      "Fnu Devvrit",
      "Rohan Anil",
      "Cho-Jui Hsieh",
      "Inderjit S Dhillon"
    ],
    "abstract": "Adaptive regularization based optimization methods such as full-matrix Adagrad which use gradient second-moment information hold significant potential for fast convergence in deep neural network (DNN) training, but are memory intensive and computationally demanding for large neural nets. We develop a technique called Combining AxeS PReconditioners (CASPR), which optimizes matrix-shaped DNN parameters by finding different preconditioners for each mode/axis of the parameter and combining them using a Kronecker-sum based approximation. We show tighter convergence guarantees in stochastic optimization compared to a Kronecker product based preconditioner, Shampoo, which arises as a special case of CASPR. Furthermore, our experiments demonstrates that CASPR approximates the gradient second-moment matrix in full-matrix Adagrad more accurately, and shows significant improvement in training and generalization performance compared to existing practical adaptive regularization based methods such as Shampoo and Adam in a variety of tasks including graph neural network on OGBG-molpcba, Transformer on a universal dependencies dataset and auto-regressive large language modeling on C4 dataset.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8j9hz8DVi8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19315,
    "title": "DiffEnc: Variational Diffusion with a Learned Encoder",
    "authors": [
      "Beatrix Miranda Ginn Nielsen",
      "Anders Christensen",
      "Andrea Dittadi",
      "Ole Winther"
    ],
    "abstract": "Diffusion models may be viewed as hierarchical variational autoencoders (VAEs) with two improvements: parameter sharing for the conditionals in the generative process and efficient computation of the loss as independent terms over the hierarchy. We consider two changes to the diffusion model that retain these advantages while adding flexibility to the model. Firstly, we introduce a data and depth-dependent mean function in the diffusion process, which leads to a modified diffusion loss. Our proposed framework, DiffEnc, achieves a statistically significant improvement in likelihood on CIFAR-10. Secondly, we let the ratio of the noise variance of the reverse encoder process and the generative process be a free weight parameter rather than being fixed to one. This leads to theoretical insights: For a finite depth hierarchy, the evidence lower bound (ELBO) can be used as an objective for a weighted diffusion loss approach and for optimizing the noise schedule specifically for inference. For the infinite-depth hierarchy, on the other hand, the weight parameter has to be one to have a well-defined ELBO.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8nxy1bQWTG",
    "arxiv_id": "2310.19789",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19314,
    "title": "One Step of Gradient Descent is Provably the Optimal In-Context Learner with One Layer of Linear Self-Attention",
    "authors": [
      "Arvind V. Mahankali",
      "Tatsunori Hashimoto",
      "Tengyu Ma"
    ],
    "abstract": "Recent works have empirically analyzed in-context learning and shown that transformers trained on synthetic linear regression tasks can learn to implement ridge regression, which is the Bayes-optimal predictor, given sufficient capacity (Akyurek et al., 2023), while one-layer transformers with linear self-attention and no MLP layer will learn to implement one step of gradient descent (GD) on a least-squares linear regression objective (von Oswald et al., 2022). However, the theory behind these observations remains poorly understood. We theoretically study transformers with a single layer of linear self-attention, trained on synthetic noisy linear regression data. First, we mathematically show that when the covariates are drawn from a standard Gaussian distribution, the one-layer transformer which minimizes the pre-training loss will implement a single step of GD on the least-squares linear regression objective. Then, we find that changing the distribution of the covariates and weight vector to a non-isotropic Gaussian distribution has a strong impact on the learned algorithm: the global minimizer of the pre-training loss now implements a single step of $\\textit{pre-conditioned}$ GD. However, if only the distribution of the responses is changed, then this does not have a large effect on the learned algorithm: even when the response comes from a more general family of $\\textit{nonlinear}$ functions, the global minimizer of the pre-training loss still implements a single step of GD on a least-squares linear regression objective.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8p3fu56lKc",
    "arxiv_id": "2307.03576",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19764,
    "title": "Unified Generative Modeling of 3D Molecules with Bayesian Flow Networks",
    "authors": [
      "Yuxuan Song",
      "Jingjing Gong",
      "Hao Zhou",
      "Mingyue Zheng",
      "Jingjing Liu",
      "Wei-Ying Ma"
    ],
    "abstract": "Advanced generative model (\\textit{e.g.}, diffusion model) derived from simplified continuity assumptions of data distribution, though showing promising progress, has been difficult to apply directly to geometry generation applications due to the \\textit{multi-modality} and \\textit{noise-sensitive} nature of molecule geometry. This work introduces Geometric Bayesian Flow Networks (GeoBFN), which naturally fits molecule geometry by modeling diverse modalities in the differentiable parameter space of distributions. GeoBFN maintains the SE-(3) invariant density modeling property by incorporating equivariant inter-dependency modeling on parameters of distributions and unifying the probabilistic modeling of different modalities. Through optimized training and sampling techniques, we demonstrate that GeoBFN achieves state-of-the-art performance on multiple 3D molecule generation benchmarks in terms of generation quality (90.87\\% molecule stability in QM9 and 85.6\\% atom stability in GEOM-DRUG\\footnote{The scores are reported at 1k sampling steps for fair comparison, and our scores could be further improved if sampling sufficiently longer steps.}). GeoBFN can also conduct sampling with any number of steps to reach an optimal trade-off between efficiency and quality (\\textit{e.g.}, 20$\\times$ speedup without sacrificing performance).",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=NSVtmmzeRB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19313,
    "title": "Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Tracking",
    "authors": [
      "Nikhil Prakash",
      "Tamar Rott Shaham",
      "Tal Haklay",
      "Yonatan Belinkov",
      "David Bau"
    ],
    "abstract": "Fine-tuning on generalized tasks such as instruction following, code generation, and mathematics has been shown to enhance language models' performance on a range of tasks. Nevertheless, explanations of how such fine-tuning influences the internal computations in these models remain elusive. We study how fine-tuning affects the internal mechanisms implemented in language models. As a case study, we explore the property of entity tracking, a crucial facet of language comprehension, where models fine-tuned on mathematics have substantial performance gains. We identify a mechanism that enables entity tracking and show that (i) both the original model and its fine-tuned version implement entity tracking with the same circuit. In fact, the entity tracking circuit of the fine-tuned version performs better than the full original model. (ii) The circuits of all the models implement roughly the same functionality, that is entity tracking is performed by tracking the position of the correct entity in both the original model and its fine-tuned version. (iii) Performance boost in the fine-tuned model is primarily attributed to its improved ability to handle positional information. To uncover these findings, we employ two methods: DCM, which automatically detects model components responsible for specific semantics, and CMAP, a new approach for patching activations across models to reveal improved mechanisms. Our findings suggest that fine-tuning enhances, rather than fundamentally alters, the mechanistic operation of the model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8sKcAWOf2D",
    "arxiv_id": "2402.14811",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19312,
    "title": "Learning Nash Equilibria in Rank-1 Games",
    "authors": [
      "Nikolas Patris",
      "Ioannis Panageas"
    ],
    "abstract": "Learning Nash equilibria (NE) in games has garnered significant attention, particularly in the context of training Generative Adversarial Networks (GANs) and multi-agent Reinforcement Learning. The current state-of-the-art in efficiently learning games focuses on landscapes that meet the (weak) Minty property or games characterized by a unique function, often referred to as potential games. A significant challenge in this domain is that computing Nash equilibria is a computationally intractable task [Daskalakis et al. 2009]. In this paper we focus on bimatrix games (A,B) called rank-1. These are games in which the sum of the payoff matrices A+B is a rank 1 matrix; note that standard zero-sum games are rank 0. We show that optimistic gradient descent/ascent converges to an \\epsilon-approximate NE after 1/\\epsilon^2 log(1/\\epsilon) iterates in rank-1 games. We achieve this by leveraging structural results about the NE landscape of rank-1 games Adsul et al. 2021. Notably, our approach bypasses the fact that these games do not satisfy the MVI property.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8utTlmhw8v",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19308,
    "title": "On gauge freedom, conservativity and intrinsic dimensionality estimation in diffusion models",
    "authors": [
      "Christian Horvat",
      "Jean-Pascal Pfister"
    ],
    "abstract": "Diffusion models are generative models that have recently demonstrated impressive performances in terms of sampling quality and density estimation in high dimensions. They rely on a forward continuous diffusion process and a backward continuous denoising process, which can be described by a time-dependent vector field and is used as a generative model. In the original formulation of the diffusion model, this vector field is assumed to be the score function (i.e. it is the gradient of the log-probability at a given time in the diffusion process). Curiously, on the practical side, most studies on diffusion models implement this vector field as a neural network function and do not constrain it be the gradient of some energy function (that is, most studies do not constrain the vector field to be conservative). Even though some studies investigated empirically whether such a constraint will lead to a performance gain with contradicting results, they lack analytical evidence. Here, we provide three analytical results regarding the extent of the modeling freedom of this vector field.  Firstly, we show that to obtain exact density estimation and exact sampling, it is neither necessary nor sufficient to assume the vector field to be conservative. Secondly, we derive the full (gauge) freedom satisfied by the vector field. Finally, we show that when it comes to inferring local information of the data manifold, conservativity is sufficient. In particular, we provide a novel algorithm to infer the intrinsic dimensionality of manifolds based on diffusion models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=92KV9xAMhF",
    "arxiv_id": "2402.03845",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19306,
    "title": "Hybrid Internal Model: Learning Agile Legged Locomotion with Simulated Robot Response",
    "authors": [
      "Junfeng Long",
      "ZiRui Wang",
      "Quanyi Li",
      "Liu Cao",
      "Jiawei Gao",
      "Jiangmiao Pang"
    ],
    "abstract": "This paper presents a Hybrid Internal Model (HIM) based method for legged locomotion control in quadruped robots. The method aims to address the limitations of existing learning-based locomotion control paradigms, which suffer from information losses, noisy observations, sample efficiency, and difficulties in developing general locomotion policies for robots with different sensor configurations. The proposed HIM method leverages joint encoders and an Inertial Measurement Unit (IMU) as the only sensors for predicting robot states. Considering the prediction frequency is higher than 50 Hz, the method infers current robot states upon the previous trajectory. The framework consists of two components: the information extractor HIM and the policy network. Unlike previous methods that explicitly model environmental observations such as base velocity and ground elevation, HIM only explicitly estimates velocity and encodes other environment dynamics as an implicit latent embedding. The latent dynamics are learned through contrastive learning, which enhances robustness and adaptability in disturbed and unpredictable environments. The proposed method is validated through simulations in different terrains and real-world experiments on the Unitree Go1 robot. The results demonstrate that HIM achieves substantial agility over challenging terrains with minimal sensors and fast convergence. The method shows promise for broader applications in locomotion control.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=93LoCyww8o",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19305,
    "title": "Alt-Text with Context: Improving Accessibility for Images on Twitter",
    "authors": [
      "Nikita Srivatsan",
      "Sofia Samaniego",
      "Omar Florez",
      "Taylor Berg-Kirkpatrick"
    ],
    "abstract": "In this work we present an approach for generating alternative text (or alt-text) descriptions for images shared on social media, specifically Twitter. More than just a special case of image captioning, alt-text is both more literally descriptive and context-specific. Also critically, images posted to Twitter are often accompanied by user-written text that despite not necessarily describing the image may provide useful context that if properly leveraged can be informative. We address this task with a multimodal model that conditions on both textual information from the associated social media post as well as visual signal from the image, and demonstrate that the utility of these two information sources stacks. We put forward a new dataset of 371k images paired with alt-text and tweets scraped from Twitter and evaluate on it across a variety of automated metrics as well as human evaluation. We show that our approach of conditioning on both tweet text and visual information significantly outperforms prior work, by more than 2x on BLEU@4.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=97Dl82avFs",
    "arxiv_id": "2305.14779",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18979,
    "title": "Dynamic Neural Response Tuning",
    "authors": [
      "Tian Qiu",
      "Xu Wenxiang",
      "lin chen",
      "Zhou Linyun",
      "Zunlei Feng",
      "Mingli Song"
    ],
    "abstract": "Artificial Neural Networks (ANNs) have gained widespread applications across various areas in recent years. The ANN design was initially inspired by the principle of biology. The biological neural network's fundamental response process comprises information transmission and aggregation. The information transmission in biological neurons is often achieved by triggering action potentials that propagate through axons. ANNs utilize activation mechanisms to simulate such biological behavior. However, previous studies have only considered static response conditions, while the biological neuron's response conditions are typically dynamic, depending on multiple factors such as neuron properties and the real-time environment. Therefore, the dynamic response conditions of biological neurons could help improve the static ones of existing activations in ANNs. Additionally, the biological neuron's aggregated response exhibits high specificity for different categories, allowing the nervous system to differentiate and identify objects. Inspired by these biological patterns, we propose a novel Dynamic Neural Response Tuning (DNRT) mechanism, which aligns the response patterns of ANNs with those of biological neurons. DNRT comprises Response-Adaptive Activation (RAA) and Aggregated Response Regularization (ARR), mimicking the biological neuron's information transmission and aggregation behaviors. RAA dynamically adjusts the response condition based on the strength and characteristics of the input signal. ARR is devised to enhance the network's ability to learn category specificity by imposing constraints on the network's response distribution. Extensive experimental studies indicate that the proposed DNRT is highly interpretable, applicable to various mainstream network architectures, and can achieve remarkable performance compared with existing neural response mechanisms in multiple tasks and domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HiTg16qhxp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19304,
    "title": "Learning Decentralized Partially Observable Mean Field Control for Artificial Collective Behavior",
    "authors": [
      "Kai Cui",
      "Sascha H. Hauck",
      "Christian Fabian",
      "Heinz Koeppl"
    ],
    "abstract": "Recent reinforcement learning (RL) methods have achieved success in various domains. However, multi-agent RL (MARL) remains a challenge in terms of decentralization, partial observability and scalability to many agents. Meanwhile, collective behavior requires resolution of the aforementioned challenges, and remains of importance to many state-of-the-art applications such as active matter physics, self-organizing systems, opinion dynamics, and biological or robotic swarms. Here, MARL via mean field control (MFC) offers a potential solution to scalability, but fails to consider decentralized and partially observable systems. In this paper, we enable decentralized behavior of agents under partial information by proposing novel models for decentralized partially observable MFC (Dec-POMFC), a broad class of problems with permutation-invariant agents allowing for reduction to tractable single-agent Markov decision processes (MDP) with single-agent RL solution. We provide rigorous theoretical results, including a dynamic programming principle, together with optimality guarantees for Dec-POMFC solutions applied to finite swarms of interest. Algorithmically, we propose Dec-POMFC-based policy gradient methods for MARL via centralized training and decentralized execution, together with policy gradient approximation guarantees. In addition, we improve upon state-of-the-art histogram-based MFC by kernel methods, which is of separate interest also for fully observable MFC. We evaluate numerically on representative collective behavior tasks such as adapted Kuramoto and Vicsek swarming models, being on par with state-of-the-art MARL. Overall, our framework takes a step towards RL-based engineering of artificial collective behavior via MFC.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=99tKiMVJhY",
    "arxiv_id": "2307.06175",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19302,
    "title": "Elucidating the design space of classifier-guided diffusion generation",
    "authors": [
      "Jiajun Ma",
      "Tianyang Hu",
      "Wenjia Wang",
      "Jiacheng Sun"
    ],
    "abstract": "Guidance in conditional diffusion generation is of great importance for sample quality and controllability. However, existing guidance schemes are to be desired. On one hand, mainstream methods such as classifier guidance and classifier-free guidance both require extra training with labeled data, which is time-consuming and unable to adapt to new conditions.On the other hand, training-free methods such as universal guidance, though more flexible, have yet to demonstrate comparable performance. In this work, through a comprehensive investigation into the design space, we show that it is possible to achieve significant performance improvements over existing guidance schemes by leveraging off-the-shelf classifiers in a training-free fashion, enjoying the best of both worlds. Employing calibration as a general guideline, we propose several pre-conditioning techniques to better exploit pretrained off-the-shelf classifiers for guiding diffusion generation. Extensive experiments on ImageNet validate our proposed method, showing that state-of-the-art (SOTA) diffusion models (DDPM, EDM, DiT) can be further improved (up to 20\\%) using off-the-shelf classifiers with barely any extra computational cost.With the proliferation of publicly available pretrained classifiers, our proposed approach has great potential and can be readily scaled up to text-to-image generation tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9DXXMXnIGm",
    "arxiv_id": "2310.11311",
    "GitHub": [
      "https://github.com/AlexMaOLS/EluCD"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19301,
    "title": "ED-NeRF: Efficient Text-Guided Editing of 3D Scene With Latent Space NeRF",
    "authors": [
      "JangHo Park",
      "Gihyun Kwon",
      "Jong Chul Ye"
    ],
    "abstract": "Recently, there has been a significant advancement in text-to-image diffusion models, leading to groundbreaking performance in 2D image generation. These advancements have been extended to 3D models, enabling the generation of novel 3D objects from textual descriptions. This has evolved into  NeRF editing methods, which allow the manipulation of existing 3D objects through textual conditioning. However, existing NeRF editing techniques have faced limitations in their performance due to slow training speeds and the use of loss functions that do not adequately consider editing. To address this,  here we present a novel 3D NeRF editing approach dubbed ED-NeRF by successfully embedding real-world scenes into the latent space of the latent diffusion model (LDM) through a unique refinement layer. This approach enables us to obtain a NeRF backbone that is not only faster but also more amenable to editing compared to traditional image space NeRF editing. Furthermore, we propose an improved loss function tailored for editing by migrating the delta denoising score (DDS) distillation loss, originally used in 2D image editing to the three-dimensional domain. This novel loss function surpasses the well-known score distillation sampling (SDS) loss in terms of suitability for editing purposes. Our experimental results demonstrate that ED-NeRF achieves faster editing speed while producing improved output quality compared to state-of-the-art 3D editing models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9DvDRTTdlu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19299,
    "title": "Neural Field Classifiers via Target Encoding and Classification Loss",
    "authors": [
      "Xindi Yang",
      "Zeke Xie",
      "Xiong Zhou",
      "Boyu Liu",
      "Buhua Liu",
      "Yi Liu",
      "Haoran Wang",
      "YUNFENG CAI",
      "Mingming Sun"
    ],
    "abstract": "Neural field methods have seen great progress in various long-standing tasks in computer vision and computer graphics, including novel view synthesis and geometry reconstruction. As existing neural field methods try to predict some coordinate-based continuous target values, such as RGB for Neural Radiance Field (NeRF), all of these methods are regression models and are optimized by some regression loss. However, are regression models really better than classification models for neural field methods? In this work, we try to visit this very fundamental but overlooked question for neural fields from a machine learning perspective. We successfully propose a novel Neural Field Classifier (NFC) framework which formulates existing neural field methods as classification tasks rather than regression tasks. The proposed NFC can easily transform arbitrary Neural Field Regressor (NFR) into its classification variant via employing a novel Target Encoding module and optimizing a classification loss. By encoding a continuous regression target into a high-dimensional discrete encoding, we naturally formulate a multi-label classification task. Extensive experiments demonstrate the impressive effectiveness of NFC at the nearly free extra computational costs. Moreover, NFC also shows robustness to sparse inputs, corrupted images, and dynamic scenes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9NqC72m31m",
    "arxiv_id": "2403.01058",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17992,
    "title": "BECLR: Batch Enhanced Contrastive Few-Shot Learning",
    "authors": [
      "Stylianos Poulakakis-Daktylidis",
      "Hadi Jamali-Rad"
    ],
    "abstract": "Learning quickly from very few labeled samples is a fundamental attribute that separates machines and humans in the era of deep representation learning. Unsupervised few-shot learning (U-FSL) aspires to bridge this gap by discarding the reliance on annotations at training time. Intrigued by the success of contrastive learning approaches in the realm of U-FSL, we structurally approach their shortcomings in both pretraining and downstream inference stages. We propose a novel Dynamic Clustered mEmory (DyCE) module to promote a highly separable latent representation space for enhancing positive sampling at the pretraining phase and infusing implicit class-level insights into unsupervised contrastive learning. We then tackle the, somehow overlooked yet critical, issue of sample bias at the few-shot inference stage. We propose an iterative Optimal Transport-based distribution Alignment (OpTA) strategy and demonstrate that it efficiently addresses the problem, especially in low-shot scenarios where FSL approaches suffer the most from sample bias. We later on discuss that DyCE and OpTA are two intertwined pieces of a novel end-to-end approach (we coin as BECLR), constructively magnifying each other's impact. We then present a suite of extensive quantitative and qualitative experimentation to corroborate that BECLR sets a new state-of-the-art across ALL existing U-FSL benchmarks (to the best of our knowledge), and significantly outperforms the best of the current baselines (codebase available at https://github.com/stypoumic/BECLR).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=k9SVcrmXL8",
    "arxiv_id": "2402.02444",
    "GitHub": [
      "https://github.com/stypoumic/BECLR"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17388,
    "title": "AgentBench: Evaluating LLMs as Agents",
    "authors": [
      "Xiao Liu",
      "Hao Yu",
      "Hanchen Zhang",
      "Yifan Xu",
      "Xuanyu Lei",
      "Hanyu Lai",
      "Yu Gu",
      "Hangliang Ding",
      "Kaiwen Men",
      "Kejuan Yang",
      "Shudan Zhang",
      "Xiang Deng",
      "Aohan Zeng",
      "Zhengxiao Du",
      "Chenhui Zhang",
      "Sheng Shen",
      "Tianjun Zhang",
      "Yu Su",
      "Huan Sun",
      "Minlie Huang",
      "Yuxiao Dong",
      "Jie Tang"
    ],
    "abstract": "Large Language Models (LLMs) are becoming increasingly smart and autonomous, targeting real-world pragmatic missions beyond traditional NLP tasks. As a result, there has been an urgent need to evaluate LLMs as agents on challenging tasks in interactive environments.We present AgentBench, a multi-dimensional evolving benchmark that currently consists of 8 distinct environments to assess LLM-as-Agent's reasoning and decision-making abilities in a multi-turn open-ended generation setting.Our extensive test over 27 API-based and open-sourced (OSS) LLMs shows that, while top commercial LLMs present a strong ability of acting as agents in complex environments, there is a significant disparity in performance between them and OSS competitors.We identify the typical reasons of failures in environments and LLMs, showing that poor long-term reasoning, decision-making, and instruction following abilities are the main obstacles for developing usable LLM agents.Training on code and high quality multi-turn alignment data could improve agent performance.Datasets, environments, and an integrated evaluation package for AgentBench are released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zAdUB0aCTQ",
    "arxiv_id": "2308.03688",
    "GitHub": [
      "https://github.com/THUDM/AgentBench"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19298,
    "title": "Towards Understanding Factual Knowledge of Large Language Models",
    "authors": [
      "Xuming Hu",
      "Junzhe Chen",
      "Xiaochuan Li",
      "Yufei Guo",
      "Lijie Wen",
      "Philip S. Yu",
      "Zhijiang Guo"
    ],
    "abstract": "Large language models (LLMs) have recently driven striking performance improvements across a range of natural language processing tasks. The factual knowledge acquired during pretraining and instruction tuning can be useful in various downstream tasks, such as question answering, and language generation. Unlike conventional Knowledge Bases (KBs) that explicitly store factual knowledge, LLMs implicitly store facts in their parameters. Content generated by the LLMs can often exhibit inaccuracies or deviations from the truth, due to facts that can be incorrectly induced or become obsolete over time. To this end, we aim to comprehensively evaluate the extent and scope of factual knowledge within LLMs by designing the benchmark Pinocchio. Pinocchio contains 20K diverse factual questions that span different sources, timelines, domains, regions, and languages. Furthermore, we investigate whether LLMs are able to compose multiple facts, update factual knowledge temporally, reason over multiple pieces of facts, identify subtle factual differences, and resist adversarial examples. Extensive experiments on different sizes and types of LLMs show that existing LLMs still lack factual knowledge and suffer from various spurious correlations. We believe this is a critical bottleneck for realizing trustworthy artificial intelligence. The dataset Pinocchio and our codes will be publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=9OevMUdods",
    "arxiv_id": "2310.05177",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19297,
    "title": "On Double Descent in Reinforcement Learning with LSTD and Random Features",
    "authors": [
      "David Brellmann",
      "Elo\u00efse Berthier",
      "David Filliat",
      "Goran Frehse"
    ],
    "abstract": "Temporal Difference (TD) algorithms are widely used in Deep Reinforcement Learning (RL). Their performance is heavily influenced by the size of the neural network. While in supervised learning, the regime of over-parameterization and its benefits are well understood, the situation in RL is much less clear. In this paper, we present a theoretical analysis of the influence of network size and $l_2$-regularization on performance. We identify the ratio between the number of parameters and the number of visited states as a crucial factor and define over-parameterization as the regime when it is larger than one. Furthermore, we observe a double descent phenomenon, i.e., a sudden drop in performance around the parameter/state ratio of one. Leveraging random features and the lazy training regime, we study the regularized Least-Square Temporal Difference (LSTD) algorithm in an asymptotic regime, as both the number of parameters and states go to infinity, maintaining a constant ratio. We derive deterministic limits of both the empirical and the true Mean-Squared Bellman Error (MSBE) that feature correction terms responsible for the double descent. Correction terms vanish when the $l_2$-regularization is increased or the number of unvisited states goes to zero. Numerical experiments with synthetic and small real-world environments closely match the theoretical predictions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9RIbNmx984",
    "arxiv_id": "2310.05518",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19296,
    "title": "Leave-one-out Distinguishability in Machine Learning",
    "authors": [
      "Jiayuan Ye",
      "Anastasia Borovykh",
      "Soufiane Hayou",
      "Reza Shokri"
    ],
    "abstract": "We introduce a new analytical framework to quantify the changes in a machine learning algorithm's output distribution following the inclusion of a few data points in its training set, a notion we define as leave-one-out distinguishability (LOOD).  This problem is key to measuring data **memorization** and information **leakage** in machine learning, and the **influence** of training data points on model predictions.  We illustrate how our method broadens and refines existing empirical measures of memorization and privacy risks associated with training data. We use Gaussian processes to model the randomness of machine learning algorithms, and validate LOOD with extensive empirical analysis of information leakage using membership inference attacks. Our theoretical framework enables us to investigate the causes of information leakage and where the leakage is high.  For example, we analyze the influence of activation functions, on data memorization.  Additionally, our method allows us to optimize  queries that disclose the most significant information about the training data in the leave-one-out setting.  We illustrate how optimal queries can be used for accurate **reconstruction** of training data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9RNfX0ah0K",
    "arxiv_id": "2309.17310",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19295,
    "title": "NECO: NEural Collapse Based Out-of-distribution detection",
    "authors": [
      "Mou\u00efn Ben Ammar",
      "Nacim Belkhir",
      "Sebastian Popescu",
      "Antoine Manzanera",
      "Gianni Franchi"
    ],
    "abstract": "Detecting out-of-distribution (OOD) data is a critical challenge in machine learning due to model overconfidence, often without awareness of their epistemological limits. We hypothesize that \"neural collapse\", a phenomenon affecting in-distribution data for models trained beyond loss convergence, also influences OOD data. To benefit from this interplay, we introduce NECO, a novel post-hoc method for OOD detection, which leverages the geometric properties of \u201cneural collapse\u201d and of principal component spaces to identify OOD data. Our extensive experiments demonstrate that NECO achieves state-of-the-art results on both small and large-scale OOD detection tasks while exhibiting strong generalization capabilities across different network architectures. Furthermore, we provide a theoretical explanation for the effectiveness of our method in OOD detection. We plan to release the code after the anonymity period.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9ROuKblmi7",
    "arxiv_id": "2310.06823",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19294,
    "title": "De novo Protein Design Using Geometric Vector Field Networks",
    "authors": [
      "Weian Mao",
      "Muzhi Zhu",
      "Zheng Sun",
      "Shuaike Shen",
      "Lin Yuanbo Wu",
      "Hao Chen",
      "Chunhua Shen"
    ],
    "abstract": "Advances like protein diffusion have marked revolutionary progress in $\\textit{de novo}$ protein design, a central topic in life science. These methods typically depend on protein structure encoders to model residue backbone frames, where atoms do not exist. Most prior encoders rely on atom-wise features, such as angles and distances between atoms, which are not available in this context. Only a few basic encoders, like IPA, have been proposed for this scenario, exposing the frame modeling as a bottleneck. In this work, we introduce the Vector Field Network (VFN), that enables network layers to perform learnable vector computations between coordinates of frame-anchored virtual atoms, thus achieving a higher capability for modeling frames. The vector computation operates in a manner similar to a linear layer, with each input channel receiving 3D virtual atom coordinates instead of scalar values. The multiple feature vectors output by the vector computation are then used to update the residue representations and virtual atom coordinates via attention aggregation. Remarkably, VFN also excels in modeling both frames and atoms, as the real atoms can be treated as the virtual atoms for modeling, positioning VFN as a potential $\\textit{universal encoder}$. In protein diffusion (frame modeling), VFN exhibits a impressive performance advantage over IPA, excelling in terms of both designability ($\\textbf{67.04}$\\% vs. 53.58\\%) and diversity ($\\textbf{66.54}$\\% vs. 51.98\\%). In inverse folding(frame and atom modeling), VFN outperforms the previous SoTA model, PiFold ($\\textbf{54.7}$\\% vs. 51.66\\%), on sequence recovery rate; we also propose a method of equipping VFN with the ESM model, which significantly surpasses the previous ESM-based SoTA ($\\textbf{62.67}$\\% vs. 55.65\\%), LM-Design, by a substantial margin.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=9UIGyJJpay",
    "arxiv_id": "2310.11802",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19291,
    "title": "TOSS: High-quality Text-guided Novel View Synthesis from a Single Image",
    "authors": [
      "Yukai Shi",
      "Jianan Wang",
      "He CAO",
      "Boshi Tang",
      "Xianbiao Qi",
      "Tianyu Yang",
      "Yukun Huang",
      "Shilong Liu",
      "Lei Zhang",
      "Heung-Yeung Shum"
    ],
    "abstract": "In this paper, we present TOSS, which introduces text to the task of novel view synthesis (NVS) from just a single RGB image. While Zero123 has demonstrated impressive zero-shot open-set NVS capabilities, it treats NVS as a pure image-to-image translation problem. This approach suffers from the challengingly under-constrained nature of single-view NVS: the process lacks means of explicit user control and often result in implausible NVS generations.To address this limitation, TOSS uses text as high-level semantic information to constrain the NVS solution space.TOSS fine-tunes text-to-image Stable Diffusion pre-trained on large-scale text-image pairs and introduces modules specifically tailored to image and camera pose conditioning, as well as dedicated training for pose correctness and preservation of fine details. Comprehensive experiments are conducted with results showing that our proposed TOSS outperforms Zero123 with higher-quality NVS results and faster convergence. We further support these results with comprehensive ablations that underscore the effectiveness and potential of the introduced semantic guidance and architecture design.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9ZUYJpvIys",
    "arxiv_id": "2310.10644",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19289,
    "title": "AGILE3D: Attention Guided Interactive Multi-object 3D Segmentation",
    "authors": [
      "Yuanwen Yue",
      "Sabarinath Mahadevan",
      "Jonas Schult",
      "Francis Engelmann",
      "Bastian Leibe",
      "Konrad Schindler",
      "Theodora Kontogianni"
    ],
    "abstract": "During interactive segmentation, a model and a user work together to delineate objects of interest in a 3D point cloud. In an iterative process, the model assigns each data point to an object (or the background), while the user corrects errors in the resulting segmentation and feeds them back into the model. The current best practice formulates the problem as binary classification and segments objects one at a time. The model expects the user to provide positive clicks to indicate regions wrongly assigned to the background and negative clicks on regions wrongly assigned to the object. Sequentially visiting objects is wasteful since it disregards synergies between objects: a positive click for a given object can, by definition, serve as a negative click for nearby objects. Moreover, a direct competition between adjacent objects can speed up the identification of their common boundary. We introduce AGILE3D, an efficient, attention-based model that (1) supports simultaneous segmentation of multiple 3D objects, (2) yields more accurate segmentation masks with fewer user clicks, and (3) offers faster inference. Our core idea is to encode user clicks as spatial-temporal queries and enable explicit interactions between click queries as well as between them and the 3D scene through a click attention module. Every time new clicks are added, we only need to run a lightweight decoder that produces updated segmentation masks. In experiments with four different 3D point cloud datasets, AGILE3D sets a new state-of-the-art. Moreover, we also verify its practicality in real-world setups with real user studies.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9cQtXpRshE",
    "arxiv_id": "2306.00977",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19288,
    "title": "Machine Unlearning for Image-to-Image Generative Models",
    "authors": [
      "Guihong Li",
      "Hsiang Hsu",
      "Chun-Fu Chen",
      "Radu Marculescu"
    ],
    "abstract": "Machine unlearning has emerged as a new paradigm to deliberately forget data samples from a given model in order to adhere to stringent regulations.However, existing machine unlearning methods have been primarily focused on classification models, leaving the landscape of unlearning for generative models relatively unexplored.This paper serves as a bridge, addressing the gap by providing a unifying framework of machine unlearning for image-to-image generative models.Within this framework, we propose a computationally-efficient algorithm, underpinned by rigorous theoretical analysis, that demonstrates negligible performance degradation on the retain samples, while effectively removing the information from the forget samples. Empirical studies on two large-scale datasets, ImageNet-1K and Places-365, further show that our algorithm does not rely on the availability of the retain samples, which further complies with data retention policy.To our best knowledge, this work is the first that represents systemic, theoretical, empirical explorations of machine unlearning specifically tailored for image-to-image generative models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9hjVoPWPnh",
    "arxiv_id": "2402.00351",
    "GitHub": [
      "https://github.com/jpmorganchase/l2l-generator-unlearning"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19287,
    "title": "Bayesian Optimization through Gaussian Cox Process Models for Spatio-temporal Data",
    "authors": [
      "Yongsheng Mei",
      "Mahdi Imani",
      "Tian Lan"
    ],
    "abstract": "Bayesian optimization (BO) has established itself as a leading strategy for efficiently optimizing expensive-to-evaluate functions. Existing BO methods mostly rely on Gaussian process (GP) surrogate models and are not applicable to (doubly-stochastic) Gaussian Cox processes, where the observation process is modulated by a latent intensity function modeled as a GP. In this paper, we propose a novel maximum *a posteriori* inference of Gaussian Cox processes. It leverages the Laplace approximation and change of kernel technique to transform the problem into a new reproducing kernel Hilbert space, where it becomes more tractable computationally. It enables us to obtain both a functional posterior of the latent intensity function and the covariance of the posterior, thus extending existing works that often focus on specific link functions or estimating the posterior mean. Using the result, we propose a BO framework based on the Gaussian Cox process model and further develop a Nystr\u00f6m approximation for efficient computation. Extensive evaluations on various synthetic and real-world datasets demonstrate significant improvement over state-of-the-art inference solutions for Gaussian Cox processes, as well as effective BO with a wide range of acquisition functions designed through the underlying Gaussian Cox process model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9j1RD9LlWH",
    "arxiv_id": "2401.14544",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19286,
    "title": "On the Learnability of Watermarks for Language Models",
    "authors": [
      "Chenchen Gu",
      "Xiang Lisa Li",
      "Percy Liang",
      "Tatsunori Hashimoto"
    ],
    "abstract": "Language model watermarking enables reliable detection of model-generated text, which has many applications in the responsible deployment of language models. Existing watermarking strategies operate by altering the decoder of an existing language model, and the ability for a language model to directly learn to generate the watermark would have significant implications for the real-world deployment of watermarks. First, learned watermarks could be used to build open models that naturally generate watermarked text, allowing for open models to benefit from watermarking. Second, if watermarking is used to determine the provenance of generated text, an adversary can damage the reputation of a victim model by spoofing its watermark and generating harmful watermarked text. To investigate the learnability of watermarks, we propose watermark distillation, which trains a student model to behave like a teacher model that uses decoding-based watermarking. We test our approach on three distinct decoding-based watermarking strategies, finding that models can learn to generate watermarked text with high detectability. We also find limitations to learnability, including the loss of watermarking capabilities under fine-tuning on normal text and high sample complexity when learning low-distortion watermarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9k0krNzvlV",
    "arxiv_id": "2312.04469",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19285,
    "title": "Time Fairness in Online Knapsack Problems",
    "authors": [
      "Adam Lechowicz",
      "Rik Sengupta",
      "Bo Sun",
      "Shahin Kamali",
      "Mohammad Hajiesmaili"
    ],
    "abstract": "The online knapsack problem is a classic problem in the field of online algorithms. Its canonical version asks how to pack items of different values and weights arriving online into a capacity-limited knapsack so as to maximize the total value of the admitted items. Although optimal competitive algorithms are known for this problem, they may be fundamentally unfair, i.e., individual items may be treated inequitably in different ways. We formalize a practically-relevant notion of time fairness which effectively models a trade off between static and dynamic pricing in a motivating application such as cloud resource allocation, and show that existing algorithms perform poorly under this metric.  We propose a parameterized deterministic algorithm where the parameter precisely captures the Pareto-optimal trade-off between fairness (static pricing) and competitiveness (dynamic pricing). We show that randomization is theoretically powerful enough to be simultaneously competitive and fair; however, it does not work well in experiments. To further improve the trade-off between fairness and competitiveness, we develop a nearly-optimal learning-augmented algorithm which is fair, consistent, and robust (competitive), showing substantial performance improvements in numerical experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9kG7TwgLYu",
    "arxiv_id": "2305.13293",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19283,
    "title": "Mastering Symbolic Operations: Augmenting Language Models with Compiled Neural Networks",
    "authors": [
      "Yixuan Weng",
      "Minjun Zhu",
      "Fei Xia",
      "Bin Li",
      "Shizhu He",
      "Kang Liu",
      "Jun Zhao"
    ],
    "abstract": "Language models (LMs) proficiency in handling deterministic symbolic reasoning and rule-based tasks remains limited due to their dependency implicit learning on textual data. To enable fully rule comprehension ability, we explore how to incorporate compiled neural networks (CoNNs) which weight is specially designed into the architecture of LMs, to achieve high accuracy and robust performance. CoNNs are transformer-based neural networks that execute rules through artificially generated attention weights. Our method, which call \"Neural Comprehension\", by incorporating CoNN modules into the LM, the framework effectively tackles rule-intensive challenges. Our experiments on symbolic reasoning tasks and real-world arithmetic reasoning tasks demonstrate the superior performance of our method compared to existing techniques. Furthermore, our LM achieves flawless execution on symbolic operations tasks, highlighting the potential of our method in enabling LMs to possess true symbolic comprehension capabilities.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9nsNyN0vox",
    "arxiv_id": "2304.01665",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19282,
    "title": "Video Language Planning",
    "authors": [
      "Yilun Du",
      "Sherry Yang",
      "Pete Florence",
      "Fei Xia",
      "Ayzaan Wahid",
      "brian ichter",
      "Pierre Sermanet",
      "Tianhe Yu",
      "Pieter Abbeel",
      "Joshua B. Tenenbaum",
      "Leslie Pack Kaelbling",
      "Andy Zeng",
      "Jonathan Tompson"
    ],
    "abstract": "We are interested in enabling visual planning for complex long-horizon tasks in the space of generated videos and language, leveraging recent advances in large generative models pretrained on Internet-scale data.  To this end, we present video language planning (VLP), an algorithm that consists of a tree search procedure, where we train (i) vision-language models to serve as both policies and value functions, and (ii) text-to-video models as dynamics models. VLP takes as input a long-horizon task instruction and current image observation, and outputs a long video plan that provides detailed multimodal (video and language) specifications that describe how to complete the final task. VLP scales with increasing computation budget where more computation time results in improved video plans, and is able to synthesize long-horizon video plans across different robotics domains -- from multi-object rearrangement, to multi-camera bi-arm dexterous manipulation. Generated video plans can be translated into real robot actions via goal-conditioned policies, conditioned on each intermediate frame of the generated video. Experiments show that VLP substantially improves long-horizon task success rates compared to prior methods on both simulated and real robots (across 3 hardware platforms).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9pKtcJcMP3",
    "arxiv_id": "2310.10625",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19281,
    "title": "Domain-Agnostic Molecular Generation with Chemical Feedback",
    "authors": [
      "Yin Fang",
      "Ningyu Zhang",
      "Zhuo Chen",
      "Lingbing Guo",
      "Xiaohui Fan",
      "Huajun Chen"
    ],
    "abstract": "The generation of molecules with desired properties has gained tremendous popularity, revolutionizing the way scientists design molecular structures and providing valuable support for chemical and drug design. However, despite the potential of language models in molecule generation, they face numerous challenges such as the generation of syntactically or chemically flawed molecules, narrow domain focus, and limitations in creating diverse and directionally feasible molecules due to a dearth of annotated data or external molecular databases. To tackle these challenges, we introduce MolGen, a pre-trained molecular language model tailored specifically for molecule generation. Through the reconstruction of over 100 million molecular SELFIES, MolGen internalizes profound structural and grammatical insights. This is further enhanced by domain-agnostic molecular prefix tuning, fostering robust knowledge transfer across diverse domains. Importantly, our self-feedback paradigm steers the model away from \"molecular hallucinations\", ensuring alignment between the model's estimated probabilities and real-world chemical preferences. Extensive experiments on well-known benchmarks underscore MolGen's optimization capabilities in properties such as penalized logP, QED, and molecular docking. Additional analyses affirm its proficiency in accurately capturing molecule distributions, discerning intricate structural patterns, and efficiently exploring the chemical space. The pre-trained model, codes, and datasets are publicly available for future research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9rPyHyjfwP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19280,
    "title": "Entropy is not Enough for Test-Time Adaptation: From the Perspective of Disentangled Factors",
    "authors": [
      "Jonghyun Lee",
      "Dahuin Jung",
      "Saehyung Lee",
      "Junsung Park",
      "Juhyeon Shin",
      "Uiwon Hwang",
      "Sungroh Yoon"
    ],
    "abstract": "Test-time adaptation (TTA) fine-tunes pre-trained deep neural networks for unseen test data. The primary challenge of TTA is limited access to the entire test dataset during online updates, causing error accumulation. To mitigate it, TTA methods have utilized the model output's entropy as a confidence metric that aims to determine which samples have a lower likelihood of causing error. Through experimental studies, however, we observed the unreliability of entropy as a confidence metric for TTA under biased scenarios and theoretically revealed that it stems from the neglect of the influence of latent disentangled factors of data on predictions. Building upon these findings, we introduce a novel TTA method named Destroy Your Object (DeYO), which leverages a newly proposed confidence metric named Pseudo-Label Probability Difference (PLPD). PLPD quantifies the influence of the shape of an object on prediction by measuring the difference between predictions before and after applying an object-destructive transformation. DeYO consists of sample selection and sample weighting, which employ entropy and PLPD concurrently. For robust adaptation, DeYO prioritizes samples that dominantly incorporate shape information when making predictions. Our extensive experiments demonstrate the consistent superiority of DeYO over baseline methods across various scenarios, including biased and wild.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=9w3iw8wDuE",
    "arxiv_id": "2403.07366",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17953,
    "title": "TRAM: Bridging Trust Regions and Sharpness Aware Minimization",
    "authors": [
      "Tom Sherborne",
      "Naomi Saphra",
      "Pradeep Dasigi",
      "Hao Peng"
    ],
    "abstract": "By reducing the curvature of the loss surface in the parameter space,Sharpness-aware minimization (SAM) yields widespread robustness improvementunder domain transfer. Instead of focusing on parameters, however, this workconsiders the transferability of _representations_ as the optimizationtarget for out-of-domain generalization in a fine-tuning setup. To encourage theretention of transferable representations, we consider trust region-basedfine-tuning methods, which exploit task-specific skills without forgettingtask-agnostic representations from pre-training. We unify parameter- andrepresentation-space smoothing approaches by using trust region bounds to informSAM-style regularizers on both of these optimization surfaces. We propose**Trust Region Aware Minimization** (TRAM), a fine-tuning algorithm thatoptimizes for flat minima and smooth, informative representations withoutforgetting pre-trained structure. We find that TRAM outperforms bothsharpness-aware and trust region-based optimization methods on cross-domainlanguage modeling and cross-lingual transfer, where robustness to domaintransfer and representation generality are critical for success. TRAMestablishes a new standard in training generalizable models with minimaladditional computation.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=kxebDHZ7b7",
    "arxiv_id": "2310.03646",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19276,
    "title": "Course Correcting Koopman Representations",
    "authors": [
      "Mahan Fathi",
      "Clement Gehring",
      "Jonathan Pilault",
      "David Kanaa",
      "Pierre-Luc Bacon",
      "Ross Goroshin"
    ],
    "abstract": "Koopman representations aim to learn features of nonlinear dynamical systems (NLDS) which lead to linear dynamics in the latent space. Theoretically, such features can be used to simplify many problems in modeling and control of NLDS. In this work we study autoencoder formulations of this problem, and different ways they can be used to model dynamics, specifically for future state prediction over long horizons. We discover several limitations of predicting future states in the latent space and propose an inference-time mechanism, which we refer to as Periodic Reencoding, for faithfully capturing long term dynamics. We justify this method both analytically and empirically via experiments in low and high dimensional NLDS.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=A18gWgc5mi",
    "arxiv_id": "2310.15386",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19274,
    "title": "Dirichlet-based Per-Sample Weighting by Transition Matrix for Noisy Label Learning",
    "authors": [
      "HeeSun Bae",
      "Seungjae Shin",
      "Byeonghu Na",
      "Il-chul Moon"
    ],
    "abstract": "For learning with noisy labels, the transition matrix, which explicitly models the relation between noisy label distribution and clean label distribution, has been utilized to achieve the statistical consistency of either the classifier or the risk. Previous researches have focused more on how to estimate this transition matrix well, rather than how to utilize it. We propose good utilization of the transition matrix is crucial and suggest a new utilization method based on resampling, coined RENT. Specifically, we first demonstrate current utilizations can have potential limitations for implementation. As an extension to Reweighting, we suggest the Dirichlet distribution-based per-sample Weight Sampling (DWS) framework, and compare reweighting and resampling under DWS framework. With the analyses from DWS, we propose RENT, a REsampling method with Noise Transition matrix. Empirically, RENT consistently outperforms existing transition matrix utilization methods, which includes reweighting, on various benchmark datasets. Our code is available at https://github.com/BaeHeeSun/RENT.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=A4mJuFRMN8",
    "arxiv_id": "2403.02690",
    "GitHub": [
      "https://github.com/BaeHeeSun/RENT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19273,
    "title": "Hyper Evidential Deep Learning to Quantify Composite Classification Uncertainty",
    "authors": [
      "Changbin Li",
      "Kangshuo Li",
      "Yuzhe Ou",
      "Lance M. Kaplan",
      "Audun J\u00f8sang",
      "Jin-Hee Cho",
      "DONG HYUN JEONG",
      "Feng Chen"
    ],
    "abstract": "Deep neural networks (DNNs) have been shown to perform well on exclusive, multi-class classification tasks. However, when different classes have similar visual features, it becomes challenging for human annotators to differentiate them. When an image is ambiguous, such as a blurry one where an annotator can't distinguish between a husky and a wolf, it may be labeled with both classes: {husky, wolf}. This scenario necessitates the use of composite set labels. In this paper, we propose a novel framework called Hyper-Evidential Neural Network (HENN) that explicitly models predictive uncertainty caused by composite set labels in training data in the context of the belief theory called Subjective Logic (SL).By placing a Grouped Dirichlet distribution on the class probabilities, we treat predictions of a neural network as parameters of hyper-subjective opinions and learn the network that collects both single and composite evidence leading to these hyper-opinions by a deterministic DNN from data.We introduce a new uncertainty type called vagueness originally designed for hyper-opinions in SL to quantify composite classification uncertainty for DNNs.Our experiments prove that HENN outperforms its state-of-the-art counterparts based on four image datasets.The code and datasets are available at: https://shorturl.at/dhoqx.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=A7t7z6g6tM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19270,
    "title": "SpeechTokenizer: Unified Speech Tokenizer for Speech Language Models",
    "authors": [
      "Xin Zhang",
      "Dong Zhang",
      "Shimin Li",
      "Yaqian Zhou",
      "Xipeng Qiu"
    ],
    "abstract": "Current speech large language models build upon discrete speech representations,which can be categorized into semantic tokens and acoustic tokens. However,existing speech tokens are not specifically designed for speech language modeling. To assess the suitability of speech tokens for building speech languagemodels, we established the first benchmark, SLMTokBench. Our results indicatethat neither semantic nor acoustic tokens are ideal for this purpose. Therefore, wepropose SpeechTokenizer, a unified speech tokenizer for speech large languagemodels. SpeechTokenizer adopts the Encoder-Decoder architecture with residualvector quantization (RVQ). Unifying semantic and acoustic tokens, SpeechTokenizer disentangles different aspects of speech information hierarchically acrossdifferent RVQ layers. Furthermore, We construct a Unified Speech LanguageModel (USLM) leveraging SpeechTokenizer. Experiments show that SpeechTokenizer performs comparably to EnCodec in speech reconstruction and demonstratesstrong performance on the SLMTokBench benchmark. Also, USLM outperformsVALL-E in zero-shot Text-to-Speech tasks. Code and models are available athttps://github.com/ZhangXInFD/SpeechTokenizer/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AF9Q8Vip84",
    "arxiv_id": "2308.16692",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19269,
    "title": "MuSc: Zero-Shot Industrial Anomaly Classification and Segmentation with Mutual Scoring of the Unlabeled Images",
    "authors": [
      "Xurui Li",
      "Ziming Huang",
      "Feng Xue",
      "Yu Zhou"
    ],
    "abstract": "This paper studies zero-shot anomaly classification (AC) and segmentation (AS) in industrial vision.We reveal that the abundant normal and abnormal cues implicit in unlabeled test images can be exploited for anomaly determination, which is ignored by prior methods.Our key observation is that for the industrial product images, the normal image patches could find a relatively large number of similar patches in other unlabeled images,while the abnormal ones only have a few similar patches.We leverage such a discriminative characteristic to design a novel zero-shot AC/AS method by Mutual Scoring (MuSc) of the unlabeled images,  which does not need any training or prompts.Specifically, we perform Local Neighborhood Aggregation with Multiple Degrees (LNAMD) to obtain the patch features that are capable of representing anomalies in varying sizes.Then we propose the Mutual Scoring Mechanism (MSM) to leverage the unlabeled test images to assign the anomaly score to each other. Furthermore, we present an optimization approach named Re-scoring with Constrained Image-level Neighborhood (RsCIN) for image-level anomaly classification to suppress the false positives caused by noises in normal images.The superior performance on the challenging MVTec AD and VisA datasets demonstrates the effectiveness of our approach. Compared with the state-of-the-art zero-shot approaches, MuSc achieves a $\\textbf{21.1}$% PRO absolute gain (from 72.7\\% to 93.8\\%) on MVTec AD, a $\\textbf{19.4}$% pixel-AP gain and a $\\textbf{14.7}$% pixel-AUROC gain on VisA.In addition, our zero-shot approach outperforms most of the few-shot approaches and is comparable to some one-class methods.Code is available at https://github.com/xrli-U/MuSc.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AHgc5SMdtd",
    "arxiv_id": "2401.16753",
    "GitHub": [
      "https://github.com/xrli-U/MuSc"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19268,
    "title": "Backdoor Federated Learning by Poisoning Backdoor-Critical Layers",
    "authors": [
      "Haomin Zhuang",
      "Mingxian Yu",
      "Hao Wang",
      "Yang Hua",
      "Jian Li",
      "Xu Yuan"
    ],
    "abstract": "Federated learning (FL) has been widely deployed to enable machine learning training on sensitive data across distributed devices. However, the decentralized learning paradigm and heterogeneity of FL further extend the attack surface for backdoor attacks. Existing FL attack and defense methodologies typically focus on the whole model. None of them recognizes the existence of backdoor-critical (BC) layers-a small subset of layers that dominate the model vulnerabilities. Attacking the BC layers achieves equivalent effects as attacking the whole model but at a far smaller chance of being detected by state-of-the-art (SOTA) defenses. This paper proposes a general in-situ approach that identifies and verifies BC layers from the perspective of attackers. Based on the identified BC layers, we carefully craft a new backdoor attack methodology that adaptively seeks a fundamental balance between attacking effects and stealthiness under various defense strategies. Extensive experiments show that our BC layer-aware backdoor attacks can successfully backdoor FL under seven SOTA defenses with only 10% malicious clients and outperform the latest backdoor attack methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AJBGSVSTT2",
    "arxiv_id": "2308.04466",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19267,
    "title": "Causality-Inspired Spatial-Temporal Explanations for Dynamic Graph Neural Networks",
    "authors": [
      "Kesen Zhao",
      "Liang Zhang"
    ],
    "abstract": "Dynamic Graph Neural Networks (DyGNNs) have gained significant popularity in the research of dynamic graphs, but are limited by the low transparency, such that human-understandable insights can hardly be drawn from their predictions. Although a number of existing research have been devoted to investigating the interpretability of graph neural networks (GNNs), achieving the interpretability of DyGNNs is pivotally challenging due to the complex spatial-temporal correlations in dynamic graphs. To this end, we propose an innovative causality-inspired generative model based on structural causal model (SCM), which explores the underlying philosophies of DyGNN predictions by identifying the trivial, static, and dynamic causal relationships. To reach this goal, two critical tasks need to be accomplished including (1) disentangling the complex causal relationships, and (2) fitting the spatial-temporal explanations of DyGNNs in the SCM architecture. To tackle these challenges, the proposed method incorporates a contrastive learning module to disentangle trivial and causal relationships, and a dynamic correlating module to disentangle dynamic and static causal relationships, respectively. A dynamic VGAE-based framework is further developed, which generates causal-and-dynamic masks for spatial interpretability, and recognizes dynamic relationships along the time horizon through causal invention for temporal interpretability. Comprehensive experiments have been conducted on both synthetic and real-world datasets, where our approach yields substantial improvements, thereby demonstrating significant superiority.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AJBkfwXh3u",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19266,
    "title": "One Forward is Enough for Neural Network Training via Likelihood Ratio Method",
    "authors": [
      "Jinyang Jiang",
      "Zeliang Zhang",
      "Chenliang Xu",
      "Zhaofei Yu",
      "Yijie Peng"
    ],
    "abstract": "While backpropagation (BP) is the mainstream approach for gradient computation in neural network training, its heavy reliance on the chain rule of differentiation constrains the designing flexibility of network architecture and training pipelines. We avoid the recursive computation in BP and develop a unified likelihood ratio (ULR) method for gradient estimation with just one forward propagation. Not only can ULR be extended to train a wide variety of neural network architectures, but the computation flow in BP can also be rearranged by ULR for better device adaptation. Moreover, we propose several variance reduction techniques to further accelerate the training process. Our experiments offer numerical results across diverse aspects, including various neural network training scenarios, computation flow rearrangement, and fine-tuning of pre-trained models. All findings demonstrate that ULR effectively enhances the flexibility of neural network training by permitting localized module training without compromising the global objective and significantly boosts the network robustness.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ALGFFPXWSi",
    "arxiv_id": "2305.08960",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19783,
    "title": "Generalization in diffusion models arises from geometry-adaptive harmonic representations",
    "authors": [
      "Zahra Kadkhodaie",
      "Florentin Guth",
      "Eero P Simoncelli",
      "St\u00e9phane Mallat"
    ],
    "abstract": "High-quality samples generated with score-based reverse diffusion algorithms provide evidence that deep neural networks (DNN) trained for denoising can learn high-dimensional densities, despite the curse of dimensionality. However, recent reports of memorization of the training set raise the question of whether these networks are learning the ``true'' density of the data. Here, we show that two denoising DNNs trained on non-overlapping subsets of a dataset learn nearly the same score function, and thus the same density, with a surprisingly small number of training images. This strong generalization demonstrates the existence of powerful inductive biases in the DNN architecture and/or training algorithm. We analyze these, demonstrating that the denoiser performs a shrinkage operation in a basis adapted to the underlying image. Examination of these bases reveals oscillating harmonic structures along contours and in homogeneous image regions. We show that trained denoisers are inductively biased towards these geometry-adaptive harmonic representations by demonstrating that they arise even when the network is trained on image classes such as low-dimensional manifolds for which the harmonic basis is suboptimal. Additionally, we show that the denoising performance of the networks is near-optimal when trained on regular image classes for which the optimal basis is known to be geometry-adaptive and harmonic.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=ANvmVS2Yr0",
    "arxiv_id": "2310.02557",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19262,
    "title": "On the hardness of learning under symmetries",
    "authors": [
      "Bobak Kiani",
      "Thien Le",
      "Hannah Lawrence",
      "Stefanie Jegelka",
      "Melanie Weber"
    ],
    "abstract": "We study the problem of learning equivariant neural networks via gradient descent. The incorporation of known  symmetries (\"equivariance\") into neural nets has empirically improved the performance of learning pipelines, in domains ranging from biology to computer vision. However, a rich yet separate line of learning theoretic research has demonstrated that actually learning shallow, fully-connected (i.e. non-symmetric) networks has exponential complexity in the correlational statistical query (CSQ) model, a framework encompassing gradient descent. In this work, we ask: are known problem symmetries sufficient to alleviate the fundamental hardness of learning neural nets with gradient descent? We answer this question in the negative. In particular, we give lower bounds for shallow graph neural networks, convolutional networks, invariant polynomials, and frame-averaged networks for permutation subgroups, which all scale either superpolynomially or exponentially in the relevant input dimension. Therefore, in spite of the significant inductive bias imparted via symmetry, actually learning the complete classes of functions represented by equivariant neural networks via gradient descent remains hard.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ARPrtuzAnQ",
    "arxiv_id": "2401.01869",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19260,
    "title": "A differentiable brain simulator bridging brain simulation and brain-inspired computing",
    "authors": [
      "Chaoming Wang",
      "Tianqiu Zhang",
      "Sichao He",
      "Hongyaoxing Gu",
      "Shangyang Li",
      "Si Wu"
    ],
    "abstract": "Brain simulation builds dynamical models to mimic the structure and functions of the brain, while brain-inspired computing (BIC) develops intelligent systems by learning from the structure and functions of the brain. The two fields are intertwined and should share a common programming framework to facilitate each other's development. However, none of the existing software in the fields can achieve this goal, because traditional brain simulators lack differentiability for training, while existing deep learning (DL) frameworks fail to capture the biophysical realism and complexity of brain dynamics. In this paper, we introduce BrainPy, a differentiable brain simulator developed using JAX and XLA, with the aim of bridging the gap between brain simulation and BIC. BrainPy expands upon the functionalities of JAX, a powerful AI framework, by introducing complete capabilities for flexible, efficient, and scalable brain simulation. It offers a range of sparse and event-driven operators for efficient and scalable brain simulation, an abstraction for managing the intricacies of synaptic computations, a modular and flexible interface for constructing multi-scale brain models, and an object-oriented just-in-time compilation approach to handle the memory-intensive nature of brain dynamics. We showcase the efficiency and scalability of BrainPy on benchmark tasks, and highlight its differentiable simulation for biologically plausible spiking models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AU2gS9ut61",
    "arxiv_id": "2311.05106",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19259,
    "title": "M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering",
    "authors": [
      "Jiaxin Lu",
      "Zetian Jiang",
      "Tianzhe Wang",
      "Junchi Yan"
    ],
    "abstract": "Existing graph matching methods typically assume that there are similar structures between graphs and they are matchable. However, these assumptions do not align with real-world applications. This work addresses a more realistic scenario where graphs exhibit diverse modes, requiring graph grouping before or along with matching, a task termed mixture graph matching and clustering. We introduce Minorize-Maximization Matching and Clustering (M3C), a learning-free algorithm that guarantees theoretical convergence through the Minorize-Maximization framework and offers enhanced flexibility via relaxed clustering. Building on M3C, we develop UM3C, an unsupervised model that incorporates novel edge-wise affinity learning and pseudo label selection. Extensive experimental results on public benchmarks demonstrate that our method outperforms state-of-the-art graph matching and mixture graph matching and clustering approaches in both accuracy and efficiency. Source code will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AXC9KydyZq",
    "arxiv_id": "2310.18444",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19258,
    "title": "Protein-ligand binding representation learning from fine-grained interactions",
    "authors": [
      "Shikun Feng",
      "Minghao Li",
      "Yinjun Jia",
      "Wei-Ying Ma",
      "Yanyan Lan"
    ],
    "abstract": "The binding between proteins and ligands plays a crucial role in the realm of drug discovery. Previous deep learning approaches have shown promising results over traditional computationally intensive methods, but resulting in poor generalization due to limited supervised data. In this paper, we propose to learn protein-ligand binding representation in a self-supervised learning manner. Different from existing pre-training approaches which treat proteins and ligands individually, we emphasize to discern the intricate binding patterns from fine-grained interactions. Specifically, this self-supervised learning problem is formulated as a prediction of the conclusive binding complex structure given a pocket and ligand with a Transformer based interaction module, which naturally emulates the binding process. To ensure the representation of rich binding information, we introduce two pre-training tasks, i.e. atomic pairwise distance map prediction and mask ligand reconstruction, which comprehensively model the fine-grained interactions from both structure and feature space. Extensive experiments have demonstrated the superiority of our method across various binding tasks, including protein-ligand affinity prediction, virtual screening and protein-ligand docking.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AXbN2qMNiW",
    "arxiv_id": "2311.16160",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19257,
    "title": "Unleashing the Power of Pre-trained Language Models for Offline Reinforcement Learning",
    "authors": [
      "Ruizhe Shi",
      "Yuyao Liu",
      "Yanjie Ze",
      "Simon Shaolei Du",
      "Huazhe Xu"
    ],
    "abstract": "Offline reinforcement learning (RL) aims to find a near-optimal policy using pre-collected datasets. Given recent advances in Large Language Models (LLMs) and their few-shot learning prowess, this paper introduces $\\textbf{La}$nguage Models for $\\textbf{Mo}$tion Control ($\\textbf{LaMo}$), a general framework based on Decision Transformers to effectively use pre-trained Language Models (LMs) for offline RL. Our framework highlights four crucial components: (1)  Initializing Decision Transformers with sequentially pre-trained LMs, (2) employing the LoRA fine-tuning method, in contrast to full-weight fine-tuning, to combine the pre-trained knowledge from LMs and in-domain knowledge effectively, (3) using the non-linear MLP transformation instead of linear projections, to generate embeddings, and (4) integrating an auxiliary language prediction loss during fine-tuning to stabilize the LMs and retain their original abilities on languages. Empirical results indicate $\\textbf{LaMo}$ achieves state-of-the-art performance in sparse-reward tasks and closes the gap between value-based offline RL methods and decision transformers in dense-reward tasks. In particular, our method demonstrates superior performance in scenarios with limited data samples.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AY6aM13gGF",
    "arxiv_id": "2310.20587",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19256,
    "title": "Adaptive Regret for Bandits Made Possible: Two Queries Suffice",
    "authors": [
      "Zhou Lu",
      "Qiuyi Zhang",
      "Xinyi Chen",
      "Fred Zhang",
      "David Woodruff",
      "Elad Hazan"
    ],
    "abstract": "Fast changing states or volatile environments pose a significant challenge to online optimization, which needs to perform rapid adaptation under limited observation. In this paper, we give query and regret optimal bandit algorithms under the strict notion of strongly adaptive regret, which measures the maximum regret over any contiguous interval  $I$. Due to its worst-case nature, there is an almost-linear $\\Omega(|I|^{1-\\epsilon})$ regret lower bound, when only one query per round is allowed [Daniely el al, ICML 2015]. Surprisingly, with just two queries per round, we give Strongly Adaptive Bandit Learner (StABL) that achieves $\\widetilde{O}(\\sqrt{n|I|})$ adaptive regret for multi-armed bandits with $n$ arms. The bound is tight and  cannot be improved in general. Our algorithm leverages a  multiplicative update scheme of varying stepsizes and a carefully chosen observation distribution to control the variance. Furthermore, we extend our results and provide optimal algorithms in the bandit convex optimization setting. Finally, we empirically demonstrate the superior performance of our algorithms under volatile environments and for downstream tasks, such as algorithm selection for hyperparameter optimization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AY9KyTGcnk",
    "arxiv_id": "2401.09278",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19751,
    "title": "Diffusion Model for Dense Matching",
    "authors": [
      "Jisu Nam",
      "Gyuseong Lee",
      "Sunwoo Kim",
      "Hyeonsu Kim",
      "Hyoungwon Cho",
      "Seyeon Kim",
      "Seungryong Kim"
    ],
    "abstract": "The objective for establishing dense correspondence between paired images consists of two terms: a data term and a prior term. While conventional techniques focused on defining hand-designed prior terms, which are difficult to formulate, recent approaches have focused on learning the data term with deep neural networks without explicitly modeling the prior, assuming that the model itself has the capacity to learn an optimal prior from a large-scale dataset. The performance improvement was obvious, however, they often fail to address inherent ambiguities of matching, such as textureless regions, repetitive patterns, large displacements, or noises. To address this, we propose DiffMatch, a novel conditional diffusion-based framework designed to explicitly model both the data and prior terms for dense matching. This is accomplished by leveraging a conditional denoising diffusion model that explicitly takes matching cost and injects the prior within generative process. However, limited resolution of the diffusion model is a major hindrance. We address this with a cascaded pipeline, starting with a low-resolution model, followed by a super-resolution model that successively upsamples and incorporates finer details to the matching field. Our experimental results demonstrate significant performance improvements of our method over existing approaches, and the ablation studies validate our design choices along with the effectiveness of each component. The code and pretrained weights will be available.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=Zsfiqpft6K",
    "arxiv_id": "2305.19094",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19255,
    "title": "Towards Cross Domain Generalization of Hamiltonian Representation via Meta Learning",
    "authors": [
      "Yeongwoo Song",
      "Hawoong Jeong"
    ],
    "abstract": "Recent advancements in deep learning for physics have focused on discovering shared representations of target systems by incorporating physics priors or inductive biases into neural networks. While effective, these methods are confined to the system domain in which the type of system remains consistent and thus cannot ensure the adaptation to new, or unseen physical systems governed by different laws. For example, a neural network trained on a mass-spring system cannot guarantee the accurate prediction of the behavior of a two-body system or any other system with different physical laws. In this work, we take a significant leap forward by targeting cross domain generalization within the field of Hamiltonian dynamics. We model our system with a graph neural network and employ a meta learning algorithm to enable the model to gain experience over a distribution of tasks and make it adapt to new physics. Our approach aims to learn a unified Hamiltonian representation that is generalizable across multiple system domains, thereby overcoming the limitations of system-specific models. We validate our approach on a dataset comprising various physical systems and evaluate its adaptability to a new type of dynamical system with previously unseen physics. Our results demonstrate that the meta trained model not only adapts effectively to new systems but also captures a generalized Hamiltonian representation that is consistent across different physical domains.Overall, through the use of meta learning, we offer a framework that achieves cross domain generalization, providing a step towards a unified model for understanding a wide array of dynamical systems via deep learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AZGIwqCyYY",
    "arxiv_id": "2212.01168",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19254,
    "title": "Enhancing Instance-Level Image Classification with Set-Level Labels",
    "authors": [
      "Renyu Zhang",
      "Aly A Khan",
      "Yuxin Chen",
      "Robert L. Grossman"
    ],
    "abstract": "Instance-level image classification tasks have traditionally relied on single-instance labels to train models, e.g., few-shot learning and transfer learning. However, set-level coarse-grained labels that capture relationships among instances can provide richer information in real-world scenarios. In this paper, we present a novel approach to enhance instance-level image classification by leveraging set-level labels. We provide a theoretical analysis of the proposed method, including recognition conditions for fast excess risk rate, shedding light on the theoretical foundations of our approach. We conducted experiments on two distinct categories of datasets: natural image datasets and histopathology image datasets. Our experimental results demonstrate the effectiveness of our approach, showcasing improved classification performance compared to traditional single-instance label-based methods. Notably, our algorithm achieves 13\\% improvement in classification accuracy compared to the strongest baseline on the histopathology image classification benchmarks. Importantly, our experimental findings align with the theoretical analysis, reinforcing the robustness and reliability of our proposed method. This work bridges the gap between instance-level and set-level image classification, offering a promising avenue for advancing the capabilities of image classification models with set-level coarse-grained labels.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AZW3qlCGTe",
    "arxiv_id": "2311.05659",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19252,
    "title": "Forward Learning of Graph Neural Networks",
    "authors": [
      "Namyong Park",
      "Xing Wang",
      "Antoine Simoulin",
      "Shuai Yang",
      "Grey Yang",
      "Ryan A. Rossi",
      "Puja Trivedi",
      "Nesreen K. Ahmed"
    ],
    "abstract": "Graph neural networks (GNNs) have achieved remarkable success across a wide range of applications, such as recommendation, drug discovery, and question answering. Behind the success of GNNs lies the backpropagation (BP) algorithm, which is the de facto standard for training deep neural networks. However, despite its effectiveness, BP imposes several constraints, which are not only biologically implausible, but also limit the scalability, parallelism, and flexibility in learning neural networks. Examples of such constraints include the storage of neural activities computed in the forward pass for use in the subsequent backward pass, and the dependence of parameter updates on non-local signals. To address these limitations, the forward-forward algorithm (FF) was recently proposed as an alternative to BP in the image classification domain, which trains neural networks by performing two forward passes over positive and negative data. Inspired by this advance, we propose ForwardGNN in this work, a new forward learning procedure for GNNs, which avoids the constraints imposed by BP via an effective layer-wise local forward training. ForwardGNN extends the original FF to deal with graph data and GNNs, and makes it possible to operate without generating negative inputs (hence no longer forward-forward). Further, ForwardGNN enables each layer to learn from both the bottom-up and top-down signals without relying on the backpropagation of errors. Extensive experiments involving five real-world datasets and three representative GNNs show the effectiveness and generality of the proposed forward graph learning framework.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Abr7dU98ME",
    "arxiv_id": "2403.11004",
    "GitHub": [
      "https://github.com/facebookresearch/forwardgnn"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19247,
    "title": "Rotation has two sides: Evaluating Data Augmentation for Deep One-class Classification",
    "authors": [
      "Guodong Wang",
      "Yunhong Wang",
      "Xiuguo Bao",
      "Di Huang"
    ],
    "abstract": "One-class classification (OCC) involves predicting whether a new data is normal or anomalous based solely on the data from a single class during training. Various attempts have been made to learn suitable representations for OCC within a self-supervised framework. Notably, discriminative methods that use geometric visual transformations, such as rotation, to generate pseudo-anomaly samples have exhibited impressive detection performance. Although rotation is commonly viewed as a distribution-shifting transformation and is widely used in the literature, its effectiveness remains a mystery. In this study, we make a surprising observation: there exists a strong linear relationship (Pearson's Correlation, $r > 0.9$) between the accuracy of rotation prediction and the performance of OCC. This suggests that a classifier that effectively distinguishes different rotations is more likely to excel in OCC, and vice versa. The root cause of this phenomenon can be attributed to the transformation bias in the dataset, where representations learned from transformations already present in the dataset tend to be less effective, making it essential to accurately estimate the transformation distribution before utilizing pretext tasks involving these transformations for reliable self-supervised representation learning. To the end, we propose a novel two-stage method to estimate the transformation distribution within the dataset. In the first stage, we learn general representations through standard contrastive pre-training. In the second stage, we select potentially semantics-preserving samples from the entire augmented dataset, which includes all rotations, by employing density matching with the provided reference distribution. By sorting samples based on semantics-preserving versus shifting transformations, we achieve improved performance on OCC benchmarks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Ad81awoBVS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19245,
    "title": "General Stability Analysis for Zeroth-Order Optimization Algorithms",
    "authors": [
      "Xinyue Liu",
      "Hualin Zhang",
      "Bin Gu",
      "Hong Chen"
    ],
    "abstract": "Zeroth-order optimization algorithms are widely used for black-box optimization problems, such as those in machine learning and prompt engineering, where the gradients are approximated using function evaluations. Recently, a generalization result was provided for zeroth-order stochastic gradient descent (SGD) algorithms through stability analysis. However, this result was limited to the vanilla 2-point zeroth-order estimate of Gaussian distribution used in SGD algorithms. To address these limitations, we propose a general proof framework for stability analysis that applies to convex, strongly convex, and non-convex conditions, and yields results for popular zeroth-order optimization algorithms, including SGD, GD, and SVRG, as well as various zeroth-order estimates, such as 1-point and 2-point with different distributions and coordinate estimates. Our general analysis shows that coordinate estimation can lead to tighter generalization bounds for SGD, GD, and SVRG versions of zeroth-order optimization algorithms, due to the smaller expansion brought by coordinate estimates to stability analysis.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AfhNyr73Ma",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19796,
    "title": "Self-Alignment with Instruction Backtranslation",
    "authors": [
      "Xian Li",
      "Ping Yu",
      "Chunting Zhou",
      "Timo Schick",
      "Omer Levy",
      "Luke Zettlemoyer",
      "Jason E Weston",
      "Mike Lewis"
    ],
    "abstract": "We present a scalable method to build a high quality instruction following language model by automatically labelling human-written text with corresponding instructions. Our approach, named instruction backtranslation, starts with a language model finetuned on a small amount of seed data, and a given web corpus. The seed model is used to construct training examples by generating instruction prompts for web documents (self-augmentation), and then  selecting high quality examples from among these candidates (self-curation).  This data is then used to finetune a stronger model.  Finetuning LLaMa on two iterations of our approach yields a model that outperforms all other LLaMa-based models on the Alpaca leaderboard not relying on distillation data, demonstrating highly effective self-alignment.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=1oijHJBRsT",
    "arxiv_id": "2308.06259",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19244,
    "title": "Role of Locality and Weight Sharing in Image-Based Tasks: A Sample Complexity Separation between CNNs, LCNs, and FCNs",
    "authors": [
      "Aakash Lahoti",
      "Stefani Karp",
      "Ezra Winston",
      "Aarti Singh",
      "Yuanzhi Li"
    ],
    "abstract": "Vision-based tasks are known to exhibit the properties of locality and translation invariance.    The superior performance of convolutional neural networks (CNNs) on these tasks is attributed to the inductive bias of locality and weight sharing baked into their architecture.    Existing attempts at quantifying the statistical benefits of these biases in CNNs over local convolutional neural networks (LCNs) and fully connected neural networks (FCNs) fall into one of the following categories: either do not establish a gap between the performance of these architectures, or ignore optimization considerations, or consider stylized settings that are not reflective of image-like tasks, particularly translation invariance.      We introduce the Dynamic Signal Distribution (DSD), a data model that     is designed to capture properties of real-world images such as locality and translation invariance. In DSD, each image is modeled with $k$ patches, with each patch of dimension $d$, and the label is determined by a $d$-sparse signal vector that can freely appear in any one of the $k$ patches. Under this task, we show that CNNs trained using gradient descent require $\\tilde{O}(k+d)$ samples, whereas LCNs require $\\Omega(kd)$ samples for predicting the label, establishing the statistical advantages of weight sharing in translation invariant tasks. Additionally, LCNs need $\\tilde{O}(k(k+d))$ samples, compared to FCNs, which need $\\Omega(k^2d)$ samples, showcasing the benefits of locality in local tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=AfnsTnYphT",
    "arxiv_id": "2403.15707",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19243,
    "title": "Large Language Models as Analogical Reasoners",
    "authors": [
      "Michihiro Yasunaga",
      "Xinyun Chen",
      "Yujia Li",
      "Panupong Pasupat",
      "Jure Leskovec",
      "Percy Liang",
      "Ed H. Chi",
      "Denny Zhou"
    ],
    "abstract": "Chain-of-thought (CoT) prompting for language models demonstrates impressive performance across reasoning tasks, but typically needs labeled exemplars of the reasoning process. In this work, we introduce a new prompting approach, analogical prompting, designed to automatically guide the reasoning process of large language models. Inspired by analogical reasoning, a cognitive process in which humans draw from relevant past experiences to tackle new problems, our approach prompts language models to self-generate relevant exemplars or knowledge in the context, before proceeding to solve the given problem. This method presents several advantages: it obviates the need for labeling or retrieving exemplars, offering generality and convenience; it can also tailor the generated exemplars and knowledge to each problem, offering adaptability. Experimental results show that our approach outperforms 0-shot CoT and manual few-shot CoT in a variety of reasoning tasks, including math problem solving in GSM8K and MATH, code generation in Codeforces, and other reasoning tasks in BIG-Bench.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AgDICX1h50",
    "arxiv_id": "2310.01714",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19241,
    "title": "BatchPrompt: Accomplish more with less",
    "authors": [
      "Jianzhe Lin",
      "Maurice Diesendruck",
      "Liang Du",
      "Robin Abraham"
    ],
    "abstract": "The ever-increasing token limits of large language models (LLMs) have enabled long context as input. Many LLMs are trained/fine-tuned to perform zero-shot/few-shot inference using instruction-based prompts. Crafting prompts for these LLMs typically requires the user to provide a detailed task description, demonstrations, and single example of context for inference. This regular prompt baseline is referred to as \u201cSinglePrompt\u201d in this paper. However, for NLP tasks where each data point for inference is not necessarily lengthy, the token countfor instructions and few-shot examples in the prompt may be considerably larger than that of the data point, resulting in lower token-resource utilization compared with encoder-based models like fine-tuned BERT. This cost-efficiency issue, affecting inference speed and compute budget, counteracts the many benefits LLMs have to offer. This paper aims to alleviate the preceding problem by batching multiple data points into a single prompt, a prompting strategy we refer to as \u201cBatchPrompt\u201d. This strategy increases the \u201cdensity\u201d of data points, which in turn leads to improved token utilization. Applying BatchPrompt na \u0308\u0131vely, however, is very challenging due to significant performance degradation, as observed in our experiments. We also noticed varying inference outcomes for the same data points appearing in different positions within a prompt. Based on this observation, to address the quality issue while remain high token-resource utilization, we introduce Batch Permutation and Ensembling (BPE) for BatchPrompt, a simple majority voting way that recovers labeling quality through repeatedly permutating data positions in a batch at the price of more token usage. To counterbalance the additional token usage caused by the voting process, we further propose Self-reflection-guided EArly Stopping (SEAS), which can terminate the voting process early for data points the LLM confidently handles. Our comprehensive experimental evaluation demonstrates that BPE +SEAS can boost the performance of BatchPrompt with a striking margin on a range of popular NLP tasks, including question answering (Boolq), textual entailment (RTE), and duplicate questions identification (QQP). These performances are even competitive with/higher than single-data prompting (SinglePrompt), while BatchPrompt requires much fewer LLM calls and input tokens (For SinglePrompt v.s. BatchPrompt+BPE +SEAS with batch size 32, using just 15.7% the number of LLM calls, Boolq accuracy 90.6% \u2192 90.9% with 27.4% tokens, QQP accuracy 87.2% \u2192 88.4% with 18.6% tokens, RTE accuracy 91.5% \u2192 91.1% with 30.8% tokens). We hope our simple yet effective approach will shed light on the future research of large language models. The code will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Agyicd577r",
    "arxiv_id": "2309.00384",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19239,
    "title": "Critical Learning Periods Emerge Even in Deep Linear Networks",
    "authors": [
      "Michael Kleinman",
      "Alessandro Achille",
      "Stefano Soatto"
    ],
    "abstract": "Critical learning periods are periods early in development where temporary sensory deficits can have a permanent effect on behavior and learned representations. Despite the radical differences between biological and artificial networks, critical learning periods have been empirically observed in both systems. This suggests that critical periods may be fundamental to learning and not an accident of biology.Yet, why exactly critical periods emerge in deep networks is still an open question, and in particular it is unclear whether the critical periods observed in both systems depend on particular architectural or optimization details. To isolate the key underlying factors, we focus on deep linear network models, and show that, surprisingly, such networks also display much of the behavior seen in biology and artificial networks, while being amenable to analytical treatment. We show that critical periods depend on the depth of the model and structure of the data distribution. We also show analytically and in simulations that the learning of features is tied to competition between sources. Finally, we extend our analysis to multi-task learning to show that pre-training on certain tasks can damage the transfer performance on new tasks, and show how this depends on the relationship between tasks and the duration of the pre-training stage. To the best of our knowledge, our work provides the first analytically tractable model that sheds light into why critical learning periods emerge in biological and artificial networks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Aq35gl2c1k",
    "arxiv_id": "2308.12221",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19238,
    "title": "KoLA: Carefully Benchmarking World Knowledge of Large Language Models",
    "authors": [
      "Jifan Yu",
      "Xiaozhi Wang",
      "Shangqing Tu",
      "Shulin Cao",
      "Daniel Zhang-Li",
      "Xin Lv",
      "Hao Peng",
      "Zijun Yao",
      "Xiaohan Zhang",
      "Hanming Li",
      "Chunyang Li",
      "Zheyuan Zhang",
      "Yushi Bai",
      "Yantao Liu",
      "Amy Xin",
      "Kaifeng Yun",
      "Linlu GONG",
      "Nianyi Lin",
      "Jianhui Chen",
      "Zhili Wu",
      "Yunjia Qi",
      "Weikai Li",
      "Yong Guan",
      "Kaisheng Zeng",
      "Ji Qi",
      "Hailong Jin",
      "Jinxin Liu",
      "Yu Gu",
      "Yuan Yao",
      "Ning Ding",
      "Lei Hou",
      "Zhiyuan Liu",
      "Xu Bin",
      "Jie Tang",
      "Juanzi Li"
    ],
    "abstract": "The unprecedented performance of large language models (LLMs) necessitates improvements in evaluations. Rather than merely exploring the breadth of LLM abilities, we believe meticulous and thoughtful designs are essential to thorough, unbiased, and applicable evaluations. Given the importance of world knowledge to LLMs, we construct a Knowledge-oriented LLM Assessment benchmark (KoLA), in which we carefully design three crucial factors: (1) For ability modeling, we mimic human cognition to form a four-level taxonomy of knowledge-related abilities, covering 19 tasks. (2) For data, to ensure fair comparisons, we use both Wikipedia, a corpus prevalently pre-trained by LLMs, along with continuously collected emerging corpora, aiming to evaluate the capacity to handle unseen data and evolving knowledge. (3) For evaluation criteria, we adopt a contrastive system, including overall standard scores for better numerical comparability across tasks and models, and a unique self-contrast metric for automatically evaluating knowledge-creating ability. We evaluate 21 open-source and commercial LLMs and obtain some intriguing findings. The KoLA dataset will be updated every three months to provide timely references for developing LLMs and knowledge-related systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AqN23oqraW",
    "arxiv_id": "2306.09296",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17675,
    "title": "SILO Language Models: Isolating Legal Risk In a Nonparametric Datastore",
    "authors": [
      "Sewon Min",
      "Suchin Gururangan",
      "Eric Wallace",
      "Weijia Shi",
      "Hannaneh Hajishirzi",
      "Noah A. Smith",
      "Luke Zettlemoyer"
    ],
    "abstract": "The legality of training language models (LMs) on copyrighted or otherwise restricted data is under intense debate. However, as we show, model performance significantly degrades if trained only on low-risk text (e.g., out-of-copyright books or government documents), due to its limited size and domain coverage. We present SILO, a new language model that manages this risk-performance tradeoff during inference. SILO is built by (1) training a parametric LM on the Open License Corpus (OLC), a new corpus we curate with 228B tokens of public domain and permissively licensed text and (2) augmenting it with a more general and easily modifiable nonparametric datastore (e.g., containing copyrighted books or news) that is only queried during inference. The datastore allows use of high-risk data without training on it, supports sentence-level data attribution, and enables data producers to opt out from the model by removing content from the store. These capabilities can foster compliance with data-use regulations such as the fair use doctrine in the United States and the GDPR in the European Union. Our experiments show that the parametric LM struggles on its own with domains not covered by OLC. However, access to the datastore greatly improves out of domain performance, closing 90% of the performance gap with an LM trained on the Pile, a more diverse corpus with mostly high-risk text. We also analyze which nonparametric approach works best, where the remaining errors lie, and how performance scales with datastore size. Our results suggest that it is possible to build high quality language models while mitigating legal risk.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ruk0nyQPec",
    "arxiv_id": "2308.04430",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19236,
    "title": "What Algorithms can Transformers Learn? A Study in Length Generalization",
    "authors": [
      "Hattie Zhou",
      "Arwen Bradley",
      "Etai Littwin",
      "Noam Razin",
      "Omid Saremi",
      "Joshua M. Susskind",
      "Samy Bengio",
      "Preetum Nakkiran"
    ],
    "abstract": "Large language models exhibit surprising emergent generalization properties, yet also struggle on many simple reasoning tasks such as arithmetic and parity. In this work, we focus on length generalization, and we propose a unifying framework to understand when and how Transformers can be expected to length generalize on a given task. First, we show that there exist algorithmic tasks for which standarddecoder-only Transformers trained from scratch naturally exhibit strong length generalization. For these tasks, we leverage the RASP programming language (Weiss et al., 2021) to show that the correct algorithmic solution which solves the task can be represented by a simple Transformer. We thus propose the RASP-Generalization Conjecture: Transformers tend to learn a length-generalizing solution if there exists a short RASP-L program that works for all input lengths. We present empirical evidence to support the correlation between RASP-simplicity and generalization. We leverage our insights to give new scratchpad formats which yield strong length generalization on traditionally hard tasks (such as parity and addition), and we illustrate how scratchpad can hinder generalization when it increases the complexity of the corresponding RASP-L program. Overall, our work provides a novel perspective on the mechanisms of length generalization and the algorithmic capabilities of Transformers.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AssIuHnmHX",
    "arxiv_id": "2310.16028",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19234,
    "title": "Understanding Augmentation-based Self-Supervised Representation Learning via RKHS Approximation and Regression",
    "authors": [
      "Runtian Zhai",
      "Bingbin Liu",
      "Andrej Risteski",
      "J Zico Kolter",
      "Pradeep Kumar Ravikumar"
    ],
    "abstract": "Data augmentation is critical to the empirical success of modern self-supervised representation learning, such as contrastive learning and masked language modeling.However, a theoretical understanding of the exact role of the augmentation remains limited.Recent work has built the connection between self-supervised learning and the approximation of the top eigenspace of a graph Laplacian operator, suggesting that learning a linear probe atop such representation can be connected to RKHS regression.Building on this insight, this work delves into a statistical analysis of augmentation-based pretraining.Starting from the isometry property, a geometric characterization of the target function given by the augmentation, we disentangle the effects of the model and the augmentation,and prove two generalization bounds that are free of model complexity.Our first bound works for an arbitrary encoder, and it is the sum of an estimation error bound incurred by fitting a linear probe, and an approximation error bound by RKHS approximation.Our second bound specifically addresses the casewhere the encoder extracts the top-d eigenspace of a finite-sample-based approximation of the underlying RKHS.A key ingredient in our analysis is the *augmentation complexity*,which we use to quantitatively compare different augmentations and analyze their impact on downstream performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Ax2yRhCQr1",
    "arxiv_id": "2306.00788",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17381,
    "title": "Detecting Pretraining Data from Large Language Models",
    "authors": [
      "Weijia Shi",
      "Anirudh Ajith",
      "Mengzhou Xia",
      "Yangsibo Huang",
      "Daogao Liu",
      "Terra Blevins",
      "Danqi Chen",
      "Luke Zettlemoyer"
    ],
    "abstract": "Although large language models (LLMs) are widely deployed, the data used to train them is rarely disclosed. Given the incredible scale of this data, up to trillions of tokens, it is all but certain that it includes potentially problematic text such as copyrighted materials, personally identifiable information, and test data for widely reported reference benchmarks. However, we currently have no way to know which data of these types is included or in what proportions. In this paper, we study the pretraining data detection problem: given a piece of text and black-box access to an LLM without knowing the pretraining data, can we determine if the model was trained on the provided text? To facilitate this study, we introduce a dynamic benchmark WIKIMIA that uses data created before and after model training to support gold truth detection. We also introduce a new detection method MIN-K PROB based on a simple hypothesis: an unseen example is likely to contain a few outlier words with low probabilities under the LLM, while a seen example is less likely to have words with such low probabilities. MIN-K PROB can be applied without any knowledge about the pretrainig corpus or any additional training, departing from previous detection methods that require training a reference model on data that is similar to the pretraining data. Moreover, our experiments demonstrate that MIN-K PROB achieves a 7.4% improvement on WIKIMIA over these previous methods. We apply MIN-K PROB to two real-world scenarios, copyrighted book detection and contaminated downstream example detection, and find that it to be a consistently effective solution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zWqr3MQuNs",
    "arxiv_id": "2310.16789",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18861,
    "title": "In-Context Pretraining: Language Modeling Beyond Document Boundaries",
    "authors": [
      "Weijia Shi",
      "Sewon Min",
      "Maria Lomeli",
      "Chunting Zhou",
      "Margaret Li",
      "Xi Victoria Lin",
      "Noah A. Smith",
      "Luke Zettlemoyer",
      "Wen-tau Yih",
      "Mike Lewis"
    ],
    "abstract": "Language models are currently trained to predict tokens given document prefixes, enabling them to zero shot long form generation and prompting-style tasks which can be reduced to document completion. We instead present IN-CONTEXT PRETRAINING, a new approach where language models are trained on a sequence of related documents, thereby explicitly encouraging them to read and reason across document boundaries. Our approach builds on the fact that current pipelines train by concatenating random sets of shorter documents to create longer context windows; this improves efficiency even though the prior documents provide no signal for predicting the next document. Given this fact, we can do IN-CONTEXT PRETRAINING by simply changing the document ordering so that each context contains related documents, and directly applying existing pretraining pipelines. However, this document sorting problem is challenging. There are billions of documents and we would like the sort to maximize contextual similarity for every document without repeating any data. To do this, we introduce approximate algorithms for finding related documents with efficient nearest neighbor search and constructing coherent batches with a graph cover algorithm. Our experiments show IN-CONTEXT PRETRAINING offers a scalable and simple approach to significantly enhance LM performance: we see notable improvements in tasks that require more complex contextual reasoning, including in-context learning (+8%), reading comprehension (+15%), faithfulness to previous contexts (+16%), long-context reasoning (+5%), and retrieval augmentation (+9%).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=LXVswInHOo",
    "arxiv_id": "2310.10638",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19233,
    "title": "Symmetric Neural-Collapse Representations with Supervised Contrastive Loss: The Impact of ReLU and Batching",
    "authors": [
      "Ganesh Ramachandra Kini",
      "Vala Vakilian",
      "Tina Behnia",
      "Jaidev Gill",
      "Christos Thrampoulidis"
    ],
    "abstract": "Supervised contrastive loss (SCL) is a competitive and often superior alternative to the cross-entropy loss for classification. While prior studies have demonstrated that both losses yield symmetric training representations under balanced data, this symmetry breaks under class imbalances. This paper presents an intriguing discovery: the introduction of a ReLU activation at the final layer effectively restores the symmetry in SCL-learned representations. We arrive at this finding analytically, by establishing that the global minimizers of an unconstrained features model with SCL loss and entry-wise non-negativity constraints form an orthogonal frame. Extensive experiments conducted across various datasets, architectures, and imbalance scenarios corroborate our finding.  Importantly, our experiments reveal that the inclusion of the ReLU activation restores symmetry without compromising test accuracy. This constitutes the first geometry characterization of SCL under imbalances. Additionally, our analysis and experiments underscore the pivotal role of batch selection strategies in representation geometry. By proving necessary and sufficient conditions for mini-batch choices that ensure invariant symmetric representations, we introduce batch-binding as an efficient strategy that guarantees these conditions hold.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AyXIDfvYg8",
    "arxiv_id": "2306.07960",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19232,
    "title": "Learning Energy-Based Models by Cooperative Diffusion Recovery Likelihood",
    "authors": [
      "Yaxuan Zhu",
      "Jianwen Xie",
      "Ying Nian Wu",
      "Ruiqi Gao"
    ],
    "abstract": "Training energy-based models (EBMs) on high-dimensional data can be both challenging and time-consuming, and there exists a noticeable gap in sample quality between EBMs and other generative frameworks like GANs and diffusion models. To close this gap, inspired by the recent efforts of learning EBMs by maximimizing diffusion recovery likelihood (DRL), we propose cooperative diffusion recovery likelihood (CDRL), an effective approach to tractably learn and sample from a series of EBMs defined on increasingly noisy versons of a dataset, paired with an initializer model for each EBM. At each noise level, the two models are jointly estimated within a cooperative training framework: Samples from the initializer serve as starting points that are refined by a few MCMC sampling steps from the EBM. The EBM is then optimized by maximizing recovery likelihood, while the initializer model is optimized by learning from the difference between the refined samples and the initial samples. In addition, we made several practical designs for EBM training to further improve the sample quality. Combining these advances, we significantly boost the generation performance compared to existing EBM methods on CIFAR-10 and ImageNet 32x32. And we have shown that CDRL has great potential to largely reduce the sampling time. We also demonstrate the effectiveness of our models for several downstream tasks, including classifier-free guided generation, compositional generation, image inpainting and out-of-distribution detection.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=AyzkDpuqcl",
    "arxiv_id": "2309.05153",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19231,
    "title": "P2Seg: Pointly-supervised Segmentation via Mutual Distillation",
    "authors": [
      "Zipeng Wang",
      "Xuehui Yu",
      "Xumeng Han",
      "Wenwen Yu",
      "Zhixun Huang",
      "Jianbin Jiao",
      "Zhenjun Han"
    ],
    "abstract": "Point-level Supervised Instance Segmentation (PSIS) aims to enhance the applicability and scalability of instance segmentation by utilizing low-cost yet instance-informative annotations. Existing PSIS methods usually rely on positional information to distinguish objects, but predicting precise boundaries remains challenging due to the lack of contour annotations. Nevertheless, weakly supervised semantic segmentation methods are proficient in utilizing intra-class feature consistency to capture the boundary contours of the same semantic regions. In this paper, we design a Mutual Distillation Module (MDM) to leverage the complementary strengths of both instance position and semantic information and achieve accurate instance-level object perception. The MDM consists of Semantic to Instance (S2I) and Istance to Semantic (I2S). S2I is guided by the precise boundaries of semantic regions to learn the association between annotated points and instance contours. I2S leverages discriminative relationships between instances to facilitate the differentiation of various objects within the semantic map. Extensive experiments substantiate the efficacy of MDM in fostering the synergy between instance and semantic information, consequently improving the quality of instance-level object representations. Our method achieves 55.7 mAP50 and 17.6 mAP on the PASCAL VOC and MS COCO datasets, significantly outperforming recent PSIS methods and several box-supervised instance segmentation competitors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=B4vzu2aokv",
    "arxiv_id": "2401.09709",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19230,
    "title": "ToolChain*: Efficient Action Space Navigation in Large Language Models with A* Search",
    "authors": [
      "Yuchen Zhuang",
      "Xiang Chen",
      "Tong Yu",
      "Saayan Mitra",
      "Victor Bursztyn",
      "Ryan A. Rossi",
      "Somdeb Sarkhel",
      "Chao Zhang"
    ],
    "abstract": "Large language models (LLMs) have demonstrated powerful decision-making and planning capabilities in solving complicated real-world problems. LLM-based autonomous agents can interact with diverse tools (e.g., functional APIs) and generate solution plans that execute a series of API function calls in a step-by-step manner. The multitude of candidate API function calls significantly expands the action space, amplifying the critical need for efficient action space navigation. However, existing methods either struggle with unidirectional exploration in expansive action spaces, trapped into a locally optimal solution, or suffer from exhaustively traversing all potential actions, causing inefficient navigation. To address these issues, we propose ToolChain*, an efficient tree search-based planning algorithm for LLM-based agents. It formulates the entire action space as a decision tree, where each node represents a possible API function call involved in a solution plan. By incorporating the A$^*$ search algorithm with task-specific cost function design, it efficiently prunes high-cost branches that may involve incorrect actions, identifying the most low-cost valid path as the solution. Extensive experiments on multiple tool-use and reasoning tasks demonstrate that ToolChain* efficiently balances exploration and exploitation within an expansive action space. It outperforms state-of-the-art baselines on planning and reasoning tasks by 3.1% and 3.5% on average while requiring 7.35x and 2.31x less time, respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=B6pQxqUcT8",
    "arxiv_id": "2310.13227",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18345,
    "title": "Representation Deficiency in Masked Language Modeling",
    "authors": [
      "Yu Meng",
      "Jitin Krishnan",
      "Sinong Wang",
      "Qifan Wang",
      "Yuning Mao",
      "Han Fang",
      "Marjan Ghazvininejad",
      "Jiawei Han",
      "Luke Zettlemoyer"
    ],
    "abstract": "Masked Language Modeling (MLM) has been one of the most prominent approaches for pretraining bidirectional text encoders due to its simplicity and effectiveness. One notable concern about MLM is that the special $\\texttt{[MASK]}$ symbol causes a discrepancy between pretraining data and downstream data as it is present only in pretraining but not in fine-tuning. In this work, we offer a new perspective on the consequence of such a discrepancy: We demonstrate empirically and theoretically that MLM pretraining allocates some model dimensions exclusively for representing $\\texttt{[MASK]}$ tokens, resulting in a representation deficiency for real tokens and limiting the pretrained model's expressiveness when it is adapted to downstream data without $\\texttt{[MASK]}$ tokens. Motivated by the identified issue, we propose MAE-LM, which pretrains the Masked Autoencoder architecture with MLM where $\\texttt{[MASK]}$ tokens are excluded from the encoder. Empirically, we show that MAE-LM improves the utilization of model dimensions for real token representations, and MAE-LM consistently outperforms MLM-pretrained models on the GLUE and SQuAD benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=b3l0piOrGU",
    "arxiv_id": "2302.02060",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19229,
    "title": "Compressing LLMs: The Truth is Rarely Pure and Never Simple",
    "authors": [
      "AJAY KUMAR JAISWAL",
      "Zhe Gan",
      "Xianzhi Du",
      "Bowen Zhang",
      "Zhangyang Wang",
      "Yinfei Yang"
    ],
    "abstract": "Despite their remarkable achievements, modern Large Language Models (LLMs) encounter exorbitant computational and memory footprints. Recently, several works have shown significant success in *training-free* and  *data-free* compression (pruning and quantization) of LLMs achieving 50-60\\% sparsity and reducing the bit-width down to 3 or 4 bits per weight, with negligible perplexity degradation over the uncompressed baseline. As recent research efforts are focused on developing increasingly sophisticated compression methods, our work takes a step back, and re-evaluates the effectiveness of existing SoTA compression methods, which rely on a fairly simple and widely questioned metric, perplexity (even for dense LLMs). We introduce **K**nowledge-**I**ntensive **C**ompressed LLM Benchmar**K** **(LLM-KICK)**, a collection of carefully-curated tasks to re-define the evaluation protocol for compressed LLMs, which have significant alignment with their dense counterparts, and perplexity fail to capture subtle change in their true capabilities. LLM-KICK unveils many favorable merits and unfortunate plights of current SoTA compression methods: all pruning methods suffer significant performance degradation, sometimes at trivial sparsity ratios (*e.g.*, 25-30\\%), and fail for N:M sparsity on knowledge-intensive tasks; current quantization methods are more successful than pruning; yet, pruned LLMs even at $\\geq 50$\\% sparsity are robust in-context retrieval and summarization systems; among others. LLM-KICK is designed to holistically access compressed LLMs' ability for language understanding, reasoning, generation, in-context retrieval, in-context summarization, *etc.* We hope our study can foster the development of better LLM compression methods. All our related codes are planed to be open-sourced.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=B9klVS7Ddk",
    "arxiv_id": "2310.01382",
    "GitHub": [
      "https://github.com/VITA-Group/llm-kick"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19228,
    "title": "Hybrid Directional Graph Neural Network for Molecules",
    "authors": [
      "Junyi An",
      "Chao Qu",
      "Zhipeng Zhou",
      "Fenglei Cao",
      "Xu Yinghui",
      "Yuan Qi",
      "Furao Shen"
    ],
    "abstract": "Equivariant message passing neural networks have emerged as the prevailing approach for predicting chemical properties of molecules due to their ability to leverage translation and rotation symmetries, resulting in a strong inductive bias. However, the equivariant operations in each layer can impose excessive constraints on the function form and network flexibility. To address these challenges, we introduce a novel network called the Hybrid Directional Graph Neural Network (HDGNN), which effectively combines strictly equivariant operations with learnable modules. We evaluate the performance of HDGNN on the QM9 dataset and the IS2RE dataset of OC20, demonstrating its state-of-the-art performance on several tasks and competitive performance on others. Our code is anonymously released on https://github.com/AnonymousACode/HDGNN.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=BBD6KXIGJL",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19438,
    "title": "Demystifying CLIP Data",
    "authors": [
      "Hu Xu",
      "Saining Xie",
      "Xiaoqing Tan",
      "Po-Yao Huang",
      "Russell Howes",
      "Vasu Sharma",
      "Shang-Wen Li",
      "Gargi Ghosh",
      "Luke Zettlemoyer",
      "Christoph Feichtenhofer"
    ],
    "abstract": "Contrastive Language-Image Pre-training (CLIP) is an approach that has advanced research and applications in computer vision, fueling modern recognition systems and generative models. We believe that the main ingredient to the success of CLIP is its \\textit{data} and \\textit{not} the \\textit{model} architecture or pre-training {objective}. However, CLIP only provides very limited information about its data and how it has been collected, leading to works that aim to reproduce CLIP's data by filtering with its model parameters. In this work, we intend to reveal CLIP's data curation approach and in our pursuit of making it open to the community introduce Metadata-Curated Language-Image Pre-training (MetaCLIP). MetaCLIP takes a raw data pool and metadata (derived from CLIP's concepts) and yields a balanced subset over the metadata distribution. Our experimental study rigorously isolates the model and training settings, concentrating solely on data. MetaCLIP applied to CommonCrawl with 400M image-text data pairs outperforms CLIP's data on multiple standard benchmarks. In zero-shot ImageNet classification, MetaCLIP achieves 70.8\\% accuracy, surpassing CLIP's 68.3\\% on \\mbox{ViT-B} models. Scaling to 1B data, while maintaining the same training budget, attains \\textbf{72.4\\%}. Our observations hold across various model sizes, exemplified by ViT-H achieving \\textbf{80.5\\%}, without any bells-and-whistles. Curation code and training data distribution over metadata will be made available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=5BCFlnfE1g",
    "arxiv_id": "2309.16671",
    "GitHub": [
      "https://github.com/facebookresearch/MetaCLIP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19225,
    "title": "DP-SGD Without Clipping: The Lipschitz Neural Network Way",
    "authors": [
      "Louis B\u00e9thune",
      "Thomas Massena",
      "Thibaut Boissin",
      "Aur\u00e9lien Bellet",
      "Franck Mamalet",
      "Yannick Prudent",
      "Corentin Friedrich",
      "Mathieu Serrurier",
      "David Vigouroux"
    ],
    "abstract": "State-of-the-art approaches for training Differentially Private (DP) Deep Neural Networks (DNN) face difficulties to estimate tight bounds on the sensitivity of the network's layers, and instead rely on a process of per-sample gradient clipping. This clipping process not only biases the direction of gradients but also proves costly both in memory consumption and in computation. To provide sensitivity bounds and bypass the drawbacks of the clipping process, we propose to rely on Lipschitz constrained networks. Our theoretical analysis reveals an unexplored link between the Lipschitz constant with respect to their input and the one with respect to their parameters. By bounding the Lipschitz constant of each layer with respect to its parameters, we prove that we can train these networks with privacy guarantees.  Our analysis not only allows the computation of the aforementioned sensitivities at scale, but also provides guidance on how to maximize the gradient-to-noise ratio for fixed privacy guarantees. To facilitate the application of Lipschitz networks and foster robust and certifiable learning under privacy guarantees, we provide a Python package that implements building blocks allowing the construction and private training of such networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BEyEziZ4R6",
    "arxiv_id": "2305.16202",
    "GitHub": [
      "https://github.com/Algue-Rythme/lip-dp"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19224,
    "title": "A 2-Dimensional State Space Layer for Spatial Inductive Bias",
    "authors": [
      "Ethan Baron",
      "Itamar Zimerman",
      "Lior Wolf"
    ],
    "abstract": "A central objective in computer vision is to design models with appropriate 2-D inductive bias. Desiderata for 2-D inductive bias include two-dimensional position awareness, dynamic spatial locality, and translation and permutation invariance. To address these goals, we leverage an expressive variation of the multidimensional State Space Model (SSM). Our approach introduces efficient parameterization,accelerated computation, and a suitable normalization scheme. Empirically, we observe that incorporating our layer at the beginning of each transformer block of Vision Transformers (ViT) significantly enhances performance for multiple ViT backbones and across datasets. The new layer is effective even with a negligible amount of additional parameters and inference time. Ablation studies and visualizations demonstrate that the layer has a strong 2-D inductive bias. For example, vision transformers equipped with our layer exhibit effective performance evenwithout positional encoding. Our code is attached as supplementary.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BGkqypmGvm",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19223,
    "title": "A Multi-Level Framework for Accelerating Training Transformer Models",
    "authors": [
      "Longwei Zou",
      "Han Zhang",
      "Yangdong Deng"
    ],
    "abstract": "The fast growing capabilities of large-scale deep learning models, such as Bert, GPT and ViT, are revolutionizing the landscape of NLP, CV and many other domains. Training such models, however, poses an unprecedented demand for computing power, which incurs exponentially increasing energy cost and carbon dioxide emissions. It is thus critical to develop efficient training solutions to reduce the training costs. Motivated by a set of key observations of inter- and intra-layer similarities among feature maps and attentions that can be identified from typical training processes, we propose a multi-level framework for training acceleration. Specifically, the framework is based on three basic operators, Coalescing, De-coalescing and Interpolation, which can be orchestrated to build a multi-level training framework. The framework consists of a V-cycle training process, which progressively down- and up-scales the model size and projects the parameters between adjacent levels of models via coalescing and de-coalescing. The key idea is that a smaller model that can be trained for fast convergence and the trained parameters provides high-qualities intermediate solutions for the next level larger network. The interpolation operator is designed to break the symmetry of neurons incurred by de-coalescing for better convergence performance. Our experiments on transformer-based language models (e.g. Bert, GPT) as well as a vision model (e.g. DeiT) prove that the proposed framework reduces the computational cost by about 20% on training BERT/GPT-Base models and up to 51.6% on training the BERT-Large model while preserving the performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BI1N3lTWtn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19562,
    "title": "RA-DIT: Retrieval-Augmented Dual Instruction Tuning",
    "authors": [
      "Xi Victoria Lin",
      "Xilun Chen",
      "Mingda Chen",
      "Weijia Shi",
      "Maria Lomeli",
      "Richard James",
      "Pedro Rodriguez",
      "Jacob Kahn",
      "Gergely Szilvasy",
      "Mike Lewis",
      "Luke Zettlemoyer",
      "Wen-tau Yih"
    ],
    "abstract": "Retrieval-augmented language models (RALMs) improve performance by accessing long-tail and up-to-date knowledge from external data stores, but are challenging to build. Existing approaches require either expensive retrieval-specific modifications to LM pre-training or use post-hoc integration of the data store that leads to suboptimal performance. We introduce Retrieval-Augmented Dual Instruction Tuning (RA-DIT), a lightweight fine-tuning methodology that provides a third option by retrofitting any LLM with retrieval capabilities. Our approach operates in two distinct fine-tuning steps: (1) one updates a pre-trained LM to better use retrieved information, while (2) the other updates the retriever to return more relevant results, as preferred by the LM. By fine-tuning over tasks that require both knowledge utilization and contextual awareness, we demonstrate that each stage yields significant performance improvements, and using both leads to additional gains. Our best model, RA-DIT 65B, achieves state-of-the-art performance across a range of knowledge-intensive zero- and few-shot learning benchmarks, significantly outperforming existing in-context RALM approaches by up to +8.9% in 0-shot setting and +1.4% in 5-shot setting on average.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=22OTbutug9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19221,
    "title": "CellPLM: Pre-training of Cell Language Model Beyond Single Cells",
    "authors": [
      "Hongzhi Wen",
      "Wenzhuo Tang",
      "Xinnan Dai",
      "Jiayuan Ding",
      "Wei Jin",
      "Yuying Xie",
      "Jiliang Tang"
    ],
    "abstract": "The current state-of-the-art single-cell pre-trained models are greatly inspired by the success of large language models. They trained transformers by treating genes as tokens and cells as sentences. However, three fundamental differences between single-cell data and natural language data are overlooked: (1) scRNA-seq data are presented as bag-of-genes instead of sequences of RNAs; (2) Cell-cell relations are more intricate and important than inter-sentence relations; and (3) The quantity of single-cell data is considerably inferior to text data, and they are very noisy. In light of these characteristics, we propose a new pre-trained model, CellPLM, which takes cells as tokens and tissues as sentences. In addition, we leverage spatially-resolved transcriptomic data in pre-training to facilitate learning cell-cell relationships and introduce a Gaussian prior distribution as an additional inductive bias to overcome data limitations. CellPLM is the first single-cell pre-trained transformer that encodes cell-cell relations and it consistently achieves state-of-the-art performance across distinct downstream tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BKXvPDekud",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19219,
    "title": "LMSYS-Chat-1M: A Large-Scale Real-World LLM Conversation Dataset",
    "authors": [
      "Lianmin Zheng",
      "Wei-Lin Chiang",
      "Ying Sheng",
      "Tianle Li",
      "Siyuan Zhuang",
      "Zhanghao Wu",
      "Yonghao Zhuang",
      "Zhuohan Li",
      "Zi Lin",
      "Eric Xing",
      "Joseph E. Gonzalez",
      "Ion Stoica",
      "Hao Zhang"
    ],
    "abstract": "Studying how people interact with large language models (LLMs) in real-world scenarios is increasingly important due to their widespread use in various applications.In this paper, we introduce RealChat-1M, a large-scale dataset containing one million real-world conversations with 25 state-of-the-art LLMs.This dataset is collected from 210K unique IP addresses in the wild on our chat demo website.We offer an overview of the dataset's content, including its curation process, basic statistics, and topic distribution, highlighting its diversity, originality, and scale.We demonstrate its versatility through four use cases: developing content moderation models that perform similarly to GPT-4, building a safety benchmark, training instruction-following models that perform similarly to Vicuna, and creating challenging benchmark questions.We believe that this dataset will serve as a valuable resource for understanding and advancing LLM capabilities.The dataset will be publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=BOfDKxfwt0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19218,
    "title": "Demystifying Poisoning Backdoor Attacks from a Statistical Perspective",
    "authors": [
      "Ganghua Wang",
      "Xun Xian",
      "Ashish Kundu",
      "Jayanth Srinivasa",
      "Xuan Bi",
      "Mingyi Hong",
      "Jie Ding"
    ],
    "abstract": "The growing dependence on machine learning in real-world applications emphasizes the importance of understanding and ensuring its safety. Backdoor attacks pose a significant security risk due to their stealthy nature and potentially serious consequences. Such attacks involve embedding triggers within a learning model with the intention of causing malicious behavior when an active trigger is present while maintaining regular functionality without it. This paper evaluates the effectiveness of any backdoor attack incorporating a constant trigger, by establishing tight lower and upper boundaries for the performance of the compromised model on both clean and backdoor test data. The developed theory answers a series of fundamental but previously underexplored problems, including (1) what are the determining factors for a backdoor attack's success, (2) what is the direction of the most effective backdoor attack, and (3) when will a human-imperceptible trigger succeed. Our derived understanding applies to both discriminative and generative models. We also demonstrate the theory by conducting experiments using benchmark datasets and state-of-the-art backdoor attack scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BPHcEpGvF8",
    "arxiv_id": "2310.10780",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19760,
    "title": "Neural Fine-Tuning Search for Few-Shot Learning",
    "authors": [
      "Panagiotis Eustratiadis",
      "\u0141ukasz Dudziak",
      "Da Li",
      "Timothy Hospedales"
    ],
    "abstract": "In few-shot recognition, a classifier that has been trained on one set of classes is required to rapidly adapt and generalize to a disjoint, novel set of classes. To that end, recent studies have shown the efficacy of fine-tuning with carefully-crafted adaptation architectures. However this raises the question of: How can one design the optimal adaptation strategy? In this paper, we study this question through the lens of neural architecture search (NAS). Given a pre-trained neural network, our algorithm discovers the optimal arrangement of adapters, which layers to keep frozen, and which to fine-tune. We demonstrate the generality of our NAS method by applying it to both residual networks and vision transformers and report state-of-the-art performance on Meta-Dataset and Meta-Album.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=T7YV5UZKBc",
    "arxiv_id": "2306.09295",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19216,
    "title": "DAFA: Distance-Aware Fair Adversarial Training",
    "authors": [
      "Hyungyu Lee",
      "Saehyung Lee",
      "Hyemi Jang",
      "Junsung Park",
      "Ho Bae",
      "Sungroh Yoon"
    ],
    "abstract": "The disparity in accuracy between classes in standard training is amplified during adversarial training, a phenomenon termed the robust fairness problem. Existing methodologies aimed to enhance robust fairness by sacrificing the model's performance on easier classes in order to improve its performance on harder ones. However, we observe that under adversarial attacks, the majority of the model's predictions for samples from the worst class are biased towards classes similar to the worst class, rather than towards the easy classes. Through theoretical and empirical analysis, we demonstrate that robust fairness deteriorates as the distance between classes decreases. Motivated by these insights, we introduce the Distance-Aware Fair Adversarial Training (DAFA) methodology, which addresses robust fairness by taking into account the similarities between classes. Specifically, our method assigns distinct adversarial margins and loss weights to each class and adjusts them to encourage a trade-off in robustness among similar classes. Experimental results across various datasets demonstrate that our method not only maintains average robust accuracy but also significantly improves the worst robust accuracy, indicating a marked improvement in robust fairness compared to existing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BRdEBlwUW6",
    "arxiv_id": "2401.12532",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19215,
    "title": "What Makes Good Data for Alignment? A Comprehensive Study of Automatic Data Selection in Instruction Tuning",
    "authors": [
      "Wei Liu",
      "Weihao Zeng",
      "Keqing He",
      "Yong Jiang",
      "Junxian He"
    ],
    "abstract": "Instruction tuning is a standard technique employed to align large language models to end tasks and user preferences after the initial pretraining phase. Recent research indicates the critical role of data engineering in instruction tuning -- when appropriately selected, only limited data is necessary to achieve superior performance. However, we still lack a principled understanding of what makes good instruction tuning data for alignment, and how we should select data automatically and effectively. In this work, we delve deeply into automatic data selection strategies for alignment. We start with controlled studies to measure data across three dimensions: complexity, quality, and diversity, along which we examine existing methods and introduce novel techniques for enhanced data measurement. Subsequently, we propose a simple strategy to select data samples based on the measurement. We present Deita (short for Data-Efficient Instruction Tuning for Alignment), a series of models fine-tuned from LLaMA models using data samples automatically selected with our proposed approach.  When assessed through both automatic metrics and human evaluation, Deita performs better or on par with the state-of-the-art open-source alignment models such as Vicuna and WizardLM with only 6K training data samples -- 10x less than the data used in the baselines. We anticipate this work to provide clear guidelines and tools on automatic data selection, aiding researchers and practitioners in achieving data-efficient alignment.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BTKAeLqLMw",
    "arxiv_id": "2312.15685",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19213,
    "title": "Provably Robust Conformal Prediction with Improved Efficiency",
    "authors": [
      "Ge Yan",
      "Yaniv Romano",
      "Tsui-Wei Weng"
    ],
    "abstract": "Conformal prediction is a powerful tool to generate uncertainty sets with guaranteed coverage using any predictive model, under the assumption that the training and test data are i.i.d.. Recently, it has been shown that adversarial examples are able to manipulate conformal methods to construct prediction sets with invalid coverage rates, as the i.i.d. assumption is violated. To address this issue, a recent work, Randomized Smoothed Conformal Prediction (RSCP), was first proposed to certify the robustness of conformal prediction methods to adversarial noise. However, RSCP has two major limitations: (i) its robustness guarantee is flawed when used in practice and (ii) it tends to produce large uncertainty sets. To address these limitations, we first propose a novel framework called RSCP+ to provide provable robustness guarantee in evaluation, which fixes the issues in the original RSCP method. Next, we propose two novel methods, Post-Training Transformation (PTT) and Robust Conformal Training (RCT), to effectively reduce prediction set size with little computation overhead. Experimental results in CIFAR10, CIFAR100, and ImageNet suggest the baseline method only yields trivial predictions including full label set, while our methods could boost the efficiency by up to $4.36\\times$, $5.46\\times$, and $16.9\\times$ respectively and provide practical robustness guarantee.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BWAhEjXjeG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19212,
    "title": "Fine-tuning Multimodal LLMs to Follow Zero-shot Demonstrative Instructions",
    "authors": [
      "Juncheng Li",
      "Kaihang Pan",
      "Zhiqi Ge",
      "Minghe Gao",
      "Wei Ji",
      "Wenqiao Zhang",
      "Tat-Seng Chua",
      "Siliang Tang",
      "Hanwang Zhang",
      "Yueting Zhuang"
    ],
    "abstract": "Recent advancements in Multimodal Large Language Models (MLLMs) have been utilizing Visual Prompt Generators (VPGs) to convert visual features into tokens that LLMs can recognize. This is achieved by training the VPGs on millions of image-caption pairs, where the VPG-generated tokens of images are fed into a frozen LLM to generate the corresponding captions. However, this image-captioning based training objective inherently biases the VPG to concentrate solely on the primary visual contents sufficient for caption generation, often neglecting other visual details. This shortcoming results in MLLMs\u2019 underperformance in comprehending demonstrative instructions consisting of multiple, interleaved, and multimodal instructions that demonstrate the required context to complete a task. To address this issue, we introduce a generic and lightweight Visual Prompt Generator Complete module (VPG-C), which can infer and complete the missing details essential for comprehending demonstrative instructions. Further, we propose a synthetic discriminative training strategy to fine-tune VPG-C, eliminating the need for supervised demonstrative instructions. As for evaluation, we build DEMON, a comprehensive benchmark for demonstrative instruction understanding. Synthetically trained with the proposed strategy, VPG-C achieves significantly stronger zero-shot performance across all tasks of DEMON. Further evaluation on the MME and OwlEval benchmarks also demonstrate the superiority of VPG-C. The anonymous project is available at https://anonymous.4open.science/r/Cheetah-45B4.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=BXY6fe7q31",
    "arxiv_id": "2308.04152",
    "GitHub": [
      "https://github.com/DCDmllm/Cheetah"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19211,
    "title": "Manifold Diffusion Fields",
    "authors": [
      "Ahmed A. A. Elhag",
      "Yuyang Wang",
      "Joshua M. Susskind",
      "Miguel \u00c1ngel Bautista"
    ],
    "abstract": "We present Manifold Diffusion Fields (MDF), an approach that unlocks learning of diffusion models of data in general non-euclidean geometries. Leveraging insights from spectral geometry analysis, we define an intrinsic coordinate system on the manifold via the eigen-functions of the Laplace-Beltrami Operator.  MDF represents functions using an explicit parametrization formed by a set of multiple input-output pairs. Our approach allows to sample continuous functions on manifolds and is invariant with respect to rigid and isometric transformations of the manifold. In addition, we show that MDF generalizes to the case where the training set contains functions on different manifolds. Empirical results on multiple datasets and manifolds including challenging scientific problems like weather prediction or  molecular conformation show that MDF can capture distributions of such functions with better diversity and fidelity than previous approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BZtEthuXRF",
    "arxiv_id": "2305.15586",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19210,
    "title": "AntGPT: Can Large Language Models Help Long-term Action Anticipation from Videos?",
    "authors": [
      "Qi Zhao",
      "Shijie Wang",
      "Ce Zhang",
      "Changcheng Fu",
      "Minh Quan Do",
      "Nakul Agarwal",
      "Kwonjoon Lee",
      "Chen Sun"
    ],
    "abstract": "Can we better anticipate an actor\u2019s future actions (e.g. mix eggs) by knowing what commonly happens after the current action (e.g. crack eggs)? What if the actor also shares the goal (e.g. make fried rice) with us? The long-term action anticipation (LTA) task aims to predict an actor\u2019s future behavior from video observations in the form of verb and noun sequences, and it is crucial for human-machine interaction.We propose to formulate the LTA task from two perspectives: a bottom-up approach that predicts the next actions autoregressively by modeling temporal dynamics; and a top-down approach that infers the goal of the actor and plans the needed procedure to accomplish the goal. We hypothesize that large language models (LLMs), which have been pretrained on procedure text data (e.g. recipes, how-tos),have the potential to help LTA from both perspectives. It can help provide the prior knowledge on the possible next actions, and infer the goal given the observed part of a procedure, respectively. We propose AntGPT, which represents video observations as sequences of human actions, and uses the action representation for an LLM to infer the goals and model temporal dynamics. AntGPT achieves state-of-the-art performance on Ego4D LTA v1 and v2, EPIC-Kitchens-55, as well as EGTEA GAZE+, thanks to LLMs\u2019 goal inference and temporal dynamics modeling capabilities. We further demonstrate that these capabilities can be effectively distilled into a compact neural network 1.3% of the original LLM model size. Code and model will be released upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Bb21JPnhhr",
    "arxiv_id": "2307.16368",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19209,
    "title": "Large Language Models as Optimizers",
    "authors": [
      "Chengrun Yang",
      "Xuezhi Wang",
      "Yifeng Lu",
      "Hanxiao Liu",
      "Quoc V Le",
      "Denny Zhou",
      "Xinyun Chen"
    ],
    "abstract": "Optimization is ubiquitous. While derivative-based algorithms have been powerful tools for various problems, the absence of gradient imposes challenges on many real-world applications. In this work, we propose Optimization by PROmpting (OPRO), a simple and effective approach to leverage large language models (LLMs) as optimizers, where the optimization task is described in natural language. In each optimization step, the LLM generates new solutions from the prompt that contains previously generated solutions with their values, then the new solutions are evaluated and added to the prompt for the next optimization step. We first showcase OPRO on linear regression and traveling salesman problems, then move on to prompt optimization where the goal is to find instructions that maximize the task accuracy. With a variety of LLMs, we demonstrate that the best prompts optimized by OPRO outperform human-designed prompts by up to 8% on GSM8K, and by up to 50% on Big-Bench Hard tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Bb4VGOWELI",
    "arxiv_id": "2309.03409",
    "GitHub": [
      "https://github.com/google-deepmind/opro"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19208,
    "title": "An improved analysis of per-sample and per-update clipping in federated learning",
    "authors": [
      "Bo Li",
      "Xiaowen Jiang",
      "Mikkel N. Schmidt",
      "Tommy Sonne Alstr\u00f8m",
      "Sebastian U Stich"
    ],
    "abstract": "Gradient clipping is key mechanism that is essential to differentially private training techniques in Federated learning. Two popular strategies are per-sample clipping, which clips the mini-batch gradient, and per-update clipping, which clips each user's model update. However, there has not been a thorough theoretical analysis of these two clipping methods.In this work, we rigorously analyze the impact of these two clipping techniques on the convergence of a popular federated learning algorithm FedAvg under standard stochastic noise and gradient dissimilarity assumptions. We provide a convergence guarantee given any arbitrary clipping threshold. Specifically, we show that per-sample clipping is guaranteed to converge to the neighborhood of the stationary point, with the size dependent on the stochastic noise, gradient dissimilarity, and clipping threshold. In contrast, the convergence to the stationary point can be guaranteed with a sufficiently small stepsize in per-update clipping at the cost of more communication rounds. We further provide insights into understanding the impact of the improved convergence analysis in the differentially private setting.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BdPvGRvoBC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19207,
    "title": "PB-LLM: Partially Binarized Large Language Models",
    "authors": [
      "Zhihang Yuan",
      "Yuzhang Shang",
      "Zhen Dong"
    ],
    "abstract": "This paper explores network binarization, a radical form of quantization, compressing model weights to a single bit, specifically for Large Language Models (LLMs) compression. Due to previous binarization methods collapsing LLMs, we propose a novel approach, Partially-Binarized LLM (PB-LLM), which can achieve extreme low-bit quantization while maintaining the linguistic reasoning capacity of quantized LLMs. Specifically, our exploration first uncovers the ineffectiveness of na\u00efve applications of existing binarization algorithms and highlights the imperative role of salient weights in achieving low-bit quantization. Thus, PB-LLM filters a small ratio of salient weights during binarization, allocating them to higher-bit storage, i.e., partially-binarization. PB-LLM is extended to recover the capacities of quantized LMMs, by analyzing from the perspective of post-training quantization (PTQ) and quantization-aware training (QAT). Under PTQ, combining the concepts from GPTQ, we reconstruct the binarized weight matrix guided by the Hessian matrix and successfully recover the reasoning capacity of PB-LLM in low-bit. Under QAT, we freeze the salient weights during training, explore the derivation of optimal scaling factors crucial for minimizing the quantization error, and propose a scaling mechanism based on this derived scaling strategy for residual binarized weights. Those explorations and the developed methodologies significantly contribute to rejuvenating the performance of low-bit quantized LLMs and present substantial advancements in the field of network binarization for LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BifeBRhikU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19349,
    "title": "EQA-MX: Embodied Question Answering using Multimodal Expression",
    "authors": [
      "Md Mofijul Islam",
      "Alexi Gladstone",
      "Riashat Islam",
      "Tariq Iqbal"
    ],
    "abstract": "Humans predominantly use verbal utterances and nonverbal gestures (e.g., eye gaze and pointing gestures) in their natural interactions. For instance, pointing gestures and verbal information is often required to comprehend questions such as \"what object is that?\" Thus, this question-answering (QA) task involves complex reasoning of multimodal expressions (verbal utterances and nonverbal gestures). However, prior works have explored QA tasks in non-embodied settings, where questions solely contain verbal utterances from a single verbal and visual perspective. In this paper, we have introduced 8 novel embodied question answering (EQA) tasks to develop learning models to comprehend embodied questions with multimodal expressions. We have developed a novel large-scale dataset, EQA-MX, with over 8 million diverse embodied QA data samples involving multimodal expressions from multiple visual and verbal perspectives. To learn salient multimodal representations from discrete verbal embeddings and continuous wrapping of multiview visual representations, we propose a vector-quantization (VQ) based multimodal representation learning model, VQ-Fusion, for the EQA tasks. Our extensive experimental results suggest that VQ-Fusion can improve the performance of existing state-of-the-art visual-language models up to 13% across EQA tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=7gUrYE50Rb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19206,
    "title": "(InThe)WildChat: 570K ChatGPT Interaction Logs In The Wild",
    "authors": [
      "Wenting Zhao",
      "Xiang Ren",
      "Jack Hessel",
      "Claire Cardie",
      "Yejin Choi",
      "Yuntian Deng"
    ],
    "abstract": "Chatbots such as GPT-4 and ChatGPT are now serving millions of users. Despite their widespread use, there remains a lack of public datasets showcasing how these tools are used by a population of users in practice. To bridge this gap, we offered free access to ChatGPT for online users in exchange for their affirmative, consensual, opt-in for anonymous collection of their chat transcripts. From this, we compiled (InThe)WildChat, a corpus of 570K user-ChatGPT conversations, which consists of over 1.5 million interaction turns. We compare WildChat with other popular user-chatbot interaction datasets, and find that our dataset offers the most diverse user prompts, contains the largest number of languages, and presents the richest variety of potentially toxic use-cases for researchers to study. In particular, in WildChat we find that a majority of the potentially unsafe use is produced by users attempting to \u201cjailbreak\u201d the model using prompts posted on online platforms; these are successful more than 70% of the time for ChatGPT. Finally, because it captures a broad range of use cases, we demonstrate the dataset\u2019s potential utility in fine-tuning state-of-the-art instruction following models. WildLlama, a chatbot fine-tuned on WildChat, outperforms the latest Vicuna model of the same size on MT-Bench, which shows that WildChat has a high utility in addition to being a source for toxicity study. We will release WildChat and WildLlama with a license that emphasizes on accountability, collaboration, and transparency. The clean portion of WildChat will be publicly available, and the portion that contains potentially unsafe content will be made available upon request with a justification for AI safety research.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Bl8u7ZRlbM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19205,
    "title": "A Fast and Provable Algorithm for Sparse Phase Retrieval",
    "authors": [
      "Jian-Feng CAI",
      "Yu Long",
      "Ruixue WEN",
      "Jiaxi Ying"
    ],
    "abstract": "We study the sparse phase retrieval problem, which aims to recover a sparse signal from a limited number of phaseless measurements. Existing algorithms for sparse phase retrieval primarily rely on first-order methods with linear convergence rate. In this paper, we propose an efficient second-order algorithm based on Newton projection, which maintains the same per-iteration computational complexity as popular first-order methods. The proposed algorithm is theoretically guaranteed to converge to the ground truth (up to a global sign) at a quadratic convergence rate after at most $\\mathcal{O}\\big(\\log (\\Vert\\boldsymbol{x}^{\\natural} \\Vert /x_{\\min}^{\\natural})\\big)$ iterations, provided a sample complexity of $\\mathcal{O}(s^2\\log n)$, where $\\boldsymbol{x}^{\\natural} \\in \\mathbb{R}^n$ represents an $s$-sparse ground truth signal. Numerical experiments demonstrate that our algorithm outperforms state-of-the-art methods in terms of achieving a significantly faster convergence rate.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BlkxbI6vzl",
    "arxiv_id": "2309.02046",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19202,
    "title": "Out-Of-Domain Unlabeled Data Improves Generalization",
    "authors": [
      "seyed amir hossein saberi",
      "Amir Najafi",
      "Alireza Heidari",
      "Mohammad Hosein Movasaghinia",
      "Abolfazl Motahari",
      "Babak Khalaj"
    ],
    "abstract": "We propose a novel framework for incorporating unlabeled data into semi-supervised classification problems, where scenarios involving the minimization of either i) adversarially robust or ii) non-robust loss functions have been considered. Notably, we allow the unlabeled samples to deviate slightly (in total variation sense) from the in-domain distribution. The core idea behind our framework is to combine Distributionally Robust Optimization (DRO) with self-supervised training. As a result, we also leverage efficient polynomial-time algorithms for the training stage. From a theoretical standpoint, we apply our framework on the classification problem of a mixture of two Gaussians in $\\mathbb{R}^d$, where in addition to the $m$ independent and labeled samples from the true distribution, a set of $n$ (usually with $n\\gg m$) out of domain and unlabeled samples are gievn as well. Using only the labeled data, it is known that the generalization error can be bounded by $\\propto\\left(d/m\\right)^{1/2}$. However, using our method on both isotropic and non-isotropic Gaussian mixture models, one can derive a new set of analytically explicit and non-asymptotic bounds which show substantial improvement on the generalization error compared ERM. Our results underscore two significant insights: 1) out-of-domain samples, even when unlabeled, can be harnessed to narrow the generalization gap, provided that the true data distribution adheres to a form of the \"cluster assumption\", and 2) the semi-supervised learning paradigm can be regarded as a special case of our framework when there are no distributional shifts. We validate our claims through experiments conducted on a variety of synthetic and real-world datasets.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Bo6GpQ3B9a",
    "arxiv_id": "2310.00027",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19201,
    "title": "Fast-DetectGPT: Efficient Zero-Shot Detection of Machine-Generated Text via Conditional Probability Curvature",
    "authors": [
      "Guangsheng Bao",
      "Yanbin Zhao",
      "Zhiyang Teng",
      "Linyi Yang",
      "Yue Zhang"
    ],
    "abstract": "Large language models (LLMs) have shown the ability to produce fluent and cogent content, presenting both productivity opportunities and societal risks. To build trustworthy AI systems, it is imperative to distinguish between machine-generated and human-authored content. The leading zero-shot detector, DetectGPT, showcases commendable performance but is marred by its intensive computational  costs. In this paper, we introduce the concept of **conditional probability curvature** to elucidate discrepancies in word choices between LLMs and humans within a given context. Utilizing this curvature as a foundational metric, we present **Fast-DetectGPT**, an optimized zero-shot detector, which substitutes DetectGPT's perturbation step with a more efficient sampling step. Our evaluations on various datasets, source models, and test conditions indicate that Fast-DetectGPT not only surpasses DetectGPT by a relative around 75\\% in both the white-box and black-box settings but also accelerates the detection process by a factor of 340, as detailed in Table 1.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Bpcgcr8E8Z",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19200,
    "title": "Stochastic Modified Equations and Dynamics of Dropout Algorithm",
    "authors": [
      "Zhongwang Zhang",
      "Yuqing Li",
      "Tao Luo",
      "Zhi-Qin John Xu"
    ],
    "abstract": "Dropout is a widely utilized regularization technique in the training of neural networks, nevertheless, its underlying mechanism and impact on achieving good generalization abilities remain to be further understood. In this work, we start by undertaking a rigorous theoretical derivation of the stochastic modified equations, with the primary aim of providing an effective approximation for the discrete iterative process of dropout. Meanwhile, we experimentally verify SDE's ability to approximate dropout under a wider range of settings. Subsequently, we empirically delve into the intricate mechanisms by which dropout facilitates the identification of flatter minima. This exploration is conducted through intuitive approximations, exploiting the structural analogies inherent in the Hessian of loss landscape and the covariance of dropout. Our empirical findings substantiate the ubiquitous presence of the Hessian-variance alignment relation throughout the training process of dropout.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Bpkhu2ExxU",
    "arxiv_id": "2305.15850",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19198,
    "title": "LLM-CXR: Instruction-Finetuned LLM for CXR Image Understanding and Generation",
    "authors": [
      "Suhyeon Lee",
      "Won Jun Kim",
      "Jinho Chang",
      "Jong Chul Ye"
    ],
    "abstract": "Following the impressive development of LLMs, vision-language alignment in LLMs is actively being researched to enable multimodal reasoning and visual input/output. This direction of research is particularly relevant to medical imaging because accurate medical image analysis and generation consist of a combination of reasoning based on visual features and prior knowledge. Many recent works have focused on training adapter networks that serve as an information bridge between image processing (encoding or generating) networks and LLMs; but presumably, in order to achieve maximum reasoning potential of LLMs on visual information as well, visual and language features should be allowed to interact more freely. This is especially important in the medical domain because understanding and generating medical images such as chest X-rays (CXR) require not only accurate visual and language-based reasoning but also a more intimate mapping between the two modalities. Thus, taking inspiration from previous work on the transformer and VQ-GAN combination for bidirectional image and text generation, we build upon this approach and develop a method for instruction-tuning an LLM pre-trained only on text to gain vision-language capabilities for medical images. Specifically, we leverage a pretrained LLM\u2019s existing question-answering and instruction-following abilities to teach it to understand visual inputs by instructing it to answer questions about image inputs and, symmetrically, output both text and image responses appropriate to a given query by tuning the LLM with diverse tasks that encompass image-based text-generation and text-based image-generation. We show that our LLM-CXR trained in this approach shows better image-text alignment in both CXR understanding and generation tasks while being smaller in size compared to previously developed models that perform a narrower range of tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BqHaLnans2",
    "arxiv_id": "2305.11490",
    "GitHub": [
      "https://github.com/hyn2028/llm-cxr"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19197,
    "title": "Multimodal Learning Without Labeled Multimodal Data: Guarantees and Applications",
    "authors": [
      "Paul Pu Liang",
      "Chun Kai Ling",
      "Yun Cheng",
      "Alexander Obolenskiy",
      "Yudong Liu",
      "Rohan Pandey",
      "Alex Wilf",
      "Louis-Philippe Morency",
      "Russ Salakhutdinov"
    ],
    "abstract": "In many machine learning systems that jointly learn from multiple modalities, a core research question is to understand the nature of multimodal interactions: how modalities combine to provide new task-relevant information that was not present in either alone. We study this challenge of interaction quantification in a semi-supervised setting with only labeled unimodal data and naturally co-occurring multimodal data (e.g., unlabeled images and captions, video and corresponding audio) but when labeling them is time-consuming. Using a precise information-theoretic definition of interactions, our key contribution is the derivation of lower and upper bounds to quantify the amount of multimodal interactions in this semi-supervised setting. We propose two lower bounds: one based on the shared information between modalities and the other based on disagreement between separately trained unimodal classifiers, and derive an upper bound through connections to approximate algorithms for min-entropy couplings. We validate these estimated bounds and show how they accurately track true interactions. Finally, we show how these theoretical results can be used to estimate multimodal model performance, guide data collection, and select appropriate multimodal models for various tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BrjLHbqiYs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19196,
    "title": "Solving Diffusion ODEs with Optimal Boundary Conditions for Better Image Super-Resolution",
    "authors": [
      "Yiyang Ma",
      "Huan Yang",
      "Wenhan Yang",
      "Jianlong Fu",
      "Jiaying Liu"
    ],
    "abstract": "Diffusion models, as a kind of powerful generative model, have given impressive results on image super-resolution (SR) tasks. However, due to the randomness introduced in the reverse process of diffusion models, the performances of diffusion-based SR models are fluctuating at every time of sampling, especially for samplers with few resampled steps. This inherent randomness of diffusion models results in ineffectiveness and instability, making it challenging for users to guarantee the quality of SR results. However, our work takes this randomness as an opportunity: fully analyzing and leveraging it leads to the construction of an effective plug-and-play sampling method that owns the potential to benefit a series of diffusion-based SR methods. More in detail, we propose to steadily sample high-quality SR images from pre-trained diffusion-based SR models by solving diffusion ordinary differential equations (diffusion ODEs) with optimal boundary conditions (BCs) and analyze the characteristics between the choices of BCs and their corresponding SR results. Our analysis shows the route to obtain an approximately optimal BC via an efficient exploration in the whole space. The quality of SR results sampled by the proposed method with fewer steps outperforms the quality of results sampled by current methods with randomness from the same pre-trained diffusion-based SR model, which means that our sampling method ''boosts'' current diffusion-based SR models without any additional training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BtT6o5tfHu",
    "arxiv_id": "2305.15357",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18346,
    "title": "KITAB: Evaluating LLMs on Constraint Satisfaction for Information Retrieval",
    "authors": [
      "Marah I Abdin",
      "Suriya Gunasekar",
      "Varun Chandrasekaran",
      "Jerry Li",
      "Mert Yuksekgonul",
      "Rahee Ghosh Peshawaria",
      "Ranjita Naik",
      "Besmira Nushi"
    ],
    "abstract": "We study the ability of state-of-the art models to answer constraint satisfaction queries for information retrieval (e.g., \u201ca list of ice cream shops in San Diego\u201d). In the past, such queries were considered as tasks that could only be solved via web-search or knowledge bases. More recently, large language models (LLMs) have demonstrated initial emergent abilities in this task. However, many current retrieval benchmarks are either saturated or do not measure constraint satisfaction. Motivated by rising concerns around factual incorrectness and hallucinations of LLMs, we present KITAB, a new dataset for measuring constraint satisfaction abilities of language models. KITAB consists of book-related data across more than 600 authors and 13,000 queries, and also offers an associated dynamic data collection and constraint verification approach for acquiring similar test data for other authors. Our extended experiments on GPT4 and GPT3.5 characterize and decouple common failure modes across dimensions such as information popularity, constraint types, and context availability. Results show that in the absence of context, models exhibit severe limitations as measured by irrelevant information, factual errors, and incompleteness, many of which exacerbate as information popularity decreases. While context availability mitigates irrelevant information, it is not helpful for satisfying constraints, identifying fundamental barriers to constraint satisfaction. We open source our contributions to foster further research on improving constraint satisfaction abilities of future models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=b3kDP3IytM",
    "arxiv_id": "2310.15511",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19192,
    "title": "Benign Overfitting and Grokking in ReLU Networks for XOR Cluster Data",
    "authors": [
      "Zhiwei Xu",
      "Yutong Wang",
      "Spencer Frei",
      "Gal Vardi",
      "Wei Hu"
    ],
    "abstract": "Neural networks trained by gradient descent (GD) have exhibited a number of surprising generalization behaviors. First, they can achieve a perfect fit to noisy training data and still generalize near-optimally, showing that overfitting can sometimes be benign. Second, they can undergo a period of classical, harmful overfitting---achieving a perfect fit to training data with near-random performance on test data---before transitioning (''grokking'') to near-optimal generalization later in training. In this work, we show that both of these phenomena provably occur in two-layer ReLU networks trained by GD on XOR cluster data where a constant fraction of the training labels are flipped. In this setting, we show that after the first step of GD, the network achieves 100\\% training accuracy, perfectly fitting the noisy labels in the training data, but achieves near-random test accuracy. At a later training step, the network achieves near-optimal test accuracy while still fitting the random labels in the training data, exhibiting a ''grokking'' phenomenon. This provides the first theoretical result of benign overfitting in neural network classification when the data distribution is not linearly separable. Our proofs rely on analyzing the feature learning process under GD, which reveals that the network implements a non-generalizable linear classifier after one step and gradually learns generalizable features in later steps.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BxHgpC6FNv",
    "arxiv_id": "2310.02541",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19191,
    "title": "PARL: A Unified Framework for Policy Alignment in Reinforcement Learning",
    "authors": [
      "Souradip Chakraborty",
      "Amrit Bedi",
      "Alec Koppel",
      "Huazheng Wang",
      "Dinesh Manocha",
      "Mengdi Wang",
      "Furong Huang"
    ],
    "abstract": "We present a novel unified bilevel optimization-based framework, \\textsf{PARL}, formulated to address the recently highlighted critical issue of policy alignment in reinforcement learning using utility or preference-based feedback. We identify a major gap within current algorithmic designs for solving policy alignment due to a lack of precise characterization of the dependence of the alignment objective on the data generated by policy trajectories. This shortfall contributes to the sub-optimal performance observed in contemporary algorithms.Our framework addressed these concerns by explicitly parameterizing the distribution of the upper alignment objective (reward design)  by the lower optimal variable (optimal policy for the designed reward). Interestingly, from an optimization perspective, our formulation leads to a new class of stochastic bilevel problems where the stochasticity at the upper objective depends upon the lower-level variable. To demonstrate the efficacy of our formulation in resolving alignment issues in RL, we devised an algorithm named \\textsf{A-PARL} to solve PARL problem, establishing sample complexity bounds of order $\\mathcal{O}(1/T)$. Our empirical results substantiate that the proposed \\textsf{PARL} can address the alignment concerns in RL by showing significant improvements (up to 63\\% in terms of required samples) for policy alignment in large-scale environments of the Deepmind control suite and Meta world tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ByR3NdDSZB",
    "arxiv_id": "2308.02585",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19190,
    "title": "Mitigating the Curse of Dimensionality for Certified Robustness via Dual Randomized Smoothing",
    "authors": [
      "Song Xia",
      "Yi Yu",
      "Xudong Jiang",
      "Henghui Ding"
    ],
    "abstract": "Randomized Smoothing (RS) has been proven a promising method for endowing an arbitrary image classifier with certified robustness. However, the substantial uncertainty inherent in the high-dimensional isotropic Gaussian noise imposes the curse of dimensionality on RS. Specifically, the upper bound of ${\\ell_2}$ certified robustness radius provided by RS exhibits a diminishing trend with the expansion of the input dimension $d$, proportionally decreasing at a rate of $1/\\sqrt{d}$. This paper explores the feasibility of providing ${\\ell_2}$ certified robustness for high-dimensional input through the utilization of dual smoothing in the lower-dimensional space. The proposed Dual Randomized Smoothing (DRS) down-samples the input image into two sub-images and smooths the two sub-images in lower dimensions. Theoretically, we prove that DRS guarantees a tight ${\\ell_2}$ certified robustness radius for the original input and reveal that DRS attains a superior upper bound on the ${\\ell_2}$ robustness radius, which decreases proportionally at a rate of $(1/\\sqrt m + 1/\\sqrt n )$ with $m+n=d$. Extensive experiments demonstrate the generalizability and effectiveness of DRS, which exhibits a notable capability to integrate with established methodologies, yielding substantial improvements in both accuracy and ${\\ell_2}$ certified robustness baselines of RS on the CIFAR-10 and ImageNet datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=C1sQBG6Sqp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19189,
    "title": "The Lipschitz-Variance-Margin Tradeoff for Enhanced Randomized Smoothing",
    "authors": [
      "Blaise Delattre",
      "Alexandre Araujo",
      "Quentin Barth\u00e9lemy",
      "Alexandre Allauzen"
    ],
    "abstract": "Real-life applications of deep neural networks are hindered by their unsteady predictions when faced with noisy inputs and adversarial attacks. The certified radius is in this context a crucial indicator of the robustness of models. However how to design an efficient classifier with a sufficient certified radius? Randomized smoothing provides a promising framework by relying on noise injection in inputs to obtain a smoothed and more robust classifier. In this paper, we first show that the variance introduced by randomized smoothing closely interacts with two other important properties of the classifier, i.e. its Lipschitz constant and margin.  More precisely, our work emphasizes the dual impact of the Lipschitz constant of the base classifier, on both the smoothed classifier and the empirical variance. Moreover, to increase the certified robust radius, we introduce a different simplex projection technique for the base classifier to leverage the variance-margin trade-off thanks to Bernstein's concentration inequality, along with an enhanced Lipschitz bound. Experimental results show a significant improvement in certified accuracy compared to current state-of-the-art methods. Our novel certification procedure allows us to use pre-trained models that are used with randomized smoothing, effectively improving the current certification radius in a zero-shot manner.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=C36v8541Ns",
    "arxiv_id": "2309.16883",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19187,
    "title": "Jumanji: a Diverse Suite of Scalable Reinforcement Learning Environments in JAX",
    "authors": [
      "Cl\u00e9ment Bonnet",
      "Daniel Luo",
      "Donal John Byrne",
      "Shikha Surana",
      "Sasha Abramowitz",
      "Paul Duckworth",
      "Vincent Coyette",
      "Laurence Illing Midgley",
      "Elshadai Tegegn",
      "Tristan Kalloniatis",
      "Omayma Mahjoub",
      "Matthew Macfarlane",
      "Andries Petrus Smit",
      "Nathan Grinsztajn",
      "Raphael Boige",
      "Cemlyn Neil Waters",
      "Mohamed Ali Ali Mimouni",
      "Ulrich Armel Mbou Sob",
      "Ruan John de Kock",
      "Siddarth Singh",
      "Daniel Furelos-Blanco",
      "Victor Le",
      "Arnu Pretorius",
      "Alexandre Laterre"
    ],
    "abstract": "Open-source reinforcement learning (RL) environments have played a crucial role in driving progress in the development of AI algorithms.In modern RL research, there is a need for simulated environments that are performant, scalable, and modular to enable their utilization in a wider range of potential real-world applications.Therefore, we present Jumanji, a suite of diverse RL environments specifically designed to be fast, flexible, and scalable.Jumanji provides a suite of environments focusing on combinatorial problems frequently encountered in industry, as well as challenging general decision-making tasks.By leveraging the efficiency of JAX and hardware accelerators like GPUs and TPUs, Jumanji enables rapid iteration of research ideas and large-scale experimentation, ultimately empowering more capable agents.Unlike existing RL environment suites, Jumanji is highly customizable, allowing users to tailor the initial state distribution and problem complexity to their needs.Furthermore, we provide actor-critic baselines for each environment, accompanied by preliminary findings on scaling and generalization scenarios.Jumanji aims to set a new standard for speed, adaptability, and scalability of RL environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=C4CxQmp9wc",
    "arxiv_id": "2306.09884",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19185,
    "title": "Graph-based Virtual Sensing from Sparse and Partial Multivariate Observations",
    "authors": [
      "Giovanni De Felice",
      "Andrea Cini",
      "Daniele Zambon",
      "Vladimir Gusev",
      "Cesare Alippi"
    ],
    "abstract": "Virtual sensing techniques allow for inferring signals at new unmonitored locations by exploiting spatio-temporal measurements coming from physical sensors at different locations. However, as the sensor coverage becomes sparse due to costs or other constraints, physical proximity cannot be used to support interpolation. In this paper, we overcome this challenge by leveraging dependencies between the target variable and a set of correlated variables (covariates) that can frequently be associated with each location of interest. From this viewpoint, covariates provide partial observability, and the problem consists of inferring values for unobserved channels by exploiting observations at other locations to learn how such variables can correlate. We introduce a novel graph-based methodology to exploit such relationships and design a graph deep learning architecture, named GgNet, implementing the framework. The proposed approach relies on propagating information over a nested graph structure that is used to learn dependencies between variables as well as locations. GgNet is extensively evaluated under different virtual sensing scenarios, demonstrating higher reconstruction accuracy compared to the state-of-the-art.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CAqdG2dy5s",
    "arxiv_id": "2402.12598",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19184,
    "title": "Unraveling the Enigma of Double Descent: An In-depth Analysis through the Lens of Learned Feature Space",
    "authors": [
      "Yufei Gu",
      "Xiaoqing Zheng",
      "Tomaso Aste"
    ],
    "abstract": "Double descent presents a counter-intuitive aspect within the machine learning domain, and researchers have observed its manifestation in various models and tasks. While some theoretical explanations have been proposed for this phenomenon in specific contexts, an accepted theory to account for its occurrence in deep learning remains yet to be established. In this study, we revisit the phenomenon of double descent and demonstrate that its occurrence is strongly influenced by the presence of noisy data. Through conducting a comprehensive analysis of the feature space of learned representations, we unveil that double descent arises in imperfect models trained with noisy data. We argue that double descent is a consequence of the model first learning the noisy data until interpolation and then adding implicit regularization via over-parameterization acquiring therefore capability to separate the information from the noise. We postulate that double descent should never occur in well-regularized models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CEkIyshNbC",
    "arxiv_id": "2310.13572",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19774,
    "title": "\"What Data Benefits My Classifier?\" Enhancing Model Performance and Interpretability through Influence-Based Data Selection",
    "authors": [
      "Anshuman Chhabra",
      "Peizhao Li",
      "Prasant Mohapatra",
      "Hongfu Liu"
    ],
    "abstract": "Classification models are ubiquitously deployed in society and necessitate high utility, fairness, and robustness performance. Current research efforts mainly focus on improving model architectures and learning algorithms on fixed datasets to achieve this goal. In contrast, in this paper, we address an orthogonal yet crucial problem: given a fixed convex learning model (or a convex surrogate for a non-convex model) and a function of interest, we assess what data benefits the model by interpreting the feature space, and then aim to improve performance as measured by this function. To this end, we propose the use of influence estimation models for interpreting the classifier's performance from the perspective of the data feature space. Additionally, we propose data selection approaches based on influence that enhance model utility, fairness, and robustness. Through extensive experiments on synthetic and real-world datasets, we validate and demonstrate the effectiveness of our approaches not only for conventional classification scenarios, but also under more challenging scenarios such as distribution shifts, fairness poisoning attacks, utility evasion attacks, online learning, and active learning.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=HE9eUQlAvo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19182,
    "title": "SEAL: A Framework for Systematic Evaluation of Real-World Super-Resolution",
    "authors": [
      "Wenlong Zhang",
      "Xiaohui Li",
      "Xiangyu Chen",
      "Xiaoyun Zhang",
      "Yu Qiao",
      "Xiao-Ming Wu",
      "Chao Dong"
    ],
    "abstract": "Real-world Super-Resolution (Real-SR) methods focus on dealing with diverse real-world images and have attracted increasing attention in recent years. The key idea is to use a complex and high-order degradation model to mimic real-world degradations. Although they have achieved impressive results in various scenarios, they are faced with the obstacle of evaluation. Currently, these methods are only assessed by their average performance on a small set of degradation cases randomly selected from a large space, which fails to provide a comprehensive understanding of their overall performance and often yields biased results.To overcome the limitation in evaluation, we propose SEAL, a framework for systematic evaluation of real-SR. In particular, we cluster the extensive degradation space to create a set of representative degradation cases, which serves as a comprehensive test set. Next, we propose a coarse-to-fine evaluation protocol to measure the distributed and relative performance of real-SR methods on the test set. The protocol incorporates two new metrics: acceptance rate (AR) and relative performance ratio (RPR), derived from acceptance and excellence lines. Under SEAL, we benchmark existing real-SR methods, obtain new observations and insights into their performance, and develop a new strong baseline. We consider SEAL as the first step towards creating an unbiased and comprehensive real-SR evaluation platform, which can promote the development of real-SR.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=CGlczSBBSj",
    "arxiv_id": "2309.03020",
    "GitHub": [
      "https://github.com/XPixelGroup/SEAL"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19180,
    "title": "Online Stabilization of Spiking Neural Networks",
    "authors": [
      "Yaoyu Zhu",
      "Jianhao Ding",
      "Tiejun Huang",
      "Xiaodong Xie",
      "Zhaofei Yu"
    ],
    "abstract": "Spiking neural networks (SNNs), attributed to the binary, event-driven nature of spikes, possess heightened biological plausibility and enhanced energy efficiency on neuromorphic hardware compared to analog neural networks (ANNs). Mainstream SNN training schemes apply backpropagation-through-time (BPTT) with surrogate gradients to replace the non-differentiable spike emitting process during backpropagation. While achieving competitive performance, the requirement for storing intermediate information at all time-steps incurs higher memory consumption and fails to fulfill the online property crucial to biological brains. Our work focuses on online training techniques, aiming for memory efficiency while preserving biological plausibility. The limitation of not having access to future information in early time steps in online training has constrained previous efforts to incorporate advantageous modules such as batch normalization. To address this problem, we propose Online Spiking Renormalization (OSR) to ensure consistent parameters between testing and training, and Online Threshold Stabilizer (OTS) to stabilize neuron firing rates across time steps. Furthermore, we design a novel online approach to compute the variable mean and variance over time for OSR. Experiments conducted on various datasets demonstrate the proposed method's superior performance among SNN online training algorithms.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=CIj1CVbkpr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19179,
    "title": "Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise",
    "authors": [
      "Rui Pan",
      "Yuxing Liu",
      "Xiaoyu Wang",
      "Tong Zhang"
    ],
    "abstract": "Heavy-ball momentum with decaying learning rates is widely used with SGD for optimizing deep learning models. In contrast to its empirical popularity, the understanding of its theoretical property is still quite limited, especially under the standard anisotropic gradient noise condition for quadratic regression problems. Although it is widely conjectured that heavy-ball momentum method can provide accelerated convergence and should work well in large batch settings, there is no rigorous theoretical analysis. In this paper, we fill this theoretical gap by establishing a non-asymptotic convergence bound for stochastic heavy-ball methods with step decay scheduler on quadratic objectives, under the anisotropic gradient noise condition. As a direct implication, we show that heavy-ball momentum can provide $\\tilde{\\mathcal{O}}(\\sqrt{\\kappa})$ accelerated convergence of the bias term of SGD while still achieving near-optimal convergence rate with respect to the stochastic variance term. The combined effect implies an overall convergence rate within log factors from the statistical minimax rate. This means SGD with heavy-ball momentum is useful in the large-batch settings such as distributed machine learning or federated learning, where a smaller number of iterations can significantly reduce the number of communication rounds, leading to acceleration in practice.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CIqjp9yTDq",
    "arxiv_id": "2312.14567",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19178,
    "title": "Channel Vision Transformers: An Image Is Worth 1 x 16 x 16 Words",
    "authors": [
      "Yujia Bao",
      "Srinivasan Sivanandan",
      "Theofanis Karaletsos"
    ],
    "abstract": "Vision Transformer (ViT) has emerged as a powerful architecture in the realm of modern computer vision. However, its application in certain imaging fields, such as microscopy and satellite imaging, presents unique challenges. In these domains, images often contain multiple channels, each carrying semantically distinct and independent information. Furthermore, the model must demonstrate robustness to sparsity in input channels, as they may not be densely available during training or testing. In this paper, we propose a modification to the ViT architecture that enhances reasoning across the input channels and introduce Hierarchical Channel Sampling (HCS) as an additional regularization technique to ensure robustness when only partial channels are presented during test time. Our proposed model, ChannelViT, constructs patch tokens independently from each input channel and utilizes a learnable channel embedding that is added to the patch tokens, similar to positional embeddings. We evaluate the performance of ChannelViT on ImageNet, JUMP-CP (microscopy cell imaging), and So2Sat (satellite imaging). Our results show that ChannelViT outperforms ViT on classification tasks and generalizes well, even when a subset of input channels is used during testing. Across our experiments, HCS proves to be a powerful regularizer, independent of the architecture employed, suggesting itself as a straightforward technique for robust ViT training. Lastly, we find that ChannelViT generalizes effectively even when there is limited access to all channels during training, highlighting its potential for multi-channel imaging under real-world conditions with sparse sensors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CK5Hfb5hBG",
    "arxiv_id": "2309.16108",
    "GitHub": [
      "https://github.com/insitro/ChannelViT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19177,
    "title": "Early Stopping Against Label Noise Without Validation Data",
    "authors": [
      "Suqin Yuan",
      "Lei Feng",
      "Tongliang Liu"
    ],
    "abstract": "Early stopping methods in deep learning face the challenge of balancing the volume of training and validation data, especially in the presence of label noise. Concretely, sparing more data for validation from training data would limit the performance of the learned model, yet insufficient validation data could result in a sub-optimal selection of the desired model. In this paper, we propose a novel early stopping method called Label Wave, which does not require validation data for selecting the desired model in the presence of label noise. It works by tracking the changes in the model's predictions on the training set during the training process, aiming to halt training before the model unduly fits mislabeled data. This method is empirically supported by our observation that minimum fluctuations in predictions typically occur at the training epoch before the model excessively fits mislabeled data. Through extensive experiments, we show both the effectiveness of the Label Wave method across various settings and its capability to enhance the performance of existing methods for learning with noisy labels.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CMzF2aOfqp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19176,
    "title": "Test-Time Training on Nearest Neighbors for Large Language Models",
    "authors": [
      "Moritz Hardt",
      "Yu Sun"
    ],
    "abstract": "Many recent efforts augment language models with retrieval, by adding retrieved data to the input context. For this approach to succeed, the retrieved data must be added at both training and test time. Moreover, as input length grows linearly with the size of retrieved data, cost in computation and memory grows quadratically for modern Transformers. To avoid these complications, we simply fine-tune the model on retrieved data at test time, using its standard training setup. We build a large-scale distributed index based on text embeddings of the Pile dataset. For each test input, our system retrieves its neighbors and fine-tunes the model on their text. Surprisingly, retrieving and training on as few as 20 neighbors, each for only one gradient iteration, drastically improves performance across more than 20 language modeling tasks in the Pile. For example, test-time training with nearest neighbors significantly narrows the performance gap between a small GPT-2 and a GPT-Neo model more than 10 times larger. Sufficient index quality and size, however, are necessary. Our work establishes a first baseline of test-time training for language modeling.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CNL2bku4ra",
    "arxiv_id": "2305.18466",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19175,
    "title": "Synergistic Patch Pruning for Vision Transformer: Unifying Intra- & Inter-Layer Patch Importance",
    "authors": [
      "Yuyao Zhang",
      "Lan Wei",
      "Nikolaos Freris"
    ],
    "abstract": "The Vision Transformer (ViT) has emerged as a powerful architecture for various computer vision tasks. Nonetheless, this comes with substantially heavier computational costs than Convolutional Neural Networks (CNNs). The attention mechanism in ViTs, which integrates information from different image patches to the class token ([CLS]), renders traditional structured pruning methods used in CNNs unsuitable. To overcome this issue, we propose SynergisTic pAtch pRuning (STAR) that unifies intra-layer and inter-layer patch importance scoring. Specifically, our approach combines a) online evaluation of intra-layer importance for the [CLS] and b) offline evaluation of the inter-layer importance of each patch. The two importance scores are fused by minimizing a weighted average of Kullback-Leibler (KL) Divergences and patches are successively pruned at each layer by maintaining only the top-k most important ones. Unlike prior art that relies on manual selection of the pruning rates at each layer, we propose an automated method for selecting them based on offline-derived metrics. We also propose a variant that uses these rates as weighted percentile parameters (for the layer-wise normalized scores), thus leading to an alternate adaptive rate selection technique that is input-based. Extensive experiments demonstrate the significant acceleration of the inference with minimal performance degradation. For instance, on the ImageNet dataset, the pruned DeiT-Small reaches a throughput of 4,256 images/s, which is over 66\\% higher than the much smaller (unpruned) DeiT-Tiny model, while having a substantially higher accuracy (+6.8\\% Top-1 and +3.1\\% Top-5).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=COO51g41Q4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19174,
    "title": "AutoCast++: Enhancing World Event Prediction with Zero-shot Ranking-based Context Retrieval",
    "authors": [
      "Qi Yan",
      "Raihan Seraj",
      "Jiawei He",
      "Lili Meng",
      "Tristan Sylvain"
    ],
    "abstract": "Machine-based prediction of real-world events is garnering attention due to its potential for informed decision-making. Whereas traditional forecasting predominantly hinges on structured data like time-series, recent breakthroughs in language models enable predictions using unstructured text. In particular, (Zou et al., 2022) unveils AutoCast, a new benchmark that employs news articles for answering forecasting queries. Nevertheless, existing methods still trail behind human performance. The cornerstone of accurate forecasting, we argue, lies in identifying a concise, yet rich subset of news snippets from a vast corpus. With this motivation, we introduce AutoCast++, a zero-shot ranking-based context retrieval system, tailored to sift through expansive news document collections for event forecasting. Our approach first re-ranks articles based on zero-shot question-passage relevance, honing in on semantically pertinent news. Following this, the chosen articles are subjected to zero-shot summarization to attain succinct context. Leveraging a pre-trained language model, we conduct both the relevance evaluation and article summarization without needing domain-specific training. Notably, recent articles can sometimes be at odds with preceding ones due to new facts or unanticipated incidents, leading to fluctuating temporal dynamics. To tackle this, our re-ranking mechanism gives preference to more recent articles, and we further regularize the multi-passage representation learning to align with human forecaster responses made on different dates. Empirical results underscore marked improvements across multiple metrics, improving the performance for multiple-choice questions (MCQ) by 48% and true/false (TF) questions by up to 8%.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=COYDmKkQH4",
    "arxiv_id": "2310.01880",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19173,
    "title": "What Matters to You? Towards Visual Representation Alignment for Robot Learning",
    "authors": [
      "Thomas Tian",
      "Chenfeng Xu",
      "Masayoshi Tomizuka",
      "Jitendra Malik",
      "Andrea Bajcsy"
    ],
    "abstract": "When operating in service of people, robots need to optimize rewards aligned with end-user preferences. Since robots will rely on raw perceptual inputs like RGB images, their rewards will inevitably use visual representations. Recently there has been excitement in using representations from pre-trained visual models, but key to making these work in robotics is fine-tuning, which is typically done via proxytasks like dynamics prediction or enforcing temporal cycle-consistency. However, all these proxy tasks bypass the human\u2019s input on what matters to them, exacerbating spurious correlations and ultimately leading to robot behaviors that are misaligned with user preferences. In this work, we propose that robots should leverage human feedback to align their visual representations with the end user and disentangle what matters for the task. We propose Representation-Aligned Preference-based Learning (RAPL), a method for solving the visual representation alignment problem and visual reward learning problem through the lens of preference-based learning and optimal transport. Across experiments in X-MAGICAL and in robotic manipulation, we find that RAPL\u2019s reward consistently generates preferred robot behaviors with high sample efficiency, and shows strong zero-shot generalization when the visual representation is learned from a different embodiment than the robot\u2019s.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CTlUHIKF71",
    "arxiv_id": "2310.07932",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19172,
    "title": "Neural Atoms: Propagating Long-range Interaction in Molecular Graphs through Efficient Communication Channel",
    "authors": [
      "Xuan Li",
      "Zhanke Zhou",
      "Jiangchao Yao",
      "Yu Rong",
      "Lu Zhang",
      "Bo Han"
    ],
    "abstract": "Graph Neural Networks (GNNs) have been widely adopted for drug discovery with molecular graphs. Nevertheless, current GNNs are mainly good at leveraging short-range interactions (SRI) but struggle to capture long-range interactions (LRI), both of which are crucial for determining molecular properties. To tackle this issue, we propose a method that implicitly projects all original atoms into a few \\textit{Neural Atoms}, which abstracts the collective information of atomic groups within a molecule. Specifically, we explicitly exchange the information among neural atoms and project them back to the atoms\u2019 representations as an enhancement. With this mechanism, neural atoms establish the communication channels among distant nodes, effectively reducing the interaction scope of arbitrary node pairs into a single hop. To provide an inspection of our method from a physical perspective, we reveal its connection with the traditional LRI calculation method, Ewald Summation. We conduct extensive experiments on three long-range graph benchmarks, covering both graph-level and link-level tasks on molecular graphs. We empirically justify that our method can be equipped with an arbitrary GNN and help to capture LRI.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CUfSCwcgqm",
    "arxiv_id": "2311.01276",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19489,
    "title": "Sharpness-Aware Minimization Enhances Feature Quality via Balanced Learning",
    "authors": [
      "Jacob Mitchell Springer",
      "Vaishnavh Nagarajan",
      "Aditi Raghunathan"
    ],
    "abstract": "Sharpness-Aware Minimization (SAM) has emerged as a promising alternative to stochastic gradient descent (SGD) for minimizing the loss objective in neural network training. While the motivation behind SAM is to bias models towards flatter minima that are believed to generalize better, recent studies have shown conflicting evidence on the relationship between flatness and (in-distribution) generalization, leaving the mechanism behind SAM's performance improvement unclear. In this work, we present a complementary effect that cannot be explained by in-distribution improvements alone: we argue that SAM can enhance the quality of features in datasets containing redundant or spurious features. We explain how SAM can induce feature diversity by investigating a controlled setting. Our results imply that one mechanism by which SAM improves the quality of features is by adaptively suppressing well-learned features which gives remaining features opportunity to be learned.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3xDaj4pRna",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19169,
    "title": "MG-TSD: Multi-Granularity Time Series Diffusion Models with Guided Learning Process",
    "authors": [
      "Xinyao Fan",
      "Yueying Wu",
      "Chang Xu",
      "Yuhao Huang",
      "Weiqing Liu",
      "Jiang Bian"
    ],
    "abstract": "Recently, diffusion probabilistic models have attracted attention in generative time series forecasting due to their remarkable capacity to generate high-fidelity samples. However, the effective utilization of their strong modeling ability in the probabilistic time series forecasting task remains an open question, partially due to the challenge of instability arising from their stochastic nature. To address this challenge, we introduce a novel Multi-Granularity Time Series Diffusion (MG-TSD) model, which achieves state-of-the-art predictive performance by leveraging the inherent granularity levels within the data as given targets at intermediate diffusion steps to guide the learning process of diffusion models. The way to construct the targets is motivated by the observation that forward process of the diffusion model, which sequentially corrupts the data distribution to a standard normal distribution, intuitively aligns with the process of smoothing fine-grained data into a coarse-grained representation, both of which result in a gradual loss of fine distribution features. In the study, we derive a novel multi-granularity guidance diffusion loss function and propose a concise implementation method to effectively utilize coarse-grained data across various granularity levels.More importantly, our approach does not rely on additional external data, making it versatile and applicable across various domains. Extensive experiments conducted on real-world datasets demonstrate that our MG-TSD model outperforms existing time series prediction methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CZiY6OLktd",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19168,
    "title": "Boosting Graph Anomaly Detection with Adaptive Message Passing",
    "authors": [
      "Jingyan Chen",
      "Guanghui Zhu",
      "Chunfeng Yuan",
      "Yihua Huang"
    ],
    "abstract": "Unsupervised graph anomaly detection has been widely used in real-world applications. Existing methods primarily focus on local inconsistency mining (LIM), based on the intuition that establishing high similarities between abnormal nodes and their neighbors is difficult. However, the message passing employed by graph neural networks (GNNs) results in local anomaly signal loss, as GNNs tend to make connected nodes similar, which conflicts with the LIM intuition. In this paper, we propose GADAM, a novel framework that not only resolves the conflict between LIM and message passing but also leverages message passing to augment anomaly detection through a transformative approach to anomaly mining beyond LIM. Specifically, we first propose an efficient MLP-based LIM approach to obtain local anomaly scores in a conflict-free way. Next, we introduce a novel approach to capture anomaly signals from a global perspective. This involves a hybrid attention based adaptive message passing, enabling nodes to selectively absorb abnormal or normal signals from their surroundings. Extensive experiments conducted on nine benchmark datasets, including two large-scale OGB datasets, demonstrate that GADAM surpassinges existing state-of-the-art methods in terms of both effectiveness and efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CanomFZssu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17926,
    "title": "The Cost of Scaling Down Large Language Models: Reducing Model Size Affects Memory before In-context Learning",
    "authors": [
      "Tian Jin",
      "Nolan Clement",
      "Xin Dong",
      "Vaishnavh Nagarajan",
      "Michael Carbin",
      "Jonathan Ragan-Kelley",
      "Gintare Karolina Dziugaite"
    ],
    "abstract": "We study how down-scaling large language model (LLM) size impacts LLM capabilities. We begin by measuring the effects of weight pruning \u2013 a popular technique for reducing model size \u2013 on the two abilities of LLMs: (a) recalling facts presented during pre-training and (b) processing information presented in context. Surprisingly, we find that existing pruning techniques affect these two abilities of LLMs differently. For example, pruning more than 30% of weights significantly decreases an LLM\u2019s ability to recall facts presented during pre-training. Yet pruning 60-70% of weights largely preserves an LLM\u2019s ability to process information in-context, ranging from retrieving answers based on information presented in context to learning parameterized functions such as a linear classifier based on a few examples. Moderate pruning impairs LLM\u2019s ability to recall facts learnt from pre-training. However, its effect on model\u2019s ability to process information presented in context is much less pronounced. The said disparate effects similarly arise when replacing the original model with a smaller dense one with reduced width and depth. This similarity suggests that model size reduction in general underpins the said disparity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ldJXXxPE0L",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19167,
    "title": "Internal Cross-layer Gradients for Extending Homogeneity to Heterogeneity in Federated Learning",
    "authors": [
      "Yun-Hin Chan",
      "Rui Zhou",
      "Running Zhao",
      "Zhihan JIANG",
      "Edith C. H. Ngai"
    ],
    "abstract": "Federated learning (FL) inevitably confronts the challenge of system heterogeneity in practical scenarios. To enhance the capabilities of most model-homogeneous FL methods in handling system heterogeneity, we propose a training scheme that can extend their capabilities to cope with this challenge. In this paper, we commence our study with a detailed exploration of homogeneous and heterogeneous FL settings and discover three key observations: (1) a positive correlation between client performance and layer similarities, (2) higher similarities in the shallow layers in contrast to the deep layers, and (3) the smoother gradients distributions indicate the higher layer similarities. Building upon these observations, we propose InCo Aggregation that leverages internal cross-layer gradients, a mixture of gradients from shallow and deep layers within a server model, to augment the similarity in the deep layers without requiring additional communication between clients. Furthermore, our methods can be tailored to accommodate model-homogeneous FL methods such as FedAvg, FedProx, FedNova, Scaffold, and MOON, to expand their capabilities to handle the system heterogeneity. Copious experimental results validate the effectiveness of InCo Aggregation, spotlighting internal cross-layer gradients as a promising avenue to enhance the performance in heterogeneous FL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Cc0qk6r4Nd",
    "arxiv_id": "2308.11464",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17771,
    "title": "Think before you speak: Training Language Models With Pause Tokens",
    "authors": [
      "Sachin Goyal",
      "Ziwei Ji",
      "Ankit Singh Rawat",
      "Aditya Krishna Menon",
      "Sanjiv Kumar",
      "Vaishnavh Nagarajan"
    ],
    "abstract": "Language models generate responses by producing a series of tokens in immediate succession: the $(K+1)^{\\rm th}$ token is an outcome of manipulating $K$ hidden vectors per layer, one vector per preceding token. What if instead we were to let the model manipulate say, $K+10$ hidden vectors, before it outputs the $(K+1)^{\\rm th}$ token? We operationalize this idea by performing training and inference on language models with a (learnable) $\\textit{pause}$ token, a sequence of which is appended to the input prefix. We then delay extracting the model's outputs until the last pause token is seen, thereby allowing the model to process extra computation before committing to an answer. We empirically evaluate $\\textit{pause-training}$ on decoder-only models of 1B and 130M parameters with causal pretraining on C4, and on downstream tasks covering reasoning, question-answering, general understanding and fact recall. Our main finding is that inference-time delays show gains when the model is both pre-trained and finetuned with delays. For the 1B model, we witness gains on 8 of 9 tasks, most prominently, a gain of $18\\\\%$ EM score on the QA task of SQuAD, $8\\\\%$ on CommonSenseQA and $1\\\\%$ accuracy on the reasoning task of GSM8k. Our work raises a range of conceptual and practical future research questions on making delayed next-token prediction a widely applicable new paradigm.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ph04CRkPdC",
    "arxiv_id": "2310.02226",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19166,
    "title": "Generative Learning for Financial Time Series with Irregular and Scale-Invariant Patterns",
    "authors": [
      "Hongbin Huang",
      "Minghua Chen",
      "Xiao Qiao"
    ],
    "abstract": "Limited data availability poses a major obstacle in training deep learning models for financial applications. Synthesizing financial time series to augment real-world data is challenging due to the irregular and scale-invariant patterns uniquely associated with financial time series - temporal dynamics that repeat with varying duration and magnitude. Such dynamics cannot be captured by existing approaches, which often assume regularity and uniformity in the underlying data. We develop a novel generative framework called FTS-Diffusion to model irregular and scale-invariant patterns that consists of three modules. First, we develop a scale-invariant pattern recognition algorithm to extract recurring patterns that vary in duration and magnitude. Second, we construct a diffusion-based generative network to synthesize segments of patterns. Third, we model the temporal transition of patterns in order to aggregate the generated segments. Extensive experiments show that FTS-Diffusion generates synthetic financial time series highly resembling observed data, outperforming state-of-the-art alternatives. Two downstream experiments demonstrate that augmenting real-world data with synthetic data generated by FTS-Diffusion reduces the error of stock market prediction by up to 17.9%. To the best of our knowledge, this is the first work on generating intricate time series with irregular and scale-invariant patterns, addressing data limitation issues in finance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=CdjnzWsQax",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19165,
    "title": "PAC-FNO: Parallel-Structured All-Component Fourier Neural Operators for Recognizing Low-Quality Images",
    "authors": [
      "Jinsung Jeon",
      "Hyundong Jin",
      "Jonghyun Choi",
      "Sanghyun Hong",
      "Dongeun Lee",
      "Kookjin Lee",
      "Noseong Park"
    ],
    "abstract": "A standard practice in developing image recognition models is to train a model on a specific image resolution and then deploy it. However, in real-world inference, models often encounter images different from the training sets in resolution and/or subject to natural variations such as weather changes, noise types and compression artifacts. While traditional solutions involve training multiple models for different resolutions or input variations, these methods are computationally expensive and thus do not scale in practice. To this end, we propose a novel neural network model, parallel-structured and all-component Fourier neural operator (PAC-FNO), that addresses the problem. Unlike conventional feed-forward neural networks, PAC-FNO operates in the frequency domain, allowing it to handle images of varying resolutions within a single model. We also propose a two-stage algorithm for training PAC-FNO with a minimal modification to the original, downstream model. Moreover, the proposed PAC-FNO is ready to work with existing image recognition models. Extensively evaluating methods with seven image recognition benchmarks, we show that the proposed PAC-FNO improves the performance of existing baseline models on images with various resolutions by up to 77.1% and various types of natural variations in the images at inference.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Cf4FJGmHRQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19742,
    "title": "Topological data analysis on noisy quantum computers",
    "authors": [
      "Ismail Yunus Akhalwaya",
      "Shashanka Ubaru",
      "Kenneth L. Clarkson",
      "Mark S. Squillante",
      "Vishnu Jejjala",
      "Yang-Hui He",
      "Kugendran Naidoo",
      "Vasileios Kalantzis",
      "Lior Horesh"
    ],
    "abstract": "Topological data analysis (TDA) is a powerful technique for extracting complex and valuable shape-related summaries of high-dimensional data. However, the computational demands of classical algorithms for computing TDA are exorbitant, and quickly become impractical for high-order characteristics. Quantum computers offer the potential of achieving significant speedup for certain computational problems. Indeed, TDA has been purported to be one such problem, yet, quantum computing algorithms proposed for the problem, such as the original Quantum TDA (QTDA) formulation by Lloyd, Garnerone and Zanardi, require fault-tolerance qualifications that are currently unavailable. In this study, we present NISQ-TDA, a fully implemented end-to-end quantum machine learning algorithm needing only a short circuit-depth, that is applicable to high-dimensional classical data, and with provable asymptotic speedup for certain classes of problems. The algorithm neither suffers from the data-loading problem nor does it need to store the input data on the quantum computer explicitly. The algorithm was successfully executed on quantum computing devices, as well as on noisy quantum simulators, applied to small datasets. Preliminary empirical results suggest that the algorithm is robust to noise.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=dLrhRIMVmB",
    "arxiv_id": "2209.09371",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19220,
    "title": "LogicMP: A Neuro-symbolic Approach for Encoding First-order Logic Constraints",
    "authors": [
      "Weidi Xu",
      "Jingwei Wang",
      "Lele Xie",
      "Jianshan He",
      "Hongting Zhou",
      "Taifeng Wang",
      "Xiaopei Wan",
      "Jingdong Chen",
      "Chao Qu",
      "Wei Chu"
    ],
    "abstract": "Integrating first-order logic constraints (FOLCs) with neural networks is a crucial but challenging problem since it involves modeling intricate correlations to satisfy the constraints. This paper proposes a novel neural layer, LogicMP, which performs mean-field variational inference over a Markov Logic Network (MLN). It can be plugged into any off-the-shelf neural network to encode FOLCs while retaining modularity and efficiency. By exploiting the structure and symmetries in MLNs, we theoretically demonstrate that our well-designed, efficient mean-field iterations greatly mitigate the difficulty of MLN inference, reducing the inference from sequential calculation to a series of parallel tensor operations. Empirical results in three kinds of tasks over images, graphs, and text show that LogicMP outperforms advanced competitors in both performance and efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BLGQ3oqldb",
    "arxiv_id": "2309.15458",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19163,
    "title": "Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression",
    "authors": [
      "Adam Block",
      "Dylan J Foster",
      "Akshay Krishnamurthy",
      "Max Simchowitz",
      "Cyril Zhang"
    ],
    "abstract": "This work studies training instabilities of behavior cloning with deep neural networks. We observe that minibatch SGD updates to the policy network during training result in sharp oscillations in long-horizon rewards, despite negligibly affecting the behavior cloning loss. We empirically disentangle the statistical and computational causes of these oscillations, and find them to stem from the chaotic propagation of minibatch SGD noise through unstable closed-loop dynamics.  While SGD noise is benign in the single-step action prediction objective, it results in catastrophic error accumulation over long horizons, an effect we term *gradient variance amplification* (GVA).  We demonstrate that many standard mitigation techniques do not alleviate GVA, but that taking an exponential moving average (EMA) of iterates is surprisingly effective at doing so.  Furthermore, we illustrate the generality of the phenomenon by showing both the existence of GVA and its amelioration by EMA in autoregressive language generation.  Finally, we provide theoretical vignettes both exhibiting the benefits of EMA in alleviating GVA and illustrating the extent to which classical convex models help in understanding the benefits of iterate averaging in deep learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CgPs04l9TO",
    "arxiv_id": "2310.11428",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19162,
    "title": "Error Feedback Reloaded: From Quadratic to Arithmetic Mean of Smoothness Constants",
    "authors": [
      "Peter Richt\u00e1rik",
      "Elnur Gasanov",
      "Konstantin Pavlovich Burlachenko"
    ],
    "abstract": "Error feedback (EF) is a highly popular and immensely effective mechanism for fixing convergence issues which arise in distributed training methods (such as distributed GD or SGD) when these are enhanced with greedy communication compression techniques such as Top-k. While EF was proposed almost a decade ago (Seide et al, 2014), and despite concentrated effort by the community to advance the theoretical understanding of this mechanism, there is still a lot to explore. In this work we study a modern form of error feedback called EF21 (Richt\u00e1rik et al, 2021) which offers the currently best-known theoretical guarantees, under the weakest assumptions, and also works well in practice. In particular, while the theoretical communication complexity of EF21 depends on the {\\em quadratic mean} of certain smoothness parameters, we improve this dependence to their {\\em arithmetic mean}, which is always smaller, and can be substantially smaller, especially in heterogeneous data regimes. We take the reader on a journey of our discovery process. Starting with the idea of applying EF21 to an equivalent reformulation of the underlying problem which (unfortunately) requires (often impractical) machine cloning, we continue to the discovery of a new {\\em weighted} version of EF21 which can (fortunately) be executed without any cloning, and finally circle back to an improved analysis of the original EF21 method. While this development applies to the simplest form of EF21, our approach naturally extends to more elaborate variants involving stochastic gradients and partial participation. Further, our technique improves the best-known theory of EF21 in the ``rare features'' regime (Richt\u00e1rik et al, 2023). Finally, we validate our theoretical findings with suitable experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ch7WqGcGmb",
    "arxiv_id": "2402.10774",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19535,
    "title": "SparseFormer: Sparse Visual Recognition via Limited Latent Tokens",
    "authors": [
      "Ziteng Gao",
      "Zhan Tong",
      "Limin Wang",
      "Mike Zheng Shou"
    ],
    "abstract": "Human visual recognition is a sparse process, where only a few salient visual cues are attended to rather than every detail being traversed uniformly. However, most current vision networks follow a dense paradigm, processing every single visual unit (such as pixels or patches) in a uniform manner. In this paper, we challenge this dense paradigm and present a new method, coined SparseFormer, to imitate human\u2019s sparse visual recognition in an end-to-end manner. SparseFormer learns to represent images using a highly limited number of tokens (as low as 49) in the latent space with sparse feature sampling procedure instead of processing dense units in the original image space. Therefore, SparseFormer circumvents most of dense operations on the image space and has much lower computational costs. Experiments on the ImageNet-1K classification show that SparseFormer achieves performance on par with canonical or well-established models while offering more favorable accuracy-throughput tradeoff. Moreover, the design of our network can be easily extended to the video classification with promising performance at lower computational costs. We hope that our work can provide an alternative way for visual modeling and inspire further research on sparse vision architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2pvECsmld3",
    "arxiv_id": "2304.03768",
    "GitHub": [
      "https://github.com/showlab/sparseformer"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19161,
    "title": "Transferring Labels to Solve Annotation Mismatches Across Object Detection Datasets",
    "authors": [
      "Yuan-Hong Liao",
      "David Acuna",
      "Rafid Mahmood",
      "James Lucas",
      "Viraj Uday Prabhu",
      "Sanja Fidler"
    ],
    "abstract": "In object detection, varying annotation protocols across datasets can result in annotation mismatches, leading to inconsistent class labels and bounding regions. Addressing these mismatches typically involves manually identifying common trends and fixing the corresponding bounding boxes and class labels. To alleviate this laborious process, we introduce the label translation problem in object detection. Here, the goal is to translate bounding boxes from one or more source datasets to match the annotation style of a target dataset. We propose a data-centric approach, Label-Guided Pseudo-Labeling (LGPL), that improves downstream detectors in a manner agnostic to the detector learning algorithms and model architectures. Validating across four object detection scenarios, defined over seven different datasets and three different architectures, we show that translating labels for a target task via LGPL consistently improves the downstream detection in every setting, on average by $1.88$ mAP and $2.65$ AP$^{75}$. Most importantly, we find that when training with multiple labeled datasets, carefully addressing annotation mismatches with LGPL alone can improve downstream object detection better than off-the-shelf domain adaptation techniques that align only image features.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ChHx5ORqF0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19159,
    "title": "Effective pruning of web-scale datasets based on complexity of concept clusters",
    "authors": [
      "Amro Kamal Mohamed Abbas",
      "Evgenia Rusak",
      "Kushal Tirumala",
      "Wieland Brendel",
      "Kamalika Chaudhuri",
      "Ari S. Morcos"
    ],
    "abstract": "Utilizing massive web-scale datasets has led to unprecedented performance gains in machine learning models, but also imposes outlandish compute requirements for their training. In order to improve training and data efficiency, we here push the limits of pruning large-scale multimodal datasets for training CLIP-style models. Today\u2019s most effective pruning method on ImageNet clusters data samples into separate concepts according to their embedding and prunes away the most proto- typical samples. We scale this approach to LAION and improve it by noting that the pruning rate should be concept-specific and adapted to the complexity of the concept. Using a simple and intuitive complexity measure, we are able to reduce the training cost to a quarter of regular training. More specifically, we are able to outperform the LAION-trained OpenCLIP-ViT-B/32 model on ImageNet zero-shot accuracy by 1.1p.p. while only using 27.7% of the data and training compute. On the DataComp Medium benchmark, we achieve a new state-of-the-art ImageNet zero-shot accuracy and a competitive average zero-shot accuracy on 38 evaluation tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CtOA9aN8fr",
    "arxiv_id": "2401.04578",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19158,
    "title": "LLCP: Learning Latent Causal Processes for Reasoning-based Video Question Answer",
    "authors": [
      "Guangyi Chen",
      "Yuke Li",
      "Xiao Liu",
      "Zijian Li",
      "Eman Al Suradi",
      "Donglai Wei",
      "Kun Zhang"
    ],
    "abstract": "Current approaches to Video Question Answering (VideoQA) primarily focus on cross-modality matching, which is limited by the requirement for extensive data annotations and the insufficient capacity for causal reasoning (e.g. attributing accidents). To address these challenges, we introduce a causal framework for video reasoning, termed Learning Latent Causal Processes (LLCP). At the heart of LLCP lies a multivariate generative model designed to analyze the spatial-temporal dynamics of objects within events. Leveraging the inherent modularity of causal mechanisms, we train the model through self-supervised local auto-regression eliminating the need for annotated question-answer pairs. During inference, the model is applied to answer two types of reasoning questions: accident attribution, which infers the cause from observed effects, and counterfactual prediction, which predicts the effects of counterfactual conditions given the factual evidence. In the first scenario, we identify variables that deviate from the established distribution by the learned model, signifying the root cause of accidents. In the second scenario, we replace embeddings of previous variables with counterfactual ones, enabling us to forecast potential developments. Once we have identified these cause/effect variables, natural language answers are derived through a combination of grammatical parsing and a pre-trained vision-language model. We assess the efficacy of LLCP on both synthetic and real-world data, demonstrating comparable performance to supervised methods despite our framework using no paired textual annotations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Cu5wJa5LGO",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19157,
    "title": "On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation",
    "authors": [
      "Jeongyeol Kwon",
      "Dohyun Kwon",
      "Stephen Wright",
      "Robert D Nowak"
    ],
    "abstract": "In this work, we study first-order algorithms for solving Bilevel Optimization (BO) where the objective functions are smooth but possibly nonconvex in both levels and the variables are restricted to closed convex sets. As a first step, we study the landscape of BO through the lens of penalty methods, in which the upper- and lower-level objectives are combined in a weighted sum with penalty parameter $\\sigma > 0$. In particular, we establish a strong connection between the penalty function and the hyper-objective by explicitly characterizing the conditions under which the values and derivatives of the two must be $O(\\sigma)$-close. A by-product of our analysis is the explicit formula for the gradient of hyper-objective when the lower-level problem has multiple solutions under minimal conditions, which could be of independent interest. Next, viewing the penalty formulation as $O(\\sigma)$-approximation of the original BO, we propose first-order algorithms that find an $\\epsilon$-stationary solution by optimizing the penalty formulation with $\\sigma = O(\\epsilon)$. When the perturbed lower-level problem uniformly satisfies the {\\it small-error} proximal error-bound (EB) condition,  we propose a first-order algorithm that converges to an $\\epsilon$-stationary point of the penalty function using in total $O(\\epsilon^{-7})$ accesses to first-order stochastic gradient oracles. Under an additional assumption on stochastic oracles, we show that the algorithm can be implemented in a fully {\\it single-loop} manner, {\\it i.e.,} with $O(1)$ samples per iteration, and achieves the improved oracle-complexity of $O(\\epsilon^{-5})$.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=CvYBvgEUK9",
    "arxiv_id": "2309.01753",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19155,
    "title": "Finite-Time Analysis of On-Policy Heterogeneous Federated Reinforcement Learning",
    "authors": [
      "Chenyu Zhang",
      "Han Wang",
      "Aritra Mitra",
      "James Anderson"
    ],
    "abstract": "Federated reinforcement learning (FRL) has emerged as a promising paradigm for reducing the sample complexity of reinforcement learning tasks by exploiting information from different agents. However, when each agent interacts with a potentially different environment, little to nothing is known theoretically about the non-asymptotic performance of FRL algorithms. The lack of such results can be attributed to various technical challenges and their intricate interplay: Markovian sampling, linear function approximation, multiple local updates to save communication, heterogeneity in the reward functions and transition kernels of the agents' MDPs, and continuous state-action spaces.  Moreover, in the on-policy setting, the behavior policies vary with time, further complicating the analysis. In response, we introduce FedSARSA, a novel federated on-policy reinforcement learning scheme, equipped with linear function approximation, to address these challenges and provide a comprehensive finite-time error analysis. Notably, we establish that FedSARSA converges to a policy that is near-optimal for all agents, with the extent of near-optimality proportional to the level of heterogeneity. Furthermore, we prove that FedSARSA leverages agent collaboration to enable linear speedups as the number of agents increases, which holds for both fixed and adaptive step-size configurations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=D2eOVqPX9g",
    "arxiv_id": "2401.15273",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19153,
    "title": "Finite-State Autoregressive Entropy Coding for Efficient Learned Lossless Compression",
    "authors": [
      "Yufeng Zhang",
      "Hang Yu",
      "Jianguo Li",
      "Weiyao Lin"
    ],
    "abstract": "Learned lossless data compression has garnered significant attention recently due to its superior compression ratios compared to traditional compressors. However, the computational efficiency of these models jeopardizes their practicality. This paper proposes a novel system for improving the compression ratio while maintaining computational efficiency for learned lossless data compression. Our approach incorporates two essential innovations. First, we propose the Finite-State AutoRegressive (FSAR) entropy coder, an efficient autoregressive Markov model based entropy coder that utilizes a lookup table to expedite autoregressive entropy coding. Next, we present a Straight-Through Hardmax Quantization (STHQ) scheme to enhance the optimization of discrete latent space. Our experiments show that the proposed lossless compression method could improve the compression ratio by up to 6\\% compared to the baseline, with negligible extra computational time. Our work provides valuable insights into enhancing the computational efficiency of learned lossless data compression, which can have practical applications in various fields. Code will be available publicly after the paper is accepted.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=D5mJSNtUtv",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19152,
    "title": "Model Merging by Uncertainty-Based Gradient Matching",
    "authors": [
      "Nico Daheim",
      "Thomas M\u00f6llenhoff",
      "Edoardo Ponti",
      "Iryna Gurevych",
      "Mohammad Emtiyaz Khan"
    ],
    "abstract": "Models trained on different datasets can be merged by a weighted-averaging of their parameters, but why does it work and when can it fail? Here, we connect the inaccuracy of weighted-averaging to mismatches in the gradients and propose a new uncertainty-based scheme to improve the performance by reducing the mismatch. The connection also reveals implicit assumptions in other schemes such as averaging, task arithmetic, and Fisher-weighted averaging. Our new method gives consistent improvements for large language models and vision transformers, both in terms of performance and robustness to hyperparameters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=D7KJmfEDQP",
    "arxiv_id": "2310.12808",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19151,
    "title": "SpaCE: The Spatial Confounding Environment",
    "authors": [
      "Mauricio Tec",
      "Ana Trisovic",
      "Michelle Audirac",
      "Sophie Mirabai Woodward",
      "Jie Kate Hu",
      "Naeem Khoshnevis",
      "Francesca Dominici"
    ],
    "abstract": "Spatial confounding poses a significant challenge in scientific studies involving spatial data, where unobserved spatial variables can influence both treatment and outcome, possibly leading to spurious associations. To address this problem, we introduce SpaCE: The Spatial Confounding Environment, the first toolkit to provide realistic benchmark datasets and tools for systematically evaluating causal inference methods designed to alleviate spatial confounding. Each dataset includes training data, true counterfactuals, a spatial graph with coordinates, and smoothness and confounding scores characterizing the effect of a missing spatial confounder. It also includes realistic semi-synthetic outcomes and counterfactuals, generated using state-of-the-art machine learning ensembles, following best practices for causal inference benchmarks. The datasets cover real treatment and covariates from diverse domains, including climate, health and social sciences. SpaCE facilitates an automated end-to-end pipeline, simplifying data loading, experimental setup, and evaluating machine learning and causal inference models. The SpaCE project provides several dozens of datasets of diverse sizes and spatial complexity. It is publicly available as a Python package, encouraging community feedback and contributions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=D9rJdtmIG6",
    "arxiv_id": "2312.00710",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19150,
    "title": "Plugin estimators for selective classification with out-of-distribution detection",
    "authors": [
      "Harikrishna Narasimhan",
      "Aditya Krishna Menon",
      "Wittawat Jitkrittum",
      "Sanjiv Kumar"
    ],
    "abstract": "Real-world classifiers can benefit from the option of abstaining from predicting on samples where they have low confidence. Such abstention is particularly useful on samples which are close to the learned decision boundary, or which are outliers with respect to the training sample. These settings have been the subject of extensive but disjoint study in the selective classification (SC) and out-of-distribution (OOD) detection literature. Recent work on selective classification with OOD detection (SCOD) has argued for the unified study of these problems; however, the formal underpinnings of this problem are still nascent, and existing techniques are heuristic in nature. In this paper, we propose new plugin estimators for SCOD that are theoretically grounded, effective, and generalise existing approaches from the SC and OOD detection literature. In the course of our analysis, we formally explicate how na\u00efve use of existing SC and OOD detection baselines may be inadequate for SCOD. We empirically demonstrate that our approaches yields competitive SC and OOD detection trade-offs compared to common baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DASh78rJ7g",
    "arxiv_id": "2301.12386",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19149,
    "title": "Boosting the Adversarial Robustness of Graph Neural Networks: An OOD Perspective",
    "authors": [
      "Kuan Li",
      "YiWen Chen",
      "Yang Liu",
      "Jin Wang",
      "Qing He",
      "Minhao Cheng",
      "Xiang Ao"
    ],
    "abstract": "Current defenses against graph attacks often rely on certain properties to eliminate structural perturbations by identifying adversarial edges from normal edges. However, this dependence makes defenses vulnerable to adaptive (white-box) attacks from adversaries with the same knowledge. Adversarial training seems to be a feasible way to enhance robustness without reliance on artificially designed properties. However, in this paper, we show theoretically that it can lead to models learning incorrect information. To solve this issue, we re-examine graph attacks from the out-of-distribution (OOD) perspective for both poisoning and evasion attacks and introduce a novel adversarial training paradigm incorporating OOD detection. This approach strengthens the robustness of Graph Neural Networks (GNNs) without reliance on prior knowledge. To further evaluate adaptive robustness, we develop new adaptive attacks against our methods, revealing a trade-off between graph attack efficacy and defensibility. Through extensive experiments over 25,000 perturbed graphs, our method could still maintain good robustness against both the adaptive and non-adaptive attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DCDT918ZkI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19148,
    "title": "DreamCraft3D: Hierarchical 3D Generation with Bootstrapped Diffusion Prior",
    "authors": [
      "Jingxiang Sun",
      "Bo Zhang",
      "Ruizhi Shao",
      "Lizhen Wang",
      "Wen Liu",
      "Zhenda Xie",
      "Yebin Liu"
    ],
    "abstract": "We present DreamCraft3D, a hierarchical 3D content generation method that produces high-fidelity and coherent 3D objects. We tackle the problem by leveraging a 2D reference image to guide the stages of geometry sculpting and texture boosting. A central focus of this work is to address the consistency issue that existing works encounter. To sculpt geometries that render coherently, we perform score distillation sampling via a view-dependent diffusion model. This 3D prior, alongside several training strategies, prioritizes the geometry consistency but compromises the texture fidelity. We further propose bootstrapped score distillation to specifically boost the texture. We train a personalized diffusion model, Dreambooth, on the augmented renderings of the scene, imbuing it with 3D knowledge of the scene being optimized. The score distillation from this 3D-aware diffusion prior provides view-consistent guidance for the scene. Notably, through an alternating optimization of the diffusion prior and 3D scene representation, we achieve mutually reinforcing improvements: the optimized 3D scene aids in training the scene-specific diffusion model, which offers increasingly view-consistent guidance for 3D optimization. The optimization is thus bootstrapped and leads to substantial texture boosting. With tailored 3D priors throughout the hierarchical generation, DreamCraft3D generates coherent 3D objects with photorealistic renderings, advancing the state-of-the-art in 3D content generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DDX1u29Gqr",
    "arxiv_id": "2310.16818",
    "GitHub": [
      "https://github.com/deepseek-ai/DreamCraft3D"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19017,
    "title": "Tree-Planner: Efficient Close-loop Task Planning with Large Language Models",
    "authors": [
      "Mengkang Hu",
      "Yao Mu",
      "Xinmiao Chelsey Yu",
      "Mingyu Ding",
      "Shiguang Wu",
      "Wenqi Shao",
      "Qiguang Chen",
      "Bin Wang",
      "Yu Qiao",
      "Ping Luo"
    ],
    "abstract": "This paper studies close-loop task planning, which refers to the process of generating a sequence of skills (a plan) to accomplish a specific goal while adapting the plan based on real-time observations.Recently, prompting Large Language Models (LLMs) to generate actions iteratively has become a prevalent paradigm due to its superior performance and user-friendliness.However, this paradigm is plagued by two inefficiencies: high token consumption and redundant error correction, both of which hinder its scalability for large-scale testing and applications.To address these issues, we propose Tree-Planner, which reframes task planning with LLMs into three distinct phases: plan sampling,  action tree construction, and grounded deciding.Tree-Planner starts by using an LLM to sample a set of potential plans before execution, followed by the aggregation of them to form an action tree.Finally, the LLM performs a top-down decision-making process on the tree, taking into account real-time environmental information.Experiments show that Tree-Planner achieves state-of-the-art performance while maintaining high efficiency.By decomposing LLM queries into a single plan-sampling call and multiple grounded-deciding calls,a considerable partof the prompt are less likely to be repeatedly consumed. As a result, token consumption is reduced by 92.2\\% compared to the previously best-performing model.Additionally, by enabling backtracking on the action tree as needed, the correction process becomes more flexible, leading to a 40.5\\% decrease in error corrections.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Glcsog6zOe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19016,
    "title": "Improved algorithm and bounds for successive projection",
    "authors": [
      "Jiashun Jin",
      "Tracy Ke",
      "Gabriel Moryoussef",
      "Jiajun Tang",
      "Jingming Wang"
    ],
    "abstract": "Consider a $K$-vertex simplex in a $d$-dimensional  space. We measure $n$ points on the simplex, but due to the measurement noise, some of the observed points fall outside the simplex. The interest is vertex hunting (i.e.,  estimating the vertices of the simplex).  The successive projection algorithm (SPA)  is one of the most popular approaches to vertex hunting, but it is vulnerable to noise and outliers, and may perform unsatisfactorily.  We propose pseudo-point SPA  (pp-SPA) as a new approach to vertex hunting. The approach contains two novel ideas (a projection step and a denoise step) and generates roughly $n$ pseudo-points, which can be fed in to SPA for vertex hunting. For theory, we first derive an improved non-asymptotic bound for the orthodox SPA, and then use the result to derive the bounds for pp-SPA.  Compared with the orthodox SPA,  pp-SPA has a faster rate and more satisfactory numerical performance in a broad setting.  The analysis is quite delicate: the non-asymptotic bound is hard to derive, and we need precise results on the extreme values of (possibly) high-dimensional random vectors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GlpawHh80l",
    "arxiv_id": "2403.11013",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19147,
    "title": "On the Reliability of Watermarks for Large Language Models",
    "authors": [
      "John Kirchenbauer",
      "Jonas Geiping",
      "Yuxin Wen",
      "Manli Shu",
      "Khalid Saifullah",
      "Kezhi Kong",
      "Kasun Fernando",
      "Aniruddha Saha",
      "Micah Goldblum",
      "Tom Goldstein"
    ],
    "abstract": "As LLMs become commonplace, machine-generated text has the potential to flood the internet with spam, social media bots, and valueless content. _Watermarking_ is a simple and effective strategy for mitigating such harms by enabling the detection and documentation of LLM-generated text. Yet a crucial question remains: How reliable is watermarking in realistic settings in the wild? There, watermarked text may be modified to suit a user's needs, or entirely rewritten to avoid detection. We study the robustness of watermarked text after it is re-written by humans, paraphrased by a non-watermarked LLM, or mixed into a longer hand-written document. We find that watermarks remain detectable even after human and machine paraphrasing. While these attacks dilute the strength of the watermark, paraphrases are statistically likely to leak n-grams or even longer fragments of the original text, resulting in high-confidence detections when enough tokens are observed.  For example, after strong human paraphrasing the watermark is detectable after observing 800 tokens on average, when setting a $1\\mathrm{e}{-5}$ false positive rate. We also consider a range of new detection schemes that are sensitive to short spans of watermarked text embedded inside a large document, and we compare the robustness of watermarking to other kinds of detectors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DEJIDCmWOz",
    "arxiv_id": "2306.04634",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19015,
    "title": "Offline RL with Observation Histories: Analyzing and Improving Sample Complexity",
    "authors": [
      "Joey Hong",
      "Anca Dragan",
      "Sergey Levine"
    ],
    "abstract": "Offline reinforcement learning (RL) can in principle synthesize more optimal behavior from a dataset consisting only of suboptimal trials. One way that this can happen is by \"stitching\" together the best parts of otherwise suboptimal trajectories that overlap on similar states, to create new behaviors where each individual state is in-distribution, but the overall returns are higher. However, in many interesting and complex applications, such as autonomous navigation and dialogue systems, the state is partially observed. Even worse, the state representation is unknown or not easy to define. In such cases, policies and value functions are often conditioned on observation histories instead of states. In these cases, it is not clear if the same kind of \"stitching\" is feasible at the level of observation histories, since two different trajectories would always have different histories, and thus \"similar states\" that might lead to effective stitching cannot be leveraged.  Theoretically, we show that standard offline RL algorithms conditioned on observation histories suffer from poor sample complexity, in accordance with the above intuition. We then identify sufficient conditions under which offline RL can still be efficient -- intuitively, it needs to learn a compact representation of history comprising only features relevant for action selection. We introduce a bisimulation loss that captures the extent to which this happens, and propose that offline RL can explicitly optimize this loss to aid worst-case sample complexity. Empirically, we show that across a variety of tasks either our proposed loss improves performance, or the value of this loss is already minimized as a consequence of standard offline RL, indicating that it correlates well with good performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GnOLWS4Llt",
    "arxiv_id": "2310.20663",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19146,
    "title": "Beyond Worst-case Attacks: Robust RL with Adaptive Defense via Non-dominated Policies",
    "authors": [
      "Xiangyu Liu",
      "Chenghao Deng",
      "Yanchao Sun",
      "Yongyuan Liang",
      "Furong Huang"
    ],
    "abstract": "In light of the burgeoning success of reinforcement learning (RL) in diverse real-world applications, considerable focus has been directed towards ensuring RL policies are robust to adversarial attacks during test time. Current approaches largely revolve around solving a minimax problem to prepare for potential worst-case scenarios. While effective against strong attacks, these methods often compromise performance in the absence of attacks or the presence of only weak attacks. To address this, we study policy robustness under the well-accepted state-adversarial attack model, extending our focus beyond merely worst-case attacks. We first formalize this task at test time as a regret minimization problem and establish its intrinsic difficulty in achieving sublinear regret when the baseline policy is from a general continuous policy class, $\\Pi$. This finding prompts us to \\textit{refine} the baseline policy class $\\Pi$ prior to test time, aiming for efficient adaptation within a compact, finite policy class $\\tilde{\\Pi}$, which can resort to an adversarial bandit subroutine. In light of the importance of a finite and compact $\\tilde{\\Pi}$, we propose a novel training-time algorithm to iteratively discover \\textit{non-dominated policies}, forming a near-optimal and minimal $\\tilde{\\Pi}$, thereby ensuring both robustness and test-time efficiency. Empirical validation on the Mujoco corroborates the superiority of our approach in terms of natural and robust performance, as well as adaptability to various attack scenarios.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=DFTHW0MyiW",
    "arxiv_id": "2402.12673",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19145,
    "title": "A Plug-and-Play Image Registration Network",
    "authors": [
      "Junhao Hu",
      "Weijie Gan",
      "Zhixin Sun",
      "Hongyu An",
      "Ulugbek Kamilov"
    ],
    "abstract": "Deformable image registration (DIR) is an active research topic in biomedical imaging. There is a growing interest in developing DIR methods based on deep learning (DL). A traditional DL approach to DIR is based on training a convolutional neural network (CNN) to estimate the registration field between two input images. While conceptually simple, this approach comes with a limitation that it exclusively relies on a pre-trained CNN without explicitly enforcing fidelity between the registered image and the reference. We present plug-and-play image registration network (PIRATE) as a new DIR method that addresses this issue by integrating an explicit data-fidelity penalty and a CNN prior. PIRATE pre-trains a CNN denoiser on the registration field and \"plugs\" it into an iterative method as a regularizer. We additionally present PIRATE+ that fine-tunes the CNN prior in PIRATE using deep equilibrium models (DEQ). PIRATE+ interprets the fixed-point iteration of PIRATE as a network with effectively infinite layers and then trains the resulting network end-to-end, enabling it to learn more task-specific information and boosting its performance. Our numerical results on OASIS and CANDI datasets show that our methods achieve state-of-the-art performance on DIR.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DGez4B2a6Y",
    "arxiv_id": "2310.04297",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19142,
    "title": "PINNsFormer: A Transformer-Based Framework For Physics-Informed Neural Networks",
    "authors": [
      "Zhiyuan Zhao",
      "Xueying Ding",
      "B. Aditya Prakash"
    ],
    "abstract": "Physics-Informed Neural Networks (PINNs) have emerged as a promising deep learning framework for approximating numerical solutions to partial differential equations (PDEs). However, conventional PINNs, relying on multilayer perceptrons (MLP), neglect the crucial temporal dependencies inherent in practical physics systems and thus fail to propagate the initial condition constraints globally and accurately capture the true solutions under various scenarios. In this paper, we introduce a novel Transformer-based framework, termed PINNsFormer, designed to address this limitation. PINNsFormer can accurately approximate PDE solutions by utilizing multi-head attention mechanisms to capture temporal dependencies. PINNsFormer transforms point-wise inputs into pseudo sequences and replaces point-wise PINNs loss with a sequential loss. Additionally, it incorporates a novel activation function, \\texttt{Wavelet}, which anticipates Fourier decomposition through deep neural networks. Empirical results demonstrate that PINNsFormer achieves superior generalization ability and accuracy across various scenarios, including PINNs failure modes and high-dimensional PDEs. Moreover, PINNsFormer offers flexibility in integrating existing learning schemes for PINNs, further enhancing its performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DO2WFXU1Be",
    "arxiv_id": "2307.11833",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19141,
    "title": "FedTrans: Client-Transparent Utility Estimation for Robust Federated Learning",
    "authors": [
      "Mingkun Yang",
      "Ran Zhu",
      "Qing Wang",
      "Jie Yang"
    ],
    "abstract": "Federated Learning (FL) is an important privacy-preserving learning paradigm that plays an important role in the Intelligent Internet of Things. Training a global model in FL, however, is vulnerable to the noise in the heterogeneous data across the clients. In this paper, we introduce **FedTrans**, a novel client-transparent client utility estimation method designed to guide client selection for noisy scenarios, mitigating performance degradation problems. To estimate the client utility, we propose a Bayesian framework that models client utility and its relationships with the weight parameters and the performance of local models. We then introduce a variational inference algorithm to effectively infer client utility, given only a small amount of auxiliary data. Our evaluation demonstrates that leveraging FedTrans as a guide for client selection can lead to a better accuracy performance (up to 7.8\\%), ensuring robustness in noisy scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DRu8PMHgCh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19139,
    "title": "HypeBoy: Generative Self-Supervised Representation Learning on Hypergraphs",
    "authors": [
      "Sunwoo Kim",
      "Shinhwan Kang",
      "Fanchen Bu",
      "Soo Yong Lee",
      "Jaemin Yoo",
      "Kijung Shin"
    ],
    "abstract": "Hypergraphs are marked by complex topology, expressing higher-order interactions among multiple nodes with hyperedges, and better capturing the topology is essential for effective representation learning. Recent advances in generative self-supervised learning (SSL) suggest that hypergraph neural networks (HNNs) learned from generative self-supervision have the potential to effectively encode the complex hypergraph topology. Designing a generative SSL strategy for hypergraphs, however, is not straightforward. Questions remain with regard to its generative SSL task, connection to downstream tasks, and empirical properties of learned representations. In light of the promises and challenges, we propose a novel generative SSL strategy for hypergraphs. We first present a generative SSL task on hypergraphs, hyperedge filling, and highlight its theoretical connection to node classification. Based on the generative SSL task, we propose a hypergraph SSL method, HYPEBOY. HYPEBOY learns effective general-purpose hypergraph representations, outperforming 15 baseline methods across 11 benchmark datasets. To our knowledge, this is the first study on generative SSL on hypergraphs, and we demonstrate its theoretical and empirical strengths for hypergraph representation learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DZUzOKE6og",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19138,
    "title": "GraphPulse: Topological representations for temporal graph property prediction",
    "authors": [
      "Kiarash Shamsi",
      "Farimah Poursafaei",
      "Shenyang Huang",
      "Bao Tran Gia Ngo",
      "Baris Coskunuzer",
      "Cuneyt Gurcan Akcora"
    ],
    "abstract": "Many real-world networks evolve over time, and predicting the evolution of such networks remains a challenging task. Graph Neural Networks (GNNs) have shown empirical success for learning on static graphs, but they lack the ability to effectively learn from nodes and edges with different timestamps. Consequently, the prediction of future properties in temporal graphs remains a relatively under-explored area.In this paper, we aim to bridge this gap by introducing a principled framework, named GraphPulse. The framework combines two important techniques for the analysis of temporal graphs within a Newtonian framework. First, we employ the Mapper method, a key tool in topological data analysis, to extract essential clustering information from graph nodes. Next, we harness the sequential modeling capabilities of Recurrent Neural Networks (RNNs) for temporal reasoning regarding the graph's evolution. Through extensive experimentation, we demonstrate that our model enhances the ROC-AUC metric by 10.2\\% in comparison to the top-performing state-of-the-art method across various temporal networks. We provide the implementation of GraphPulse at https://anonymous.4open.science/r/Graph_Pulse",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DZqic2sPTY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19136,
    "title": "Improving Domain Generalization with Domain Relations",
    "authors": [
      "Huaxiu Yao",
      "Xinyu Yang",
      "Xinyi Pan",
      "Shengchao Liu",
      "Pang Wei Koh",
      "Chelsea Finn"
    ],
    "abstract": "Distribution shift presents a significant challenge in machine learning, where models often underperform during the test stage when faced with a different distribution than the one they were trained on. In this paper, we focus on domain shifts, which occur when the model is applied to new domains that are different from the ones it was trained on, and propose a new approach called DG. Unlike previous approaches that aim to learn a single model that is domain invariant, DG leverages domain similarities based on domain metadata to learn domain-specific models. Concretely, DG learns a set of training-domain-specific functions during the training stage and reweights them based on domain relations during the test stage. These domain relations can be directly obtained and learned from domain metadata. Under mild assumptions, we theoretically prove that using domain relations to reweight training-domain-specific functions achieves stronger out-of-domain generalization compared to the conventional averaging approach. Empirically, we evaluate the effectiveness of DG using both toy and real-world datasets for tasks such as temperature regression, land use classification, and molecule-protein binding affinity prediction. Our results show that DG consistently outperforms state-of-the-art methods.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Dc4rXq3HIA",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19135,
    "title": "The Blessing of Randomness: SDE Beats ODE in General Diffusion-based Image Editing",
    "authors": [
      "Shen Nie",
      "Hanzhong Allan Guo",
      "Cheng Lu",
      "Yuhao Zhou",
      "Chenyu Zheng",
      "Chongxuan Li"
    ],
    "abstract": "We present a unified probabilistic formulation for diffusion-based image editing, where a latent variable is edited in a task-specific manner and generally deviates from the corresponding marginal distribution induced by the original stochastic or ordinary differential equation (SDE or ODE). Instead, it defines a corresponding SDE or ODE for editing. In the formulation, we prove that the Kullback-Leibler divergence between the marginal distributions of the two SDEs gradually decreases while that for the ODEs remains as the time approaches zero, which shows the promise of SDE in image editing. Inspired by it, we provide the SDE counterparts for widely used ODE baselines in various tasks including inpainting and image-to-image translation, where SDE shows a consistent and substantial improvement. Moreover, we propose \\emph{SDE-Drag}  -- a simple yet effective method built upon the SDE formulation for point-based content dragging. We build a challenging benchmark (termed \\emph{DragBench}) with open-set natural, art, and AI-generated images for evaluation. A user study on DragBench indicates that SDE-Drag significantly outperforms our ODE baseline, existing diffusion-based methods, and the renowned DragGAN. Our results demonstrate the superiority and versatility of SDE in image editing and push the boundary of diffusion-based editing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DesYwmUG00",
    "arxiv_id": "2311.01410",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19134,
    "title": "Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks",
    "authors": [
      "Yassine ABBAHADDOU",
      "Sofiane ENNADIR",
      "Johannes F. Lutzeyer",
      "Michalis Vazirgiannis",
      "Henrik Bostr\u00f6m"
    ],
    "abstract": "Graph Neural Networks (GNNs) have demonstrated state-of-the-art performance in various graph representation learning tasks. Recently, studies revealed their vulnerability to adversarial attacks. In this work, we theoretically define the concept of expected robustness in the context of attributed graphs and relate it to the classical definition of adversarial robustness in the graph representation learning literature. Our definition allows us to derive an upper bound of the expected robustness of Graph Convolutional Networks (GCNs) and Graph Isomorphism Networks subject to node feature attacks. Building on these findings, we connect the expected robustness of GNNs to the orthogonality of their weight matrices and consequently propose an attack-independent, more robust variant of the GCN, called the Graph Convolutional Orthogonal Robust Networks (GCORNs). We further introduce a probabilistic method to estimate the expected robustness, which allows us to evaluate the effectiveness of GCORN on several real-world datasets. Experimental experiments showed that GCORN outperforms available defense methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DfPtC8uSot",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19132,
    "title": "Cleanba: A Reproducible and Efficient Distributed Reinforcement Learning Platform",
    "authors": [
      "Shengyi Huang",
      "Jiayi Weng",
      "Rujikorn Charakorn",
      "Min Lin",
      "Zhongwen Xu",
      "Santiago Ontanon"
    ],
    "abstract": "Distributed Deep Reinforcement Learning (DRL) aims to leverage more computational resources to train autonomous agents with less training time. Despite recent progress in the field, reproducibility issues have not been sufficiently explored. This paper first shows that the typical actor-learner framework can have reproducibility issues even if hyperparameters are controlled. We then introduce Cleanba, a new open-source platform for distributed DRL that proposes a highly reproducible architecture. Cleanba implements highly optimized distributed variants of PPO and IMPALA. Our Atari experiments show that these variants can obtain equivalent or higher scores than strong IMPALA baselines in moolib and torchbeast and PPO baseline in CleanRL. However, Cleanba variants present 1) shorter training time and 2) more reproducible learning curves in different hardware settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Diq6urt3lS",
    "arxiv_id": "2310.00036",
    "GitHub": [
      "https://github.com/vwxyzjn/cleanba"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19130,
    "title": "Robustifying State-space Models for Long Sequences via Approximate Diagonalization",
    "authors": [
      "Annan Yu",
      "Arnur Nigmetov",
      "Dmitriy Morozov",
      "Michael W. Mahoney",
      "N. Benjamin Erichson"
    ],
    "abstract": "State-space models (SSMs) have recently emerged as a framework for learning long-range sequence tasks. An example is the structured state-space sequence (S4) layer, which uses the diagonal-plus-low-rank structure of the HiPPO initialization framework. However, the complicated structure of the S4 layer poses challenges; and, in an effort to address these challenges, models such as S4D and S5 have considered a purely diagonal structure. This choice simplifies the implementation, improves computational efficiency, and allows channel communication. However, diagonalizing the HiPPO framework is itself an ill-posed problem. In this paper, we propose a general solution for this and related ill-posed diagonalization problems in machine learning. We introduce a generic, backward-stable ``perturb-then-diagonalize'' (PTD) methodology, which is based on the pseudospectral theory of non-normal operators, and which may be interpreted as the approximate diagonalization of the non-normal matrices defining SSMs. Based on this, we introduce the S4-PTD and S5-PTD models. Through theoretical analysis of the transfer functions of different initialization schemes, we demonstrate that the S4-PTD/S5-PTD initialization strongly converges to the HiPPO framework, while the S4D/S5 initialization only achieves weak convergences. As a result, our new models show resilience to Fourier-mode noise-perturbed inputs, a crucial property not achieved by the S4D/S5 models. In addition to improved robustness, our S5-PTD model averages 87.6% accuracy on the Long-Range Arena benchmark, demonstrating that the PTD methodology helps to improve the accuracy of deep learning models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=DjeQ39QoLQ",
    "arxiv_id": "2310.01698",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19129,
    "title": "Simplicial Representation Learning with Neural $k$-Forms",
    "authors": [
      "Kelly Maggs",
      "Celia Hacker",
      "Bastian Rieck"
    ],
    "abstract": "\\emph{Geometric deep learning} extends deep learning to incorporate information about the geometry and topology data, especially in complex domains like graphs. Despite the popularity of message passing in this field, it has limitations such as the need for graph rewiring, ambiguity in interpreting data, and over-smoothing. In this paper, we take a different approach, focusing on leveraging geometric information from simplicial complexes embedded in $\\mathbb{R}^n$ using node coordinates. We use differential $k$-forms in $\\mathbb{R}^n$ to create representations of simplices, offering interpretability and geometric consistency without message passing. This approach also enables us to apply differential geometry tools and achieve universal approximation. Our method is efficient, versatile, and applicable to various input complexes, including graphs, simplicial complexes, and cell complexes. It outperforms existing message passing neural networks in harnessing information from geometrical graphs with node features serving as coordinates.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Djw0XhjHZb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19128,
    "title": "CLIPSelf: Vision Transformer Distills Itself for Open-Vocabulary Dense Prediction",
    "authors": [
      "Size Wu",
      "Wenwei Zhang",
      "Lumin Xu",
      "Sheng Jin",
      "Xiangtai Li",
      "Wentao Liu",
      "Chen Change Loy"
    ],
    "abstract": "Open-vocabulary dense prediction tasks including object detection and image segmentation have been advanced by the success of Contrastive Language-Image Pre-training (CLIP). CLIP models, particularly those incorporating vision transformers (ViTs), have exhibited remarkable generalization ability in zero-shot image classification. However, when transferring the vision-language alignment of CLIP from global image representation to local region representation for the open-vocabulary dense prediction tasks, CLIP ViTs suffer from the domain shift from full images to local image regions. In this paper, we embark on an in-depth analysis of the region-language alignment in CLIP models, which is essential for downstream open-vocabulary dense prediction tasks. Subsequently, we propose an approach named CLIPSelf, which adapts the image-level recognition ability of CLIP ViT to local image regions without needing any region-text pairs. CLIPSelf empowers ViTs to distill itself by aligning a region representation extracted from its dense feature map with the image-level representation of the corresponding image crop. With the enhanced CLIP ViTs, we achieve new state-of-the-art performance on open-vocabulary object detection, semantic segmentation, and panoptic segmentation across various benchmarks. Models and code are released at https://github.com/wusize/CLIPSelf.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=DjzvJCRsVf",
    "arxiv_id": "2310.01403",
    "GitHub": [
      "https://github.com/wusize/CLIPSelf"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19127,
    "title": "BayesPrompt: Prompting Large-Scale Pre-Trained Language Models on Few-shot Inference via Debiased Domain Abstraction",
    "authors": [
      "Jiangmeng Li",
      "Fei Song",
      "Yifan Jin",
      "Wenwen Qiang",
      "Changwen Zheng",
      "Fuchun Sun",
      "Hui Xiong"
    ],
    "abstract": "As a novel and effective fine-tuning paradigm based on large-scale pre-trained language models (PLMs), prompt-tuning aims to reduce the gap between downstream tasks and pre-training objectives. While prompt-tuning has yielded continuous advancements in various tasks, such an approach still remains a persistent defect: prompt-tuning methods fail to generalize to specific few-shot patterns. From the perspective of distribution analyses, we disclose that the intrinsic issues behind the phenomenon are the over-multitudinous conceptual knowledge contained in PLMs and the abridged knowledge for target downstream domains, which jointly result in that PLMs mis-locate the knowledge distributions corresponding to the target domains in the universal knowledge embedding space. To this end, we intuitively explore to approximate the unabridged target domains of downstream tasks in a debiased manner, and then abstract such domains to generate discriminative prompts, thereby providing the de-ambiguous guidance for PLMs. Guided by such an intuition, we propose a simple yet effective approach, namely BayesPrompt, to learn prompts that contain the domain discriminative information against the interference from domain-irrelevant knowledge. BayesPrompt primitively leverages known distributions to approximate the debiased factual distributions of target domains and further uniformly samples certain representative features from the approximated distributions to generate the ultimate prompts for PLMs. We provide theoretical insights with the connection to domain adaptation. Empirically, ourmethod achieves state-of-the-art performance on benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DmD1wboID9",
    "arxiv_id": "2401.14166",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19126,
    "title": "DeepSPF: Spherical SO(3)-Equivariant Patches for Scan-to-CAD Estimation",
    "authors": [
      "Driton Salihu",
      "Adam Misik",
      "Yuankai Wu",
      "Constantin Patsch",
      "Fabian Esteban Seguel",
      "Eckehard Steinbach"
    ],
    "abstract": "Recently, SO(3)-equivariant methods have been explored for 3D reconstruction via Scan-to-CAD.Despite significant advancements attributed to the unique characteristics of 3D data, existing SO(3)-equivariant approaches often fall short in seamlessly integrating local and global contextual information in a widely generalizable manner.Our contributions in this paper are threefold.First, we introduce Spherical Patch Fields, a representation technique designed for patch-wise, SO(3)-equivariant 3D point clouds, anchored theoretically on the principles of Spherical Gaussians.Second, we present the Patch Gaussian Layer, designed for the adaptive extraction of local and global contextual information from resizable point cloud patches.Culminating our contributions, we present Learnable Spherical Patch Fields (DeepSPF) \u2013 a versatile and easily integrable backbone suitable for instance-based point networks.Through rigorous evaluations, we demonstrate significant enhancements in Scan-to-CAD performance for point cloud registration, retrieval, and completion: a significant reduction in the rotation error of existing registration methods, an improvement of up to 17\\% in the Top-1 error for retrieval tasks, and a notable reduction of up to 30\\% in the Chamfer Distance for completion models, all attributable to the incorporation of DeepSPF.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Dnc3paMqDE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19125,
    "title": "Group Preference Optimization: Few-Shot Alignment of Large Language Models",
    "authors": [
      "Siyan Zhao",
      "John Dang",
      "Aditya Grover"
    ],
    "abstract": "Many applications of large language models (LLMs), ranging from chatbots tocreative writing, require nuanced subjective judgments that can differ significantlyacross different groups. Existing alignment algorithms can be expensive to alignfor each group, requiring prohibitive amounts of group-specific preference dataand computation for real-world use cases. We introduce Group Preference Optimization (GPO), an alignment framework that steers language models to preferences of individual groups in a few-shot manner. In GPO, we augment the baseLLM with an independent transformer module trained to predict the preferencesof a group for the LLM generations. For few-shot learning, we parameterize thismodule as an in-context autoregressive transformer and train it via meta-learningon several groups. We empirically validate the efficacy of GPO through rigorous evaluations using LLMs with varied sizes on three human opinion adaptation tasks. These tasks involve adapting to the preferences of US demographicgroups, global countries, and individual users. Our results demonstrate that GPOnot only aligns models more accurately but also requires fewer group-specificpreferences and less training and inference computing resources, outperformingexisting strategies such as in-context steering and fine-tuning methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DpFeMH4l8Q",
    "arxiv_id": "2310.11523",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19124,
    "title": "Causal Fairness under Unobserved Confounding: A Neural Sensitivity Framework",
    "authors": [
      "Maresa Schr\u00f6der",
      "Dennis Frauen",
      "Stefan Feuerriegel"
    ],
    "abstract": "Fairness for machine learning predictions is widely required in practice for legal, ethical, and societal reasons. Existing work typically focuses on settings without unobserved confounding, even though unobserved confounding can lead to severe violations of causal fairness and, thus, unfair predictions. In this work, we analyze the sensitivity of causal fairness to unobserved confounding. Our contributions are three-fold. First, we derive bounds for causal fairness metrics under different sources of observed confounding. This enables practitioners to audit the sensitivity of their machine learning models to unobserved confounding in fairness-critical applications. Second, we propose a novel neural framework for learning fair predictions, which allows us to offer worst-case guarantees of the extent to which causal fairness can be violated due to unobserved confounding. Third, we demonstrate the effectiveness of our framework in a series of experiments, including a real-world case study about predicting prison sentences. To the best of our knowledge, ours is the first work to study causal fairness under observed confounding. To this end, our work is of direct practical value for auditing and ensuring the fairness of predictions in high-stakes applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DqD59dQP37",
    "arxiv_id": "2311.18460",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19122,
    "title": "Single Motion Diffusion",
    "authors": [
      "Sigal Raab",
      "Inbal Leibovitch",
      "Guy Tevet",
      "Moab Arar",
      "Amit Haim Bermano",
      "Daniel Cohen-Or"
    ],
    "abstract": "Synthesizing realistic animations of humans, animals, and even imaginary creatures, has long been a goal for artists and computer graphics professionals. Compared to the imaging domain, which is rich with large available datasets, the number of data instances for the motion domain is limited, particularly for the animation of animals and exotic creatures (e.g., dragons), which have unique skeletons and motion patterns. In this work, we introduce SinMDM, a Single Motion Diffusion Model. It is designed to learn the internal motifs of a single motion sequence with arbitrary topology and synthesize a variety of motions of arbitrary length that remain faithful to the learned motifs. We harness the power of diffusion models and present a denoising network explicitly designed for the task of learning from a single input motion. SinMDM is crafted as a lightweight architecture, which avoids overfitting by using a shallow network with local attention layers that narrow the receptive field and encourage motion diversity. Our work applies to multiple contexts, including spatial and temporal in-betweening, motion expansion, style transfer, and crowd animation. Our results show that SinMDM outperforms existing methods both qualitatively and quantitatively. Moreover, while prior network-based approaches require additional training for different applications, SinMDM supports these applications during inference. Our code is included as supplementary material and will be published.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=DrhZneqz4n",
    "arxiv_id": "2302.05905",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19509,
    "title": "Fusion Is Not Enough: Single Modal Attacks on Fusion Models for 3D Object Detection",
    "authors": [
      "Zhiyuan Cheng",
      "Hongjun Choi",
      "Shiwei Feng",
      "James Chenhao Liang",
      "Guanhong Tao",
      "Dongfang Liu",
      "Michael Zuzak",
      "Xiangyu Zhang"
    ],
    "abstract": "Multi-sensor fusion (MSF) is widely used in autonomous vehicles (AVs) for perception, particularly for 3D object detection with camera and LiDAR sensors. The purpose of fusion is to capitalize on the advantages of each modality while minimizing its weaknesses. Advanced deep neural network (DNN)-based fusion techniques have demonstrated the exceptional and industry-leading performance. Due to the redundant information in multiple modalities, MSF is also recognized as a general defence strategy against adversarial attacks. In this paper, we attack fusion models from the camera modality that is considered to be of lesser importance in fusion but is more affordable for attackers. We argue that the weakest link of fusion models depends on their most vulnerable modality and propose an attack framework that targets advanced camera-LiDAR fusion-based 3D object detection models through camera-only adversarial attacks. Our approach employs a two-stage optimization-based strategy that first thoroughly evaluates vulnerable image areas under adversarial attacks, and then applies dedicated attack strategies for different fusion models to generate deployable patches. The evaluations with six advanced camera-LiDAR fusion models and one camera-only model indicate that our attacks successfully compromise all of them. Our approach can either decrease the mean average precision (mAP) of detection performance from 0.824 to 0.353 or degrade the detection score of a target object from 0.728 to 0.156, demonstrating the efficacy of our proposed attack framework. Code is available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3VD4PNEt5q",
    "arxiv_id": "2304.14614",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19121,
    "title": "Decomposed Diffusion Sampler for Accelerating Large-Scale Inverse Problems",
    "authors": [
      "Hyungjin Chung",
      "Suhyeon Lee",
      "Jong Chul Ye"
    ],
    "abstract": "Krylov subspace, which is generated by multiplying a given vector by the matrix of a linear transformation and its successive powers,  has been extensively studied in classical optimization literature to design algorithms that converge quickly for large linear inverse problems. For example, the conjugate gradient method (CG), one of the most popular Krylov subspace methods, is based on the idea of minimizing the residual error in the Krylov subspace. However, with the recent advancement of high-performance diffusion solvers for inverse problems, it is not clear how classical wisdom can be synergistically combined with modern diffusion models. In this study, we propose a novel and efficient diffusion sampling strategy that synergistically combines the diffusion sampling and Krylov subspace methods. Specifically, we prove that if the tangent space at a denoised sample by Tweedie's formula forms a  Krylov subspace, then the CG initialized with the denoised data ensures the data consistency update to remain in the tangent space. This negates the need to compute the manifold-constrained gradient (MCG), leading to a more efficient diffusion sampling method. Our method is applicable regardless of the parametrization and setting (i.e., VE, VP). Notably, we achieve state-of-the-art reconstruction quality on challenging real-world medical inverse imaging problems, including multi-coil MRI reconstruction and 3D CT reconstruction. Moreover, our proposed method achieves more than 80 times faster inference time than the previous state-of-the-art method. Code is available at https://github.com/HJ-harry/DDS",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DsEhqQtfAG",
    "arxiv_id": "2303.05754",
    "GitHub": [
      "https://github.com/HJ-harry/DDS"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19120,
    "title": "Adversarial Imitation Learning via Boosting",
    "authors": [
      "Jonathan Daniel Chang",
      "Dhruv Sreenivas",
      "Yingbing Huang",
      "Kiant\u00e9 Brantley",
      "Wen Sun"
    ],
    "abstract": "Adversarial imitation learning (AIL) has stood out as a dominant framework across various imitation learning (IL) applications, with Discriminator Actor Critic (DAC) demonstrating the effectiveness of off-policy learning algorithms in improving sample efficiency and scalability to higher-dimensional observations. Despite DAC\u2019s empirical success, the original AIL objective is on-policy and DAC\u2019s ad-hoc application of off-policy training does not guarantee successful imitation. Follow-up work such as ValueDICE tackles this issue by deriving a fully off-policy AIL objective. Instead in this work, we develop a novel and principled AIL algorithm via the framework of boosting. Like boosting, our new algorithm, AILBoost, maintains an ensemble of weighted weak learners (i.e., policies) and trains a discriminator that witnesses the maximum discrepancy between the distributions of the ensemble and the expert policy. We maintain a weighted replay buffer to represent the state-action distribution induced by the ensemble, allowing us to train discriminators using the entire data collected so far. Empirically, we evaluate our algorithm on both controller state-based and pixel-based environments from the DeepMind Control Suite. AILBoost outperforms DAC on both types of environments, demonstrating the benefit of properly weighting replay buffer data for off-policy training. On state-based environments, AILBoost outperforms ValueDICE and IQ-Learn, achieving state-of-the-art performance with as little as one expert trajectory.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DuQkqSe9en",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19119,
    "title": "Enhancing Group Fairness in Online Settings Using Oblique Decision Forests",
    "authors": [
      "Somnath Basu Roy Chowdhury",
      "Nicholas Monath",
      "Ahmad Beirami",
      "Rahul Kidambi",
      "Kumar Avinava Dubey",
      "Amr Ahmed",
      "Snigdha Chaturvedi"
    ],
    "abstract": "Fairness, especially group fairness, is an important consideration in the context of machine learning systems. The most commonly adopted group fairness-enhancing techniques are in-processing methods that rely on a mixture of a fairness objective (e.g., demographic parity) and a task-specific objective (e.g., cross-entropy) during the training process. However, when data arrives in an online fashion \u2013 one instance at a time \u2013 optimizing such fairness objectives poses several challenges. In particular, group fairness objectives are defined using expectations of predictions across different demographic groups. In the online setting, where the algorithm has access to a single instance at a time, estimating the group fairness objective requires additional storage and significantly more computation (e.g., forward/backward passes) than the task-specific objective at every time step. In this paper, we propose Aranyani, an ensemble of oblique decision trees, to make fair decisions in online settings. The hierarchical tree structure of Aranyani enables parameter isolation and allows us to efficiently compute the fairness gradients using aggregate statistics of previous decisions, eliminating the need for additional storage and forward/backward passes. We also present an efficient framework to train Aranyani and theoretically analyze several of its properties. We conduct empirical evaluations on 5 publicly available benchmarks (including vision and language datasets) to show that Aranyani achieves a better accuracy-fairness trade-off compared to baseline approaches.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=E1NxN5QMOE",
    "arxiv_id": "2310.11401",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19118,
    "title": "Parallelizing non-linear sequential models over the sequence length",
    "authors": [
      "Yi Heng Lim",
      "Qi Zhu",
      "Joshua Selfridge",
      "Muhammad Firmansyah Kasim"
    ],
    "abstract": "Sequential models, such as Recurrent Neural Networks and Neural Ordinary Differential Equations, have long suffered from slow training due to their inherent sequential nature.For many years this bottleneck has persisted, as many thought sequential models could not be parallelized.We challenge this long-held belief with our parallel algorithm that accelerates GPU evaluation of sequential models by up to 3 orders of magnitude faster without compromising output accuracy.The algorithm does not need any special structure in the sequential models' architecture, making it applicable to a wide range of architectures.Using our method, training sequential models can be more than 10 times faster than the common sequential method without any meaningful difference in the training results.Leveraging this accelerated training, we discovered the efficacy of the Gated Recurrent Unit in a long time series classification problem with 17k time samples.By overcoming the training bottleneck, our work serves as the first step to unlock the potential of non-linear sequential models for long sequence problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=E34AlVLN0v",
    "arxiv_id": "2309.12252",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19117,
    "title": "Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions",
    "authors": [
      "Adel Javanmard",
      "Lin Chen",
      "Vahab Mirrokni",
      "Ashwinkumar Badanidiyuru",
      "Gang Fu"
    ],
    "abstract": "Due to the rise of privacy concerns, in many practical applications the training data is aggregated before being shared with the learner, in order to protect privacy of users' sensitive responses. In an aggregate learning framework, the dataset is grouped into bags of samples, where each bag is available only with an aggregate response, providing a summary of individuals\u2019 responses in that bag. In this paper, we study two natural loss functions for learning from aggregate responses: bag-level loss and the instance-level loss. In the former, the model is learnt by minimizing a loss between aggregate responses and aggregate model predictions, while in the latter the model aims to fit individual predictions to the aggregate responses. In this work, we show that the instance-level loss can be perceived as a regularized form of the bag-level loss. This observation lets us compare the two approaches with respect to bias and variance of the resulting estimators, and introduce a novel interpolating estimator which combines the two approaches. For linear regression tasks, we provide a precise characterization of the risk of the interpolating estimator in an asymptotic regime where the size of the training set grows in proportion to the features dimension.  Our analysis allows us to theoretically understand the effect of different factors, such as bag size on the model prediction risk. In addition, we propose a mechanism for differentially private learning from aggregate responses and derive the optimal bag size in terms of prediction risk-privacy trade-off.  We also carry out thorough experiments to corroborate our theory and show the efficacy of the interpolating estimator.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=E60SIDItyT",
    "arxiv_id": "2401.11081",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19116,
    "title": "CAS: A Probability-Based Approach for Universal Condition Alignment Score",
    "authors": [
      "Chunsan Hong",
      "ByungHee Cha",
      "Tae-Hyun Oh"
    ],
    "abstract": "Recent conditional diffusion models have shown remarkable advancements and have been widely applied in fascinating real-world applications. However, samples generated by these models often do not strictly comply with user-provided conditions. Due to this, there have been few attempts to evaluate this alignment via pre-trained scoring models to select well-generated samples. Nonetheless, current studies are confined to the text-to-image domain and require large training datasets. This suggests that crafting alignment scores for various conditions will demand considerable resources in the future. In this context, we introduce a universal condition alignment score that leverages the conditional probability measurable through the diffusion process. Our technique operates across all conditions and requires no additional models beyond the diffusion model used for generation, effectively enabling self-rejection. Our experiments validate that our met- ric effectively applies in diverse conditional generations, such as text-to-image, {instruction, image}-to-image, edge-/scribble-to-image, and text-to-audio.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=E78OaH2s3f",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19115,
    "title": "VBH-GNN: Variational Bayesian Heterogeneous Graph Neural Networks for Cross-subject Emotion Recognition",
    "authors": [
      "Chenyu Liu",
      "XINLIANG ZHOU",
      "Zhengri Zhu",
      "Liming Zhai",
      "Ziyu Jia",
      "Yang Liu"
    ],
    "abstract": "The research on human emotion under electroencephalogram (EEG) is an emerging field in which cross-subject emotion recognition (ER) is a promising but challenging task. Many approaches attempt to find emotionally relevant domain-invariant features using domain adaptation (DA) to improve the accuracy of cross-subject ER. Two problems exist with these methods. First, only single-modal data (EEG) are utilized, ignoring the complementarity between multi-modal physiological signals. Second, these methods aim to completely match the signal feature between different domains, which is difficult due to the extreme individual differences of EEG. To solve these problems, we introduced the complementarity of multi-modal physiological signals and proposed a new method for cross-subject ER that does not align the distribution of signal features but rather the distribution of spatio-temporal relationships between features. We design a Variational Bayesian Heterogeneous Graph Neural Network (VBH-GNN) with Relationship Distribution Adaptation (RDA). The RDA first aligns the domains by expressing the model space as a posterior distribution of a heterogeneous graph (HetG) for a given source domain through Bayesian graph inference. Then RDA transforms the HetG into an emotion-specific graph to further align the domains for the downstream ER task. Extensive experiments on two public datasets, DEAP and Dreamer, show that our VBH-GNN outperforms state-of-the-art methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EArTDUmILF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19114,
    "title": "Vision-by-Language for Training-Free Compositional Image Retrieval",
    "authors": [
      "Shyamgopal Karthik",
      "Karsten Roth",
      "Massimiliano Mancini",
      "Zeynep Akata"
    ],
    "abstract": "Given an image and a target modification (e.g an image of the Eiffel tower and the text \u201cwithout people and at night-time\u201d), Compositional Image Retrieval (CIR) aims to retrieve the relevant target image in a database. While supervised approaches rely on annotating triplets that is costly (i.e. query image, textual modification, and target image), recent research sidesteps this need by using large-scale vision-language models (VLMs), performing Zero-Shot CIR (ZS-CIR). However, state-of-the-art approaches in ZS-CIR still require training task-specific, customized models over large amounts of image-text pairs. In this work, we proposeto tackle CIR in a training-free manner via our Compositional Image Retrieval through Vision-by-Language (CIReVL), a simple, yet human-understandable and scalable pipeline that effectively recombines large-scale VLMs with large language models (LLMs). By captioning the reference image using a pre-trained generative VLM and asking a LLM to recompose the caption based on the textual target modification for subsequent retrieval via e.g. CLIP, we achieve modular language reasoning. In four ZS-CIR benchmarks, we find competitive, in-part state-of-the-art performance - improving over supervised methods Moreover, the modularity of CIReVL offers simple scalability without re-training, allowing us to both investigate scaling laws and bottlenecks for ZS-CIR while easily scaling up to in parts more than double of previously reported results. Finally, we show that CIReVL makes CIR human-understandable by composing image and text in a modular fashion in the language domain, thereby making it intervenable, allowing to post-hoc re-align failure cases. Code will be released upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EDPxCjXzSb",
    "arxiv_id": "2310.09291",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19113,
    "title": "One-shot Active Learning Based on Lewis Weight Sampling for Multiple Deep Models",
    "authors": [
      "Sheng-Jun Huang",
      "Yi Li",
      "Yiming Sun",
      "Ying-Peng Tang"
    ],
    "abstract": "Active learning (AL) for multiple target models aims to reduce labeled data querying while effectively training multiple models concurrently. Existing AL algorithms often rely on iterative model training, which can be computationally expensive, particularly for deep models. In this paper, we propose a one-shot AL method to address this challenge, which performs all label queries without repeated model training. Specifically, we extract different representations of the same dataset using distinct network backbones, and actively learn linear prediction layer on each representation via an $\\ell_p$-regression formulation. The regression problems are solved approximately by sampling and reweighting the unlabeled instances based on their maximum Lewis weights across the representations. An upper bound on the number of samples needed is provided with a rigorous analysis for $p\\in (0, +\\infty)$. Notably, in the case of $p=2$, our result substantially improves the bound of applying (Gajjar et al., 2023) to our setting. Experimental results on 8 benchmarks show that our one-shot approach achieves competitive performances with the state-of-the-art AL methods for multiple target models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EDXkkUAIFW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19014,
    "title": "DreamSmooth: Improving Model-based Reinforcement Learning via Reward Smoothing",
    "authors": [
      "Vint Lee",
      "Pieter Abbeel",
      "Youngwoon Lee"
    ],
    "abstract": "Model-based reinforcement learning (MBRL) has gained much attention for its ability to learn complex behaviors in a sample-efficient way: planning actions by generating imaginary trajectories with predicted rewards. Despite its success, we found that surprisingly, reward prediction is often a bottleneck of MBRL, especially for sparse rewards that are challenging (or even ambiguous) to predict. Motivated by the intuition that humans can learn from rough reward estimates, we propose a simple yet effective reward smoothing approach, DreamSmooth, which learns to predict a temporally-smoothed reward, instead of the exact reward at the given timestep. We empirically show that DreamSmooth achieves state-of-the-art performance on long-horizon sparse-reward tasks both in sample efficiency and final performance without losing performance on common benchmarks, such as Deepmind Control Suite and Atari benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GruDNzQ4ux",
    "arxiv_id": "2311.01450",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19112,
    "title": "Flow to Better: Offline Preference-based Reinforcement Learning via Preferred Trajectory Generation",
    "authors": [
      "Zhilong Zhang",
      "Yihao Sun",
      "Junyin Ye",
      "Tian-Shuo Liu",
      "Jiaji Zhang",
      "Yang Yu"
    ],
    "abstract": "Offline preference-based reinforcement learning (PbRL) offers an effective solution to overcome the challenges associated with designing rewards and the high costs of online interactions. In offline PbRL, agents are provided with a fixed dataset containing human preferences between pairs of trajectories. Previous studies mainly focus on recovering the rewards from the preferences, followed by policy optimization with an off-the-shelf offline RL algorithm. However, given that preference label in PbRL is inherently trajectory-based, accurately learning transition-wise rewards from such label can be challenging, potentially leading to misguidance during subsequent offline RL training. To address this issue, we introduce our method named $\\textit{Flow-to-Better (FTB)}$, which leverages the pairwise preference relationship to guide a generative model in producing preferred trajectories, avoiding Temporal Difference (TD) learning with inaccurate rewards. Conditioning on a low-preference trajectory, $\\textit{FTB}$ uses a diffusion model to generate a better one with a higher preference, achieving high-fidelity full-horizon trajectory improvement. During diffusion training, we propose a technique called $\\textit{Preference Augmentation}$ to alleviate the problem of insufficient preference data. As a result, we surprisingly find that the model-generated trajectories not only exhibit increased preference and consistency with the real transition but also introduce elements of $\\textit{novelty}$ and $\\textit{diversity}$, from which we can derive a desirable policy through imitation learning. Experimental results on D4RL benchmarks demonstrate that FTB achieves a remarkable improvement compared to state-of-the-art offline PbRL methods. Furthermore, we show that FTB can also serve as an effective data augmentation method for offline RL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EG68RSznLT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19111,
    "title": "Revisiting Data Augmentation in Deep Reinforcement Learning",
    "authors": [
      "Jianshu Hu",
      "Yunpeng Jiang",
      "Paul Weng"
    ],
    "abstract": "Various data augmentation techniques have been recently proposed in image-based deep reinforcement learning (DRL).Although they empirically demonstrate the effectiveness of data augmentation for improving sample efficiency or generalization, which technique should be preferred is not always clear. To tackle this question, we analyze existing methods to better understand them and to uncover how they are connected.Notably, by expressing the variance of the Q-targets and that of the empirical actor/critic losses of these methods, we can analyze the effects of their different components and compare them.We furthermore formulate an explanation about how these methods may be affected by choosing different data augmentation transformations in calculating the target Q-values.This analysis suggests recommendations on how to exploit data augmentation in a more principled way.In addition, we include a regularization term called tangent prop, previously proposed in computer vision, but whose adaptation to DRL is novel to the best of our knowledge.We evaluate our proposition and validate our analysis in several domains. Compared to different relevant baselines,  we demonstrate that it achieves state-of-the-art performance in most environments and shows higher sample efficiency and better generalization ability in some complex environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EGQBpkIEuu",
    "arxiv_id": "2402.12181",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19110,
    "title": "Prompt Gradient Projection for Continual Learning",
    "authors": [
      "Jingyang Qiao",
      "zhizhong zhang",
      "Xin Tan",
      "Chengwei Chen",
      "Yanyun Qu",
      "Yong Peng",
      "Yuan Xie"
    ],
    "abstract": "Prompt-tuning has demonstrated impressive performance in continual learning by querying relevant prompts for novel classes training. Its forgetting is therefore reduced as this instance-wise query mechanism enables us to select and update only relevant prompts. In this paper, we further integrate prompt-tuning with gradient projection approach. Our observation is: prompt-tuning releases the necessity of task identifier for gradient projection method; and gradient projection provides theoretical guarantees against forgetting for prompt-tuning. This inspires a new prompt gradient projection approach (PGP) for continual learning.  In PGP, we deduce the orthogonal condition for prompt gradient via the self-attention mechanism in vision-transformer.  The condition equations are then solved by conducting Singular Value Decomposition (SVD) on an element-wise sum space between input space and prompt space. We validate our method on diverse datasets and experiments demonstrate the efficiency of reducing forgetting both in class incremental, online class incremental, and task incremental settings.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=EH2O3h7sBI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19108,
    "title": "ResFields: Residual Neural Fields for Spatiotemporal Signals",
    "authors": [
      "Marko Mihajlovic",
      "Sergey Prokudin",
      "Marc Pollefeys",
      "Siyu Tang"
    ],
    "abstract": "Neural fields, a category of neural networks trained to represent high-frequency signals, have gained significant attention in recent years due to their impressive performance in modeling complex 3D data, such as signed distance (SDFs) or radiance fields (NeRFs), via a single multi-layer perceptron (MLP). However, despite the power and simplicity of representing signals with an MLP, these methods still face challenges when modeling large and complex temporal signals due to the limited capacity of MLPs. In this paper, we propose an effective approach to address this limitation by incorporating temporal residual layers into neural fields, dubbed ResFields. It is a novel class of networks specifically designed to effectively represent complex temporal signals. We conduct a comprehensive analysis of the properties of ResFields and propose a matrix factorization technique to reduce the number of trainable parameters and enhance generalization capabilities. Importantly, our formulation seamlessly integrates with existing MLP-based neural fields and consistently improves results across various challenging tasks: 2D video approximation, dynamic shape modeling via temporal SDFs, and dynamic NeRF reconstruction. Lastly, we demonstrate the practical utility of ResFields by showcasing its effectiveness in capturing dynamic 3D scenes from sparse RGBD cameras of a lightweight capture system.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=EHrvRNs2Y0",
    "arxiv_id": "2309.03160",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19107,
    "title": "Parametric Augmentation for Time Series Contrastive Learning",
    "authors": [
      "Xu Zheng",
      "Tianchun Wang",
      "Wei Cheng",
      "Aitian Ma",
      "Haifeng Chen",
      "Mo Sha",
      "Dongsheng Luo"
    ],
    "abstract": "Modern techniques like contrastive learning have been effectively used in many areas, including computer vision, natural language processing, and graph-structured data. Creating positive examples that assist the model in learning robust and discriminative representations is a crucial stage in contrastive learning approaches. Usually, preset human intuition directs the selection of relevant data augmentations. Due to patterns that are easily recognized by humans, this rule of thumb works well in the vision and language domains. However, it is impractical to visually inspect the temporal structures in time series. The diversity of time series augmentations at both the dataset and instance levels makes it difficult to choose meaningful augmentations on the fly. Thus, although prevalent, contrastive learning with data augmentation has been less studied in the time series domain. In this study, we address this gap by analyzing time series data augmentation using information theory and summarizing the most commonly adopted augmentations in a unified format. We then propose a parametric augmentation method, AutoTCL, which can be adaptively employed to support time series representation learning. The proposed approach is encoder-agnostic, allowing it to be seamlessly integrated with different backbone encoders. Experiments on univariate forecasting tasks demonstrate the highly competitive results of our method, with an average 6.5\\%  reduction in MSE and  4.7\\% in MAE over the leading baselines. In classification tasks, AutoTCL achieves a $1.2\\%$ increase in average accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EIPLdFy3vp",
    "arxiv_id": "2402.10434",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19106,
    "title": "Adversarial Supervision Makes Layout-to-Image Diffusion Models Thrive",
    "authors": [
      "Yumeng Li",
      "Margret Keuper",
      "Dan Zhang",
      "Anna Khoreva"
    ],
    "abstract": "Despite the recent advances in large-scale diffusion models, little progress has been made on the layout-to-image (L2I) synthesis task. Current L2I models either suffer from poor editability via text or weak alignment between the generated image and the input layout. This limits their usability in practice. To mitigate this, we propose to integrate adversarial supervision into the conventional training pipeline of L2I diffusion models (ALDM). Specifically, we employ a segmentation-based discriminator which provides explicit feedback to the diffusion generator on the pixel-level alignment between the denoised image and the input layout. To encourage consistent adherence to the input layout over the sampling steps, we further introduce the multistep unrolling strategy. Instead of looking at a single timestep, we unroll a few steps recursively to imitate the inference process, and ask the discriminator to assess the alignment of denoised images with the layout over a certain time window. Our experiments show that ALDM enables layout faithfulness of the generated images, while allowing broad editability via text prompts. Moreover, we showcase its usefulness for practical applications: by synthesizing target distribution samples via text control, we improve domain generalization of semantic segmentation models by a large margin (~12 mIoU points).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EJPIzl7mgc",
    "arxiv_id": "2401.08815",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19105,
    "title": "Exploring the cloud of feature interaction scores in a Rashomon set",
    "authors": [
      "Sichao Li",
      "Rong Wang",
      "Quanling Deng",
      "Amanda S Barnard"
    ],
    "abstract": "Interactions among features are central to understanding the behavior of machine learning models. Recent research has made significant strides in detecting and quantifying feature interactions in single predictive models. However, we argue that the feature interactions extracted from a single pre-specified model may not be trustworthy since: *a well-trained predictive model may not preserve the true feature interactions and there exist multiple well-performing predictive models that differ in feature interaction strengths*. Thus, we recommend exploring feature interaction strengths in a model class of approximately equally accurate predictive models. In this work, we introduce the feature interaction score (FIS) in the context of a Rashomon set, representing a collection of models that achieve similar accuracy on a given task. We propose a general and practical algorithm to calculate the FIS in the model class. We demonstrate the properties of the FIS via synthetic data and draw connections to other areas of statistics. Additionally, we introduce a Halo plot for visualizing the feature interaction variance in high-dimensional space and a swarm plot for analyzing FIS in a Rashomon set. Experiments with recidivism prediction and image classification illustrate how feature interactions can vary dramatically in importance for similarly accurate predictive models. Our results suggest that the proposed FIS can provide valuable insights into the nature of feature interactions in machine learning models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EPNEazJoAg",
    "arxiv_id": "2305.10181",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19013,
    "title": "Universal Jailbreak Backdoors from Poisoned Human Feedback",
    "authors": [
      "Javier Rando",
      "Florian Tram\u00e8r"
    ],
    "abstract": "Reinforcement Learning from Human Feedback (RLHF) is used to align large language models to produce helpful and harmless responses. Yet, these models can be jailbroken by finding adversarial prompts that revert the model to its unaligned behavior. In this paper, we consider a new threat where an attacker poisons the RLHF data to embed a jailbreak trigger into the model as a backdoor. The trigger then acts like a universal sudo command, enabling arbitrary harmful responses without  the need to search for an adversarial prompt. Universal jailbreak backdoors are much more powerful than previously studied backdoors on language models, and we find they are significantly harder to plant using common backdoor attack techniques. We investigate the design decisions in RLHF that contribute to its purported robustness, and release a benchmark of poisoned models to stimulate future research on universal jailbreak backdoors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GxCGsxiAaK",
    "arxiv_id": "2311.14455",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19104,
    "title": "Minimax optimality of convolutional neural networks for infinite dimensional input-output problems and separation from kernel methods",
    "authors": [
      "Yuto Nishimura",
      "Taiji Suzuki"
    ],
    "abstract": "Recent deep learning applications, exemplified by text-to-image tasks, often involve high-dimensional inputs and outputs. While several studies have investigated the function estimation capabilities of deep learning, research on dilated convolutional neural networks (CNNs) has mainly focused on cases where input dimensions are infinite but output dimensions are one-dimensional, similar to many other studies. However, many practical deep learning tasks involve high-dimensional (or even infinite dimensional) inputs and outputs.In this paper, we investigate the optimality of dilated CNNs for estimating a map between infinite-dimensional input and output spaces by analyzing their approximation and estimation abilities. For that purpose, we first show that approximation and estimation errors depend only on the smoothness and decay rate with respect to the infinity norm of the output, and their estimation accuracy actually achieve the {\\it minimax optimal} rate of convergence.Second, we demonstrate that the dilated CNNs outperform {\\it any} linear estimators including kernel ridge regression and $k$-NN estimators in a minimax error sense, highlighting the usefulness of feature learning realized by deep neural networks.Our theoretical analysis particularly explains the success of deep learning in recent high-dimensional input-output tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EW8ZExRZkJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19102,
    "title": "Open-ended VQA benchmarking of Vision-Language models by exploiting Classification datasets and their semantic hierarchy",
    "authors": [
      "Simon Ging",
      "Maria Alejandra Bravo",
      "Thomas Brox"
    ],
    "abstract": "The evaluation of text-generative vision-language models is a challenging yet crucial endeavor. By addressing the limitations of existing Visual Question Answering (VQA) benchmarks and proposing innovative evaluation methodologies, our research seeks to advance our understanding of these models\u2019 capabilities. We propose a novel VQA benchmark based on well-known visual classification datasets which allows a granular evaluation of text-generative vision-language models and their comparison with discriminative vision-language models. To improve assessment of coarse answers on fine-grained classification tasks, we suggest using the semantic hierarchy of the label space to ask automatically generated follow-up questions about the ground-truth category. Finally, we compare traditional NLP and LLM-based metrics for the problem of evaluating model predictions given ground-truth answers. We perform a human evaluation study upon which we base our decision on the final metric. We apply our benchmark to a suite of vision-language models and show a detailed comparison of their abilities on object, action, and attribute classification. Our contributions aim to lay the foundation for more precise and meaningful assessments, facilitating targeted progress in the exciting field of vision-language modeling.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=EXitynZhYn",
    "arxiv_id": "2402.07270",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19100,
    "title": "Is This the Subspace You Are Looking for? An Interpretability Illusion for Subspace Activation Patching",
    "authors": [
      "Aleksandar Makelov",
      "Georg Lange",
      "Atticus Geiger",
      "Neel Nanda"
    ],
    "abstract": "Mechanistic interpretability aims to attribute high-level model behaviors to specific, interpretable learned features. It is hypothesized that these features manifest as directions or low-dimensional subspaces within activation space. Accordingly, recent studies have explored the identification and manipulation of such subspaces to reverse-engineer computations, employing methods such as activation patching. In this work, we demonstrate that na\u00efve approaches to subspace interventions can give rise to interpretability illusions.Specifically, even if patching along a subspace has the intended end-to-end causal effect on model behavior, this effect may be achieved by activating \\emph{a dormant parallel pathway} using a component that is \\textit{causally disconnected} from the model output.We demonstrate this in a mathematical example, realize the example empirically in two different settings (the Indirect Object Identification (IOI) task and factual recall), and argue that activating dormant pathways ought to be prevalent in practice.In the context of factual recall, we further show that the illusion is related to rank-1 fact editing, providing a mechanistic explanation for previous work observing an inconsistency between fact editing performance and fact localisation.However, this does not imply that activation patching of subspaces is intrinsically unfit for interpretability.To contextualize our findings, we also show what a success case looks like in a task (IOI) where prior manual circuit analysis allows an understanding of the location of the ground truth feature. We explore the additional evidence needed to argue that a patched subspace is faithful.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ebt7JgMHv1",
    "arxiv_id": "2311.17030",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19099,
    "title": "Understanding Convergence and Generalization in Federated Learning through Feature Learning Theory",
    "authors": [
      "Wei Huang",
      "Ye Shi",
      "Zhongyi Cai",
      "Taiji Suzuki"
    ],
    "abstract": "Federated Learning (FL) has attracted significant attention as an efficient privacy-preserving approach to distributed learning across multiple clients. Despite extensive empirical research and practical applications, a systematic way to theoretically understand the convergence and generalization properties in FL remains limited. This work aims to establish a unified theoretical foundation for understanding FL through feature learning theory. We focus on a scenario where each client employs a two-layer convolutional neural network (CNN) for local training on their own data. Many existing works analyze the convergence of Federated Averaging (FedAvg) under lazy training with linearizing assumptions in weight space. In contrast, our approach tracks the trajectory of signal learning and noise memorization in FL, eliminating the need for these assumptions. We further show that FedAvg can achieve near-zero test error by effectively increasing signal-to-noise ratio (SNR) in feature learning, while local training without communication achieves a large constant test error. This finding highlights the benefits of communication for generalization in FL. Moreover, our theoretical results suggest that a weighted FedAvg method, based on the similarity of input features across clients, can effectively tackle data heterogeneity issues in FL. Experimental results on both synthetic and real-world datasets verify our theoretical conclusions and emphasize the effectiveness of the weighted FedAvg approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EcetCr4trp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19098,
    "title": "HyperAttention: Long-context Attention in Near-Linear Time",
    "authors": [
      "Insu Han",
      "Rajesh Jayaram",
      "Amin Karbasi",
      "Vahab Mirrokni",
      "David Woodruff",
      "Amir Zandieh"
    ],
    "abstract": "We present an approximate attention mechanism named `HyperAttention` to address the computational challenges posed by the growing complexity of long contexts used in Large Language Models (LLMs). Recent work suggests that in the worst-case scenario, the quadratic time is necessary unless the entries of the attention matrix are bounded or the matrix has low stable rank. We introduce two parameters which measure: (1) the max column norm in the normalized attention matrix, and (2) the ratio of row norms in the unnormalized attention matrix after detecting and removing large entries. We use these fine-grained parameters to capture the hardness of the problem. Despite previous lower bounds, we are able to achieve a linear time sampling algorithm even when the matrix has unbounded entries or a large stable rank, provided the above parameters are small.HyperAttention features a modular design that easily accommodates integration of other fast low-level implementations, particularly FlashAttention. Empirically, employing Locality Sensitive Hashing (LSH) to identify large entries, HyperAttention outperforms existing methods, giving significant speed improvements compared to state-of-the-art solutions like FlashAttention. This development presents substantial implications for enabling LLMs to handle significantly larger contexts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Eh0Od2BJIM",
    "arxiv_id": "2310.05869",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19097,
    "title": "HoloNets: Spectral Convolutions do extend to Directed Graphs",
    "authors": [
      "Christian Koke",
      "Daniel Cremers"
    ],
    "abstract": "Within the graph learning community, conventional wisdom dictates that spectral convolutional networks may only be deployed on undirected graphs: Only there could the existence of a well-defined graph Fourier transform be guaranteed, so that information may be translated between spatial- and spectral domains. Here we show this traditional reliance on the graph Fourier transform to be superfluous: Making use of certain advanced tools from complex analysis and spectral theory, we extend spectral convolutions to directed graphs. We provide a frequency- response interpretation of newly developed filters, investigate the influence of the basis\u2019 used to express filters and discuss the interplay with characteristic operators on which networks are based. In order to thoroughly test the developed general theory, we conduct experiments in real world settings, showcasing that directed spectral convolutional networks provide new state of the art results for  heterophilic node classification and \u2013 as opposed to baselines \u2013 may be rendered stable to resolution-scale varying topological perturbations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EhmEwfavOW",
    "arxiv_id": "2310.02232",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19095,
    "title": "Meta-VBO: Utilizing Prior Tasks in Optimizing Risk Measures with Gaussian Processes",
    "authors": [
      "Quoc Phong Nguyen",
      "Bryan Kian Hsiang Low",
      "Patrick Jaillet"
    ],
    "abstract": "Research on optimizing the risk measure of a blackbox function using Gaussian processes, especially Bayesian optimization (BO) of risk measures, has become increasingly important due to the inevitable presence of uncontrollable variables in real-world applications. Nevertheless, existing works on BO of risk measures start the optimization from scratch for every new task without considering the results of previous tasks. In contrast, its vanilla BO counterpart has received a thorough investigation on utilizing previous tasks to speed up the current task through the body of works on meta-BO which, however, have not considered risk measures. To bridge this gap, this paper presents the first algorithm for meta-BO of risk measures (i.e., value-at-risk (VaR) and the conditional VaR) by introducing a novel adjustment to the upper confidence bound acquisition function. Our proposed algorithm exhibits two desirable properties: (i) invariance to scaling and vertical shifting of the blackbox function and (ii) robustness to previous harmful tasks. We provide a theoretical performance guarantee for our algorithm and empirically demonstrate its performance using several synthetic function benchmarks and real-world objective functions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ElykcDu5YK",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19094,
    "title": "Self-contradictory Hallucinations of Large Language Models: Evaluation, Detection and Mitigation",
    "authors": [
      "Niels M\u00fcndler",
      "Jingxuan He",
      "Slobodan Jenko",
      "Martin Vechev"
    ],
    "abstract": "Large language models (large LMs) are susceptible to producing text that contains hallucinated content. An important instance of this problem is self-contradiction, where the LM generates two contradictory sentences within the same context. In this work, we present a comprehensive investigation into self-contradiction for various instruction-tuned LMs, covering evaluation, detection, and mitigation. Our analysis reveals the prevalence of self-contradictions when LMs generate text for open-domain topics, e.g., in 17.7% of all sentences produced by ChatGPT. Self-contradiction also complements retrieval-based methods, as a large portion of them (e.g., 35.8% for ChatGPT) cannot be verified using Wikipedia. We then propose a novel prompting-based framework designed to effectively detect and mitigate self-contradictions. Our detector achieves high accuracy, e.g., around 80% F1 score when prompting ChatGPT. The mitigation algorithm iteratively refines the generated text to remove contradictory information while preserving text fluency and informativeness. Importantly, our entire framework is applicable to black-box LMs and does not require external grounded knowledge. Our approach is practically effective and has been released as a push-button tool to benefit the public, with an anonymized version at https://iclr9113.com/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EmQSOi1X2f",
    "arxiv_id": "2305.15852",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19093,
    "title": "Building Cooperative Embodied Agents Modularly with Large Language Models",
    "authors": [
      "Hongxin Zhang",
      "Weihua Du",
      "Jiaming Shan",
      "Qinhong Zhou",
      "Yilun Du",
      "Joshua B. Tenenbaum",
      "Tianmin Shu",
      "Chuang Gan"
    ],
    "abstract": "In this work, we address challenging multi-agent cooperation problems with decentralized control, raw sensory observations, costly communication, and multi-objective tasks instantiated in various embodied environments. While previous research either presupposes a cost-free communication channel or relies on a centralized controller with shared observations, we harness the commonsense knowledge, reasoning ability, language comprehension, and text generation prowess of LLMs and seamlessly incorporate them into a cognitive-inspired modular framework that integrates with perception, memory, and execution. Thus building a **Co**operative **E**mbodied **L**anguage **A**gent *CoELA*, who can plan, communicate, and cooperate with others to accomplish long-horizon tasks efficiently. Our experiments on C-WAH and TDW-MAT demonstrate that *CoELA* driven by GPT-4 can surpass strong planning-based methods and exhibit emergent effective communication. Though current Open LMs like LLAMA-2 still underperform, we fine-tune a *CoLLAMA* with data collected with our agents and show how they can achieve promising performance. We also conducted a user study for human-agent interaction and discovered that *CoELA* communicating in natural language can earn more trust and cooperate more effectively with humans. Our research underscores the potential of LLMs for future research in multi-agent cooperation. Videos can be found on the project website https://llm-co.github.io/CoELA/ .",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EnXJfQqy0K",
    "arxiv_id": "2307.02485",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19092,
    "title": "An Emulator for Fine-tuning Large Language Models using Small Language Models",
    "authors": [
      "Eric Mitchell",
      "Rafael Rafailov",
      "Archit Sharma",
      "Chelsea Finn",
      "Christopher D Manning"
    ],
    "abstract": "Widely used language models (LMs) are typically built by scaling up a two-stage training pipeline: a pre-training stage that uses a very large, diverse dataset of text and a fine-tuning (sometimes, 'alignment') stage using more targeted examples of specific behaviors and/or human preferences. While it has been hypothesized that knowledge and skills come from pre-training, and fine-tuning mostly filters this knowledge and skillset, this intuition has not been rigorously tested. In this paper, we test this hypothesis with a novel methodology for scaling these two stages independently, essentially asking, *What would happen if we combined the knowledge learned by a large model during pre-training with the knowledge learned by a small model during fine-tuning (or vice versa)?* Using an RL-based framework derived from recent developments in learning from human preferences, we introduce *emulated fine-tuning (EFT)*, a principled and practical method for sampling from a distribution that approximates the result of pre-training and fine-tuning at different scales. Our experiments with EFT show that scaling up fine-tuning tends to improve helpfulness, while scaling up pre-training tends to improve factuality. Further, we show that EFT enables test-time adjustment of competing behavioral factors like helpfulness and harmlessness without additional training. Finally, we find that a special case of emulated fine-tuning, which we call LM *up-scaling*, avoids resource-intensive fine-tuning of large pre-trained models by ensembling small fine-tuned models with large pre-trained models, essentially 'emulating' the result of fine-tuning the large pre-trained model. Up-scaling consistently improves helpfulness and factuality of widely used pre-trained models like Llama, Llama-2, and Falcon, without additional hyperparameters or training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Eo7kv0sllr",
    "arxiv_id": "2310.12962",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19091,
    "title": "ToRA: A Tool-Integrated Reasoning Agent for Mathematical Problem Solving",
    "authors": [
      "Zhibin Gou",
      "Zhihong Shao",
      "Yeyun Gong",
      "yelong shen",
      "Yujiu Yang",
      "Minlie Huang",
      "Nan Duan",
      "Weizhu Chen"
    ],
    "abstract": "Large language models have made significant progress in various language tasks, yet they still struggle with complex mathematics. In this paper, we propose ToRA a series of Tool-integrated Reasoning Agents designed to solve challenging mathematical problems by seamlessly integrating natural language reasoning with the utilization of external tools (e.g., computation libraries and symbolic solvers), thereby amalgamating the analytical prowess of language and the computational efficiency of tools. To train ToRA, we curate interactive tool-use trajectories on mathematical datasets, apply imitation learning on the annotations, and propose output space shaping to further refine models' reasoning behavior. As a result, ToRA models significantly outperform open-source models on 10 mathematical reasoning datasets across all scales with 13%-19% absolute improvements on average. Notably, ToRA-7B reaches 44.6% on the competition-level dataset MATH, surpassing the best open-source model WizardMath-70B by 22% absolute. ToRA-34B is also the first open-source model that achieves an accuracy exceeding 50% on MATH, which significantly outperforms GPT-4's CoT result, and is competitive with GPT-4 solving problems with programs. Additionally, we conduct a comprehensive analysis of the benefits and remaining challenges of tool interaction for mathematical reasoning, providing valuable insights for future research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ep0TtjVoap",
    "arxiv_id": "2309.17452",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19090,
    "title": "Privileged Sensing Scaffolds Reinforcement Learning",
    "authors": [
      "Edward S. Hu",
      "James Springer",
      "Oleh Rybkin",
      "Dinesh Jayaraman"
    ],
    "abstract": "We need to look at our shoelaces as we first learn to tie them but having mastered this skill, can do it from touch alone. We call this phenomenon \u201csensory scaffolding\u201d: observation streams that are not needed by a master might yet aid a novice learner. We consider such sensory scaffolding setups for training artificial agents. For example, a robot arm may need to be deployed with just a low-cost, robust, general-purpose camera; yet its performance may improve by having privileged training-time-only access to informative albeit expensive and unwieldy motion capture rigs or fragile tactile sensors. For these settings, we propose _Scaffolder_, a reinforcement learning approach which effectively exploits privileged sensing in critics, world models, reward estimators, and other such auxiliary components that are only used at training time, to improve the target policy. For evaluating sensory scaffolding agents, we design a new \u201cS3\u201d suite of ten diverse simulated robotic tasks that explore a wide range of practical sensor setups. Agents must use privileged camera sensing to train blind hurdlers, privileged active visual perception to help robot arms overcome visual occlusions, privileged touch sensors to train robot hands, and more. _Scaffolder_ easily outperforms relevant prior baselines and frequently performs comparably even to policies that have test-time access to the privileged sensors. Website: https://sites.google.com/view/sensory-scaffolding",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EpVe8jAjdx",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19088,
    "title": "Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control",
    "authors": [
      "Neehal Tumma",
      "Mathias Lechner",
      "Noel Loo",
      "Ramin Hasani",
      "Daniela Rus"
    ],
    "abstract": "Developing autonomous agents that can interact with changing environments is an open challenge in machine learning. Robustness is particularly important in these settings as agents are often fit offline on expert demonstrations but deployed online where they must generalize to the closed feedback loop within the environment. In this work, we explore the application of recurrent neural networks to tasks of this nature and understand how a parameterization of their recurrent connectivity influences robustness in closed-loop settings. Specifically, we represent the recurrent connectivity as a function of rank and sparsity and show both theoretically and empirically that modulating these two variables has desirable effects on network dynamics. The proposed low-rank, sparse connectivity induces an interpretable prior on the network that proves to be most amenable for a class of models known as closed-form continuous-time neural networks (CfCs). We find that CfCs with fewer parameters can outperform their full-rank, fully-connected counterparts in the online setting under distribution shift. This yields memory-efficient and robust agents while opening a new perspective on how we can modulate network dynamics through connectivity.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=EriR6Ec69a",
    "arxiv_id": "2310.03915",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19089,
    "title": "Self-supervised Representation Learning from Random Data Projectors",
    "authors": [
      "Yi Sui",
      "Tongzi Wu",
      "Jesse C. Cresswell",
      "Ga Wu",
      "George Stein",
      "Xiao Shi Huang",
      "Xiaochen Zhang",
      "Maksims Volkovs"
    ],
    "abstract": "Self-supervised representation learning (SSRL) has advanced considerably by exploiting the transformation invariance assumption under artificially designed data augmentations. While augmentation-based SSRL algorithms push the boundaries of performance in computer vision and natural language processing, they are often not directly applicable to other data modalities, and can conflict with application-specific data augmentation constraints. This paper presents an SSRL approach that can be applied to any data modality and network architecture because it does not rely on augmentations or masking. Specifically, we show that high-quality data representations can be learned by reconstructing random data projections. We evaluate the proposed approach on a wide range of representation learning tasks that span diverse modalities and real-world applications. We show that it outperforms multiple state-of-the-art SSRL baselines. Due to its wide applicability and strong empirical results, we argue that learning from randomness is a fruitful research direction worthy of attention and further study.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EpYnZpDpsQ",
    "arxiv_id": "2310.07756",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19087,
    "title": "Interpreting Robustness Proofs of Deep Neural Networks",
    "authors": [
      "Debangshu Banerjee",
      "Avaljot Singh",
      "Gagandeep Singh"
    ],
    "abstract": "In recent years numerous methods have been developed to formally verify the robustness of deep neural networks (DNNs). Though the proposed techniques are effective in providing mathematical guarantees about the DNNs' behavior, it is not clear whether the proofs generated by these methods are human understandable. In this paper, we bridge this gap by developing new concepts, algorithms, and representations to generate human understandable insights into the internal workings of DNN robustness proofs. Leveraging the proposed method, we show that the robustness proofs of standard DNNs rely more on spurious input features as compared to the proofs of DNNs trained to be robust. Robustness proofs of the provably robust DNNs filter out a larger number of spurious input features as compared to adversarially trained DNNs, sometimes even leading to the pruning of semantically meaningful input features.The proofs for the DNNs combining adversarial and provably robust training tend to achieve the middle ground.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ev10F9TWML",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19086,
    "title": "Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuning",
    "authors": [
      "Ted Zadouri",
      "Ahmet \u00dcst\u00fcn",
      "Arash Ahmadian",
      "Beyza Ermis",
      "Acyr Locatelli",
      "Sara Hooker"
    ],
    "abstract": "The Mixture of Experts (MoE) is a widely known neural architecture where  an ensemble of specialized sub-models optimizes overall performance with a constant computational cost. However, conventional MoEs pose challenges at scale due to the need to store all experts in memory. In this paper, we push MoE to the limit. We propose extremely parameter-efficient MoE by uniquely combining MoE architecture with lightweight experts.Our MoE architecture outperforms standard parameter-efficient fine-tuning (PEFT) methods and is on par with full fine-tuning by only updating the lightweight experts -- less than 1\\% of an 11B parameters model. Furthermore, our method generalizes to unseen tasks as it does not depend on any prior task knowledge. Our research underscores the versatility of the mixture of experts architecture, showcasing its ability to deliver robust performance even when subjected to rigorous parameter constraints.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EvDeiLv7qc",
    "arxiv_id": "2309.05444",
    "GitHub": [
      "https://github.com/for-ai/parameter-efficient-moe"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19085,
    "title": "DATS: Difficulty-Aware Task Sampler for Meta-Learning Physics-Informed Neural Networks",
    "authors": [
      "Maryam Toloubidokhti",
      "Yubo Ye",
      "Ryan Missel",
      "Xiajun Jiang",
      "Nilesh Kumar",
      "Ruby Shrestha",
      "Linwei Wang"
    ],
    "abstract": "Advancements in deep learning have led to the development of physics-informed neural networks (PINNs) for solving partial differential equations (PDEs) without being supervised by PDE solutions. While vanilla PINNs require training one network per PDE configuration, recent works have showed the potential to meta-learn PINNs across a range of PDE configurations. It is however known that PINN training is associated with different levels of difficulty, depending on the underlying PDE configurations or the number of residual sampling points available. Existing meta-learning approaches, however, treat all PINN tasks equally. We address this gap by introducing a novel difficulty-aware task sampler (DATS) for meta-learning of PINNs. We derive an optimal analytical solution to optimize the probability for sampling individual PINN tasks in order to minimize their validation loss across tasks. We further present two alternative strategies to utilize this sampling probability to either adaptively weigh PINN tasks, or dynamically allocate optimal residual points across tasks. We evaluated DATS against uniform and self-paced task-sampling baselines on two representative meta-PINN models, across four benchmark PDEs as well as three different residual point sampling strategies. The results demonstrated that DATS was able to improve the accuracy of meta-learned PINN solutions when reducing performance disparity across PDE configurations, at only a fraction of residual sampling budgets required by its baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EvyYFSxdgB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19084,
    "title": "RT-Trajectory: Robotic Task Generalization via Hindsight Trajectory Sketches",
    "authors": [
      "Jiayuan Gu",
      "Sean Kirmani",
      "Paul Wohlhart",
      "Yao Lu",
      "Montserrat Gonzalez Arenas",
      "Kanishka Rao",
      "Wenhao Yu",
      "Chuyuan Fu",
      "Keerthana Gopalakrishnan",
      "Zhuo Xu",
      "Priya Sundaresan",
      "Peng Xu",
      "Hao Su",
      "Karol Hausman",
      "Chelsea Finn",
      "Quan Vuong",
      "Ted Xiao"
    ],
    "abstract": "Generalization remains one of the most important desiderata for robust robot learning systems. While recently proposed approaches show promise in generalization to novel objects, semantic concepts, or visual distribution shifts, generalization to new tasks remains challenging. For example, a language-conditioned policy trained on pick-and-place tasks will not be able to generalize to a folding task, even if the arm trajectory of folding is similar to pick-and-place. Our key insight is that this kind of generalization becomes feasible if we represent the task through rough trajectory sketches. We propose a policy conditioning method using such rough trajectory sketches, which we call RT-Trajectory, that is practical, easy to specify, and allows the policy to effectively perform new tasks that would otherwise be challenging to perform. We find that trajectory sketches strike a balance between being detailed enough to express low-level motion-centric guidance while being coarse enough to allow the learned policy to interpret the trajectory sketch in the context of situational visual observations. In addition, we show how trajectory sketches can provide a useful interface to communicate with robotic policies -- they can be specified through simple human inputs like drawings or videos, or through automated methods such as modern image-generating or waypoint-generating methods. We evaluate RT-Trajectory at scale on a variety of real-world robotic tasks, and find that RT-Trajectory is able to perform a wider range of tasks compared to language-conditioned and goal-conditioned policies, when provided the same training data.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=F1TKzG8LJO",
    "arxiv_id": "2311.01977",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19081,
    "title": "Sparse Autoencoders Find Highly Interpretable Features in Language Models",
    "authors": [
      "Robert Huben",
      "Hoagy Cunningham",
      "Logan Riggs Smith",
      "Aidan Ewart",
      "Lee Sharkey"
    ],
    "abstract": "One of the roadblocks to a better understanding of neural networks' internals is \\textit{polysemanticity}, where neurons appear to activate in multiple, semantically distinct contexts. Polysemanticity prevents us from identifying concise, human-understandable explanations for what neural networks are doing internally. One hypothesised cause of polysemanticity is \\textit{superposition}, where neural networks represent more features than they have neurons by assigning features to an overcomplete set of directions in activation space, rather than to individual neurons. Here, we attempt to identify those directions, using sparse autoencoders to reconstruct the internal activations of a language model. These autoencoders learn sets of sparsely activating features that are more interpretable and monosemantic than directions identified by alternative approaches, where interpretability is measured by automated methods. Moreover, we show that with our learned set of features, we can pinpoint the features that are causally responsible for counterfactual behaviour on the indirect object identification task \\citep{wang2022interpretability} to a finer degree than previous decompositions. This work indicates that it is possible to resolve superposition in language models using a scalable, unsupervised method. Our method may serve as a foundation for future mechanistic interpretability work, which we hope will enable greater model transparency and steerability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=F76bwRSLeK",
    "arxiv_id": "2309.08600",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19080,
    "title": "GTMGC: Using Graph Transformer to Predict Molecule\u2019s Ground-State Conformation",
    "authors": [
      "Guikun Xu",
      "Yongquan Jiang",
      "PengChuan Lei",
      "Yan Yang",
      "Jim Chen"
    ],
    "abstract": "The ground-state conformation of a molecule is often decisive for its properties. However, experimental or computational methods, such as density functional theory (DFT), are time-consuming and labor-intensive for obtaining this conformation. Deep learning (DL) based molecular representation learning (MRL) has made significant advancements in molecular modeling and has achieved remarkable results in various tasks. Consequently, it has emerged as a promising approach for directly predicting the ground-state conformation of molecules. In this regard, we introduce GTMGC, a novel network based on Graph-Transformer (GT) that seamlessly predicts the spatial configuration of molecules in a 3D space from their 2D topological architecture in an end-to-end manner. Moreover, we propose a novel self-attention mechanism called Molecule Structural Residual Self-Attention (MSRSA) for molecular structure modeling. This mechanism not only guarantees high model performance and easy implementation but also lends itself well to other molecular modeling tasks. Our method has been evaluated on the Molecule3D benchmark dataset and the QM9 dataset. Experimental results demonstrate that our approach achieves remarkable performance and outperforms current state-of-the-art methods as well as the widely used open-source software RDkit.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=F7QnIKlC1N",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19083,
    "title": "Fixed Non-negative Orthogonal Classifier: Inducing Zero-mean Neural Collapse with Feature Dimension Separation",
    "authors": [
      "Hoyong Kim",
      "Kangil Kim"
    ],
    "abstract": "Fixed classifiers in neural networks for classification problems have demonstrated cost efficiency and even outperformed learnable classifiers in some popular benchmarks when incorporating orthogonality. Despite these advantages, prior research has yet to investigate the training dynamics of fixed orthogonal classifiers on neural collapse, a recently clarified phenomenon that last-layer features converge to a specific form, called simplex ETF, in training classification models involving the post-zero-error phase. Ensuring this phenomenon is critical for obtaining global optimality in a layer-peeled model, potentially leading to enhanced performance in practice. However, fixed orthogonal classifiers cannot invoke neural collapse due to their geometric limitations. To overcome the limits, we analyze a $\\textit{zero-mean neural collapse}$ considering the orthogonality in non-negative Euclidean space. Then, we propose a $\\textit{fixed non-negative orthogonal classifier}$ that induces the optimal solution and maximizes the margin of an orthogonal layer-peeled model by satisfying the properties of zero-mean neural collapse. Building on this foundation, we exploit a $\\textit{feature dimension separation}$ effect inherent in our classifier for further purposes: (1) enhances softmax masking by mitigating feature interference in continual learning and (2) tackles the limitations of mixup on the hypersphere in imbalanced learning. We conducted comprehensive experiments on various datasets and architectures and demonstrated significant performance improvements.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=F4bmOrmUwc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19079,
    "title": "Explaining Kernel Clustering via Decision Trees",
    "authors": [
      "Maximilian Fleissner",
      "Leena Chennuru Vankadara",
      "Debarghya Ghoshdastidar"
    ],
    "abstract": "Despite the growing popularity of explainable and interpretable machine learning, there is still surprisingly limited work on inherently interpretable clustering methods. Recently, there has been a surge of interest in explaining the classic k-means algorithm, leading to efficient algorithms that approximate k-means clusters using axis-aligned decision trees. However, interpretable variants of k-means have limited applicability in practice, where more flexible clustering methods are often needed to obtain useful partitions of the data. In this work, we investigate interpretable kernel clustering, and propose algorithms that construct decision trees to approximate the partitions induced by kernel k-means, a nonlinear extension of k-means. We further build on previous work on explainable k-means and demonstrate how a suitable choice of features allows preserving interpretability without sacrificing approximation guarantees on the interpretable model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FAGtjl7HOw",
    "arxiv_id": "2402.09881",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19078,
    "title": "LOQA: Learning with Opponent Q-Learning Awareness",
    "authors": [
      "Milad Aghajohari",
      "Juan Agustin Duque",
      "Tim Cooijmans",
      "Aaron Courville"
    ],
    "abstract": "In various real-world scenarios, interactions among agents often resemble the dynamics of general-sum games, where each agent strives to optimize its own utility. Despite the ubiquitous relevance of such settings, decentralized machine learning algorithms have struggled to find equilibria that maximize individual utility while preserving social welfare. In this paper we introduce Learning with Opponent Q-Learning Awareness (LOQA) , a novel reinforcement learning algorithm tailored to optimizing an agent's individual utility while fostering cooperation among adversaries in partially competitive environments. LOQA assumes that each agent samples actions proportionally to their action-value function Q. Experimental results demonstrate the effectiveness of LOQA at achieving state-of-the-art performance in benchmark scenarios such as the Iterated Prisoner's Dilemma and the Coin Game. LOQA achieves these outcomes with a significantly reduced computational footprint compared to previous works, making it a promising approach for practical multi-agent applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FDQF6A1s6M",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19076,
    "title": "Few-shot Hybrid Domain Adaptation of Image Generator",
    "authors": [
      "Hengjia Li",
      "Yang Liu",
      "Linxuan Xia",
      "Yuqi Lin",
      "Wenxiao Wang",
      "Tu Zheng",
      "Zheng Yang",
      "Xiaohui Zhong",
      "Xiaobo Ren",
      "Xiaofei He"
    ],
    "abstract": "Can a pre-trained generator be adapted to the hybrid of multiple target domains and generate images with integrated attributes of them? In this work, we introduce a new task -- Few-shot $\\textit{Hybrid Domain Adaptation}$ (HDA). Given a source generator and several target domains, HDA aims to acquire an adapted generator that preserves the integrated attributes of all target domains, without overriding the source domain's characteristics. Compared with $\\textit{Domain Adaptation}$ (DA), HDA offers greater flexibility and versatility to adapt generators to more composite and expansive domains. Simultaneously, HDA also presents more challenges than DA as we have access only to images from individual target domains and lack authentic images from the hybrid domain. To address this issue, we introduce a discriminator-free framework that directly encodes different domains' images into well-separable subspaces. To achieve HDA, we propose a novel directional subspace loss comprised of a distance loss and a direction loss. Concretely, the distance loss blends the attributes of all target domains by reducing the distances from generated images to all target subspaces. The direction loss preserves the characteristics from the source domain by guiding the adaptation along the perpendicular to subspaces. Experiments show that our method can obtain numerous domain-specific attributes in a single adapted generator, which surpasses the baseline methods in semantic similarity, image fidelity, and cross-domain consistency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FE2e8664Sl",
    "arxiv_id": "2310.19378",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19075,
    "title": "Multimarginal Generative Modeling with Stochastic Interpolants",
    "authors": [
      "Michael Samuel Albergo",
      "Nicholas Matthew Boffi",
      "Michael Lindsey",
      "Eric Vanden-Eijnden"
    ],
    "abstract": "Given a set of $K$ probability densities, we consider the multimarginal generative modeling problem of learning a joint distribution that recovers these densities as marginals. The structure of this joint distribution should identify multi-way correspondences among the prescribed marginals. We formalize an approach to this task within a generalization of the stochastic interpolant framework, leading to efficient learning algorithms built upon dynamical transport of measure. Our generative models are defined by velocity and score fields that can be characterized as the minimizers of simple quadratic objectives, and they are defined on a simplex that generalizes the time variable in the usual dynamical transport framework. The resulting transport on the simplex is influenced by all marginals, and we show that multi-way correspondences can be extracted. The identification of such correspondences has applications to style transfer, algorithmic fairness, and data decorruption.  In addition, the multimarginal perspective enables an efficient algorithm for optimizing the dynamical transport cost in the ordinary two-marginal setting. We demonstrate these capacities with several numerical examples.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FHqAzWl2wE",
    "arxiv_id": "2310.03695",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19074,
    "title": "CLIP the Bias: How Useful is Balancing Data in Multimodal Learning?",
    "authors": [
      "Ibrahim Alabdulmohsin",
      "Xiao Wang",
      "Andreas Peter Steiner",
      "Priya Goyal",
      "Alexander D'Amour",
      "Xiaohua Zhai"
    ],
    "abstract": "We investigate the effectiveness of data-balancing for mitigating biases in contrastive language-image pretraining (CLIP) models, identifying areas of strength and limitation. First, we reaffirm prior conclusions that CLIP models can inadvertently absorb societal stereotypes. To counter this, we present a novel data-balancing algorithm designed to reduce both representation and association biases (i.e. first- and second-order statistics) in multimodal datasets. We use this algorithm to conduct an in-depth analysis taking into account various factors, such as the model, representation, and training data size. Our study also explores the dynamic nature of how CLIP models learn and unlearn biases. In particular, we find that fine-tuning is effective in countering representation biases, though its impact diminishes for association biases. In addition, data balancing has a mixed impact on quality: it tends to improve zero- and few-shot classification but can hurt retrieval, which we provide an explanation for. We conclude with a set of recommendations for improving the efficacy of data balancing in multimodal systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FIGXAxr9E4",
    "arxiv_id": "2403.04547",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19073,
    "title": "QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models",
    "authors": [
      "Jing Liu",
      "Ruihao Gong",
      "Xiuying Wei",
      "Zhiwei Dong",
      "Jianfei Cai",
      "Bohan Zhuang"
    ],
    "abstract": "Large Language Models (LLMs) have demonstrated unparalleled efficacy in natural language processing. However, their high computational demands and memory overheads hinder their broad deployment. To address this, two quantization strategies emerge, including Quantization-Aware Training (QAT) and Post-Training Quantization (PTQ). For LLMs, the billions of parameters make the QAT impractical due to the prohibitive training cost and thus PTQ becomes more prevalent. In existing studies, activation outliers in particular channels are identified as the biggest challenge to PTQ accuracy. They propose to transform the magnitudes from activations to weights, which however offers limited alleviation or suffers from unstable gradients, resulting in a severe performance drop at low-bitwidth. In this paper, we propose QLLM, an accurate and efficient low-bitwidth PTQ method designed for LLMs. QLLM introduces an adaptive channel reassembly technique that reallocates the magnitude of outliers to other channels, thereby mitigating their impact on the quantization range. This is achieved by channel disassembly and channel assembly, which first breaks down the outlier channels into several sub-channels to ensure a more balanced distribution of activation magnitudes. Then similar channels are merged to maintain the original channel number for efficiency. Additionally, an adaptive strategy is designed to autonomously determine the optimal number of sub-channels for channel disassembly. To further compensate for the performance loss caused by quantization, we propose an efficient tuning method that only learns a small number of low-rank weights while freezing the pre-trained quantized model. After training, these low-rank parameters can be fused into the frozen weights without affecting inference. Extensive experiments on LLaMA-1 and LLaMA-2 show that QLLM is able to obtain accurate quantized models efficiently. For example, QLLM quantizes the 4-bit LLaMA-2-70B within 10 hours on a single A100-80G GPU, outperforming the previous state-of-the-art method by 7.89% on the average accuracy across five zero-shot tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FIplmUWdm3",
    "arxiv_id": "2310.08041",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19069,
    "title": "Post-hoc bias scoring is optimal for fair classification",
    "authors": [
      "Wenlong Chen",
      "Yegor Klochkov",
      "Yang Liu"
    ],
    "abstract": "We consider a binary classification problem under group fairness constraints, which can be one of Demographic Parity (DP), Equalized Opportunity (EOp), or Equalized Odds (EO). We propose an explicit characterization of Bayes optimal classifier under the fairness constraints, which turns out to be a simple modification rule of the unconstrained classifier. Namely, we introduce a novel instance-level measure of bias, which we call bias score, and the modification rule is a simple linear rule on top of the finite amount of bias scores. Based on this characterization, we develop a post-hoc approach that allows us to adapt to fairness constraints while maintaining high accuracy. In the case of DP and EOp constraints, the modification rule is thresholding a single bias score, while in the case of EO constraints we are required to fit a linear modification rule with 2 parameters. The method can also be applied for composite group-fairness criteria, such as ones involving several sensitive attributes. We achieve competitive or better performance compared to both in-processing and post-processing methods across three datasets: Adult, COMPAS, and CelebA. Unlike most post-processing methods, we do not require access to sensitive attributes during the inference time.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=FM5xfcaR2Y",
    "arxiv_id": "2310.05725",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19068,
    "title": "Gradual Optimization Learning for Conformational Energy Minimization",
    "authors": [
      "Artem Tsypin",
      "Leonid Anatolievich Ugadiarov",
      "Kuzma Khrabrov",
      "Alexander Telepov",
      "Egor Rumiantsev",
      "Alexey Skrynnik",
      "Aleksandr Panov",
      "Dmitry P. Vetrov",
      "Elena Tutubalina",
      "Artur Kadurin"
    ],
    "abstract": "Molecular conformation optimization is crucial to computer-aided drug discovery and materials design.Traditional energy minimization techniques rely on iterative optimization methods that use molecular forces calculated by a physical simulator (oracle) as anti-gradients.However, this is a computationally expensive approach that requires many interactions with a physical simulator.One way to accelerate this procedure is to replace the physical simulator with a neural network.Despite recent progress in neural networks for molecular conformation energy prediction, such models are prone to distribution shift, leading to inaccurate energy minimization.We find that the quality of energy minimization with neural networks can be improved by providing optimization trajectories as additional training data.Still, it takes around $5 \\times 10^5$ additional conformations to match the physical simulator's optimization quality.In this work, we present the Gradual Optimization Learning Framework (GOLF) for energy minimization with neural networks that significantly reduces the required additional data.The framework consists of an efficient data-collecting scheme and an external optimizer.The external optimizer utilizes gradients from the energy prediction model to generate optimization trajectories, and the data-collecting scheme selects additional training data to be processed by the physical simulator. Our results demonstrate that the neural network trained with GOLF performs \\textit{on par} with the oracle on a benchmark of diverse drug-like molecules using $50$x less additional data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FMMF1a9ifL",
    "arxiv_id": "2311.06295",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19067,
    "title": "SEINE: Short-to-Long Video Diffusion Model for Generative Transition and Prediction",
    "authors": [
      "Xinyuan Chen",
      "Yaohui Wang",
      "Lingjun Zhang",
      "Shaobin Zhuang",
      "Xin Ma",
      "Jiashuo Yu",
      "Yali Wang",
      "Dahua Lin",
      "Yu Qiao",
      "Ziwei Liu"
    ],
    "abstract": "Recently video generation has achieved substantial progress with realistic results. Nevertheless, existing AI-generated videos are usually very short clips (\"shot-level'') depicting a single scene. To deliver a coherent long video (\"story-level''), it is desirable to have creative transition and prediction effects across different clips. This paper presents a short-to-long video diffusion model, SEINE, that focuses on generative transition and prediction. The goal is to generate high-quality long videos with smooth and creative transitions between scenes and varying lengths of shot-level videos. Specifically, we propose a random-mask video diffusion model to automatically generate transitions based on textual descriptions. By providing the images of different scenes as inputs, combined with text-based control, our model generates transition videos that ensure coherence and visual quality. Furthermore, the model can be readily extended to various tasks such as image-to-video animation and autoregressive video prediction. To conduct a comprehensive evaluation of this new generative task, we propose three assessing criteria for smooth and creative transition: temporal consistency, semantic similarity, and video-text semantic alignment. Extensive experiments validate the effectiveness of our approach over existing methods for generative transition and prediction, enabling the creation of story-level long videos.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FNq3nIvP4F",
    "arxiv_id": "2310.20700",
    "GitHub": [
      "https://github.com/Vchitect/SEINE"
    ],
    "Space": [
      "Vchitect/SEINE"
    ],
    "Model": [
      "Vchitect/SEINE"
    ],
    "Dataset": []
  },
  {
    "id": 19064,
    "title": "ZeroFlow: Scalable Scene Flow via Distillation",
    "authors": [
      "Kyle Vedder",
      "Neehar Peri",
      "Nathaniel Eliot Chodosh",
      "Ishan Khatri",
      "ERIC EATON",
      "Dinesh Jayaraman",
      "Yang Liu",
      "Deva Ramanan",
      "James Hays"
    ],
    "abstract": "Scene flow estimation is the task of describing the 3D motion field between temporally successive point clouds. State-of-the-art methods use strong priors and test-time optimization techniques, but require on the order of tens of seconds to process full-size point clouds, making them unusable as computer vision primitives for real-time applications such as open world object detection. Feedforward methods are considerably faster, running on the order of tens to hundreds of milliseconds for full-size point clouds, but require expensive human supervision. To address both limitations, we propose _Scene Flow via Distillation_, a simple, scalable distillation framework that uses a label-free optimization method to produce pseudo-labels to supervise a feedforward model. Our instantiation of this framework, _ZeroFlow_, achieves **state-of-the-art** performance on the _Argoverse 2 Self-Supervised Scene Flow Challenge_ while using zero human labels by simply training on large-scale, diverse unlabeled data. At test-time, ZeroFlow is over 1000$\\times$ faster than label-free state-of-the-art optimization-based methods on full-size point clouds (34 FPS vs 0.028 FPS) and over 1000$\\times$ cheaper to train on unlabeled data compared to the cost of human annotation (\\\\$394 vs ~\\\\$750,000). To facilitate further research, we will release our code, trained model weights, and high quality pseudo-labels for the Argoverse 2 and Waymo Open datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FRCHDhbxZF",
    "arxiv_id": "2305.10424",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19063,
    "title": "MVDream: Multi-view Diffusion for 3D Generation",
    "authors": [
      "Yichun Shi",
      "Peng Wang",
      "Jianglong Ye",
      "Long Mai",
      "Kejie Li",
      "Xiao Yang"
    ],
    "abstract": "We introduce MVDream, a multi-view diffusion model that is able to generate consistent multi-view images from a given text prompt. Learning from both 2D and 3D data, a multi-view diffusion model can achieve the generalizability of 2D diffusion models and the consistency of 3D renderings. We demonstrate that such a multi-view prior can serve as a generalizable 3D prior that is agnostic to 3D representations. It can be applied to 3D generation via Score Distillation Sampling, significantly enhancing the consistency and stability of existing 2D-lifting methods. It can also learn new concepts from a few 2D examples, akin to DreamBooth, but for 3D generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FUgrjq2pbB",
    "arxiv_id": "2308.16512",
    "GitHub": [
      "https://github.com/bytedance/MVDream"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19061,
    "title": "Neural-Symbolic Recursive Machine for Systematic Generalization",
    "authors": [
      "Qing Li",
      "Yixin Zhu",
      "Yitao Liang",
      "Ying Nian Wu",
      "Song-Chun Zhu",
      "Siyuan Huang"
    ],
    "abstract": "Current learning models often struggle with human-like systematic generalization; learning compositional rules from limited data and extrapolating them to unseen combinations. To address this, we introduce Neural-Symbolic Recursive Machine (NSR), a model whose core representation is a Grounded Symbol System (GSS ), with its combinatorial syntax and semantics emerging entirely from the training data. The NSR adopts a modular approach, incorporating neural perception, syntactic parsing, and semantic reasoning, which are jointly learned through a deduction-abduction algorithm. We establish that NSR possesses sufficient expressiveness to handle a variety of sequence-to-sequence tasks and attains superior systematic generalization, thanks to the inductive biases of equivariance and recursiveness inherent in each module. We assess NSR \u2019s performance against four rigorous benchmarks designed to test systematic generalization: SCAN for semantic parsing, PCFG for string manipulation, HINT for arithmetic reasoning, and a task involving compositional machine translation. Our results indicate that NSR outperforms existing neural or hybrid models in terms of generalization and transferability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FWJAmwE0xH",
    "arxiv_id": "2210.01603",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19059,
    "title": "OVOR: OnePrompt with Virtual Outlier Regularization for Rehearsal-Free Class-Incremental Learning",
    "authors": [
      "Wei-Cheng Huang",
      "Chun-Fu Chen",
      "Hsiang Hsu"
    ],
    "abstract": "Recent works have shown that by using large pre-trained models along with learnable prompts, rehearsal-free methodsfor class-incremental learning (CIL) settings can achieve superior performance to prominent rehearsal-based ones.Rehearsal-free CIL methods struggle with distinguishing classes from different tasks, as those are not trained together.In this work we propose a regularization method based on virtual outliers to tighten decision boundaries of the classifier,such that confusion of classes among different tasks is mitigated.Recent prompt-based methods often require a pool of task-specific prompts, in order to prevent overwriting knowledgeof previous tasks with that of the new task, leading to extra computation in querying and composing anappropriate prompt from the pool.This additional cost can be eliminated, without sacrificing accuracy, as we reveal in the paper.We illustrate that a simplified prompt-based method can achieve results comparable toprevious state-of-the-art (SOTA) methods equipped with a prompt pool, using much less learnable parameters and lower inference cost.Our regularization method has demonstrated its compatibility with different prompt-based methods, boostingthose previous SOTA rehearsal-free CIL methods' accuracy on the ImageNet-R and CIFAR-100 benchmarks. Our source code is available at https://github.com/jpmorganchase/ovor.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FbuyDzZTPt",
    "arxiv_id": "2402.04129",
    "GitHub": [
      "https://github.com/jpmorganchase/ovor"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19058,
    "title": "AlpaGasus: Training a Better Alpaca with Fewer Data",
    "authors": [
      "Lichang Chen",
      "Shiyang Li",
      "Jun Yan",
      "Hai Wang",
      "Kalpa Gunaratna",
      "Vikas Yadav",
      "Zheng Tang",
      "Vijay Srinivasan",
      "Tianyi Zhou",
      "Heng Huang",
      "Hongxia Jin"
    ],
    "abstract": "Large language models~(LLMs) strengthen instruction-following capability through instruction-finetuning (IFT) on supervised instruction/response data. However, widely used IFT datasets (e.g., Alpaca's 52k data) surprisingly contain many low-quality instances with incorrect or irrelevant responses, which are misleading and detrimental to IFT.  In this paper, we propose a simple and effective data selection strategy that automatically identifies and removes low-quality data using a strong LLM (e.g., ChatGPT). To this end, we introduce Alpagasus, which is finetuned on only 9k high-quality data filtered from the 52k Alpaca data. Alpagasus significantly outperforms the original Alpaca as evaluated by GPT-4 on multiple test sets and the controlled human study. Its 13B variant matches $>90\\%$ performance of its teacher LLM (i.e., Text-Davinci-003) on test tasks. It also provides 5.7x faster training, reducing the training time for a 7B variant from 80 minutes (for Alpaca) to 14 minutes \\footnote{We apply IFT for the same number of epochs as Alpaca(7B) but on fewer data, using 4$\\times$NVIDIA A100 (80GB) GPUs and following the original Alpaca setting and hyperparameters.}.  In the experiment, we also demonstrate that our method can work not only for machine-generated datasets but also for human-written datasets. Overall, Alpagasus demonstrates a novel data-centric IFT paradigm that can be generally applied to instruction-tuning data, leading to faster training and better instruction-following models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FdVXgSJhvz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19333,
    "title": "Learning Personalized Causally Invariant Representations for Heterogeneous Federated Clients",
    "authors": [
      "Xueyang Tang",
      "Song Guo",
      "Jie ZHANG",
      "Jingcai Guo"
    ],
    "abstract": "Personalized federated learning (PFL) has gained great success in tackling the scenarios where target datasets are heterogeneous across the local clients. However, the application of the existing PFL methods to real-world setting is hindered by the common assumption that the test data on each client is in-distribution (IND) with respect to its training data. Due to the bias of training dataset, the modern machine learning model prefers to rely on shortcut which can perform well on the training data but fail to generalize to the unseen test data that is out-of-distribution (OOD). This pervasive phenomenon is called shortcut learning and has attracted plentiful efforts in centralized situations. In PFL, the limited data diversity on federated clients makes mitigating shortcut and meanwhile preserving personalization knowledge rather difficult. In this paper, we analyse this challenging problem by formulating the structural causal models (SCMs) for heterogeneous federated clients. From the proposed SCMs, we derive two significant causal signatures which inspire a provable shortcut discovery and removal method under federated learning, namely FedSDR. Specifically, FedSDR is divided into two steps: 1) utilizing the available training data distributed among local clients to discover all the shortcut features in a collaborative manner. 2) developing the optimal personalized causally invariant predictor for each client by eliminating the discovered shortcut features. We provide theoretical analysis to prove that our method can draw complete shortcut features and produce the optimal personalized invariant predictor that can generalize to unseen OOD data on each client. The experimental results on diverse datasets validate the superiority of FedSDR over the state-of-the-art PFL methods on OOD generalization performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8FHWkY0SwF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19012,
    "title": "PINNACLE: PINN Adaptive ColLocation and Experimental points selection",
    "authors": [
      "Gregory Kang Ruey Lau",
      "Apivich Hemachandra",
      "See-Kiong Ng",
      "Bryan Kian Hsiang Low"
    ],
    "abstract": "Physics-Informed Neural Networks (PINNs), which incorporate PDEs as soft constraints, train with a composite loss function that contains multiple training point types: different types of collocation points chosen during training to enforce each PDE and initial/boundary conditions, and experimental points which are usually costly to obtain via experiments or simulations. Training PINNs using this loss function is challenging as it typically requires selecting large numbers of points of different types, each with different training dynamics. Unlike past works that focused on the selection of either collocation or experimental points, this work introduces PINN Adaptive ColLocation and Experimental points selection (PINNACLE), the first algorithm that jointly optimizes the selection of all training point types, while automatically adjusting the proportion of collocation point types as training progresses. PINNACLE uses information on the interactions among training point types, which had not been considered before, based on an analysis of PINN training dynamics via the Neural Tangent Kernel (NTK). We theoretically show that the criterion used by PINNACLE is related to the PINN generalization error, and empirically demonstrate that PINNACLE is able to outperform existing point selection methods for forward, inverse, and transfer learning problems.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=GzNaCp6Vcg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19010,
    "title": "A unique M-pattern for micro-expression spotting in long videos",
    "authors": [
      "Jinxuan Wang",
      "Shiting Xu",
      "Tong Zhang"
    ],
    "abstract": "Micro-expression spotting (MES) is challenging since the small magnitude of micro-expression (ME) makes them susceptible to global movements like head rotation. However, the unique movement pattern and inherent characteristics of ME allow them to be distinguished from other movements. Existing MES methods based on fixed reference frame degrade optical flow accuracy and are overly dependent on facial alignment. In this paper, we propose a skip-$k$-frame block-wise main directional mean optical flow (MDMO) feature for MES based on unfixed reference frame. By employing skip-$k$-frame strategy, we substantiate the existence of a distinct and exclusive movement pattern in ME, called M-pattern due to its feature curve resembling the letter `M'. Based on M-pattern and characteristics of ME, we then provide a novel spotting rules to precisely locate ME intervals. Block-wise MDMO feature is capable of removing global movements without compromising complete ME movements in the early feature extraction stage. Besides, A novel pixelmatch-based facial alignment algorithm with dynamic update of reference frame is proposed to better align facial images and reduce jitter between frames. Experimental results on CAS(ME)$^2$, SAMM-LV and CASME II validate the proposed methods are superior to the state-of-the-art methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=H396R79GiQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19054,
    "title": "A Versatile Causal Discovery Framework to Allow Causally-Related Hidden Variables",
    "authors": [
      "Xinshuai Dong",
      "Biwei Huang",
      "Ignavier Ng",
      "Xiangchen Song",
      "Yujia Zheng",
      "Songyao Jin",
      "Roberto Legaspi",
      "Peter Spirtes",
      "Kun Zhang"
    ],
    "abstract": "Most existing causal discovery methods rely on the assumption of no latent confounders, limiting their applicability in solving real-life problems. In this paper, we introduce a novel, versatile framework for causal discovery that accommodates the presence of causally-related hidden variables almost everywhere in the causal network (for instance, they can be effects of measured variables), based on rank information of covariance matrix over measured variables. We start by investigating the efficacy of rank in comparison to conditional independence and, theoretically, establish necessary and sufficient conditions for the identifiability of certain latent structural patterns. Furthermore, we develop a  Rank-based Latent Causal Discovery algorithm, RLCD, that can efficiently locate hidden variables, determine their cardinalities, and discover the entire causal structure over both measured and hidden ones. We also show that, under certain graphical conditions, RLCD correctly identifies the Markov Equivalence Class of the whole latent causal graph asymptotically. Experimental results on both synthetic and real-world personality data sets demonstrate the efficacy of the proposed approach in finite-sample cases. Our code will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FhQSGhBlqv",
    "arxiv_id": "2312.11001",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19053,
    "title": "Let's do the time-warp-attend: Learning topological invariants of dynamical systems",
    "authors": [
      "Noa Moriel",
      "Matt Ricci",
      "Mor Nitzan"
    ],
    "abstract": "Dynamical systems across the sciences, from electrical circuits to ecological networks, undergo qualitative and often catastrophic changes in behavior called \\textit{bifurcations} when their underlying parameters cross a threshold. Existing methods predict oncoming catastrophes from time-series in individual systems but struggle both to categorize qualitative dynamical regimes across diverse systems and to generalize to real data. To address this challenge, we propose a data-driven, physically-informed deep-learning framework for classifying dynamical regimes and characterizing bifurcation boundaries based on the extraction of topologically invariant features. We focus on the paradigmatic case of the supercritical Hopf bifurcation, which is used to model periodic dynamics across a wide range of applications. Our convolutional attention method is trained with data augmentations that encourage the learning of topological invariants which can be used to detect bifurcation boundaries in unseen systems and to design models of biological systems like oscillatory gene regulatory networks. We further demonstrate our method's use in analyzing real data, recovering distinct proliferation and differentiation dynamics along pancreatic endocrinogenesis trajectory in gene expression space based on single-cell data. Our method provides valuable insights into the qualitative, long-term behavior of a wide range of dynamical systems as well as detect bifurcations or catastrophic transitions in large-scale physical and biological systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Fj7Fzm5lWL",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19009,
    "title": "Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuning",
    "authors": [
      "Haobo SONG",
      "Hao Zhao",
      "Soumajit Majumder",
      "Tao Lin"
    ],
    "abstract": "Fine-tuning large pre-trained foundation models, such as the 175B GPT-3, has become the prevailing approach for downstream tasks. While parameter-efficient fine-tuning methods have been proposed and proven effective without retraining all model parameters, their performance is limited by the capacity of incremental modules, especially under constrained parameter budgets.To overcome this challenge, we propose CAPABOOST, a simple yet effective strategy that enhances model capacity by leveraging low-rank updates through parallel weight modules in target layers. By applying static random masks to the shared weight matrix, CAPABOOST constructs a diverse set of weight matrices, effectively increasing the rank of incremental weights without adding parameters. Notably, our approach can be seamlessly integrated into various existing parameter-efficient fine-tuning methods. We extensively validate the efficacy of CAPABOOST through experiments on diverse downstream tasks, including natural language understanding, question answering, and image classification. Our results demonstrate significant improvements over baselines, without incurring additional computationor storage costs. We will make our code and benchmark publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=H3IUunLy8s",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19051,
    "title": "Incentive-Aware Federated Learning with Training-Time Model Rewards",
    "authors": [
      "Zhaoxuan Wu",
      "Mohammad Mohammadi Amiri",
      "Ramesh Raskar",
      "Bryan Kian Hsiang Low"
    ],
    "abstract": "In federated learning (FL), incentivizing contributions of training resources (e.g., data, compute) from potentially competitive clients is crucial. Existing incentive mechanisms often distribute post-training monetary rewards, which suffer from practical challenges of timeliness and feasibility of the rewards. Rewarding the clients after the completion of training may incentivize them to abort the collaboration, and monetizing the contribution is challenging in practice. To address these problems, we propose an incentive-aware algorithm that offers differentiated training-time model rewards for each client at each FL iteration. We theoretically prove that such a $\\textit{local}$ design ensures the $\\textit{global}$ objective of client incentivization. Through theoretical analyses, we further identify the issue of error propagation in model rewards and thus propose a stochastic reference-model recovery strategy to ensure theoretically that all the clients eventually obtain the optimal model in the limit. We perform extensive experiments to demonstrate the superior incentivizing performance of our method compared to existing baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FlY7WQ2hWS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19050,
    "title": "DisenBooth: Identity-Preserving Disentangled Tuning for Subject-Driven Text-to-Image Generation",
    "authors": [
      "Hong Chen",
      "Yipeng Zhang",
      "Simin Wu",
      "Xin Wang",
      "Xuguang Duan",
      "Yuwei Zhou",
      "Wenwu Zhu"
    ],
    "abstract": "Subject-driven text-to-image generation aims to generate customized images of the given subject based on the text descriptions, which has drawn increasing attention. Existing methods mainly resort to finetuning a pretrained generative model, where the identity-relevant information (e.g., the boy) and the identity-irrelevant information (e.g., the background or the pose of the boy) are entangled in the latent embedding space. However, the highly entangled latent embedding may lead to the failure of subject-driven text-to-image generation as follows: (i) the identity-irrelevant information hidden in the entangled embedding may dominate the generation process, resulting in the generated images heavily dependent on the irrelevant information while ignoring the given text descriptions; (ii) the identity-relevant information carried in the entangled embedding can not be appropriately preserved, resulting in identity change of the subject in the generated images. To tackle the problems, we propose DisenBooth, an identity-preserving disentangled tuning framework for subject-driven text-to-image generation. Specifically, DisenBooth finetunes the pretrained diffusion model in the denoising process. Different from previous works that utilize an entangled embedding to denoise each image, DisenBooth instead utilizes disentangled embeddings to respectively preserve the subject identity and capture the identity-irrelevant information. We further design the novel weak denoising and contrastive embedding auxiliary tuning objectives to achieve the disentanglement. Extensive experiments show that our proposed DisenBooth framework outperforms baseline models for subject-driven text-to-image generation with the identity-preserved embedding. Additionally, by combining the identity-preserved embedding and identity-irrelevant embedding, DisenBooth demonstrates more generation flexibility and controllability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FlhjUkC7vH",
    "arxiv_id": "2305.03374",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19048,
    "title": "SOInter: A Novel Deep Energy-Based Interpretation Method for Explaining Structured Output Models",
    "authors": [
      "S. Fatemeh Seyyedsalehi",
      "Mahdieh Soleymani Baghshah",
      "Hamid R. Rabiee"
    ],
    "abstract": "This paper proposes a novel interpretation technique to explain the behavior of structured output models, which simultaneously learn mappings between an input vector and a set of output variables. As a result of the complex relationships between the computational path of output variables in structured models, a feature may impact the output value via another feature. We focus on one of the outputs as the target and try to find the most important features adopted by the structured model to decide on the target in each locality of the input space. We consider an arbitrary structured output model available as a black-box and argue that considering correlations among output variables can improve explanation quality. The goal is to train a function as an interpreter for the target output variable over the input space. We introduce an energy-based training process for the interpreter function, which effectively considers the structural information incorporated into the model to be explained. The proposed method's effectiveness is confirmed using various simulated and real data sets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Fn655mJ4bv",
    "arxiv_id": "2202.09914",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19047,
    "title": "PnP Inversion: Boosting Diffusion-based Editing with 3 Lines of Code",
    "authors": [
      "Xuan Ju",
      "Ailing Zeng",
      "Yuxuan Bian",
      "Shaoteng Liu",
      "Qiang Xu"
    ],
    "abstract": "Text-guided diffusion models have revolutionized image generation and editing, offering exceptional realism and diversity. Specifically, in the context of diffusion-based editing, where a source image is edited according to a target prompt, the process commences by acquiring a noisy latent vector corresponding to the source image via the diffusion model. This vector is subsequently fed into separate source and target diffusion branches for editing. The accuracy of this inversion process significantly impacts the final editing outcome, influencing both essential content preservation of the source image and edit fidelity according to the target prompt. Prior inversion techniques aimed at finding a unified solution in both the source and target diffusion branches. However, our theoretical and empirical analyses reveal that disentangling these branches leads to a distinct separation of responsibilities for preserving essential content and ensuring edit fidelity. Building on this insight, we introduce \u201cDirect Inversion,\u201d a novel technique achieving optimal performance of both branches with just three lines of code. To assess image editing performance, we present PIE-Bench, an editing benchmark with 700 images showcasing diverse scenes and editing types, accompanied by versatile annotations and comprehensive evaluation metrics. Compared to state-of-the-art optimization-based inversion techniques, our solution not only yields superior performance across 8 editing methods but also achieves nearly an order of speed-up.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FoMZ4ljhVw",
    "arxiv_id": "2310.01506",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19043,
    "title": "CRAFT: Customizing LLMs by Creating and Retrieving from Specialized Toolsets",
    "authors": [
      "Lifan Yuan",
      "Yangyi Chen",
      "Xingyao Wang",
      "Yi Fung",
      "Hao Peng",
      "Heng Ji"
    ],
    "abstract": "Large language models (LLMs) are often augmented with tools to solve complex tasks. By generating code snippets and executing them through task-specific Application Programming Interfaces (APIs), they can offload certain functions to dedicated external modules, such as image encoding and performing calculations. However, most existing approaches to augment LLMs with tools are constrainedby general-purpose APIs and lack the flexibility for tailoring them to specific tasks. In this work, we present CRAFT, a general tool creation and retrieval framework for LLMs. It creates toolsets specifically curated for the tasks and equips LLMs with a component that retrieves tools from these sets to enhance their capability to solve complex tasks. For each task, we collect specific code solutions by promptingGPT-4 to solve the training examples. Following a validation step ensuring the correctness, these solutions are abstracted into code snippets to enhance reusability, and deduplicated for higher quality. At inference time, the language model retrieves snippets from the toolsets and then executes them or generates the output conditioning on the retrieved snippets. Our method is designed to be flexible andoffers a plug-and-play approach to adapt off-the-shelf LLMs to unseen domains and modalities, without any finetuning. Experiments on vision-language, tabular processing, and mathematical reasoning tasks show that our approach achieves substantial improvements compared to strong baselines. In addition, our in-depth analysis reveals that: (1) consistent performance improvement can be achieved byscaling up the number of tools and the capability of the backbone models; (2) each component of our approach contributes to the performance gains; (3) the created tools are well-structured and reliable with low complexity  and atomicity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=G0vdDSt9XM",
    "arxiv_id": "2309.17428",
    "GitHub": [
      "https://github.com/lifan-yuan/CRAFT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19042,
    "title": "Customizable Combination of Parameter-Efficient Modules for Multi-Task Learning",
    "authors": [
      "Haowen Wang",
      "Tao Sun",
      "Congyun Jin",
      "Yingbo Wang",
      "Yibo Fan",
      "Yunqi Xu",
      "Yuliang Du",
      "Cong Fan"
    ],
    "abstract": "Modular skill learning is an emerging direction in the field of Parameter Efficient Fine-Tuning (PEFT), as it enables neural networks to better organize and clarify various aspects of knowledge, leading to improved knowledge transfer for new tasks. In this paper, we introduce a novel approach that categorizes skills into shared domain skills and specialized skills, with the skill parameters being highly parameterized using low-rank or sparse techniques. Each task is associated with an exclusive specialized skill while also benefiting from shared domain skills. Moreover, tasks can selectively utilize specialized skills from other tasks as needed. To facilitate this approach, we propose a skill assignment matrix that can be jointly learned, and the task network is instantiated based on the skill parameters. To evaluate the effectiveness of our approach, we conducted extensive experiments on the Super Natural Instructions and SuperGLUE datasets. Our results demonstrate that compared to fully-shared, task-specific, or skill-indistinguishable baselines. Modular learning with skill-type discrimination significantly enhances the sample efficiency of multi-task learning. Furthermore, the freezing of a substantial number of base model parameters greatly improves parameter efficiency, leading to boosted training efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=G1Hlubz1fR",
    "arxiv_id": "2312.03248",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19046,
    "title": "AttEXplore: Attribution for Explanation with model parameters eXploration",
    "authors": [
      "Zhiyu Zhu",
      "Huaming Chen",
      "Jiayu Zhang",
      "Xinyi Wang",
      "Zhibo Jin",
      "Jason Xue",
      "Flora D. Salim"
    ],
    "abstract": "Deep Neural Networks (DNNs) have achieved state-of-the-art performance in various application scenarios. However, due to the real-world noise and human-added perturbations, the trustworthiness of DNNs has been a critical concern from the security perspective. Therefore, it is imperative to provide explainability for the decisions made by the non-linear and complex parameterized models. Given the diverse decision boundaries across various models and specific tasks, attribution methods are promising for this goal, yet its performance can be further improved. In this paper, for the first time, we present that the decision boundary exploration approaches of attribution are consistent with the process for transferable adversarial attacks. Utilizing this consistency, we introduce a novel attribution method via model parameter exploration. Furthermore, inspired by the capability of frequency exploration to investigate the model parameters, we provide enhanced explainability for DNN models by manipulating the input features based on frequency information to explore the decision boundaries of different models. The large-scale experiments demonstrate that our \\textbf{A}ttribution method for \\textbf{E}xplanation with model parameter e\\textbf{X}ploration (AttEXplore) outperforms other state-of-the-art interpretability methods. Moreover, by employing other transferable attack techniques, AttEXplore can explore potential variations in attribution outcomes. Our code is available at: https://anonymous.4open.science/r/AMPE-6C32/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FsVxd9CIlb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19041,
    "title": "Image Clustering Conditioned on Text Criteria",
    "authors": [
      "Sehyun Kwon",
      "Jaeseung Park",
      "Minkyu Kim",
      "Jaewoong Cho",
      "Ernest K. Ryu",
      "Kangwook Lee"
    ],
    "abstract": "Classical clustering methods do not provide users with direct control of the clustering results, and the clustering results may not be consistent with the relevant criterion that a user has in mind. In this work, we present a new methodology for performing image clustering based on user-specified criteria in the form of text by leveraging modern Vision-Language Models and Large Language Models. We call our method Image Clustering Conditioned on Text Criteria (IC$|$TC), and it represents a different paradigm of image clustering. IC$|$TC requires a minimal and practical degree of human intervention and grants the user significant control over the clustering results in return. Our experiments show that IC$|$TC can effectively cluster images with various criteria, such as human action, physical location, or the person's mood, significantly outperforming baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=G2cG3mQqop",
    "arxiv_id": "2310.18297",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19040,
    "title": "PTaRL: Prototype-based Tabular Representation Learning via Space Calibration",
    "authors": [
      "Hangting Ye",
      "Wei Fan",
      "Xiaozhuang Song",
      "Shun Zheng",
      "He Zhao",
      "Dan dan Guo",
      "Yi Chang"
    ],
    "abstract": "Tabular data have been playing a mostly important role in diverse real-world fields, such as healthcare, engineering, finance, etc.With the recent success of deep learning, many tabular machine learning (ML) methods based on deep networks (e.g., Transformer, ResNet) have achieved competitive performance on tabular benchmarks. However, existing deep tabular ML methods suffer from the representation entanglement and localization, which largely hinders their prediction performance and leads to  performance inconsistency on tabular tasks.To overcome these problems, we explore a novel direction of applying prototype learning for tabular ML and propose a prototype-based tabular representation learning framework, PTaRL, for tabular prediction tasks. The core idea of PTaRL is to construct prototype-based projection space (P-Space) and learn the disentangled representation around global data prototypes. Specifically, PTaRL mainly involves two stages: (i) Prototype Generating, that constructs global prototypes as the basis vectors of P-Space for representation, and (ii) Prototype Projecting, that projects the data samples into P-Space and keeps the core global data information via Optimal Transport. Then, to further acquire the disentangled representations, we constrain PTaRL with two strategies: (i) to diversify the coordinates towards global prototypes of different representations within P-Space, we bring up a diversifying constraint for representation calibration; (ii) to avoid prototype entanglement in P-Space, we introduce a matrix orthogonalization constraint to ensure the independence of global prototypes. Finally, we conduct extensive experiments in PTaRL coupled with state-of-the-art deep tabular ML models on various tabular benchmarks and the results have shown our consistent superiority.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=G32oY4Vnm8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19039,
    "title": "Hypothesis Search: Inductive Reasoning with Language Models",
    "authors": [
      "Ruocheng Wang",
      "Eric Zelikman",
      "Gabriel Poesia",
      "Yewen Pu",
      "Nick Haber",
      "Noah Goodman"
    ],
    "abstract": "Inductive reasoning is a core problem-solving capacity: humans can identify underlying principles from a few examples, which can then be robustly generalized to novel scenarios. Recent work has evaluated large language models (LLMs) on inductive reasoning tasks by directly prompting them yielding \"in context learning.\" This can work well for straightforward inductive tasks, but performs very poorly on more complex tasks such as the Abstraction and Reasoning Corpus (ARC). In this work, we propose to improve the inductive reasoning ability of LLMs by generating explicit hypotheses at multiple levels of abstraction: we prompt the LLM to propose multiple abstract hypotheses about the problem, in natural language, then implement the natural language hypotheses as concrete Python programs. These programs can be directly verified by running on the observed examples and generalized to novel inputs. To reduce the hypothesis search space, we explore steps to filter the set of hypotheses to be implemented as programs: we either ask the LLM to summarize them into a smaller set of hypotheses, or ask human annotators to select a subset. We verify our pipeline's effectiveness on the ARC visual inductive reasoning benchmark, its variant 1D-ARC, and string transformation dataset SyGuS. On a random 40-problem subset of ARC, our automated pipeline using LLM summaries achieves 27.5% accuracy, significantly outperforming the direct prompting baseline (accuracy of 12.5%). With the minimal human input of selecting from LLM-generated candidates, the performance is boosted to 37.5%. Our ablation studies show that abstract hypothesis generation and concrete program representations are both beneficial for LLMs to perform inductive reasoning tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=G7UtIGQmjm",
    "arxiv_id": "2309.05660",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19038,
    "title": "Empirical Likelihood for Fair Classification",
    "authors": [
      "Pangpang Liu",
      "Yichuan Zhao"
    ],
    "abstract": "Machine learning algorithms are commonly being deployed in decision-making systems that have a direct impact on human lives. However, if these algorithms are trained solely to minimize training/test errors, they may inadvertently discriminate against individuals based on their sensitive attributes, such as gender, race or age. Recently, algorithms that ensure the fairness are developed in the machine learning community. Fairness criteria are applied by these algorithms to measure the fairness, but they often use the point estimate to assess the fairness and fail to consider the uncertainty of the sample fairness criterion once the algorithms are deployed. We suggest that assessing the fairness should take the uncertainty into account. In this paper, we use the covariance as a proxy for the fairness and develop the confidence region of the covariance vector using empirical likelihood \\citep{Owen1988}. Our confidence region based fairness constraints for classification take uncertainty into consideration during fairness assessment. The proposed confidence region can be used to test the fairness and impose fairness constraint using the significant level as a tool to balance the accuracy and fairness.   Simulation studies show that our method exactly covers the target Type I error rate and effectively balances the trade-off between accuracy and fairness. Finally, we conduct data analysis to demonstrate the effectiveness of our method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GACjMj1MS1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19037,
    "title": "Identifying the Risks of LM Agents with an LM-Emulated Sandbox",
    "authors": [
      "Yangjun Ruan",
      "Honghua Dong",
      "Andrew Wang",
      "Silviu Pitis",
      "Yongchao Zhou",
      "Jimmy Ba",
      "Yann Dubois",
      "Chris J. Maddison",
      "Tatsunori Hashimoto"
    ],
    "abstract": "Recent advances in Language Model (LM) agents and tool use, exemplified by applications like ChatGPT Plugins, enable a rich set of capabilities but also amplify potential risks\u2014such as leaking private data or causing financial losses. Identifying these risks is labor-intensive, necessitating implementing the tools, setting up the environment for each test scenario manually, and finding risky cases. As tools and agents become more complex, the high cost of testing these agents will make it increasingly difficult to find high-stakes, long-tail risks. To address these challenges, we introduce ToolEmu: a framework that uses an LM to emulate tool execution and enables scalable testing of LM agents against a diverse range of tools and scenarios. Alongside the emulator, we develop an LM-based automatic safety evaluator that examines agent failures and quantifies associated risks. We test both the tool emulator and evaluator through human evaluation and find that 68.8% of failures identified with ToolEmu would be valid real-world agent failures. Using our curated initial benchmark consisting of 36 high-stakes toolkits and 144 test cases, we provide a quantitative risk analysis of current LM agents and identify numerous failures with potentially severe outcomes. Notably, even the safest LM agent exhibits such failures 23.9% of the time according to our evaluator, underscoring the need to develop safer LM agents for real-world deployment.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=GEcwtMk1uA",
    "arxiv_id": "2309.15817",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19035,
    "title": "Effective Structural Encodings via Local Curvature Profiles",
    "authors": [
      "Lukas Fesser",
      "Melanie Weber"
    ],
    "abstract": "Structural and Positional Encodings can significantly improve the performance of Graph Neural Networks in downstream tasks. Recent literature has begun to systematically investigate differences in the structural properties that these approaches encode, as well as performance trade-offs between them. However, the question of which structural properties yield the most effective encoding remains open. In this paper, we investigate this question from a geometric perspective. We propose a novel structural encoding based on discrete Ricci curvature (Local Curvature Profiles, short LCP) and show that it significantly outperforms existing encoding approaches. We further show that combining local structural encodings, such as LCP, with global positional encodings improves downstream performance, suggesting that they capture complementary geometric information. Finally, we compare different encoding types with (curvature-based) rewiring techniques. Rewiring has recently received a surge of interest due to its ability to improve the performance of Graph Neural Networks by mitigating over-smoothing and over-squashing effects. Our results suggest that utilizing curvature information for structural encodings delivers significantly larger performance increases than rewiring.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GIUjLsDP4Z",
    "arxiv_id": "2311.14864",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19034,
    "title": "RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval",
    "authors": [
      "Parth Sarthi",
      "Salman Abdullah",
      "Aditi Tuli",
      "Shubh Khanna",
      "Anna Goldie",
      "Christopher D Manning"
    ],
    "abstract": "Retrieval-augmented language models can better adapt to changes in world state and incorporate long-tail knowledge.  However, most existing methods retrieve only short contiguous chunks from a retrieval corpus, limiting holistic understanding of the overall document context. We introduce the novel approach of recursively embedding, clustering, and summarizing chunks of text, constructing a tree with differing levels of summarization from the bottom up. At inference time, our RAPTOR model retrieves from this tree, integrating information across lengthy documents at different levels of abstraction. Controlled experiments show that retrieval with recursive summaries offers significant improvements over traditional retrieval-augmented LMs on several tasks. On question-answering tasks that involve complex, multi-step reasoning, we show state-of-the-art results; for example, by coupling RAPTOR retrieval with the use of GPT-4, we can improve the best performance on the QuALITY benchmark by 20\\% in absolute accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GN921JHCRw",
    "arxiv_id": "2401.18059",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19006,
    "title": "DMV3D: Denoising Multi-view Diffusion Using 3D Large Reconstruction Model",
    "authors": [
      "Yinghao Xu",
      "Hao Tan",
      "Fujun Luan",
      "Sai Bi",
      "Peng Wang",
      "Jiahao Li",
      "Zifan Shi",
      "Kalyan Sunkavalli",
      "Gordon Wetzstein",
      "Zexiang Xu",
      "Kai Zhang"
    ],
    "abstract": "We propose DMV3D, a novel 3D generation approach that uses a transformer-based 3D large reconstruction model to denoise multi-view diffusion. Our reconstruction model incorporates a triplane NeRF representation and, functioning as a denoiser, can denoise noisy multi-view images via 3D NeRF reconstruction and rendering, achieving single-stage 3D generation in the 2D diffusion denoising process. We train DMV3D on large-scale multi-view image datasets of extremely diverse objects using only image reconstruction losses, without accessing 3D assets. We demonstrate state-of-the-art results for the single-image reconstruction problem where probabilistic modeling of unseen object parts is required for generating diverse reconstructions with sharp textures. We also show high-quality text-to-3D generation results outperforming previous 3D diffusion models. Our project website is at: https://dmv3d.github.io/.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=H4yQefeXhp",
    "arxiv_id": "2311.09217",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19003,
    "title": "Forward $\\chi^2$ Divergence Based Variational Importance Sampling",
    "authors": [
      "Chengrui Li",
      "Yule Wang",
      "Weihan Li",
      "Anqi Wu"
    ],
    "abstract": "Maximizing the marginal log-likelihood is a crucial aspect of learning latent variable models, and variational inference (VI) stands as the commonly adopted method. However, VI can encounter challenges in achieving a high marginal log-likelihood when dealing with complicated posterior distributions. In response to this limitation, we introduce a novel variational importance sampling (VIS) approach that directly estimates and maximizes the marginal log-likelihood. VIS leverages the optimal proposal distribution, achieved by minimizing the forward $\\chi^2$ divergence, to enhance marginal log-likelihood estimation. We apply VIS to various popular latent variable models, including mixture models, variational auto-encoders, and partially observable generalized linear models. Results demonstrate that our approach consistently outperforms state-of-the-art baselines, in terms of both log-likelihood and model parameter estimation. Code: \\url{https://github.com/JerrySoybean/vis}.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=HD5Y7M8Xdk",
    "arxiv_id": "2311.02516",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19000,
    "title": "SparseDFF: Sparse-View Feature Distillation for One-Shot Dexterous Manipulation",
    "authors": [
      "Qianxu Wang",
      "Haotong Zhang",
      "Congyue Deng",
      "Yang You",
      "Hao Dong",
      "Yixin Zhu",
      "Leonidas Guibas"
    ],
    "abstract": "Humans excel at transferring manipulation skills across diverse object shapes, poses, and appearances due to their understanding of semantic correspondences between different instances. To endow robots with a similar high-level understanding, we develop a DFF for 3D scenes, leveraging large 2D vision models to distill semantic features from multiview images. While current research demonstrates advanced performance in reconstructing DFF from dense views, the development of learning a DFF from sparse views is relatively nascent, despite its prevalence in numerous manipulation tasks with fixed cameras. In this work, we introduce \\method, a novel method for acquiring view-consistent 3D Distilled Feature Field from sparse RGBD observations, enabling one-shot learning of dexterous manipulations that are transferable to novel scenes. Specifically, we map the image features to the 3D point cloud, allowing for propagation across the 3D space to establish a dense feature field. At the core of SparseDFF is a lightweight feature refinement network, optimized with a contrastive loss between pairwise views after back-projecting the image features onto the 3D point cloud. Additionally, we implement a point-pruning mechanism to augment feature continuity within each local neighborhood. By establishing coherent feature fields on both source and target scenes, we devise an energy function that facilitates the minimization of feature discrepancies w.r.t. the end-effector parameters between the demonstration and the target manipulation. We evaluate our approach using a dexterous hand, mastering real-world manipulations on both rigid and deformable objects, and showcase robust generalization in the face of object and scene-context variations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HHWlwxDeRn",
    "arxiv_id": "2310.16838",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18999,
    "title": "Looped Transformers are Better at Learning Learning Algorithms",
    "authors": [
      "Liu Yang",
      "Kangwook Lee",
      "Robert D Nowak",
      "Dimitris Papailiopoulos"
    ],
    "abstract": "Transformers have demonstrated effectiveness in in-context solving data-fitting problems from various (latent) models, as reported by Garg et al. (2022). However, the absence of an inherent iterative structure in the transformer architecture presents a challenge in emulating the iterative algorithms, which are commonly employed in traditional machine learning methods. To address this, we propose the utilization of looped transformer architecture and its associated training methodology, with the aim of incorporating iterative characteristics into the transformer architectures. Experimental results suggest that the looped transformer achieves performance comparable to the standard transformer in solving various data-fitting problems, while utilizing less than 10% of the parameter count.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HHbRxoDTxE",
    "arxiv_id": "2311.12424",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18998,
    "title": "Frequency-Aware Transformer for Learned  Image Compression",
    "authors": [
      "Han Li",
      "Shaohui Li",
      "Wenrui Dai",
      "Chenglin Li",
      "Junni Zou",
      "Hongkai Xiong"
    ],
    "abstract": "Learned image compression (LIC) has gained traction as an effective solution for image storage and transmission in recent years. However, existing LIC methods are redundant in latent representation due to limitations in capturing anisotropic frequency components and preserving directional details. To overcome these challenges, we propose a novel frequency-aware transformer (FAT) block that for the first time achieves multiscale directional ananlysis for LIC. The FAT block comprises frequency-decomposition window attention (FDWA) modules to capture multiscale and directional frequency components of natural images. Additionally, we introduce frequency-modulation feed-forward network (FMFFN) to adaptively modulate different frequency components, improving rate-distortion performance. Furthermore, we present a transformer-based channel-wise autoregressive (T-CA) model that effectively exploits channel dependencies. Experiments show that our method achieves state-of-the-art rate-distortion performance compared to existing LIC methods, and evidently outperforms latest standardized codec VTM-12.1 by 14.5\\%, 15.1\\%, 13.0\\% in BD-rate on the Kodak, Tecnick, and CLIC datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HKGQDDTuvZ",
    "arxiv_id": "2310.16387",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18996,
    "title": "Efficiently Computing Similarities to Private Datasets",
    "authors": [
      "Arturs Backurs",
      "Zinan Lin",
      "Sepideh Mahabadi",
      "Sandeep Silwal",
      "Jakub Tarnawski"
    ],
    "abstract": "Many methods in differentially private model training rely on computing the similarity between a query point (such as public or synthetic data) and private data. We abstract out this common subroutine and study the following fundamental algorithmic problem: Given a similarity function $f$ and a large high-dimensional private dataset $X \\subset \\mathbb{R}^d$, output a differentially private (DP) data-structure which approximates $\\sum_{x \\in X} f(x,y)$ for any query $y$. We consider the cases where $f$ is a kernel function, such as $f(x,y) = e^{-\\|x-y\\|_2^2/\\sigma^2}$ (also known as DP kernel density estimation), or a distance function such as $f(x,y) = \\|x-y\\|_2$, among others.     Our theoretical results improve upon prior work and give better privacy-utility trade-offs as well as faster query times for a wide range of kernels and distance functions. The unifying approach behind our results is leveraging `low-dimensional structures' present in the specific functions $f$ that we study, using tools such as provable dimensionality reduction, approximation theory, and one-dimensional decomposition of the functions. Our algorithms empirically exhibit improved query times and accuracy over prior state of the art. We also present an application to DP classification. Our experiments demonstrate that the simple methodology of classifying based on average similarity is orders of magnitude faster than prior DP-SGD based approaches for comparable accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HMe5CJv9dQ",
    "arxiv_id": "2403.08917",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18993,
    "title": "Learning to Compose: Improving Object Centric Learning by Injecting Compositionality",
    "authors": [
      "Whie Jung",
      "Jaehoon Yoo",
      "Sungjin Ahn",
      "Seunghoon Hong"
    ],
    "abstract": "Learning compositional representation is a key aspect of object-centric learning as it enables flexible systematic generalization and supports complex visual reasoning. However, most of the existing approaches rely on auto-encoding objective, while the compositionality is implicitly imposed by the architectural or algorithmic bias in the encoder. This misalignment between auto-encoding objective and learning compositionality often results in failure of capturing meaningful object representations. In this study, we propose a novel objective that explicitly encourages compositionality of the representations. Built upon the existing object-centric learning framework (e.g., slot attention), our method incorporates additional constraints that an arbitrary mixture of object representations from two images should be valid by maximizing the likelihood of the composite data. We demonstrate that incorporating our objective to the existing framework consistently improves the objective-centric learning and enhances the robustness to the architectural choices.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HT2dAhh4uV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18991,
    "title": "Label-Noise Robust Diffusion Models",
    "authors": [
      "Byeonghu Na",
      "Yeongmin Kim",
      "HeeSun Bae",
      "Jung Hyun Lee",
      "Se Jung Kwon",
      "Wanmo Kang",
      "Il-chul Moon"
    ],
    "abstract": "Conditional diffusion models have shown remarkable performance in various generative tasks, but training them requires large-scale datasets that often contain noise in conditional inputs, a.k.a. noisy labels. This noise leads to condition mismatch and quality degradation of generated data. This paper proposes Transition-aware weighted Denoising Score Matching (TDSM) for training conditional diffusion models with noisy labels, which is the first study in the line of diffusion models. The TDSM objective contains a weighted sum of score networks, where the weights represent instance-wise and time-dependent label transition probabilities. These weights are derived from the relationship between the conditional scores on noisy and clean labels. Also, we introduce a transition-aware weight estimator, which leverages a time-dependent noisy-label classifier distinctively customized to the diffusion process. We conduct experiments on various datasets and noisy label settings, and we verify that models trained with the TDSM objective generate high-quality samples that closely match the given conditions. Furthermore, our models improve generation performance even on benchmark datasets, which implies the potential noisy labels and their risk of generative model learning in prevalent benchmark datasets. Finally, we show improved performance of TDSM on top of conventional noisy label corrections, which empirically proves its contribution as a part of label-noise robust generative models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HXWTXXtHNl",
    "arxiv_id": "2402.17517",
    "GitHub": [
      "https://github.com/byeonghu-na/tdsm"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18990,
    "title": "Diffusion Sampling with Momentum for Mitigating Divergence Artifacts",
    "authors": [
      "Suttisak Wizadwongsa",
      "Worameth Chinchuthakun",
      "Pramook Khungurn",
      "Amit Raj",
      "Supasorn Suwajanakorn"
    ],
    "abstract": "Despite the remarkable success of diffusion models in image generation, slow sampling remains a persistent issue. To accelerate the sampling process, prior studies have reformulated diffusion sampling as an ODE/SDE and introduced higher-order numerical methods. However, these methods often produce divergence artifacts, especially with a low number of sampling steps, which limits the achievable acceleration. In this paper, we investigate the potential causes of these artifacts and suggest that the small stability regions of these methods could be the principal cause. To address this issue, we propose two novel techniques. The first technique involves the incorporation of Heavy Ball (HB) momentum, a well-known technique for improving optimization, into existing diffusion numerical methods to expand their stability regions.  We also prove that the resulting methods have first-order convergence. The second technique, called Generalized Heavy Ball (GHVB), constructs a new high-order method that offers a variable trade-off between accuracy and artifact suppression. Experimental results show that our techniques are highly effective in reducing artifacts and improving image quality, surpassing state-of-the-art diffusion solvers on both pixel-based and latent-based diffusion models for low-step sampling. Our research provides novel insights into the design of numerical methods for future diffusion work.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HXc5aXeoc8",
    "arxiv_id": "2307.11118",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18989,
    "title": "FairerCLIP: Debiasing CLIP's Zero-Shot Predictions using Functions in RKHSs",
    "authors": [
      "Sepehr Dehdashtian",
      "Lan Wang",
      "Vishnu Boddeti"
    ],
    "abstract": "Large pre-trained vision-language models (VLMs) provide compact and general-purpose representations of text and images that are demonstrably effective across multiple downstream vision and language tasks. However, owing to the nature of their training process, these models have the potential to 1) propagate or amplify societal biases in the training data, and 2) learn to rely on spurious features. Thispaper proposes FairVLM, a general approach for making the zero-shot prediction of VLMs more fair and robust to spurious correlations. We formulate the problem of jointly debiasing VLMs\u2019 image and text representations in reproducing kernel Hilbert spaces (RKHSs), which affords multiple benefits: 1) Flexibility: Unlike existing approaches, which are specialized to either learn with or without ground-truth labels, FairVLM is adaptable to learning in both scenarios, 2) Ease of Optimization: FairVLM lends itself to an iterative optimization involving closed-form solvers, which leads to 4\u00d7-10\u00d7 faster training than the existing methods, 3) Sample Efficiency: Under sample-limited conditions, FairVLM significantly outperforms baselines when they fail entirely, and 4) Performance: Empirically, FairVLM achieves appreciable zero-shot accuracy gains on benchmark fairness and spurious correlation datasets over their respective baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HXoq9EqR9e",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18988,
    "title": "Structured World Modeling via Semantic Vector Quantization",
    "authors": [
      "Yi-Fu Wu",
      "Minseung Lee",
      "Sungjin Ahn"
    ],
    "abstract": "Neural discrete representations are crucial components of modern neural networks. However, their main limitation is that the primary strategies such as VQ-VAE can only provide representations at the patch level. Therefore, one of the main goals of representation learning, acquiring conceptual, semantic, and compositional abstractions such as the color and shape of an object, remains elusive. In this paper, we present the first approach to semantic neural discrete representation learning. The proposed model, called Semantic Vector-Quantized Variational Autoencoder (SVQ), leverages recent advances in unsupervised object-centric learning to address this limitation. Specifically, we observe that a simple approach quantizing at the object level poses a significant challenge and propose constructing scene representations hierarchically, from low-level discrete concept schemas to object representations. Additionally, we suggest a novel method for training a prior over these semantic representations, enabling the ability to generate images following the underlying data distribution, which is lacking in most object-centric models. In experiments on various 2D and 3D object-centric datasets, we find that our model achieves superior generation performance compared to non-semantic vector quantization methods such as VQ-VAE and previous object-centric generative models. Furthermore, we find that the semantic discrete representations can solve downstream scene understanding tasks that require reasoning about the properties of different objects in the scene.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HYyRwm367m",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18987,
    "title": "Set Learning for Accurate and Calibrated Models",
    "authors": [
      "Lukas Muttenthaler",
      "Robert A. Vandermeulen",
      "Qiuyi Zhang",
      "Thomas Unterthiner",
      "Klaus Robert Muller"
    ],
    "abstract": "Model overconfidence and poor calibration are common in machine learning and difficult to account for when applying standard empirical risk minimization. In this work, we propose a novel method to alleviate these problems that we call odd-$k$-out learning (OKO), which minimizes the cross-entropy error for sets rather than for single examples. This naturally allows the model to capture correlations across data examples and achieves both better accuracy and calibration, especially in limited training data and class-imbalanced regimes. Perhaps surprisingly, OKO often yields better calibration even when training with hard labels and dropping any additional calibration parameter tuning, such as temperature scaling. We demonstrate this in extensive experimental analyses and provide a mathematical theory to interpret our findings. We emphasize that OKO is a general framework that can be easily adapted to many settings and a trained model can be applied to single examples at inference time, without significant run-time overhead or architecture changes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HZ3S17EI0o",
    "arxiv_id": "2307.02245",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18986,
    "title": "Principled Architecture-aware Scaling of Hyperparameters",
    "authors": [
      "Wuyang Chen",
      "Junru Wu",
      "Zhangyang Wang",
      "Boris Hanin"
    ],
    "abstract": "Training a high-quality deep neural network requires choosing suitable hyperparameters, which is a non-trivial and expensive process. Current works try to automatically optimize or design principles of hyperparameters, such that they can generalize to diverse unseen scenarios. However, most designs of principles or optimization methods are agnostic to the choice of network structures, and thus largely ignore the impact of neural architectures on hyperparameters. In this work, we precisely characterize the dependence of initializations and maximal learning rates on the network architecture, which includes the network depth, width, convolutional kernel size, and connectivity patterns. By pursuing every parameter to be maximally updated with the same mean squared change in pre-activations, we can generalize our initialization and learning rates across MLPs (multi-layer perception) and CNNs (convolutional neural network) with sophisticated graph topologies. We verify our principles with comprehensive experiments. More importantly, our strategy further sheds light on advancing current benchmarks for architecture design. A fair comparison of AutoML algorithms requires accurate network rankings. However, we demonstrate that network rankings can be easily changed by better training networks in benchmarks with our architecture-aware learning rates and initialization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HZndRcfyNI",
    "arxiv_id": "2402.17440",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18985,
    "title": "Topic Modeling as Multi-Objective Contrastive Optimization",
    "authors": [
      "Thong Thanh Nguyen",
      "Xiaobao Wu",
      "Xinshuai Dong",
      "Cong-Duy T Nguyen",
      "See-Kiong Ng",
      "Anh Tuan Luu"
    ],
    "abstract": "Recent representation learning approaches enhance neural topic models by optimizing the weighted linear combination of the evidence lower bound (ELBO) of the log-likelihood and the contrastive learning objective that contrasts pairs of input documents. However, document-level contrastive learning might capture low-level mutual information, such as word ratio, which disturbs topic modeling. Moreover, there is a potential conflict between the ELBO loss that memorizes input details for better reconstruction quality, and the contrastive loss which attempts to learn topic representations that generalize among input documents. To address these issues, we first introduce a novel contrastive learning method oriented towards sets of topic vectors to capture useful semantics that are shared among a set of input documents. Secondly, we explicitly cast contrastive topic modeling as a gradient-based multi-objective optimization problem, with the goal of achieving a Pareto stationary solution that balances the trade-off between the ELBO and the contrastive objective. Extensive experiments demonstrate that our framework consistently produces higher-performing neural topic models in terms of topic coherence, topic diversity, and downstream performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HdAoLSBYXj",
    "arxiv_id": "2402.07577",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18984,
    "title": "Towards Best Practices of Activation Patching in Language Models: Metrics and Methods",
    "authors": [
      "Fred Zhang",
      "Neel Nanda"
    ],
    "abstract": "Mechanistic interpretability seeks to understand the internal mechanisms ofmachine learning models, where localization\u2014identifying the important modelcomponents\u2014is a key step. Activation patching, also known as causal tracing orinterchange intervention, is a standard technique for this task (Vig et al., 2020), butthe literature contains many variants with little consensus on the choice of hyperparameters or methodology. In this work, we systematically examine the impactof methodological details in activation patching, including evaluation metrics andcorruption methods. In several settings of localization and circuit discovery in language models, we find that varying these hyperparameters could lead to disparateinterpretability results. Backed by empirical observations, we give conceptual arguments for why certain metrics or methods may be preferred. Finally, we providerecommendations for the best practices of activation patching going forwards.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Hf17y6u9BC",
    "arxiv_id": "2309.16042",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18983,
    "title": "Novel Quadratic Constraints for Extending LipSDP beyond Slope-Restricted Activations",
    "authors": [
      "Patricia Pauli",
      "Aaron J Havens",
      "Alexandre Araujo",
      "Siddharth Garg",
      "Farshad Khorrami",
      "Frank Allg\u00f6wer",
      "Bin Hu"
    ],
    "abstract": "Recently, semidefinite programming (SDP) techniques have shown great promise in providing accurate Lipschitz bounds for neural networks. Specifically, the LipSDP approach (Fazlyab et al., 2019) has received much attention and provides the least conservative Lipschitz upper bounds that can be computed with polynomial time guarantees. However, one main restriction of LipSDP is that its formulation requires the activation functions to be slope-restricted on $[0,1]$, preventing its further use for more general activation functions such as GroupSort, MaxMin, and Householder. One can rewrite MaxMin activations for example as residual ReLU networks. However, a direct application of LipSDP to the resultant residual ReLU networks is conservative and even fails in recovering the well-known fact that the MaxMin activation is 1-Lipschitz. Our paper bridges this gap and extends LipSDP  beyond slope-restricted activation functions. To this end, we provide novel quadratic constraints for GroupSort, MaxMin, and Householder activations via leveraging their underlying properties such as sum preservation. Our proposed analysis is general and provides a unified approach for estimating $\\ell_2$ and $\\ell_\\infty$ Lipschitz bounds for a rich class of neural network architectures, including non-residual and residual neural networks and implicit models,  with GroupSort, MaxMin, and HouseHolder activations. Finally, we illustrate the utility of our approach with a variety of experiments and show that our proposed SDPs generate less conservative Lipschitz bounds in comparison to existing approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HfXDrAzFvG",
    "arxiv_id": "2401.14033",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18982,
    "title": "SGD Finds then Tunes Features in Two-Layer Neural Networks with near-Optimal Sample Complexity: A Case Study in the XOR problem",
    "authors": [
      "Margalit Glasgow"
    ],
    "abstract": "In this work, we consider the optimization process of minibatch stochastic gradient descent (SGD) on a 2-layer neural network with data separated by a quadratic ground truth function. We prove that with data drawn from the Boolean hypercube labeled by the quadratic ``XOR'' function $y = -x_ix_j$ , it is possible to train to a population error $o(1)$ with $\\Theta(d\\text{polylog}(d))$ samples. Our result considers simultaneously training both layers of the two-layer-neural network with ReLU activations via standard minibatch SGD on the logistic loss. To our knowledge, this work is the first to give a sample complexity of  for efficiently learning the XOR function on isotropic data on a standard neural network with standard training. Our main technique is showing that the network evolves in two phases: a \\em signal-finding \\em phase where the network is small and many of the neurons evolve independently to find features, and a \\em signal-heavy \\em phase, where SGD maintains and balances the features. We leverage the simultaneous training of the layers to show that it is sufficient for only a small fraction of the neurons to learn features, since those neurons will be amplified by the simultaneous growth of their second layer weights.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=HgOJlxzB16",
    "arxiv_id": "2309.15111",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18978,
    "title": "Self-Guided Masked Autoencoders for Domain-Agnostic Self-Supervised Learning",
    "authors": [
      "Johnathan Wenjia Xie",
      "Yoonho Lee",
      "Annie S Chen",
      "Chelsea Finn"
    ],
    "abstract": "Self-supervised learning excels in learning representations from large amounts of unlabeled data, demonstrating success across multiple data modalities. Yet, extending self-supervised learning to new modalities is non-trivial because the specifics of existing methods are tailored to each domain, such as domain-specific augmentations which reflect the invariances in the target task. While masked modeling is promising as a domain-agnostic framework for self-supervised learning because it does not rely on input augmentations, its mask sampling procedure remains domain-specific. We present Self-guided Masked Autoencoders (SMA), a fully domain-agnostic masked modeling method. SMA trains an attention based model using a masked modeling objective, by learning masks to sample without any domain-specific assumptions. We evaluate SMA on three self-supervised learning benchmarks in protein biology, chemical property prediction, and particle physics. We find SMA is capable of learning representations without domain-specific knowledge and achieves state-of-the-art performance on these three benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HiYMiZYwkw",
    "arxiv_id": "2402.14789",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18589,
    "title": "IDEAL: Influence-Driven Selective Annotations Empower In-Context Learners in Large Language Models",
    "authors": [
      "Shaokun Zhang",
      "Xiaobo Xia",
      "Zhaoqing Wang",
      "Ling-Hao Chen",
      "Jiale Liu",
      "Qingyun Wu",
      "Tongliang Liu"
    ],
    "abstract": "In-context learning is a promising paradigm that utilizes in-context examples as prompts for the predictions of large language models. These prompts are crucial for achieving strong performance. However, since the prompts need to be sampled from a large volume of annotated examples, finding the right prompt may result in high annotation costs. To address this challenge, this paper introduces an influence-driven selective annotation method that aims to minimize annotation costs while improving the quality of in-context examples. The essence of our method is to select a pivotal subset from a large-scale unlabeled data pool to annotate for the subsequent sampling of prompts. Specifically, a directed graph is first constructed to represent unlabeled data. Afterward, the influence of candidate unlabeled subsets is quantified with a diffusion process. A simple yet effective greedy algorithm for unlabeled data selection is lastly introduced. It iteratively selects the data if it provides a maximum marginal gain with respect to quantified influence. Compared with previous efforts on selective annotations, our influence-driven method works in an end-to-end manner, avoids an intractable explicit balance between data diversity and representativeness, and enjoys theoretical support. Experiments confirm the superiority of the proposed method on various benchmarks, achieving better performance under lower time consumption during subset selection.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Spp2i1hKwV",
    "arxiv_id": "2310.10873",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18977,
    "title": "Chain-of-Experts: When LLMs Meet Complex Operations Research Problems",
    "authors": [
      "Ziyang Xiao",
      "Dongxiang Zhang",
      "Yangjun Wu",
      "Lilin Xu",
      "Yuan Jessica Wang",
      "Xiongwei Han",
      "Xiaojin Fu",
      "Tao Zhong",
      "Jia Zeng",
      "Mingli Song",
      "Gang Chen"
    ],
    "abstract": "Large language models (LLMs) have emerged as powerful techniques for various NLP tasks, such as mathematical reasoning and plan generation. In this paper, we study automatic modeling and programming for complex operation research (OR) problems, so as to alleviate the heavy dependence on domain experts and benefit a spectrum of industry sectors. We present the first LLM-based solution, namely Chain-of-Experts (CoE), a novel multi-agent cooperative framework to enhance reasoning capabilities. Specifically, each agent is assigned a specific role and endowed with domain knowledge related to OR. We also introduce a conductor to orchestrate these agents via forward thought construction and backward reflection mechanism. Furthermore, we release a benchmark dataset (ComplexOR) of complex OR problems to facilitate OR research and community development. Experimental results show that CoE significantly outperforms the state-of-the-art LLM-based approaches both on LPWP and ComplexOR.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HobyL1B9CZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18976,
    "title": "Oracle Efficient Algorithms for Groupwise Regret",
    "authors": [
      "Krishna Acharya",
      "Eshwar Ram Arunachaleswaran",
      "Sampath Kannan",
      "Aaron Roth",
      "Juba Ziani"
    ],
    "abstract": "We study the problem of online prediction, in which at each time step $t \\in \\{1,2, \\cdots T\\}$, an individual $x_t$ arrives, whose label we must predict. Each individual is associated with various groups, defined based on their features such as age, sex, race etc., which may intersect. Our goal is to make predictions that have regret guarantees not just overall but also simultaneously on each sub-sequence comprised of the members of any single group. Previous work such as  [Blum & Lykouris][1] and [Lee et al][2] provide attractive regret guarantees for these problems; however, these are computationally intractable on large model classes (e.g., the set of all linear models, as used in linear regression). We show that a simple modification of the sleeping experts technique of [Blum & Lykouris][1] yields an efficient *reduction* to the well-understood problem of obtaining diminishing external regret *absent group considerations*. Our approach gives similar regret guarantees compared to [Blum & Lykouris][1]; however, we run in time linear in the number of groups, and are oracle-efficient in the hypothesis class. This in particular implies that our algorithm is efficient whenever the number of groups is  polynomially bounded and the external-regret problem can be solved efficiently, an improvement on [Blum & Lykouris][1]'s stronger condition that the model class must be small. Our approach can handle online linear regression and online combinatorial optimization problems like online shortest paths. Beyond providing theoretical regret bounds, we evaluate this algorithm with an extensive set of experiments on synthetic data and on two real data sets --- Medical costs and the Adult income dataset, both instantiated with intersecting groups defined in terms of race, sex, and other demographic characteristics. We find that uniformly across groups, our algorithm gives substantial error improvements compared to running a standard online linear regression algorithm with no groupwise regret guarantees.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HrRKc9ei7h",
    "arxiv_id": "2310.04652",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18975,
    "title": "Energy-Based Concept Bottleneck Models: Unifying Prediction, Concept Intervention, and Probabilistic Interpretations",
    "authors": [
      "Xinyue Xu",
      "Yi Qin",
      "Lu Mi",
      "Hao Wang",
      "Xiaomeng Li"
    ],
    "abstract": "Existing methods, such as concept bottleneck models (CBMs), have been successful in providing concept-based interpretations for black-box deep learning models. They typically work by predicting concepts given the input and then predicting the final class label given the predicted concepts. However, (1) they often fail to capture the high-order, nonlinear interaction between concepts, e.g., correcting a predicted concept (e.g., \u201cyellow breast\u201d) does not help correct highly correlated concepts (e.g., \u201cyellow belly\u201d), leading to suboptimal final accuracy; (2) they cannot naturally quantify the complex conditional dependencies between different concepts and class labels (e.g., for an image with the class label \u201cKentucky Warbler\u201d and a concept \u201cblack bill\u201d, what is the probability that the model correctly predicts another concept \u201cblack crown\u201d), therefore failing to provide deeper insight into how a black-box model works. In response to these limitations, we propose Energy-based Concept Bottleneck Models (ECBMs). Our ECBMs use a set of neural networks to define the joint energy of candidate (input, concept, class) tuples. With such a unified interface, prediction, concept correction, and conditional dependency quantification are then represented as conditional probabilities, which are generated by composing different energy functions. Our ECBMs address both limitations of existing CBMs, providing higher accuracy and richer concept interpretations. Empirical results show that our approach outperforms the state-of-the-art on real-world datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=I1quoTXZzc",
    "arxiv_id": "2401.14142",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18971,
    "title": "Eureka: Human-Level Reward Design via Coding Large Language Models",
    "authors": [
      "Yecheng Jason Ma",
      "William Liang",
      "Guanzhi Wang",
      "De-An Huang",
      "Osbert Bastani",
      "Dinesh Jayaraman",
      "Yuke Zhu",
      "Linxi Fan",
      "Anima Anandkumar"
    ],
    "abstract": "Large Language Models (LLMs) have excelled as high-level semantic planners for sequential decision-making tasks. However, harnessing them to learn complex low-level manipulation tasks, such as dexterous pen spinning, remains an open problem. We bridge this fundamental gap and present Eureka, a human-level reward design algorithm powered by LLMs. Eureka exploits the remarkable zero-shot generation, code-writing, and in-context improvement capabilities of state-of-the-art LLMs, such as GPT-4, to perform evolutionary optimization over reward code. The resulting rewards can then be used to acquire complex skills via reinforcement learning. Without any task-specific prompting or pre-defined reward templates, Eureka generates reward functions that outperform expert human-engineered rewards. In a diverse suite of 29 open-source RL environments that include 10 distinct robot morphologies, Eureka outperforms human experts on 83% of the tasks, leading to an average normalized improvement of 52%. The generality of Eureka also enables a new gradient-free in-context learning approach to reinforcement learning from human feedback (RLHF), readily incorporating human inputs to improve the quality and the safety of the generated rewards without model updating. Finally, using Eureka rewards in a curriculum learning setting, we demonstrate for the first time, a simulated Shadow Hand capable of performing pen spinning tricks, adeptly manipulating a pen in circles at rapid speed.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IEduRUO55F",
    "arxiv_id": "2310.12931",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18969,
    "title": "Robot Fleet Learning via Policy Merging",
    "authors": [
      "Lirui Wang",
      "Kaiqing Zhang",
      "Allan Zhou",
      "Max Simchowitz",
      "Russ Tedrake"
    ],
    "abstract": "Fleets of robots ingest massive amounts of heterogeneous streaming data silos generated by interacting with their environments, far more than what can be stored or transmitted with ease. At the same time, teams of robots should co-acquire diverse skills through their heterogeneous experiences in varied settings. How can we enable such fleet-level learning without having to transmit or centralize fleet-scale data? In this paper, we investigate policy merging (PoMe) from such distributed heterogeneous datasets as a potential solution. To efficiently merge policies in the fleet setting, we propose FLEET-MERGE, an instantiation of distributed learning that accounts for the permutation invariance that arises when parameterizing the control policies with recurrent neural networks. We show that FLEET-MERGE consolidates the behavior of policies trained on 50 tasks in the Meta-World environment, with good performance on nearly all training tasks at test time. Moreover, we introduce a novel robotic tool-use benchmark, FLEET-TOOLS, for fleet policy learning in compositional and contact-rich robot manipulation tasks, to validate the efficacy of FLEET-MERGE on the benchmark.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IL71c1z7et",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18968,
    "title": "Uncertainty-aware Constraint Inference in Inverse Constrained Reinforcement Learning",
    "authors": [
      "Sheng Xu",
      "Guiliang Liu"
    ],
    "abstract": "Aiming for safe control, Inverse Constrained Reinforcement Learning (ICRL) considers inferring the constraints respected by expert agents from their demonstrations and learning imitation policies that adhere to these constraints. While previous ICRL works often neglected underlying uncertainties during training, we contend that modeling these uncertainties is crucial for facilitating robust constraint inference. This insight leads to the development of an Uncertainty-aware Inverse Constrained Reinforcement Learning (UAICRL) algorithm. Specifically, 1) aleatoric uncertainty arises from the inherent stochasticity of environment dynamics, leading to constraint-violating behaviors in imitation policies. To address this, UAICRL constructs risk-sensitive constraints by incorporating distributional Bellman updates into the cumulative costs model. 2) Epistemic uncertainty, resulting from the model's limited knowledge of Out-of-Distribution (OoD) samples, affects the accuracy of step-wise cost predictions. To tackle this issue, UAICRL develops an information-theoretic quantification of the uncertainty and mitigates its impact through flow-based generative data augmentation. Empirical results demonstrate that UAICRL consistently outperforms other baselines in continuous and discrete environments with stochastic dynamics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ILYjDvUM6U",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18967,
    "title": "Performance Gaps in Multi-view Clustering under the Nested Matrix-Tensor Model",
    "authors": [
      "Hugo Lebeau",
      "Mohamed El Amine Seddik",
      "Jos\u00e9 Henrique De Morais Goulart"
    ],
    "abstract": "We study the estimation of a planted signal hidden in a recently introduced nested matrix-tensor model, which is an extension of the classical spiked rank-one tensor model, motivated by multi-view clustering. Prior work has theoretically examined the performance of a tensor-based approach, which relies on finding a best rank-one approximation, a problem known to be computationally hard. A tractable alternative approach consists in computing instead the best rank-one (matrix) approximation of an unfolding of the observed tensor data, but its performance was hitherto unknown. We quantify here the performance gap between these two approaches, in particular by deriving the precise algorithmic threshold of the unfolding approach and demonstrating that it exhibits a BBP-type transition behavior. This work is therefore in line with recent contributions which deepen our understanding of why tensor-based methods surpass matrix-based methods in handling structured tensor data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ILqA09Oeq2",
    "arxiv_id": "2402.10677",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18965,
    "title": "Window Attention is Bugged: How not to Interpolate Position Embeddings",
    "authors": [
      "Daniel Bolya",
      "Chaitanya Ryali",
      "Judy Hoffman",
      "Christoph Feichtenhofer"
    ],
    "abstract": "Window attention, position embeddings, and high resolution finetuning are core concepts in the modern transformer era of computer vision. However, we find that naively combining these near ubiquitous components can have a detrimental effect on performance. The issue is simple: interpolating position embeddings while using window attention is wrong. We study two state-of-the-art methods that have these three components, namely Hiera and ViTDet, and find that both do indeed suffer from this bug. To fix it, we introduce a simple absolute window position embedding strategy, which solves the bug outright in Hiera and allows us to increase both speed and performance of the model in ViTDet. We finally combine the two to obtain HieraDet, which achieves 61.7 box mAP on COCO, making it state-of-the-art for models that only use ImageNet-1k pretraining. This all stems from what is essentially a 3 line bug fix, which we name \"absolute win\".",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IPhm01y9a9",
    "arxiv_id": "2311.05613",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18964,
    "title": "Learning Hierarchical Image Segmentation For Recognition and By Recognition",
    "authors": [
      "Tsung-Wei Ke",
      "Sangwoo Mo",
      "Stella X. Yu"
    ],
    "abstract": "Image segmentation and recognition occur simultaneously, with recognition relying on the underlying segmentation to form a continuous visual grouping hierarchy. For example, the same object can be parsed into different part-to-whole structures, resulting in varying recognitions. Despite this, most prior works treated segmentation and recognition as separate tasks. In this paper, we aim to devise a learning framework that involves segmentation in the recognition process, utilizing hierarchical segmentation for recognition, which is learned by recognition. Specifically, we propose CAST, which realizes this concept through designs inspired by vision transformers, enabling concurrent segmentation and recognition with a single model. The core idea of CAST is to employ adaptive segment tokens that group the finest pixels into coarser segments, using the latest embedding to represent the entire image for recognition. Trained solely on image recognition objectives, CAST automatically discovers the hierarchy of segments. Our experiments demonstrate that CAST provides consistent hierarchical segmentation and recognition, which is impossible with state-of-the-art segmentation methods such as SAM. Additionally, CAST offers several advantages over the standard ViT, including improved semantic segmentation, computational efficiency, and object-centric attention.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=IRcv4yFX6z",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18588,
    "title": "Provable Robust Watermarking for AI-Generated Text",
    "authors": [
      "Xuandong Zhao",
      "Prabhanjan Vijendra Ananth",
      "Lei Li",
      "Yu-Xiang Wang"
    ],
    "abstract": "We study the problem of watermarking large language models (LLMs) generated text \u2014 one of the most promising approaches for addressing the safety challenges of LLM usage. In this paper, we propose a rigorous theoretical framework to quantify the effectiveness and robustness of LLM watermarks. We propose a robust and high-quality watermark method, Unigram-Watermark, by extending an existing approach with a simplified fixed grouping strategy. We prove that our watermark method enjoys guaranteed generation quality, correctness in watermark detection, and is robust against text editing and paraphrasing. Experiments on three varying LLMs and two datasets verify that our Unigram-Watermark achieves superior detection accuracy and comparable generation quality in perplexity, thus promoting the responsible use of LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SsmT8aO45L",
    "arxiv_id": "2306.17439",
    "GitHub": [
      "https://github.com/XuandongZhao/Unigram-Watermark"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18963,
    "title": "Davidsonian Scene Graph: Improving Reliability in Fine-grained Evaluation for Text-to-Image Generation",
    "authors": [
      "Jaemin Cho",
      "Yushi Hu",
      "Jason Michael Baldridge",
      "Roopal Garg",
      "Peter Anderson",
      "Ranjay Krishna",
      "Mohit Bansal",
      "Jordi Pont-Tuset",
      "Su Wang"
    ],
    "abstract": "Evaluating text-to-image models is notoriously dif\ufb01cult. A strong recent approach for assessing text-image faithfulness is based on QG/A (question generation and answering), which uses pre-trained foundational models to automatically generate a set of questions and answers from the prompt, and output images are scored based on whether these answers extracted with a visual question answering model are consistent with the prompt-based answers. This kind of evaluation is naturally dependent on the quality of the underlying QG and QA models. We identify and address several reliability challenges in existing QG/A work: (a) QG questions should respect the prompt (avoiding hallucinations, duplications, and omissions) and (b) VQA answers should be consistent (not assert that there is no motorcycle in an image while also claiming the motorcycle is blue). We address these issues with Davidsonian Scene Graph (DSG), an empirically grounded evaluation framework inspired by formal semantics. DSG is an automatic, graph-based QG/A that is modularly implemented to be adaptable to any QG/A module. DSG produces atomic and unique questions organized in dependency graphs, which (i) ensure appropriate semantic coverage and (ii) sidestep inconsistent answers. With extensive experimentation and human evaluation on a range of model con\ufb01gurations (LLM, VQA, and T2I), we empirically demonstrate that DSG addresses the challenges noted above. Finally, we present DSG-1k, an open-sourced evaluation benchmark that includes 1,060 prompts, covering a wide range of \ufb01ne-grained semantic categories with a balanced distribution. We will release the DSG-1k prompts and the corresponding DSG questions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ITq4ZRUT4a",
    "arxiv_id": "2310.18235",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18959,
    "title": "Vanishing Gradients in Reinforcement Finetuning of Language Models",
    "authors": [
      "Noam Razin",
      "Hattie Zhou",
      "Omid Saremi",
      "Vimal Thilak",
      "Arwen Bradley",
      "Preetum Nakkiran",
      "Joshua M. Susskind",
      "Etai Littwin"
    ],
    "abstract": "Pretrained language models are commonly aligned with human preferences and downstream tasks via reinforcement finetuning (RFT), which refers to maximizing a (possibly learned) reward function using policy gradient algorithms. This work identifies a fundamental optimization obstacle in RFT: we prove that the expected gradient for an input vanishes when its reward standard deviation under the model is small, even if the expected reward is far from optimal. Through experiments on an RFT benchmark and controlled environments, as well as a theoretical analysis, we then demonstrate that vanishing gradients due to small reward standard deviation are prevalent and detrimental, leading to extremely slow reward maximization. Lastly, we explore ways to overcome vanishing gradients in RFT. We find the common practice of an initial supervised finetuning (SFT) phase to be the most promising candidate, which sheds light on its importance in an RFT pipeline. Moreover, we show that a relatively small number of SFT optimization steps on as few as 1% of the input samples can suffice, indicating that the initial SFT phase need not be expensive in terms of compute and data labeling efforts. Overall, our results emphasize that being mindful for inputs whose expected gradient vanishes, as measured by the reward standard deviation, is crucial for successful execution of RFT.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IcVNBR7qZi",
    "arxiv_id": "2310.20703",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18957,
    "title": "GraphChef: Decision-Tree Recipes to Explain Graph Neural Networks",
    "authors": [
      "Peter M\u00fcller",
      "Lukas Faber",
      "Karolis Martinkus",
      "Roger Wattenhofer"
    ],
    "abstract": "We propose a new self-explainable Graph Neural Network (GNN) model: GraphChef. GraphChef integrates decision trees into the GNN message passing framework. Given a dataset, GraphChef returns a set of rules (a recipe) that explains each class in the dataset unlike existing GNNs and explanation methods that reason on individual graphs. Thanks to the decision trees, GraphChef  recipes are human understandable.  We also present a new pruning method to produce small and easy to digest trees. Experiments demonstrate that GraphChef reaches comparable accuracy to not self-explainable GNNs and produced decision trees are indeed small. We further validate the correctness of the discovered recipes on datasets where explanation ground truth is available: Reddit-Binary, MUTAG, BA-2Motifs, BA-Shapes, Tree-Cycle, and Tree-Grid.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IjMUGuUmBI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18956,
    "title": "Large Language Models Cannot Self-Correct Reasoning Yet",
    "authors": [
      "Jie Huang",
      "Xinyun Chen",
      "Swaroop Mishra",
      "Huaixiu Steven Zheng",
      "Adams Wei Yu",
      "Xinying Song",
      "Denny Zhou"
    ],
    "abstract": "Large Language Models (LLMs) have emerged as a groundbreaking technology with their unparalleled text generation capabilities across various applications. Nevertheless, concerns persist regarding the accuracy and appropriateness of their generated content. A contemporary methodology, self-correction, has been proposed as a remedy to these issues. Building upon this premise, this paper critically examines the role and efficacy of self-correction within LLMs, shedding light on its true potential and limitations. Central to our investigation is the notion of intrinsic self-correction, whereby an LLM attempts to correct its initial responses based solely on its inherent capabilities, without the crutch of external feedback. In the context of reasoning, our research indicates that LLMs struggle to self-correct their responses without external feedback, and at times, their performance might even degrade post self-correction. Drawing from these insights, we offer suggestions for future research and practical applications in this field.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IkmD3fKBPQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18955,
    "title": "Consistent Video-to-Video Transfer Using Synthetic Dataset",
    "authors": [
      "Jiaxin Cheng",
      "Tianjun Xiao",
      "Tong He"
    ],
    "abstract": "We introduce a novel and efficient approach for text-based video-to-video editing that eliminates the need for resource-intensive per-video-per-model finetuning. At the core of our approach is a synthetic paired video dataset tailored for video-to-video transfer tasks. Inspired by Instruct Pix2Pix's image transfer via editing instruction, we adapt this paradigm to the video domain. Extending the Prompt-to-Prompt to videos, we efficiently generate paired samples, each with an input video and its edited counterpart. Alongside this, we introduce the Long Video Sampling Correction during sampling, ensuring consistent long videos across batches. Our method surpasses current methods like Tune-A-Video, heralding substantial progress in text-based video-to-video editing and suggesting exciting avenues for further exploration and deployment.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IoKRezZMxF",
    "arxiv_id": "2311.00213",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18954,
    "title": "Talk like a Graph: Encoding Graphs for Large Language Models",
    "authors": [
      "Bahare Fatemi",
      "Jonathan Halcrow",
      "Bryan Perozzi"
    ],
    "abstract": "Graphs are a powerful tool for representing and analyzing complex relationships in real-world applications such as social networks, recommender systems, and computational finance. Reasoning on graphs is essential for drawing inferences about the relationships between entities in a complex system, and to identify hidden patterns and trends. Despite the remarkable progress in automated reasoning with natural text, reasoning on graphs with large language models (LLMs) remains an understudied problem. In this work, we perform the first comprehensive study of encoding graph-structured data as text for consumption by LLMs. We show that LLM performance on graph reasoning tasks varies on three fundamental levels: (1) the graph encoding method, (2) the nature of the graph task itself, and (3) interestingly, the very structure of the graph considered. These novel results provide valuable insight on strategies for encoding graphs as text. Using these insights we illustrate how the correct choice of encoders can boost performance on graph reasoning tasks inside LLMs by 4.8% to 61.8%, depending on the task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IuXR1CCrSi",
    "arxiv_id": "2310.04560",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18953,
    "title": "A Good Learner can Teach Better: Teacher-Student Collaborative Knowledge Distillation",
    "authors": [
      "Ayan Sengupta",
      "Shantanu Dixit",
      "Md Shad Akhtar",
      "Tanmoy Chakraborty"
    ],
    "abstract": "Knowledge distillation (KD) is a technique used to transfer knowledge from a larger ''teacher'' model into a smaller ''student'' model. Recent advancements in meta-learning-based knowledge distillation (MetaKD) emphasize that the fine-tuning of teacher models should be aware of the student's need to achieve better knowledge distillation. However, existing MetaKD methods often lack incentives for the teacher model to improve itself. In this study, we introduce MPDistil, a meta-policy distillation technique, that utilizes novel optimization strategies to foster both *collaboration* and *competition* during the fine-tuning of the teacher model in the meta-learning step. Additionally, we propose a curriculum learning framework for the student model in a competitive setup, in which the student model aims to outperform the teacher model by self-training on various tasks. Exhaustive experiments on SuperGLUE and GLUE benchmarks demonstrate the efficacy of MPDistil compared to $20$ conventional KD and advanced MetaKD baselines, showing significant performance enhancements in the student model -- e.g., a distilled 6-layer BERT model outperforms a 12-layer BERT model on five out of six SuperGLUE tasks. Furthermore, MPDistil, while applied to a large language teacher model (DeBERTa-v2-xxlarge), significantly narrows the performance gap of its smaller student counterpart (DeBERTa-12) by just $4.6$% on SuperGLUE. We further demonstrate how higher rewards and customized training curricula strengthen the student model and enhance generalizability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ixi4j6LtdX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18952,
    "title": "VQ-TR: Vector Quantized Attention for Time Series Forecasting",
    "authors": [
      "Kashif Rasul",
      "Andrew Bennett",
      "Pablo Vicente",
      "Umang Gupta",
      "Hena Ghonia",
      "Anderson Schneider",
      "Yuriy Nevmyvaka"
    ],
    "abstract": "Probabilistic time series forecasting is a challenging problem due to the long sequences involved, the large number of samples needed for accurate probabilistic inference, and the need for real-time inference in many applications. These challenges necessitate methods that are not only accurate but computationally efficient. Unfortunately, most current state-of-the-art methods for time series forecasting are based on Transformers, which scale poorly due to quadratic complexity in sequence length, and are therefore needlessly computationally inefficient. Moreover, with a few exceptions, these methods have only been evaluated for non-probabilistic point estimation. In this work, we address these two shortcomings.For the first, we introduce VQ-TR, which maps large sequences to a discrete set of latent representations as part of the Attention module. This not only allows us to attend over larger context windows with linear complexity in sequence length but also allows for effective regularization to avoid overfitting.For the second, we provide what is to the best of our knowledge the first systematic comparison of modern Transformer-based time series forecasting methods for probabilistic forecasting. In this comparison, we find that VQ-TR performs better or comparably to all other methods while being computationally efficient.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IxpTsFS7mh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18951,
    "title": "Bellman Optimal Stepsize Straightening of Flow-Matching Models",
    "authors": [
      "Bao Nguyen",
      "Binh Nguyen",
      "Viet Anh Nguyen"
    ],
    "abstract": "Flow matching is a powerful framework for generating high-quality samples in various applications, especially image synthesis. However, the intensive computational demands of these models, especially during the fine-tuning process and sampling processes, pose significant challenges for low-resource scenarios. This paper introduces Bellman Optimal Step-size Straightening (BOSS) technique for distilling flow-matching generative models: it aims specifically for a few-step efficient image sampling while adhering to a computational budget constraint. First, this technique involves a dynamic programming algorithm that optimizes the step sizes of the pretrained network. Then, it refines the velocity network to match the optimal step sizes, aiming to straighten the generation paths. Extensive experimental evaluations across image generation tasks demonstrate the efficacy of BOSS in terms of both resource utilization and image quality. Our results reveal that BOSS achieves substantial gains in efficiency while maintaining competitive sample quality, effectively bridging the gap between low-resource constraints and the demanding requirements of flow-matching generative models. Our paper also fortifies the responsible development of artificial intelligence, offering a more sustainable generative model that reduces computational costs and environmental footprints.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Iyve2ycvGZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18950,
    "title": "Private Zeroth-Order Nonsmooth Nonconvex Optimization",
    "authors": [
      "Qinzi Zhang",
      "Hoang Tran",
      "Ashok Cutkosky"
    ],
    "abstract": "We introduce a new zeroth-order algorithm for private stochastic optimization on nonconvex and nonsmooth objectives.Given a dataset of size $M$, our algorithm ensures $(\\alpha,\\alpha\\rho^2/2)$-Renyi differential privacy and finds a $(\\delta,\\epsilon)$-stationary point so long as $M=\\tilde\\Omega(\\frac{d}{\\delta\\epsilon^3} + \\frac{d^{3/2}}{\\rho\\delta\\epsilon^2})$.This matches the optimal complexity found in its non-private zeroth-order analog. Notably, although the objective is not smooth, we have privacy ``for free'' when $\\rho \\ge \\sqrt{d}\\epsilon$.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IzqZbNMZ0M",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18949,
    "title": "Efficient Score Matching with Deep Equilibrium Layers",
    "authors": [
      "Yuhao Huang",
      "Qingsong Wang",
      "Akwum Onwunta",
      "Bao Wang"
    ],
    "abstract": "Score matching methods -- estimate probability densities without computing the normalization constant -- are particularly useful in deep learning. However, computational and memory costs of score matching methods can be prohibitive for high-dimensional data or complex models, particularly due to the derivatives or Hessians of the log density function appearing in the objective function. Some existing approaches modify the objective function to reduce the quadratic computational complexity for Hessian computation. However, the memory bottleneck of score matching methods remains for deep learning. This study improves the memory efficiency of score matching by leveraging deep equilibrium models. We provide a theoretical analysis of deep equilibrium models for scoring matching and applying implicit differentiation to higher-order derivatives. Empirical evaluations demonstrate that our approach enables the development of deep and expressive models with improved performance and comparable computational and memory costs over shallow architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=J1djqLAa6N",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18587,
    "title": "Sliced Wasserstein Estimation with Control Variates",
    "authors": [
      "Khai Nguyen",
      "Nhat Ho"
    ],
    "abstract": "The sliced Wasserstein (SW) distances between two probability measures are defined as the expectation of the Wasserstein distance between two one-dimensional projections of the two measures. The randomness comes from a projecting direction that is used to project the two input measures to one dimension. Due to the intractability of the expectation, Monte Carlo integration is performed to estimate the value of the SW distance. Despite having various variants, there has been no prior work that improves the Monte Carlo estimation scheme for the SW distance in terms of controlling its variance. To bridge the literature on variance reduction and the literature on the SW distance, we propose computationally efficient control variates to reduce the variance of the empirical estimation of the SW distance. The key idea is to first find Gaussian approximations of projected one-dimensional measures, then we utilize the closed-form of the Wasserstein-2 distance between two Gaussian distributions to design the control variates. In particular, we propose using a lower bound and an upper bound of the Wasserstein-2 distance between two fitted Gaussians as two computationally efficient control variates. We empirically show that the proposed control variate estimators can help to reduce the variance considerably when comparing measures over images and point-clouds. Finally, we demonstrate the favorable performance of the proposed control variate estimators in gradient flows to interpolate between two point-clouds and in deep generative modeling on standard image datasets, such as CIFAR10 and CelebA.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=StYc4hQAEi",
    "arxiv_id": "2305.00402",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18948,
    "title": "Toward Optimal Policy Population Growth in Two-Player Zero-Sum Games",
    "authors": [
      "Stephen Marcus McAleer",
      "JB Lanier",
      "Kevin A. Wang",
      "Pierre Baldi",
      "Tuomas Sandholm",
      "Roy Fox"
    ],
    "abstract": "In competitive two-agent environments, deep reinforcement learning (RL) methods like Policy Space Response Oracles (PSRO) often increase exploitability between iterations, which is problematic when training in large games. To address this issue, we introduce anytime double oracle (ADO), an algorithm that ensures exploitability does not increase between iterations, and its approximate extensive-form version, anytime PSRO (APSRO). ADO converges to a Nash equilibrium while iteratively reducing exploitability. However, convergence in these algorithms may require adding all of a game's deterministic policies. To improve this, we propose Self-Play PSRO (SP-PSRO), which incorporates an approximately optimal stochastic policy into the population in each iteration. APSRO and SP-PSRO demonstrate lower exploitability and near-monotonic exploitability reduction in games like Leduc poker and Liar's Dice. Empirically, SP-PSRO often converges much faster than APSRO and PSRO, requiring only a few iterations in many games.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=J2TZgj3Tac",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18947,
    "title": "Mitigating Hallucination in Large Multi-Modal Models via Robust Instruction Tuning",
    "authors": [
      "Fuxiao Liu",
      "Kevin Lin",
      "Linjie Li",
      "Jianfeng Wang",
      "Yaser Yacoob",
      "Lijuan Wang"
    ],
    "abstract": "Despite the promising progress in multi-modal tasks, current large multi-modal models (LMMs) are prone to hallucinating inconsistent descriptions with respect to the associated image and human instructions. This paper addresses this issue by introducing the first large and diverse visual instruction tuning dataset, named Large-scale Robust Visual (LRV)-Instruction. Our dataset comprises 400k visualinstructions generated by GPT4, covering 16 vision-and-language tasks with open-ended instructions and answers. Unlike existing studies that primarily focus on positive instruction samples, we design LRV-Instruction to include both positive and negative instructions for more robust visual instruction tuning. Our negative instructions are designed at three semantic levels: (i) Nonexistent Object Manipulation, (ii) Existent Object Manipulation and (iii) Knowledge Manipulation. To efficiently measure the hallucination generated by LMMs, we propose GPT4-Assisted Visual Instruction Evaluation (GAVIE), a stable approach to evaluate visual instruction tuning like human experts. GAVIE does not require human-annotated groundtruth answers and can adapt to diverse instruction formats. We conduct comprehensive experiments to investigate the hallucination of LMMs. Our results demonstrate existing LMMs exhibit significant hallucinations when presented with our negative instructions, particularly Existent Object and Knowledge Manipulation instructions. Moreover, we successfully mitigate hallucination by finetuning MiniGPT4 and mPLUG-Owl on LRV-Instruction while improving performance on several publicdatasets compared to state-of-the-art methods. Additionally, we observed that a balanced ratio of positive and negative instances in the training data leads to a more robust model. Code and data will be released upon publication.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=J44HfH4JCg",
    "arxiv_id": "2306.14565",
    "GitHub": [
      "https://github.com/FuxiaoLiu/LRV-Instruction"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18946,
    "title": "Rethinking Label Poisoning for GNNs: Pitfalls and Attacks",
    "authors": [
      "Vijay Lingam",
      "Mohammad Sadegh Akhondzadeh",
      "Aleksandar Bojchevski"
    ],
    "abstract": "Node labels for graphs are usually generated using an automated process or crowd-sourced from human users. This opens up avenues for malicious users to compromise the training labels, making it unwise to blindly rely on them. While robustness against noisy labels is an active area of research, there are only a handful of papers in the literature that address this for graph-based data. Even more so, the effects of adversarial label perturbations is sparsely studied. More critically, we reveal that the entire literature on label poisoning for GNNs is plagued by serious evaluation pitfalls. Thus making it hard to conclude how robust GNNs are against label perturbations. After course correcting the state of label poisoning attacks with our faithful evaluation, we identify a discrepancy in attack efficiency of $\\sim9\\%$ on average. Additionally, we introduce two new simple yet effective attacks that are significantly stronger (up to $\\sim8\\%$) than the previous strongest attack. Our strongest proposed attack can be efficiently computed and is theoretically backed.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=J7ioefqDPw",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18945,
    "title": "Sample-Efficient Quality-Diversity by Cooperative Coevolution",
    "authors": [
      "Ke Xue",
      "Ren-Jian Wang",
      "Pengyi Li",
      "Dong Li",
      "Jianye HAO",
      "Chao Qian"
    ],
    "abstract": "Quality-Diversity (QD) algorithms, as a subset of evolutionary algorithms, have emerged as a powerful optimization paradigm with the aim of generating a set of high-quality and diverse solutions. Although QD has demonstrated competitive performance in reinforcement learning, its low sample efficiency remains a significant impediment for real-world applications. Recent research has primarily focused on augmenting sample efficiency by refining selection and variation operators of QD. However, one of the less considered yet crucial factors is the inherently large-scale issue of the QD optimization problem. In this paper, we propose a novel Cooperative Coevolution QD (CCQD) framework, which decomposes a policy network naturally into two types of layers, corresponding to representation and decision respectively, and thus simplifies the problem significantly. The resulting two (representation and decision) subpopulations are coevolved cooperatively. CCQD can be implemented with different selection and variation operators. Experiments on several popular tasks within the QDAX suite demonstrate that an instantiation of CCQD achieves approximately a 200% improvement in sample efficiency.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=JDud6zbpFv",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18943,
    "title": "Scaling Laws of RoPE-based Extrapolation",
    "authors": [
      "Xiaoran Liu",
      "Hang Yan",
      "Chenxin An",
      "Xipeng Qiu",
      "Dahua Lin"
    ],
    "abstract": "The extrapolation capability of Large Language Models (LLMs) based on Rotary Position Embedding \\cite{su2021roformer} is currently a topic of considerable interest. The mainstream approach to addressing extrapolation with LLMs involves modifying RoPE by replacing 10000, the rotary base of $\\theta_n={10000}^{-2n/d}$ in the original RoPE, with a larger value and providing longer fine-tuning text. In this work, we first observe that fine-tuning a RoPE-based LLM with either a smaller or larger base in pre-training context length could significantly enhance its extrapolation performance. After that, we propose \\textbf{\\textit{Scaling Laws of RoPE-based Extrapolation}}, a unified framework from the periodic perspective, to describe the relationship between the extrapolation performance and base value as well as tuning context length. In this process, we also explain the origin of the RoPE-based extrapolation issue by \\textbf{\\textit{critical dimension for extrapolation}}. Besides these observations and analyses, we achieve extrapolation up to 1 million context length within only 16K training length on LLaMA2 7B and 13B \\citep{touvron2023llama2}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JO7k0SJ5V6",
    "arxiv_id": "2310.05209",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18942,
    "title": "On the Stability of Iterative Retraining of Generative Models on their own Data",
    "authors": [
      "Quentin Bertrand",
      "Joey Bose",
      "Alexandre Duplessis",
      "Marco Jiralerspong",
      "Gauthier Gidel"
    ],
    "abstract": "Deep generative models have made tremendous progress in modeling complex data, often exhibiting generation quality that surpasses a typical human's ability to discern the authenticity of samples. Undeniably a key driver of this success is enabled by the massive amounts of web-scale data consumed by these models. Due to the striking performance of these models combined with their ease of availability, the web will inevitably be increasingly populated with synthetic content. Such a fact directly implies that future iterations of generative models must contend with the reality that their training is curated from both clean data and artificially generated data from past models. In this paper, we develop a framework to rigorously study the impact on the stability of training generative models on mixed datasets of real and synthetic data. We first prove the stability of iterative training under the condition that the initial generative models approximate the data distribution well enough and the proportion of clean training data (w.r.t. synthetic data) is large enough. Building on this foundation we quantify the error incurred by iterative retraining of generative models and we also provide a radius stability in parameter space. We empirically validate our theory on both synthetic and natural images by iteratively training normalizing flows and state-of-the-art diffusion models on CIFAR10 and FFHQ.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=JORAfH2xFd",
    "arxiv_id": "2310.00429",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18941,
    "title": "On the Role of General Function Approximation in Offline Reinforcement Learning",
    "authors": [
      "Chenjie Mao",
      "Qiaosheng Zhang",
      "Zhen Wang",
      "Xuelong Li"
    ],
    "abstract": "We study offline reinforcement learning (RL) with general function approximation. General function approximation is a powerful tool for algorithm design and analysis, but its adaptation to offline RL encounters several challenges due to varying approximation targets and assumptions that blur the real meanings of function assumptions. In this paper, we try to formulate and clarify the treatment of general function approximation in offline RL in two aspects: (1) analyzing different types of assumptions and their practical usage, and (2) understanding its role as a restriction on underlying MDPs from information-theoretic perspectives. Additionally, we introduce a new insight for lower bound establishing: one can exploit model-realizability to establish general-purposed lower bounds that can be generalized into other functions. Building upon this insight, we propose two generic lower bounds that contribute to a better understanding of offline RL with general function approximation.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=JSS9rKHySk",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18940,
    "title": "AirPhyNet: Harnessing Physics-Guided Neural Networks for Air Quality Prediction",
    "authors": [
      "Kethmi Hirushini Hettige",
      "Jiahao Ji",
      "Shili Xiang",
      "Cheng Long",
      "Gao Cong",
      "Jingyuan Wang"
    ],
    "abstract": "Air quality prediction and modelling plays a pivotal role in public health and environment management, for individuals and authorities to make informed decisions. Although traditional data-driven models have shown promise in this domain,their long-term prediction accuracy can be limited, especially in scenarios with sparse or incomplete data and they often rely on \"black-box\" deep learning structures that lack solid physical foundation leading to reduced transparency and interpretability in predictions. To address these limitations, this paper presents a novel approach named Physics guided Neural Network for Air Quality Prediction (AirPhyNet). Specifically, we leverage two well-established physics principles of air particle movement (diffusion and advection) by representing them as differential equation networks. Then, we utilize a graph structure to integrate physics knowledge into a neural network architecture and exploit latent representations to capture spatio-temporal relationships within the air quality data. Experiments on two real-world benchmark datasets demonstrate that AirPhyNet outperforms state-of-the-art models for different testing scenarios including different lead time (24h, 48h, 72h), sparse data and sudden change prediction, achieving reduction in prediction errors up to 10%. Moreover, a case study further validates that our model captures underlying physical processes of particle movement and generates accurate predictions with real physical meaning. The code is available at:: https://anonymous.4open.science/r/AirPhyNet-230F/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JW3jTjaaAB",
    "arxiv_id": "2402.03784",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18939,
    "title": "ARM: Refining Multivariate Forecasting with Adaptive Temporal-Contextual Learning",
    "authors": [
      "Jiecheng Lu",
      "Xu Han",
      "Shihao Yang"
    ],
    "abstract": "Long-term time series forecasting (LTSF) is important for various domains but is confronted by challenges in handling the complex temporal-contextual relationships. As multivariate input models underperforming some recent univariate counterparts, we posit that the issue lies in the inefficiency of existing multivariate LTSF Transformers to model series-wise relationships: the characteristic differences between series are often captured incorrectly. To address this, we introduce ARM: a multivariate temporal-contextual adaptive learning method, which is an enhanced architecture specifically designed for multivariate LTSF modelling. ARM employs Adaptive Univariate Effect Learning (**A**UEL), Random Dropping (**R**D) training strategy, and Multi-kernel Local Smoothing (**M**KLS), to better handle individual series temporal patterns and correctly learn inter-series dependencies. ARM demonstrates superior performance on multiple benchmarks without significantly increasing computational costs compared to vanilla Transformer, thereby advancing the state-of-the-art in LTSF. ARM is also generally applicable to other LTSF architecture beyond vanilla Transformer.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JWpwDdVbaM",
    "arxiv_id": "2310.09488",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18938,
    "title": "The Update-Equivalence Framework for Decision-Time Planning",
    "authors": [
      "Samuel Sokota",
      "Gabriele Farina",
      "David J Wu",
      "Hengyuan Hu",
      "Kevin A. Wang",
      "J Zico Kolter",
      "Noam Brown"
    ],
    "abstract": "The process of revising (or constructing) a policy immediately prior to execution---known as decision-time planning---is key to achieving superhuman performance in perfect-information games like chess and Go. A recent line of work has extended decision-time planning to more general imperfect-information games, leading to superhuman performance in poker. However, these methods require considering subgames whose sizes grow quickly in the amount of non-public information, making them unhelpful when the amount of non-public information is large. Motivated by this issue, we introduce an alternative framework for decision-time planning that is not based on subgames but rather on the notion of update equivalence. In this framework, decision-time planning algorithms are designed to replicate, in the limit, updates of global policy learners. Despite its conceptual simplicity, this approach had surprisingly been overlooked in the imperfect-information game literature. It enables us to introduce a new family of principled decision-time planning algorithms that do not rely on public information, opening the door to sound and effective decision-time planning in games with large amounts of non-public information. In experiments, members of this family produce comparable or superior results compared to state-of-the-art approaches in Hanabi and improve performance in 3x3 Abrupt Dark Hex and Phantom Tic-Tac-Toe.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JXGph215fL",
    "arxiv_id": "2304.13138",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18937,
    "title": "Towards Codable Watermarking for Injecting Multi-Bits Information to LLMs",
    "authors": [
      "Lean Wang",
      "Wenkai Yang",
      "Deli Chen",
      "Hao Zhou",
      "Yankai Lin",
      "Fandong Meng",
      "Jie Zhou",
      "Xu Sun"
    ],
    "abstract": "As large language models (LLMs) generate texts with increasing fluency and realism, there is a growing need to identify the source of texts to prevent the abuse of LLMs. Text watermarking techniques have proven reliable in distinguishing whether a text is generated by LLMs by injecting hidden patterns. However, we argue that existing LLM watermarking methods are encoding-inefficient and cannot flexibly meet the diverse information encoding needs (such as encoding model version, generation time, user id, etc.). In this work, we conduct the first systematic study on the topic of **Codable Text Watermarking for LLMs** (CTWL) that allows text watermarks to carry multi-bit customizable information. First of all, we study the taxonomy of LLM watermarking technologies and give a mathematical formulation for CTWL. Additionally, we provide a comprehensive evaluation system for CTWL: (1) watermarking success rate, (2) robustness against various corruptions, (3) coding rate of payload information, (4) encoding and decoding efficiency, (5) impacts on the quality of the generated text. To meet the requirements of these non-Pareto-improving metrics, we follow the most prominent vocabulary partition-based watermarking direction, and devise an advanced CTWL method named **Balance-Marking**. The core idea of our method is to use a proxy language model to split the vocabulary into probability-balanced parts, thereby effectively maintaining the quality of the watermarked text.Extensive experimental results show that our method outperforms the baseline under comprehensive evaluation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JYu5Flqm9D",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18936,
    "title": "SEA: Sparse Linear Attention with Estimated Attention Mask",
    "authors": [
      "Heejun Lee",
      "Jina Kim",
      "Jeffrey Willette",
      "Sung Ju Hwang"
    ],
    "abstract": "The transformer architecture has made breakthroughs in recent years on tasks which require modeling pairwise relationships between sequential elements, as is the case in natural language understanding. However, transformers struggle with long sequences due to the quadratic complexity of the attention operation, and previous research has aimed to lower the complexity by sparsifying or linearly approximating the attention matrix. Yet, these approaches cannot straightforwardly distill knowledge from a teacher's attention matrix, and often require complete retraining from scratch. Furthermore, previous sparse and linear approaches may also lose interpretability if they do not produce full quadratic attention matrices. To address these challenges, we propose SEA: Sparse linear attention with an Estimated Attention mask. SEA estimates the attention matrix with linear complexity via kernel-based linear attention, then creates a sparse approximation to the full attention matrix with a top-k selection to perform a sparse attention operation. For language modeling tasks (Wikitext2), previous linear and sparse attention methods show a roughly two-fold worse perplexity scores over the quadratic OPT-125M baseline, while SEA achieves an even better perplexity than OPT-125M, using roughly half as much memory as OPT-125M. Moreover, SEA maintains an interpretable attention matrix and can utilize knowledge distillation to lower the complexity of existing pretrained transformers. We believe that our work will have a large practical impact, as it opens the possibility of running large transformers on resource-limited devices with less memory.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JbcwfmYrob",
    "arxiv_id": "2310.01777",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18935,
    "title": "Optimal criterion for feature learning of two-layer linear neural network in high dimensional interpolation regime",
    "authors": [
      "Keita Suzuki",
      "Taiji Suzuki"
    ],
    "abstract": "Deep neural networks with feature learning have shown surprising generalization performance in high dimensional settings, but it has not been fully understood how and when they enjoy the benefit of feature learning. In this paper, we theoretically analyze the statistical properties of the benefits from feature learning in a two-layer linear neural network with multiple outputs in a high-dimensional setting. For that purpose, we propose a new criterion that allows feature learning of a two-layer linear neural network in a high-dimensional setting. Interestingly, we can show that models with smaller values of the criterion generalize even in situations where normal ridge regression fails to generalize. This is because the proposed criterion contains a proper regularization for the feature mapping and acts as an upper bound on the predictive risk. As an important characterization of the criterion, the two-layer linear neural network that minimizes this criterion can achieve the optimal Bayes risk that is determined by the distribution of the true signals across the multiple outputs. To the best of our knowledge, this is the first study to specifically identify the conditions under which a model obtained by proper feature learning can outperform normal ridge regression in a high-dimensional multiple-output linear regression problem.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Jc0FssXh2R",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18934,
    "title": "Multimodal Patient Representation Learning with Missing Modalities and Labels",
    "authors": [
      "Zhenbang Wu",
      "Anant Dadu",
      "Nicholas Tustison",
      "Brian Avants",
      "Mike Nalls",
      "Jimeng Sun",
      "Faraz Faghri"
    ],
    "abstract": "Multimodal patient representation learning aims to integrate information from multiple modalities and generate comprehensive patient representations for subsequent clinical predictive tasks. However, many existing approaches either presuppose the availability of all modalities and labels for each patient or only deal with missing modalities. In reality, patient data often comes with both missing modalities and labels for various reasons (i.e., the missing modality and label issue). Moreover, multimodal models might over-rely on certain modalities, causing sub-optimal performance when these modalities are absent (i.e., the modality collapse issue). To address these issues, we introduce MUSE: a mutual-consistent graph contrastive learning method. MUSE uses a flexible bipartite graph to represent the patient-modality relationship, which can adapt to various missing modality patterns. To tackle the modality collapse issue, MUSE learns to focus on modality-general and label-decisive features via a mutual-consistent contrastive learning loss. Notably, the unsupervised component of the contrastive objective only requires self-supervision signals, thereby broadening the training scope to incorporate patients with missing labels. We evaluate MUSE on three publicly available datasets: MIMIC-IV, eICU, and ADNI. Results show that MUSE outperforms all baselines, and MUSE+ further elevates the absolute improvement to ~4% by extending the training scope to patients with absent labels.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Je5SHCKpPa",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18933,
    "title": "iTransformer: Inverted Transformers Are Effective for Time Series Forecasting",
    "authors": [
      "Yong Liu",
      "Tengge Hu",
      "Haoran Zhang",
      "Haixu Wu",
      "Shiyu Wang",
      "Lintao Ma",
      "Mingsheng Long"
    ],
    "abstract": "The recent boom of linear forecasting models questions the ongoing passions in architectural modifications of Transformer-based forecasters. These forecasters leverage Transformers to model the global dependencies over temporal tokens of time series, with each token formed by multiple variates of the same timestamp. However, Transformer is challenged in forecasting series with larger lookback windows due to performance degradation and computation explosion. Besides, the unified embedding for each temporal token fuses multiple variates with potentially unaligned timestamps and distinct physical measurements, which may fail in learning variate-centric representations and result in meaningless attention maps. In this work, we reflect on the competent duties of Transformer components and repurpose the Transformer architecture without any adaptation on the basic components. We propose iTransformer that simply inverts the duties of the attention mechanism and the feed-forward network. Specifically, the time points of individual series are embedded into variate tokens which are utilized by the attention mechanism to capture multivariate correlations; meanwhile, the feed-forward network is applied for each variate token to learn nonlinear representations.The iTransformer model achieves consistent state-of-the-art on several real-world datasets, which further empowers the Transformer family with promoted performance, generalization ability across different variates, and better utilization of arbitrary lookback windows, making it a nice alternative as the fundamental backbone of time series forecasting.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=JePfAI8fah",
    "arxiv_id": "2310.06625",
    "GitHub": [
      "https://github.com/thuml/iTransformer"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18931,
    "title": "SKILL-MIX: a Flexible and Expandable Family of Evaluations for AI Models",
    "authors": [
      "Dingli Yu",
      "Simran Kaur",
      "Arushi Gupta",
      "Jonah Brown-Cohen",
      "Anirudh Goyal",
      "Sanjeev Arora"
    ],
    "abstract": "As the role of LLMs shifts from statistical modeling of language to serving as general-purpose AI agents, how should LLM evaluations change? Arguably, a key ability of an AI agent is to flexibly combine, as needed, the basic skills it has learned. This capability to combine skills plays an important role in (human) pedagogy and also in a recent paper on emergence phenomena (Arora & Goyal,2023). Our paper introduces an evaluation, Skill-Mix, to measure this capability. Using a list of $N$  skills the evaluator repeatedly picks random subsets of  $k$ skills and asks the LLM to produce text combining that subset of skills. Since the number of subsets grows like $N^k$, for even modest $k$ this evaluation will, with high probability, require the LLM to produce text it has not seen in the training set.  The paper develops a methodology for (a) designing and administering such an evaluation, and (b) automatic grading (plus spot-checking by humans) of the results using the open LLaMA-2 70b model as well as  GPT-4.  Administering a version of Skill-Mix to popular chatbots gave results that,  while generally in line with prior expectations, contained surprises. We found sizeable differences in capabilities among models ---including suspected cases of ``cramming for the leaderboard''--- that had not been revealed by the (much simpler) evaluations used in popular LLM leaderboards.  Our methodology can flexibly change to future models and model capabilities, by expanding the set of skills being tested and increasing  $k$. We hope Skill-Mix (which will be publicly released, including all prompts and code) may grow into an eco-system of open evaluations for AI capabilities, including in multi-modal settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Jf5gplvglq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18928,
    "title": "Rethinking Channel Dependence for Multivariate Time Series Forecasting: Learning from Leading Indicators",
    "authors": [
      "Lifan Zhao",
      "Yanyan Shen"
    ],
    "abstract": "Recently, channel-independent methods have achieved state-of-the-art performance in multivariate time series (MTS) forecasting. Despite reducing overfitting risks, these methods miss potential opportunities in utilizing channel dependence for accurate predictions. We argue that there exist locally stationary lead-lag relationships between variates, i.e., some lagged variates may follow the leading indicators within a short time period. Exploiting such channel dependence is beneficial since leading indicators offer advance information that can be used to reduce the forecasting difficulty of the lagged variates. In this paper, we propose a new method named LIFT that first efficiently estimates leading indicators and their leading steps at each time step and then judiciously allows the lagged variates to utilize the advance information from leading indicators. LIFT plays as a plugin that can be seamlessly collaborated with arbitrary time series forecasting methods. Extensive experiments on six real-world datasets demonstrate that LIFT improves the state-of-the-art methods by 5.6% in average forecasting performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JiTVtCUOpS",
    "arxiv_id": "2401.17548",
    "GitHub": [
      "https://github.com/SJTU-Quant/LIFT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18926,
    "title": "LabelDP-Pro: Learning with Label Differential Privacy via Projections",
    "authors": [
      "Badih Ghazi",
      "Yangsibo Huang",
      "Pritish Kamath",
      "Ravi Kumar",
      "Pasin Manurangsi",
      "Chiyuan Zhang"
    ],
    "abstract": "Label differentially private (label DP) algorithms seek to preserve the privacy of the labels in a training dataset in settings where the features are known to the adversary. In this work, we study a new family of label DP training algorithms. Unlike most prior label DP algorithms that have been based on label randomization, our algorithm naturally leverages the power of the central model of DP. It interleaves gradient projection operations with private stochastic gradient descent steps in order to improve the utility of the trained model while guaranteeing the privacy of the labels. We show that such projection-based algorithms can be made practical and that they improve on the state-of-the art for label DP training in the high-privacy regime. We complement our empirical evaluation with theoretical results shedding light on the efficacy of our method through the lens of bias-variance trade-offs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JnYaF3vv3G",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18925,
    "title": "A Mutual Information Perspective on Federated Contrastive Learning",
    "authors": [
      "Christos Louizos",
      "Matthias Reisser",
      "Denis Korzhenkov"
    ],
    "abstract": "We extend SimCLR to the federated setting through the lens of multi-view mutual information maximization. In doing so, we uncover a connection between contrastive representation learning and user verification; by adding a user verification loss to each client's local SimCLR loss we recover a lower bound to the global multi-view mutual information. To accommodate for the case of when some labelled data are available at the clients, we extend our SimCLR variant to the federated semi-supervised setting. We see that a supervised SimCLR objective can be obtained with two changes: a) the contrastive loss is computed between datapoints that share the same label and b) we require an additional auxiliary head that predicts the correct labels from either of the two views. Along with the proposed SimCLR extensions, we also study how different sources of non-i.i.d.-ness can impact the performance of federated unsupervised learning through global mutual information maximization; we find that a global objective is beneficial for some sources of non-i.i.d.-ness but can be detrimental for others. We experimentally evaluate our proposed extensions in various tasks to validate our claims.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=JrmPG9ufKg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18150,
    "title": "IMPUS: Image Morphing with Perceptually-Uniform Sampling Using Diffusion Models",
    "authors": [
      "Zhaoyuan Yang",
      "Zhengyang Yu",
      "Zhiwei Xu",
      "Jaskirat Singh",
      "Jing Zhang",
      "Dylan Campbell",
      "Peter Tu",
      "Richard Hartley"
    ],
    "abstract": "We present a diffusion-based image morphing approach with perceptually-uniform sampling (IMPUS) that produces smooth, direct, and realistic interpolations given an image pair. A latent diffusion model has distinct conditional distributions and data embeddings for each of the two images, especially when they are from different classes. To bridge this gap, we interpolate in the locally linear and continuous text embedding space and Gaussian latent space. We first optimize the endpoint text embeddings and then map the images to the latent space using a probability flow ODE. Unlike existing work that takes an indirect morphing path, we show that the model adaptation yields a direct path and suppresses ghosting artifacts in the interpolated images. To achieve this, we propose an adaptive bottleneck constraint based on a novel relative perceptual path diversity score that automatically controls the bottleneck size and balances the diversity along the path with its directness. We also propose a perceptually-uniform sampling technique that enables visually smooth changes between the interpolated images. Extensive experiments validate that our IMPUS can achieve smooth, direct, and realistic image morphing and be applied to other image generation tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gG38EBe2S8",
    "arxiv_id": "2311.06792",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18922,
    "title": "ReFusion: Improving Natural Language Understanding with Computation-Efficient Retrieval Representation Fusion",
    "authors": [
      "Shangyu Wu",
      "Ying Xiong",
      "Yufei CUI",
      "Xue Liu",
      "Buzhou Tang",
      "Tei-Wei Kuo",
      "Chun Jason Xue"
    ],
    "abstract": "Retrieval-based augmentations that aim to incorporate knowledge from an external database into language models have achieved great success in various knowledge-intensive (KI) tasks, such as question-answering and text generation.However, integrating retrievals in non-knowledge-intensive (NKI) tasks, such as text classification, is still challenging.Existing works focus on concatenating retrievals to inputs as context to form the prompt-based inputs. Unfortunately, such methods require language models to have the capability to handle long texts.Besides, inferring such concatenated data would also consume a significant amount of computational resources.To solve these challenges, we propose \\textbf{ReFusion} in this paper, a computation-efficient \\textbf{Re}trieval representation \\textbf{Fusion} with neural architecture search. The main idea is to directly fuse the retrieval representations into the language models.Specifically, we first propose an online retrieval module that retrieves representations of similar sentences.Then, we present a retrieval fusion module including two effective ranking schemes, i.e., reranker-based scheme and ordered-mask-based scheme, to fuse the retrieval representations with hidden states.Furthermore, we use Neural Architecture Search (NAS) to seek the optimal fusion structure across different layers. Finally, we conduct comprehensive experiments, and the results demonstrate our ReFusion can achieve superior and robust performance on various NKI tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JtKGkz9fAe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18920,
    "title": "Generative Adversarial Inverse Multiagent Learning",
    "authors": [
      "Denizalp Goktas",
      "Amy Greenwald",
      "Sadie Zhao",
      "Alec Koppel",
      "Sumitra Ganesh"
    ],
    "abstract": "In this paper, we study inverse game theory (resp. inverse multiagent learning) inwhich the goal is to find parameters of a game\u2019s payoff functions for which theexpected (resp. sampled) behavior is an equilibrium. We formulate these problemsas a generative-adversarial (i.e., min-max) optimization problem, based on whichwe develop polynomial-time algorithms the solve them, the former of whichrelies on an exact first-order oracle, and the latter, a stochastic one. We extendour approach to solve inverse multiagent apprenticeship learning in polynomialtime and number of samples, where we seek a simulacrum, i.e., parameters andan associated equilibrium, which replicate observations in expectation. We findthat our approach outperforms other widely-used methods in predicting prices inSpanish electricity markets based on time-series data.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=JzvIWvC9MG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18919,
    "title": "Conditional Information Bottleneck Approach for Time Series Imputation",
    "authors": [
      "MinGyu Choi",
      "Changhee Lee"
    ],
    "abstract": "Time series imputation presents a significant challenge because it requires capturing the underlying temporal dynamics from partially observed time series data. Among the recent successes of imputation methods based on generative models, the information bottleneck (IB) framework offers a well-suited theoretical foundation for multiple imputations, allowing us to account for the uncertainty associated with the imputed values. However, directly applying the IB framework to time series data without considering their temporal context can lead to a substantial loss of temporal dependencies, which, in turn, can degrade the overall imputation performance. To address such a challenge, we propose a novel conditional information bottleneck (CIB) approach for time series imputation, which aims to mitigate the potentially negative consequences of the regularization constraint by focusing on reducing the redundant information conditioned on the temporal context. We provide a theoretical analysis of its effect by adapting variational decomposition. We use the resulting insight and propose a novel deep learning method that can approximately achieve the proposed CIB objective for time series imputation as a combination of evidence lower bound and novel temporal kernel-enhanced contrastive optimization. Our experiments, conducted on multiple real-world datasets, consistently demonstrate that our method significantly improves imputation performance (including both interpolation and extrapolation), and also enhances classification performance based on the imputed values.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=K1mcPiDdOJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18918,
    "title": "Towards Enhancing Time Series Contrastive Learning: A Dynamic Bad Pair Mining Approach",
    "authors": [
      "Xiang Lan",
      "Hanshu Yan",
      "Shenda Hong",
      "Mengling Feng"
    ],
    "abstract": "Not all positive pairs are beneficial to time series contrastive learning. In this paper, we study two types of bad positive pairs that can impair the quality of time series representation learned through contrastive learning: the noisy positive pair and the faulty positive pair. We observe that, with the presence of noisy positive pairs, the model tends to simply learn the pattern of noise (Noisy Alignment). Meanwhile, when faulty positive pairs arise, the model wastes considerable amount of effort aligning non-representative patterns (Faulty Alignment). To address this problem, we propose a Dynamic Bad Pair Mining (DBPM) algorithm, which reliably identifies and suppresses bad positive pairs in time series contrastive learning. Specifically, DBPM utilizes a memory module to dynamically track the training behavior of each positive pair along training process. This allows us to identify potential bad positive pairs at each epoch based on their historical training behaviors. The identified bad pairs are subsequently down-weighted through a transformation module, thereby mitigating their negative impact on the representation learning process. DBPM is a simple algorithm designed as a lightweight **plug-in** without learnable parameters to enhance the performance of existing state-of-the-art methods. Through extensive experiments conducted on four large-scale, real-world time series datasets, we demonstrate DBPM's efficacy in mitigating the adverse effects of bad positive pairs. Codes are available at [Anonymous GitHub](https://anonymous.4open.science/r/DynamicBadPairMining_ICLR24-2562).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=K2c04ulKXn",
    "arxiv_id": "2302.03357",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18916,
    "title": "Robust Similarity Learning with Difference Alignment Regularization",
    "authors": [
      "Shuo Chen",
      "Gang Niu",
      "Chen Gong",
      "Okan Koc",
      "Jian Yang",
      "Masashi Sugiyama"
    ],
    "abstract": "Similarity-based representation learning has shown impressive capabilities in both supervised (e.g., metric learning) and unsupervised (e.g., contrastive learning) scenarios. Existing approaches effectively constrained the representation difference (i.e., the disagreement between the embeddings of two instances) to fit the corresponding (pseudo) similarity supervision. However, most of them can hardly restrict the variation of representation difference, sometimes leading to overfitting results where the clusters are disordered by drastically changed differences. In this paper, we thus propose a novel difference alignment regularization (DAR) to encourage all representation differences between inter-class instances to be as close as possible, so that the learning algorithm can produce consistent differences to distinguish data points from each other. To this end, we construct a new cross-total-variation (CTV) norm to measure the divergence among representation differences, and we convert it into an equivalent stochastic form for easy optimization. Then, we integrate the proposed regularizer into the empirical loss for difference-aligned similarity learning (DASL), shrinking the hypothesis space and alleviating overfitting. Theoretically, we prove that our regularizer tightens the error bound of the traditional similarity learning. Experiments on multi-domain data demonstrate the superiority of DASL over existing approaches in both supervised metric learning and unsupervised contrastive learning tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=K9V7ugVuUz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18915,
    "title": "VersVideo: Leveraging Enhanced Temporal Diffusion Models for Versatile Video Generation",
    "authors": [
      "Jinxi Xiang",
      "Ricong Huang",
      "Jun Zhang",
      "Guanbin Li",
      "Xiao Han",
      "Yang Wei"
    ],
    "abstract": "Creating stable, controllable videos is a complex task due to the need for significant variation in temporal dynamics and cross-frame temporal consistency. To address this, we enhance the spatial-temporal capability and introduce a versatile video generation model, VersVideo, which leverages textual, visual, and stylistic conditions. Current video diffusion models typically extend image diffusion architectures by supplementing 2D operations (such as convolutions and attentions) with temporal operations. While this approach is efficient, it often restricts spatial-temporal performance due to the oversimplification of standard 3D operations. To counter this, we incorporate two key elements: (1) multi-excitation paths for spatial-temporal convolutions with dimension pooling across different axes, and (2) multi-expert spatial-temporal attention blocks. These enhancements boost the model's spatial-temporal performance without significantly escalating training and inference costs. We also tackle the issue of information loss that arises when a variational autoencoder is used to transform pixel space into latent features and then back into pixel frames. To mitigate this, we incorporate temporal modules into the decoder to maintain inter-frame consistency. Lastly, by utilizing the innovative denoising UNet and decoder, we develop a unified ControlNet model suitable for various conditions, including image, Canny, HED, depth, and style. Examples of the videos generated by our model can be found at https://anonymous-pages.github.io/video_demos/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=K9sVJ17zvB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18914,
    "title": "Data Filtering Networks",
    "authors": [
      "Alex Fang",
      "Albin Madappally Jose",
      "Amit Jain",
      "Ludwig Schmidt",
      "Alexander T Toshev",
      "Vaishaal Shankar"
    ],
    "abstract": "Large training sets have become a cornerstone of machine learning and are the foundation for recent advances in language modeling and multimodal learning. While data curation for pre-training is often still ad-hoc, one common paradigm is to first collect a massive pool of data from the Web and then filter this candidate pool down to an actual training set via various heuristics. In this work, we study the problem of learning a *data filtering network* (DFN) for this second step  of filtering a large uncurated dataset. Our key finding is that the quality of a network for filtering is distinct from its performance on downstream tasks: for instance, a model that performs well on ImageNet can yield worse training sets than a model with low ImageNet accuracy that is trained on a small amount of high-quality data. Based on our insights, we construct new data filtering networks that induce state-of-the-art image-text datasets. Specifically, our best performing dataset DFN-5B enables us to train state-of-the-art models for their compute budgets: among other improvements on a variety of tasks, a ViT-H trained on our dataset achieves 83.0% zero-shot transfer accuracy on ImageNet, out-performing larger models trained on other datasets such as LAION-2B, DataComp-1B, or OpenAI\u2019s WIT. In order to facilitate further research in dataset design, we also release a new 2 billion example dataset DFN-2B and show that high performance data filtering networks can be trained from scratch using only publicly available data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KAk6ngZ09F",
    "arxiv_id": "2309.17425",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18912,
    "title": "A Cognitive Model for Learning Abstract Relational Structures from Memory-based Decision-Making Tasks",
    "authors": [
      "Haruo Hosoya"
    ],
    "abstract": "Motivated by a recent neuroscientific hypothesis, some theoretical studies have accounted for neural cognitive maps in the rodent hippocampal formation as a representation of the general relational structure across task environments.  However, despite their remarkable results, it is unclear whether their account can be extended to more general settings beyond spatial random-walk tasks in 2D environments.  To address this question, we construct a novel cognitive model that performs memory-based relational decision-making tasks, inspired by previous human studies, for learning abstract structures in non-spatial relations.  Building on previous approaches of modular architecture, we develop a learning algorithm that performs reward-guided search for representation of abstract relations, while dynamically maintaining their binding to concrete entities using our specific memory mechanism enabling content replacement.  Our experiments show (i) the capability of our model to capture relational structures that can generalize over new domains with unseen entities, (ii) the difficulty of our task that leads previous models, including Neural Turing Machine and vanilla Transformer, to complete failure, and (iii) the similarity of  performance and internal representations of our model to recent human behavioral and fMRI experimental data in the human hippocampal formation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KC58bVmxyN",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18911,
    "title": "ReMasker: Imputing Tabular Data with Masked Autoencoding",
    "authors": [
      "Tianyu Du",
      "Luca Melis",
      "Ting Wang"
    ],
    "abstract": "We present ReMasker, a new method of imputing missing values in tabular data by extending the masked autoencoding framework. Compared with prior work, ReMasker is extremely simple -- besides the missing values (i.e., naturally masked), we randomly \"re-mask\" another set of values, optimize the autoencoder by reconstructing this re-masked set, and apply the trained model to predict the missing values; and yet highly effective -- with extensive evaluation on benchmark datasets, we show that ReMasker performs on par with or outperforms state-of-the-art methods in terms of both imputation fidelity and utility under various missingness settings, while its performance advantage often increases with the ratio of missing data. We further explore theoretical justification for its effectiveness, showing that ReMasker tends to learn missingness-invariant representations of tabular data. Our findings indicate that masked modeling represents a promising direction for further research on tabular data imputation. The code is publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KI9NqjLVDT",
    "arxiv_id": "2309.13793",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18910,
    "title": "At Which Training Stage Does Code Data Help LLMs Reasoning?",
    "authors": [
      "YINGWEI MA",
      "Yue Liu",
      "Yue Yu",
      "Yuanliang Zhang",
      "Yu Jiang",
      "Changjian Wang",
      "Shanshan Li"
    ],
    "abstract": "Large Language models (LLMs) have exhibited remarkable reasoning capabilities and become the foundation of language technologies. Inspired by the great success of code data in training LLMs, we naturally wonder at which training stage introducing code data can really help LLMs reasoning. To this end, this paper systematically explores the impact of code data on LLMs at different stages. Concretely, we introduce the code data at the pre-training stage, instruction-tuning stage, and both of them, respectively. Then, the reasoning capability of LLMs is comprehensively and fairly evaluated via six reasoning tasks. We critically analyze the experimental results and provide conclusions with insights. First, pre-training LLMs with the mixture of code and text can significantly enhance LLMs' general reasoning capability almost without negative transfer on other tasks. Besides, at the instruction-tuning stage, code data endows LLMs the task-specific reasoning capability. Moreover, the dynamic mixing strategy of code and text data assists LLMs to learn reasoning capability step-by-step during training. These insights deepen the understanding of LLMs regarding reasoning ability for their application, such as scientific question answering, legal support, etc.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KIPJKST4gw",
    "arxiv_id": "2309.16298",
    "GitHub": [
      "https://github.com/yingweima2022/CodeLLM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18909,
    "title": "HiGen: Hierarchical Graph Generative Networks",
    "authors": [
      "Mahdi Karami"
    ],
    "abstract": "Most real-world graphs exhibit a hierarchical structure, which is often overlooked by existing graph generation methods. To address this limitation, we propose a novel graph generative network that captures the hierarchical nature of graphs and successively generates the graph sub-structures in a coarse-to-fine fashion. At each level of hierarchy, this model generates communities in parallel, followed by the prediction of cross-edges between communities using separate neural networks. This modular approach enables scalable graph generation for large and complex graphs.  Moreover, we model the output distribution of edges in the hierarchical graph with a multinomial distribution and derive a recursive factorization for this distribution. This enables us to generate  community graphs with integer-valued edge weights in an autoregressive manner.Empirical studies demonstrate the effectiveness and scalability of our proposed generative model, achieving state-of-the-art performance in terms of graph quality across various benchmark datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KNvubydSB5",
    "arxiv_id": "2305.19337",
    "GitHub": [
      "https://github.com/Karami-m/HiGen_main"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18908,
    "title": "Retroformer: Retrospective Large Language Agents with Policy Gradient Optimization",
    "authors": [
      "Weiran Yao",
      "Shelby Heinecke",
      "Juan Carlos Niebles",
      "Zhiwei Liu",
      "Yihao Feng",
      "Le Xue",
      "Rithesh R N",
      "Zeyuan Chen",
      "Jianguo Zhang",
      "Devansh Arpit",
      "Ran Xu",
      "Phil L Mui",
      "Huan Wang",
      "Caiming Xiong",
      "Silvio Savarese"
    ],
    "abstract": "Recent months have seen the emergence of a powerful new trend in which large language models (LLMs) are augmented to become autonomous language agents capable of performing objective oriented multi-step tasks on their own, rather than merely responding to queries from human users. Most existing language agents, however, are not optimized using environment-specific rewards. Although some agents enable iterative refinement through verbal feedback, they do not reason and plan in ways that are compatible with gradient-based learning from rewards. This paper introduces a principled framework for reinforcing large language agents by learning a retrospective model, which automatically tunes the language agent prompts from environment feedback through policy gradient. Specifically, our proposed agent architecture learns from rewards across multiple environments and tasks, for fine-tuning a pre-trained language model which refines the language agent prompt by summarizing the root cause of prior failed attempts and proposing action plans. Experimental results on various tasks demonstrate that the language agents improve over time and that our approach considerably outperforms baselines that do not properly leverage gradients from the environment.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KOZu91CzbK",
    "arxiv_id": "2308.02151",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18907,
    "title": "LEAP: Liberate Sparse-View 3D Modeling from Camera Poses",
    "authors": [
      "Hanwen Jiang",
      "Zhenyu Jiang",
      "Yue Zhao",
      "Qixing Huang"
    ],
    "abstract": "Are camera poses necessary for multi-view 3D modeling? Existing approaches predominantly assume access to accurate camera poses. While this assumption might hold for dense views, accurately estimating camera poses for sparse views is often elusive. Our analysis reveals that noisy estimated poses lead to degraded performance for existing sparse-view 3D modeling methods. To address this issue, we present LEAP, a novel pose-free approach, therefore challenging the prevailing notion that camera poses are indispensable. LEAP discards pose-based operations and learns geometric knowledge from data. LEAP is equipped with a neural volume, which is shared across scenes and is parameterized to encode geometry and texture priors. For each incoming scene, we update the neural volume by aggregating 2D image features in a feature-similarity-driven manner. The updated neural volume is decoded into the radiance field, enabling novel view synthesis from any viewpoint. On both object-centric and scene-level datasets, we show that LEAP significantly outperforms prior methods when they employ predicted poses from state-of-the-art pose estimators. Notably, LEAP performs on par with prior approaches that use ground-truth poses while running $400\\times$ faster than PixelNeRF. We show LEAP generalizes to novel object categories and scenes, and learns knowledge closely resembles epipolar geometry.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KPmajBxEaF",
    "arxiv_id": "2310.01410",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18905,
    "title": "Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagation",
    "authors": [
      "Shreyas Havaldar",
      "Navodita Sharma",
      "Shubhi Sareen",
      "Karthikeyan Shanmugam",
      "Aravindan Raghuveer"
    ],
    "abstract": "Learning from Label Proportions (LLP) is a learning problem where only aggregate level labels are available for groups of instances, called bags, during training, and the aim is to get the best performance at the instance-level on the test data. This setting arises in domains like advertising and medicine due to privacy considerations. We propose a novel algorithmic framework for this problem that iteratively performs two main steps. For the first step (Pseudo Labeling) in every iteration, we define a Gibbs distribution over binary instance labels that incorporates a) covariate information through the constraint that instances with similar covariates should have similar labels and b) the bag level aggregated label. We then use Belief Propagation (BP) to marginalize the Gibbs distribution to obtain pseudo labels. In the second step (Embedding Refinement), we use the pseudo labels to provide supervision for a learner that yields a better embedding. Further, we iterate on the two steps again by using the second step's embeddings as new covariates for the next iteration. In the final iteration, a classifier is trained using the pseudo labels. Our algorithm displays strong gains  against several SOTA baselines (upto **15%**) for the LLP Binary Classification problem on various dataset types - tabular and Image. We achieve these improvements with minimal computational overhead above standard supervised learning due to Belief Propagation, for large bag sizes, even for a million samples.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KQe9tHd0k8",
    "arxiv_id": "2310.08056",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18903,
    "title": "Memorization in Self-Supervised Learning Improves Downstream Generalization",
    "authors": [
      "Wenhao Wang",
      "Muhammad Ahmad Kaleem",
      "Adam Dziedzic",
      "Michael Backes",
      "Nicolas Papernot",
      "Franziska Boenisch"
    ],
    "abstract": "Self-supervised learning (SSL) has recently received significant attention due to its ability to train high-performance encoders purely on unlabeled data---often scraped from the internet. This data can still be sensitive and empirical evidence suggests that SSL encoders memorize private information of their training data and can disclose them at inference time. Since existing theoretical definitions of memorization from supervised learning rely on labels, they do not transfer to SSL. To address this gap, we propose a framework for defining memorization within the context of SSL. Our definition compares the difference in alignment of representations for data points and their augmented views returned by both encoders that were trained on these data points and encoders that were not. Through comprehensive empirical analysis on diverse encoder architectures and datasets we highlight that even though SSL relies on large datasets and strong augmentations---both known in supervised learning as regularization techniques that reduce overfitting---still significant fractions of training data points experience high memorization. Through our empirical results, we show that this memorization is essential for encoders to achieve higher generalization performance on different downstream tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KSjPaXtxP8",
    "arxiv_id": "2401.12233",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18902,
    "title": "Towards Robust Multi-Modal Reasoning via Model Selection",
    "authors": [
      "Xiangyan Liu",
      "Rongxue LI",
      "Wei Ji",
      "Tao Lin"
    ],
    "abstract": "The reasoning capabilities of LLM (Large Language Model) are widely acknowledged in recent research, inspiring studies on tool learning and autonomous agents. LLM serves as the ``brain'' of agent, orchestrating multiple tools for collaborative multi-step task solving. Unlike methods invoking tools like calculators or weather APIs for straightforward tasks, multi-modal agents excel by integrating diverse AI models for complex challenges. However, current multi-modal agents neglect the significance of model selection: they primarily focus on the planning and execution phases, and will only invoke predefined task-specific models for each subtask, making the execution fragile. Meanwhile, other traditional model selection methods are either incompatible with or suboptimal for the multi-modal agent scenarios, due to ignorance of dependencies among subtasks arising by multi-step reasoning.To this end, we identify the key challenges therein and propose the $\\textbf{\\textit{M}}^\\textbf{\\textit{3}}$ framework as a plug-in with negligible runtime overhead at test-time. This framework improves model selection and bolsters the robustness of multi-modal agents in multi-step reasoning. In the absence of suitable benchmarks, we create MS-GQA, a new dataset specifically designed to investigate the model selection challenge in multi-modal agents. Our experiments reveal that our framework enables dynamic model selection, considering both user inputs and subtask dependencies, thereby robustifying the overall reasoning process.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KTf4DGAzus",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18901,
    "title": "CORN: Contact-based Object Representation for Nonprehensile Manipulation of General Unseen Objects",
    "authors": [
      "Yoonyoung Cho",
      "Junhyek Han",
      "Yoontae Cho",
      "Beomjoon Kim"
    ],
    "abstract": "Nonprehensile manipulation is essential for manipulating objects that are too thin, large, or otherwise ungraspable in the wild. To sidestep the difficulty of contact modeling in conventional modeling-based approaches, reinforcement learning (RL) has recently emerged as a promising alternative. However, previous RL approaches either lack the ability to generalize over diverse object shapes, or use simple action primitives that limit the diversity of robot motions. Furthermore, using RL over diverse object geometry is challenging due to the high cost of training a policy that takes in high-dimensional sensory inputs. We propose a novel contact-based object representation and pretraining pipeline to tackle this. To enable massively parallel training, we leverage a lightweight patch-based transformer architecture for our encoder that processes point clouds, thus scaling our training across thousands of environments. Compared to learning from scratch, or other shape representation baselines, our representation facilitates both time- and data-efficient learning. We validate the efficacy of our overall system by zero-shot transferring the trained policy to novel real-world objects. We highly recommend the video attached in the supplementary material. Code and videos are available at \\url{https://sites.google.com/view/contact-non-prehensile}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KTtEICH4TO",
    "arxiv_id": "2403.10760",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18898,
    "title": "NetInfoF Framework: Measuring and Exploiting Network Usable Information",
    "authors": [
      "Meng-Chieh Lee",
      "Haiyang Yu",
      "Jian Zhang",
      "Vassilis N. Ioannidis",
      "Xiang song",
      "Soji Adeshina",
      "Da Zheng",
      "Christos Faloutsos"
    ],
    "abstract": "Given a node-attributed graph, and a graph task (link prediction or node classification), can we tell if a graph neural network (GNN) will perform well? More specifically, do the graph structure and the node features carry enough usable information for the task? Our goals are(1) to develop a fast tool to measure how much information is in the graph structure and in the node features, and(2) to exploit the information to solve the task, if there is enough.We propose NetInfoF, a framework including NetInfoF_Probe and NetInfoF_Act, for the measurement and the exploitation of network usable information (NUI), respectively. Given a graph data, NetInfoF_Probe measures NUI without any model training, and NetInfoF_Act solves link prediction and node classification, while two modules share the same backbone.In summary, NetInfoF has following notable advantages:(a) General, handling both link prediction and node classification;(b) Principled, with theoretical guarantee and closed-form solution;(c) Effective, thanks to the proposed adjustment to node similarity;(d) Scalable, scaling linearly with the input size.In our carefully designed synthetic datasets, NetInfoF correctly identifies the ground truth of NUI and is the only method being robust to all graph scenarios. Applied on real-world datasets, NetInfoF wins in 11 out of 12 times on link prediction compared to general GNN baselines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KY8ZNcljVU",
    "arxiv_id": "2402.07999",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18897,
    "title": "Depthwise Hyperparameter Transfer in Residual Networks: Dynamics and Scaling Limit",
    "authors": [
      "Blake Bordelon",
      "Lorenzo Noci",
      "Mufan Bill Li",
      "Boris Hanin",
      "Cengiz Pehlevan"
    ],
    "abstract": "The cost of hyperparameter tuning in deep learning has been rising with model sizes, prompting practitioners to find new tuning methods using a proxy of smaller networks. One such proposal uses $\\mu$P parameterized networks, where the optimal hyperparameters for small width networks *transfer* to networks with arbitrarily large width. However, in this scheme, hyperparameters do not transfer across depths. As a remedy, we study residual networks with a residual branch scale of $1/\\sqrt{\\text{depth}}$ in combination with the $\\mu$P parameterization. We provide experiments demonstrating that residual architectures including convolutional ResNets and vision transformers trained with this parameterization exhibit transfer of optimal hyperparameters across width and depth on CIFAR-10 and ImageNet.  Furthermore, our empirical findings are supported and motivated by theory. Using recent developments in the dynamical mean field theory (DMFT) description of neural network learning dynamics, we show that this parameterization of ResNets admits a well-defined feature learning joint infinite-width and infinite-depth limit and show convergence of finite-size network dynamics towards this limit.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KZJehvRKGD",
    "arxiv_id": "2309.16620",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18894,
    "title": "ReTaSA: A Nonparametric Functional Estimation Approach for Addressing Continuous Target Shift",
    "authors": [
      "Hwanwoo Kim",
      "Xin Zhang",
      "Jiwei Zhao",
      "Qinglong Tian"
    ],
    "abstract": "The presence of distribution shifts poses a significant challenge for deploying modern machine learning models in real-world applications. This work focuses on the target shift problem in a regression setting  (Zhang et al., 2013; Nguyen et al., 2016). More specifically, the target variable $y$ (also known as the response variable), which is continuous, has different marginal distributions in the training source and testing domain, while the conditional distribution of features $\\boldsymbol{x}$ given $y$ remains the same. While most literature focuses on classification tasks with finite target space, the regression problem has an *infinite dimensional* target space, which makes many of the existing methods inapplicable. In this work, we show that the continuous target shift problem can be addressed by estimating the importance weight function from an ill-posed integral equation. We propose a nonparametric regularized approach named *ReTaSA* to solve the ill-posed integral equation and provide theoretical justification for the estimated importance weight function. The effectiveness of the proposed method has been demonstrated with extensive numerical studies on synthetic and real-world datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KdVvOA00Or",
    "arxiv_id": "2401.16410",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18893,
    "title": "Language Model Cascades: Token-Level Uncertainty And Beyond",
    "authors": [
      "Neha Gupta",
      "Harikrishna Narasimhan",
      "Wittawat Jitkrittum",
      "Ankit Singh Rawat",
      "Aditya Krishna Menon",
      "Sanjiv Kumar"
    ],
    "abstract": "Recent advances in language models (LMs) have led to significant improvements in quality on complex NLP tasks, but at the expense of increased inference costs. A simple strategy to achieve more favorable cost-quality tradeoffs is cascading: here, a small model is invoked for most \u201ceasy\u201d instances, while a few \u201chard\u201d instances are deferred to the large model. While the principles underpinning effective cascading are well-studied for classification tasks \u2014 with deferral based on predicted class uncertainty favored theoretically and practically \u2014 a similar understanding is lacking for generative LM tasks. In this work, we initiate a systematic study of deferral rules for LM cascades. We begin by examining the natural extension of predicted class uncertainty to generative LM tasks, namely, the predicted sequence uncertainty. We show that this measure suffers from the length bias problem, either over- or under-emphasizing outputs based on their lengths. This is because LMs produce a sequence of uncertainty values, one for each output token; and moreover, the number of output tokens is variable across different examples. To mitigate the length bias, we propose to exploit the richer token-level uncertainty information implicit in generative LMs. We argue that naive predicted sequence uncertainty corresponds to a simple aggregation of these uncertainties. By contrast, we show that incorporating token-level uncertainty through learned post-hoc deferral rules can significantly outperform such simple aggregation strategies, via experiments on a range of natural language benchmarks with FLAN-T5 models. We further show that incorporating embeddings from the smaller model and intermediate layers of the larger model can give an additional boost in the overall cost-quality tradeoff.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KgaBScZ4VI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18892,
    "title": "Improving the Convergence of Dynamic NeRFs via Optimal Transport",
    "authors": [
      "Sameera Ramasinghe",
      "Violetta Shevchenko",
      "Gil Avraham",
      "Hisham Husain",
      "Anton van den Hengel"
    ],
    "abstract": "Synthesizing novel views for dynamic scenes from a collection of RGB inputs poses significant challenges due to the inherent under-constrained nature of the problem. To mitigate this ill-posedness, practitioners in the field of neural radiance fields (NeRF) often resort to the adoption of intricate geometric regularization techniques, including scene flow, depth estimation, or learned perceptual similarity. While these geometric cues have demonstrated their effectiveness, their incorporation leads to evaluation of computationally expensive off-the-shelf models, introducing substantial computational overhead into the pipeline. Moreover, seamlessly integrating such modules into diverse dynamic NeRF models can be a non-trivial task, hindering their utilization in an architecture-agnostic manner. In this paper, we propose a theoretically grounded, lightweight regularizer by treating the dynamics of a time-varying scene as a low-frequency change of a probability distribution of the light intensity. We constrain the dynamics of this distribution using optimal transport (OT) and provide error bounds under reasonable assumptions. Our regularization is learning-free, architecture agnostic, and can be implemented with just a few lines of code. Finally, we demonstrate the practical efficacy of our regularizer across state-of-the-art architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KiespDPaRH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18891,
    "title": "Cascading Reinforcement Learning",
    "authors": [
      "Yihan Du",
      "R. Srikant",
      "Wei Chen"
    ],
    "abstract": "Cascading bandits have gained popularity in recent years due to their applicability to recommendation systems and online advertising. In the cascading bandit model, at each timestep, an agent recommends an ordered subset of items (called an item list) from a pool of items, each associated with an unknown attraction probability. Then, the user examines the list, and clicks the first attractive item (if any), and after that, the agent receives a reward. The goal of the agent is to maximize the expected cumulative reward. However, the prior literature on cascading bandits ignores the influences of user states (e.g., historical behaviors) on recommendations and the change of states as the session proceeds. Motivated by this fact, we propose a generalized cascading RL framework, which considers the impact of user states and state transition into decisions. In cascading RL, we need to select items not only with  large attraction probabilities but also leading to good successor states. This imposes a huge computational challenge due to the combinatorial action space. To tackle this challenge, we delve into the properties of value functions, and design an oracle BestPerm to efficiently find the optimal item list. Equipped with BestPerm, we develop two algorithms CascadingVI and CascadingBPI, which are both computationally-efficient and sample-efficient, and provide near-optimal regret and sample complexity guarantees. Furthermore, we present experiments to show the improved computational and sample efficiencies of our algorithms compared to straightforward adaptations of existing RL algorithms in practice.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KjOAHlKMF5",
    "arxiv_id": "2401.08961",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18889,
    "title": "An Extensible Framework for Open Heterogeneous Collaborative Perception",
    "authors": [
      "Yifan Lu",
      "Yue Hu",
      "Yiqi Zhong",
      "Dequan Wang",
      "Yanfeng Wang",
      "Siheng Chen"
    ],
    "abstract": "Collaborative perception aims to mitigate the limitations of single-agent perception, such as occlusions, by facilitating data exchange among multiple agents. However, most current works consider a homogeneous scenario where all agents use identity sensors and perception models. In reality, heterogeneous agent types may continually emerge and inevitably face a domain gap when collaborating with existing agents. In this paper, we introduce a new open heterogeneous problem: how to accommodate continually emerging new heterogeneous agent types into collaborative perception, while ensuring high perception performance and low integration cost? To address this problem, we propose HEterogeneous ALliance (HEAL), a novel extensible collaborative perception framework. HEAL first establishes a unified feature space with initial agents via a novel multi-scale foreground-aware Pyramid Fusion network. When heterogeneous new agents emerge with previously unseen modalities or models, we align them to the established unified space with an innovative backward alignment. This step only involves individual training on the new agent type, thus presenting extremely low training costs and high extensibility. To enrich agents' data heterogeneity, we bring OPV2V-H, a new large-scale dataset with more diverse sensor types. Extensive experiments on OPV2V-H and DAIR-V2X datasets show that HEAL surpasses SOTA methods in performance while reducing the training parameters by 91.5\\% when integrating 3 new agent types. We further implement a comprehensive codebase at: https://github.com/yifanlu0227/HEAL",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KkrDUGIASk",
    "arxiv_id": "2401.13964",
    "GitHub": [
      "https://github.com/yifanlu0227/HEAL"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18888,
    "title": "FedHyper: A Universal and Robust Learning Rate Scheduler for Federated Learning with Hypergradient Descent",
    "authors": [
      "Ziyao Wang",
      "Jianyu Wang",
      "Ang Li"
    ],
    "abstract": "The theoretical landscape of federated learning (FL) undergoes rapid evolution, but its practical application encounters a series of intricate challenges, and hyperparameter optimization is one of these critical challenges. Amongst the diverse adjustments in hyperparameters, the adaptation of the learning rate emerges as a crucial component, holding the promise of significantly enhancing the efficacy of FL systems. In response to this critical need, this paper presents FedHyper, a novel hypergradient-based learning rate adaptation algorithm specifically designed for FL. FedHyper serves as a universal learning rate scheduler that can adapt both global and local rates as the training progresses. In addition, FedHyper not only showcases unparalleled robustness to a spectrum of initial learning rate configurations but also significantly alleviates the necessity for laborious empirical learning rate adjustments. We provide a comprehensive theoretical analysis of FedHyper\u2019s convergence rate and conduct extensive experiments on vision and language benchmark datasets. The results demonstrate that FEDHYPER consistently converges 1.1-3\u00d7 faster than FedAvg and the competing baselines while achieving superior final accuracy. Moreover, FEDHYPER catalyzes a remarkable surge in accuracy, augmenting it by up to 15% compared to FedAvg under suboptimal initial learning rate settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Kl9CqKf7h6",
    "arxiv_id": "2310.03156",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18887,
    "title": "On the Markov Property of Neural Algorithmic Reasoning: Analyses and Methods",
    "authors": [
      "Montgomery Bohde",
      "Meng Liu",
      "Alexandra Saxton",
      "Shuiwang Ji"
    ],
    "abstract": "Neural algorithmic reasoning is an emerging research direction that endows neural networks with the ability to mimic algorithmic executions step-by-step. A common paradigm in existing designs involves the use of historical embeddings in predicting the results of future execution steps. Our observation in this work is that such historical dependence intrinsically contradicts the Markov nature of algorithmic reasoning tasks. Based on this motivation, we present our ForgetNet, which does not use historical embeddings and thus is consistent with the Markov nature of the tasks. To address challenges in training ForgetNet at early stages, we further introduce G-ForgetNet, which uses a gating mechanism to allow for the selective integration of historical embeddings. Such an enhanced capability could provide valuable guidance during the model's early training phase. Our extensive experiments, based on the CLRS-30 algorithmic reasoning benchmark, demonstrate that both ForgetNet and G-ForgetNet achieve better generalization capability than existing methods. Furthermore, we investigate the behavior of the gating mechanism, highlighting its degree of alignment with our intuitions and its effectiveness for robust performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Kn7tWhuetn",
    "arxiv_id": "2403.04929",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18885,
    "title": "Generative Pre-training for Speech with Flow Matching",
    "authors": [
      "Alexander H. Liu",
      "Matthew Le",
      "Apoorv Vyas",
      "Bowen Shi",
      "Andros Tjandra",
      "Wei-Ning Hsu"
    ],
    "abstract": "Generative models have gained more and more attention in recent years for their remarkable success in tasks that required estimating and sampling data distribution to generate high-fidelity synthetic data. In speech, text-to-speech synthesis and neural vocoder are good examples where generative models have shined. While generative models have been applied to different applications in speech, there exists no general-purpose generative model that models speech directly. In this work, we take a step toward this direction by showing a single pre-trained generative model can be adapted to different downstream tasks with strong performance. Specifically, we pre-trained a generative model, named SpeechFlow, on 60k hours of untranscribed speech with Flow Matching and masked conditions. Experiment results show the pre-trained generative model can be fine-tuned with task-specific data to match or surpass existing expert models on speech enhancement, separation, and synthesis. Our work suggested a foundational model for generation tasks in speech can be built with generative pre-training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KpoQSgxbKH",
    "arxiv_id": "2310.16338",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18883,
    "title": "MetaPhysiCa: Improving OOD Robustness in Physics-informed Machine Learning",
    "authors": [
      "S Chandra Mouli",
      "Muhammad Alam",
      "Bruno Ribeiro"
    ],
    "abstract": "A fundamental challenge in physics-informed machine learning (PIML) is the design of robust PIML methods for out-of-distribution (OOD) forecasting tasks. These OOD tasks require learning-to-learn from observations of the same (ODE) dynamical system with different unknown ODE parameters, and demand accurate forecasts even under out-of-support initial conditions and out-of-support ODE parameters. In this work we propose to improve the OOD robustness of PIML via a meta-learning procedure for causal structure discovery. Using three different OOD tasks, we empirically observe that the proposed approach significantly outperforms existing state-of-the-art PIML and deep learning methods (with $2\\times$ to $28\\times$ lower OOD errors).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KrWuDiW4Qm",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18882,
    "title": "The Wasserstein Believer: Learning Belief Updates for Partially Observable Environments through Reliable Latent Space Models",
    "authors": [
      "Rapha\u00ebl Avalos",
      "Florent Delgrange",
      "Ann Nowe",
      "Guillermo Perez",
      "Diederik M Roijers"
    ],
    "abstract": "Partially Observable Markov Decision Processes (POMDPs) are used to model environments where the full state cannot be perceived by an agent. As such the agent needs to reason taking into account the past observations and actions. However, simply remembering the full history is generally intractable due to the exponential growth in the history space. Maintaining a probability distribution that models the belief over what the true state is can be used as a sufficient statistic of the history, but its computation requires access to the model of the environment and is often intractable. While SOTA algorithms use Recurrent Neural Networks to compress the observation-action history aiming to learn a sufficient statistic, they lack guarantees of success and can lead to sub-optimal policies. To overcome this, we propose the Wasserstein Belief Updater, an RL algorithm that learns a latent model of the POMDP and an approximation of the belief update. Our approach comes with theoretical guarantees on the quality of our approximation ensuring that our outputted beliefs allow for learning the optimal value function.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KrtGfTGaGe",
    "arxiv_id": "2303.03284",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18881,
    "title": "Thin-Shell Object Manipulations With Differentiable Physics Simulations",
    "authors": [
      "Yian Wang",
      "Juntian Zheng",
      "Zhehuan Chen",
      "Zhou Xian",
      "Gu Zhang",
      "Chao Liu",
      "Chuang Gan"
    ],
    "abstract": "In this work, we aim to teach robots to manipulate various thin-shell materials. Prior works studying thin-shell object manipulation mostly rely on heuristic policies or learn policies from real-world video demonstrations, and only focus on limited material types and tasks (e.g., cloth unfolding). However, these approaches face significant challenges when extended to a wider variety of thin-shell materials and a diverse range of tasks.On the other hand, while virtual simulations are shown to be effective in diverse robot skill learning and evaluation, prior thin-shell simulation environments only support a subset of thin-shell materials, which also limits their supported range of tasks. To fill in this gap, we introduce ThinShellLab - a fully differentiable simulation platform tailored for robotic interactions with diverse thin-shell materials possessing varying material properties, enabling flexible thin-shell manipulation skill learning and evaluation. Building on top of our developed simulation engine, we design a diverse set of manipulation tasks centered around different thin-shell objects. Our experiments suggest that manipulating thin-shell objects presents several unique challenges: 1) thin-shell manipulation relies heavily on frictional forces due to the objects' co-dimensional nature, 2) the materials being manipulated are highly sensitive to minimal variations in interaction actions, and 3) the constant and frequent alteration in contact pairs makes trajectory optimization methods susceptible to local optima, and neither standard reinforcement learning algorithms nor trajectory optimization methods (either gradient-based or gradient-free) are able to solve the tasks alone. To overcome these challenges, we present an optimization scheme that couples sampling-based trajectory optimization and gradient-based optimization, boosting both learning efficiency and converged performance across various proposed tasks. In addition, the differentiable nature of our platform facilitates a smooth sim-to-real transition. By tuning simulation parameters with a minimal set of real-world data, we demonstrate successful deployment of the learned skills to real-robot settings.  ThinShellLab will be publicly available. Video demonstration and more information can be found on the project website https://thinshelllab.github.io.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KsUh8MMFKQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18879,
    "title": "Large Multilingual Models Pivot Zero-Shot Multimodal Learning across Languages",
    "authors": [
      "Jinyi Hu",
      "Yuan Yao",
      "Chongyi Wang",
      "SHAN WANG",
      "Yinxu Pan",
      "Qianyu Chen",
      "Tianyu Yu",
      "Hanghao Wu",
      "Yue Zhao",
      "Haoye Zhang",
      "Xu Han",
      "Yankai Lin",
      "Jiao Xue",
      "dahai li",
      "Zhiyuan Liu",
      "Maosong Sun"
    ],
    "abstract": "Recently there has been a significant surge in multimodal learning in terms of both image-to-text and text-to-image generation. However, the success is typically limited to English, leaving other languages largely behind. Building a competitive counterpart in other languages is highly challenging due to the low-resource nature of non-English multimodal data (i.e., lack of large-scale, high-quality image-text data). In this work, we propose \\trainname, an effective training paradigm for training large multimodal models in low-resource languages. \\trainname demonstrates that \\textbf{M}ultilingual language models can \\textbf{P}ivot zero-shot \\textbf{M}ultimodal learning across languages. Specifically, based on a strong multilingual large language model, multimodal models pretrained on English-only image-text data can well generalize to other languages in a zero-shot manner, even surpassing models trained on image-text data in native languages. Taking Chinese as a practice of \\trainname, we build large multimodal models \\modelname in image-to-text and text-to-image generation, which achieve state-of-the-art (open-source) performance in Chinese. To facilitate future research, we open-source codes and model weights at https://anonymous.4open.science/r/VisCPM-8E13.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Kuh5qgCGCp",
    "arxiv_id": "2308.12038",
    "GitHub": [
      "https://github.com/OpenBMB/VisCPM.git"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18878,
    "title": "Accelerating Sinkhorn algorithm with sparse Newton iterations",
    "authors": [
      "Xun Tang",
      "Michael Shavlovsky",
      "Holakou Rahmanian",
      "Elisa Tardini",
      "Kiran Koshy Thekumparampil",
      "Tesi Xiao",
      "Lexing Ying"
    ],
    "abstract": "Computing the optimal transport distance between statistical distributions is a fundamental task in machine learning. One remarkable recent advancement is entropic regularization and the Sinkhorn algorithm, which utilizes only matrix scaling and guarantees an approximated solution with near-linear runtime. Despite the success of the Sinkhorn algorithm, its runtime may still be slow due to the potentially large number of iterations needed for convergence. To achieve possibly super-exponential convergence, we introduce Sinkhorn-Newton-Sparse (SNS), an extension to the Sinkhorn algorithm, by introducing early stopping for the matrix scaling steps and a second stage featuring a Newton-type subroutine. Adopting the variational viewpoint that the Sinkhorn algorithm maximizes a concave Lyapunov potential, we offer the insight that the Hessian matrix of the potential function is approximately sparse. Sparsification of the Hessian results in a fast $O(n^2)$ per-iteration complexity, the same as the Sinkhorn algorithm.  In terms of total iteration count, we observe that the SNS algorithm converges orders of magnitude faster across a wide range of practical cases, including optimal transportation between empirical distributions and calculating the Wasserstein $W_1, W_2$ distance of discretized continuous densities. The empirical performance is corroborated by a rigorous bound on the approximate sparsity of the Hessian matrix.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Kuj5gVp5GQ",
    "arxiv_id": "2401.12253",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18877,
    "title": "The False Promise of Imitating Proprietary Language Models",
    "authors": [
      "Arnav Gudibande",
      "Eric Wallace",
      "Charlie Victor Snell",
      "Xinyang Geng",
      "Hao Liu",
      "Pieter Abbeel",
      "Sergey Levine",
      "Dawn Song"
    ],
    "abstract": "An emerging method to cheaply improve a weaker language model is to finetune it on outputs from a stronger model, such as a proprietary system like ChatGPT (e.g., Alpaca, Self-Instruct, and others). In this work, we critically analyze this approach of imitating language models.We first finetune a series of LMs that imitate ChatGPT using varying base model sizes (1.5B--13B), data sources, and imitation data amounts (0.3M--150M tokens). We then evaluate the models using crowd raters and canonical NLP benchmarks. Initially, we were surprised by the output quality of our imitation models---they appear far better at following instructions, and crowd workers rate their outputs as competitive with ChatGPT. However, when conducting more targeted automatic evaluations, we find that imitation models close little to none of the gap from the base LM to ChatGPT on tasks that are not heavily supported in the imitation data. We show that these performance discrepancies may slip past human raters because imitation models are adept at mimicking ChatGPT\u2019s style but not its factuality. Overall, we conclude that model imitation is a false promise: there exists a substantial capabilities gap between open and closed LMs that, with current methods, can only be bridged using an unwieldy amount of imitation data or by using more capable base LMs.In turn, we argue that the highest leverage action for improving open-source models is to tackle the difficult challenge of developing better base LMs, rather than taking the shortcut of imitating proprietary systems.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Kz3yckpCN5",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18874,
    "title": "Rephrase, Augment, Reason: Visual Grounding of Questions for Vision-Language Models",
    "authors": [
      "Archiki Prasad",
      "Elias Stengel-Eskin",
      "Mohit Bansal"
    ],
    "abstract": "An increasing number of vision-language tasks can be handled with little to no training (i.e., in a zero and few-shot manner) by marrying large language models (LLMs) to vision encoders, resulting in large vision-language models (LVLMs). While this has huge upsides (e.g., not requiring training data or custom architectures), how an input is presented to a LVLM can have a major impact on zero-shot model performance. In particular, inputs phrased in an underspecified way can result in incorrect answers due to factors like missing visual information, complex implicit reasoning, or linguistic ambiguity. Therefore, adding visually-grounded information should improve model performance by reducing underspecification, e.g., by localizing objects and disambiguating references. To this end, we present **Rep**hrase, **A**ugment and **Re**ason (RepARe), a gradient-free framework, which extracts salient details about the image using the underlying LVLM as a captioner and reasoner, in order to propose modifications to the original question. We then use the LVLM\u2019s confidence over a generated answer as an unsupervised scoring function to select the rephrased question most likely to improve zero-shot performance. Focusing on two visual question answering tasks, we show that RepARe can result in an 3.85 percentage point (absolute) increase in zero-shot performance on VQAv2 and a 6.41 point increase on A-OKVQA. Additionally, we find that using gold answers for oracle selection of question candidates achieves an impressive gain in VQA accuracy by up to 14.41 percentage points. Through extensive analysis, we demonstrate that outputs from RepARe increase syntactic complexity and better utilize the frozen language model in LVLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=L4nOxziGf9",
    "arxiv_id": "2310.05861",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18872,
    "title": "Select to Perfect: Imitating desired behavior from large multi-agent data",
    "authors": [
      "Tim Franzmeyer",
      "Edith Elkind",
      "Philip Torr",
      "Jakob Nicolaus Foerster",
      "Joao F. Henriques"
    ],
    "abstract": "AI agents are commonly trained with large datasets of demonstrations of human behavior.However, not all behaviors are equally safe or desirable.Desired characteristics for an AI agent can be expressed by assigning desirability scores, which we assume are assigned to collective trajectories, but not to individual behaviors.For example, in a dataset of vehicle interactions, these scores might relate to the number of incidents that occurred. We first assess the effect of each individual agent's behavior on the collective desirability score, e.g., assessing how likely an agent is to cause incidents.This allows us to afterward only imitate agents with desired behavior, e.g., only imitating agents that are unlikely to cause incidents. To enable this, we propose the concept of an agent's \\textit{Exchange Value}, which quantifies an individual agent's contribution to the collective desirability score. This is expressed as the expected change in desirability score when substituting the agent for a randomly selected agent.We propose additional methods for estimating Exchange Values from real-world datasets, enabling us to learn aligned imitation policies that outperform relevant baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=L6crLU7MIE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18871,
    "title": "ODICE: Revealing the Mystery of Distribution Correction Estimation via Orthogonal-gradient Update",
    "authors": [
      "Liyuan Mao",
      "Haoran Xu",
      "Weinan Zhang",
      "Xianyuan Zhan"
    ],
    "abstract": "In this study, we investigate the DIstribution Correction Estimation (DICE) methods, an important line of work in offline reinforcement learning (RL) and imitation learning (IL). DICE-based methods impose state-action-level behavior constraint, which is an ideal choice for offline learning. However, they typically perform much worse than current state-of-the-art (SOTA) methods that solely use action-level behavior constraint. After revisiting DICE-based methods, we find there exist two gradient terms when learning the value function using true-gradient update: forward gradient (taken on the current state) and backward gradient (taken on the next state). Using forward gradient bears a large similarity to many offline RL methods, and thus can be regarded as applying action-level constraint. However, directly adding the backward gradient may degenerate or cancel out its effect if these two gradients have conflicting directions. To resolve this issue, we propose a simple yet effective modification that projects the backward gradient onto the normal plane of the forward gradient, resulting in an orthogonal-gradient update, a new learning rule for DICE-based methods. We conduct thorough theoretical analyses and find that the projected backward gradient brings state-level behavior regularization, which reveals the mystery of DICE-based methods: the value learning objective does try to impose state-action-level constraint, but needs to be used in a corrected way. Through toy examples and extensive experiments on complex offline RL and IL tasks, we demonstrate that DICE-based methods using orthogonal-gradient updates achieve SOTA performance and great robustness.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=L8UNn7Llt4",
    "arxiv_id": "2402.00348",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18870,
    "title": "Concept Bottleneck Generative Models",
    "authors": [
      "Aya Abdelsalam Ismail",
      "Julius Adebayo",
      "Hector Corrada Bravo",
      "Stephen Ra",
      "Kyunghyun Cho"
    ],
    "abstract": "We introduce a generative model with an intrinsically interpretable layer---a concept bottleneck layer---that constrains the model to encode human-understandable concepts. The concept bottleneck layer partitions the generative model into three parts: the pre-concept bottleneck portion, the CB layer, and the post-concept bottleneck portion. To train CB generative models, we complement the traditional task-based loss function for training generative models with a concept loss and an orthogonality loss. The CB layer and these loss terms are model agnostic, which we demonstrate by applying the CB layer to three different families of generative models: generative adversarial networks, variational autoencoders, and diffusion models. On multiple datasets across different types of generative models, steering a generative model, with the CB layer, outperforms all baselines---in some cases, it is \\textit{10 times} more effective. In addition, we show how the CB layer can be used to interpret the output of the generative model and debug the model during or post training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=L9U5MJJleF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18869,
    "title": "ZipIt! Merging Models from Different Tasks without Training",
    "authors": [
      "George Stoica",
      "Daniel Bolya",
      "Jakob Brandt Bjorner",
      "Pratik Ramesh",
      "Taylor Hearn",
      "Judy Hoffman"
    ],
    "abstract": "Typical deep visual recognition models are capable of performing the one task they were trained on. In this paper, we tackle the extremely difficult problem of combining distinct models with different initializations, each solving a separate task, into one multi-task model without any additional training. Prior work in model merging permutes one model to the space of the other then averages them together. While this works for models trained on the same task, we find that this fails to account for the differences in models trained on disjoint tasks. Thus, we introduce \"ZipIt!\", a general method for merging two arbitrary models of the same architecture that incorporates two simple strategies. First, in order to account for features that aren\u2019t shared between models, we expand the model merging problem to allow for merging features within each model by defining a general \u201czip\u201d operation. Second, we add support for partially zipping the models up until a specified layer, naturally creating a multi-head model. We find that these two changes combined account for a staggering 20-60% improvement over prior work, making it feasible to merge models trained on disjoint tasks without retraining.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LEYUkvdUhq",
    "arxiv_id": "2305.03053",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18867,
    "title": "Beyond Imitation: Leveraging Fine-grained Quality Signals for Alignment",
    "authors": [
      "Geyang Guo",
      "Ranchi Zhao",
      "Tianyi Tang",
      "Xin Zhao",
      "Ji-Rong Wen"
    ],
    "abstract": "Alignment with human preference is a desired property of large language models (LLMs). Currently, the main alignment approach is based on reinforcement learning from human feedback (RLHF). Despite the effectiveness of RLHF, it is intricate to implement and train, thus recent studies explore how to develop alternative alignment approaches based on supervised fine-tuning (SFT). A major limitation of SFT is that it essentially does imitation learning, which can't fully understand what are the expected behaviors. To address this issue, we propose an improved alignment approach named $\\textbf{FIGA}$. Different from prior methods, we incorporate fine-grained (i.e., token or phrase level) quality signals that are derived by contrasting good and bad responses. Our approach has made two major contributions. Firstly, we curate a refined alignment dataset that pairs initial responses and the corresponding revised ones. Secondly, we devise a new loss function can leverage fine-grained quailty signals to instruct the learning of LLMs for alignment. Extensive experiments have demonstrated the effectiveness of our approaches by comparing a number of competitive baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LNLjU5C5dK",
    "arxiv_id": "2311.04072",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18866,
    "title": "CCIL: Continuity-Based Data Augmentation for Corrective Imitation Learning",
    "authors": [
      "Liyiming Ke",
      "Yunchu Zhang",
      "Abhay Deshpande",
      "Siddhartha Srinivasa",
      "Abhishek Gupta"
    ],
    "abstract": "We present a new technique to enhance the robustness of imitation learning methods by generating corrective data to account for compounding error and disturbances. While existing methods rely on interactive expert labeling, additional offline datasets, or domain-specific invariances, our approach requires minimal additional assumptions beyond expert data. The key insight is to leverage local continuity in the environment dynamics. Our method first constructs a dynamics model from the expert demonstration, enforcing local Lipschitz continuity while skipping the discontinuous regions. In the locally continuous regions, this model allows us to generate corrective labels within the neighborhood of the demonstrations but beyond the actual set of states and actions in the dataset. Training on this augmented data enhances the agent's ability to recover from perturbations and deal with compounding error. We demonstrate the effectiveness of our generated labels through experiments in a variety of robotics domains that have distinct forms of continuity and discontinuity, including classic control, drone flying, high-dimensional navigation, locomotion, and tabletop manipulation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LQ6LQ8f4y8",
    "arxiv_id": "2310.12972",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18148,
    "title": "Neural Optimal Transport with General Cost Functionals",
    "authors": [
      "Arip Asadulaev",
      "Alexander Korotin",
      "Vage Egiazarian",
      "Petr Mokrov",
      "Evgeny Burnaev"
    ],
    "abstract": "We introduce a novel neural network-based algorithm to compute optimal transport (OT) plans for general cost functionals. In contrast to common Euclidean costs, i.e., $\\ell^1$ or $\\ell^2$, such functionals provide more flexibility and allow using auxiliary information, such as class labels, to construct the required transport map. Existing methods for general costs are discrete and have limitations in practice, i.e. they do not provide an out-of-sample estimation. We address the challenge of designing a continuous OT approach for general costs that generalizes to new data points in high-dimensional spaces, such as images. Additionally, we provide the theoretical error analysis for our recovered transport plans. As an application, we construct a cost functional to map data distributions while preserving the class-wise structure.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gIiz7tBtYZ",
    "arxiv_id": "2205.15403",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18865,
    "title": "SineNet: Learning Temporal Dynamics in Time-Dependent Partial Differential Equations",
    "authors": [
      "Xuan Zhang",
      "Jacob Helwig",
      "Yuchao Lin",
      "Yaochen Xie",
      "Cong Fu",
      "Stephan Wojtowytsch",
      "Shuiwang Ji"
    ],
    "abstract": "We consider using deep neural networks to solve time-dependent partial differential equations (PDEs), where multi-scale processing is crucial for modeling complex, time-evolving dynamics. While the U-Net architecture with skip connections is commonly used by prior studies to enable multi-scale processing, our analysis shows that the need for features to evolve across layers results in temporally misaligned features in skip connections, which limits the model\u2019s performance. To address this limitation, we propose SineNet, consisting of multiple sequentially connected U-shaped network blocks, referred to as waves. In SineNet, high-resolution features are evolved progressively through multiple stages, thereby reducing the amount of misalignment within each stage. We furthermore analyze the role of skip connections in enabling both parallel and sequential processing of multi-scale information. Our method is rigorously tested on multiple PDE datasets, including the Navier-Stokes equations and shallow water equations, showcasing the advantages of our proposed approach over conventional U-Nets with a comparable parameter budget. We further demonstrate that increasing the number of waves in SineNet while maintaining the same number of parameters leads to a monotonically improved performance. The results highlight the effectiveness of SineNet and the potential of our approach in advancing the state-of-the-art in neural PDE solver design.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LSYhE2hLWG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18864,
    "title": "Masked Distillation Advances Self-Supervised Transformer Architecture Search",
    "authors": [
      "Caixia Yan",
      "Xiaojun Chang",
      "Zhihui Li",
      "Lina Yao",
      "Minnan Luo",
      "Qinghua Zheng"
    ],
    "abstract": "Transformer architecture search (TAS) has achieved remarkable progress in automating the neural architecture design process of vision transformers. Recent TAS advancements have discovered outstanding transformer architectures while saving tremendous labor from human experts. However, it is still cumbersome to deploy these methods in real-world applications due to the expensive costs of data labeling under the supervised learning paradigm. To this end, this paper proposes a masked image modelling (MIM) based self-supervised neural architecture search method specifically designed for vision transformers, termed as MaskTAS, which completely avoids the expensive costs of data labeling inherited from supervised learning. Based on the one-shot NAS framework, MaskTAS requires to train various weight-sharing subnets, which can easily diverged without strong supervision in MIM-based self-supervised learning.For this issue, we design the search space of MaskTAS as a siamesed teacher-student architecture to distill knowledge from pre-trained networks, allowing for efficient training of the transformer supernet.To achieve self-supervised transformer architecture search, we further design a novel unsupervised evaluation metric for the evolutionary search algorithm, where each candidate of the student branch is rated by measuring its consistency with the larger teacher network.Extensive experiments demonstrate that the searched architectures can achieve state-of-the-art accuracy on benchmark dataset even without using manual labels. Moreover, the proposed MaskTAS can generalize well to various data domains and tasks by searching specialized transformer architectures in self-supervised manner.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LUpC8KTvdV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18863,
    "title": "Attention-Guided Contrastive Role Representations for Multi-agent Reinforcement Learning",
    "authors": [
      "Zican Hu",
      "Zongzhang Zhang",
      "Huaxiong Li",
      "Chunlin Chen",
      "Hongyu Ding",
      "Zhi Wang"
    ],
    "abstract": "Real-world multi-agent tasks usually involve dynamic team composition with the emergence of roles, which should also be a key to efficient cooperation in multi-agent reinforcement learning (MARL). Drawing inspiration from the correlation between roles and agent's behavior patterns, we propose a novel framework of Attention-guided COntrastive Role representation learning for MARL (ACORM) to promote behavior heterogeneity, knowledge transfer, and skillful coordination across agents. First, we introduce mutual information maximization to formalize role representation learning, derive a contrastive learning objective, and concisely approximate the distribution of negative pairs. Second, we leverage an attention mechanism to prompt the global state to attend to learned role representations in value decomposition, implicitly guiding agent coordination in a skillful role space to yield more expressive credit assignment. Experiments and visualizations on challenging StarCraft II micromanagement tasks demonstrate the state-of-the-art performance of our method and its advantages over existing approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LWmuPfEYhH",
    "arxiv_id": "2312.04819",
    "GitHub": [
      "https://github.com/NJU-RL/ACORM](https:"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18862,
    "title": "A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning",
    "authors": [
      "Haozhe Jiang",
      "Qiwen Cui",
      "Zhihan Xiong",
      "Maryam Fazel",
      "Simon Shaolei Du"
    ],
    "abstract": "We investigate learning the equilibria in non-stationary multi-agent systems and address the challenges that differentiate multi-agent learning from single-agent learning. Specifically, we focus on games with bandit feedback, where testing an equilibrium can result in substantial regret even when the gap to be tested is small, and the existence of multiple optimal solutions (equilibria) in stationary games poses extra challenges. To overcome these obstacles, we propose a versatile black-box approach applicable to a broad spectrum of problems, such as general-sum games, potential games, and Markov games, when equipped with appropriate learning and testing oracles for stationary environments. Our algorithms can achieve $\\widetilde{O}\\left(\\Delta^{1/4}T^{3/4}\\right)$ regret when the degree of nonstationarity, as measured by total variation $\\Delta$, is known, and $\\widetilde{O}\\left(\\Delta^{1/5}T^{4/5}\\right)$ regret when $\\Delta$ is unknown, where $T$ is the number of rounds. Meanwhile, our algorithm inherits the favorable dependence on number of agents from the oracles. As a side contribution that may be independent of interest, we show how to test for various types of equilibria by a black-box reduction to single-agent learning, which includes Nash equilibria, correlated equilibria, and coarse correlated equilibria.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LWuYsSD94h",
    "arxiv_id": "2306.07465",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18860,
    "title": "Zoology: Measuring and Improving  Recall in Efficient Language Models",
    "authors": [
      "Simran Arora",
      "Sabri Eyuboglu",
      "Aman Timalsina",
      "Isys Johnson",
      "Michael Poli",
      "James Zou",
      "Atri Rudra",
      "Christopher Re"
    ],
    "abstract": "Convolution-based language models are asymptotically more efficient than Transformers and recent work shows they are competitive in quality. To better understand the relative language modeling quality of these architectures, we pre-train a suite of 14 language models across attention and convolution-based architectures, finding that the SoTA gated convolution architectures still underperform Transformers by up to 2.1 perplexity points on the Pile. Our analysis shows that a single language modeling capability, termed associative recall (AR) \u2014 output the next token using the prior context, e.g. Hakuna Matata means no worries Hakuna Matata it means no \u2192 ?? \u2014 accounts for 76% of the perplexity gap on average. We show the issue arises because the convolution-based models process sequences using fixed filters that do not depend on the input data, making it difficult to handle a variable number of input-specific recall distances (e.g. 4 tokens between instances of Hakuna vs. 5 between worries above). Theoretically, our core contributions are precise bounds for solving AR, applying to the entire class of gated convolution models, that show dimensionality scaling in sequence length. Meanwhile, attention enables tokens separated by any distance to interact and solves AR with model dimension independent of sequence length. We present (1) a concise synthetic AR task, on which we validate the theoretically predicted scaling holds, and (2) a series of architectural modifications, theoretically and empirically showing that they enable solving AR with improved scaling. Our analysis motivates a set of strong baseline models that outperform Transformers at 150M and 355M parameters. We release all checkpoints and code for future analysis.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LY3ukUANko",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18859,
    "title": "H-GAP: Humanoid Control with a Generalist Planner",
    "authors": [
      "zhengyao jiang",
      "Yingchen Xu",
      "Nolan Wagener",
      "Yicheng Luo",
      "Michael Janner",
      "Edward Grefenstette",
      "Tim Rockt\u00e4schel",
      "Yuandong Tian"
    ],
    "abstract": "Humanoid control is an important research challenge offering avenues for integration into human-centric infrastructures and enabling physics-driven humanoid animations.The daunting challenges in this field stem from the difficulty of optimizing in high-dimensional action spaces and the instability introduced by the bipedal morphology of humanoids. However, the extensive collection of human motion-captured data and the derived datasets of humanoid trajectories, such as MoCapAct, paves the way to tackle these challenges. In this context, we present Humanoid Generalist Autoencoding Planner (H-GAP), a state-action trajectory generative model trained on humanoid trajectories derived from human motion-captured data, capable of adeptly handling downstream control tasks with Model Predictive Control (MPC).For 56 degrees of freedom humanoid, we empirically demonstrate that H-GAP learns to represent and generate a wide range of motor behaviors. Further, without any learning from online interactions, it can also flexibly transfer these behaviours to solve novel downstream control tasks via planning. Notably, H-GAP excels established MPC baselines with access to the ground truth model, and is superior or comparable to offline RL methods trained for individual tasks.Finally, we do a series of empirical studies on the scaling properties of H-GAP, showing the potential for performance gains via additional data but not computing.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=LYG6tBlEX0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18857,
    "title": "JoMA: Demystifying Multilayer Transformers via Joint Dynamics of MLP and Attention",
    "authors": [
      "Yuandong Tian",
      "Yiping Wang",
      "Zhenyu Zhang",
      "Beidi Chen",
      "Simon Shaolei Du"
    ],
    "abstract": "We propose Joint MLP/Attention (JoMA) dynamics, a novel mathematical framework to understand the training procedure of multilayer Transformer architectures. This is achieved by integrating out the self-attention layer in Transformers, producing a modified dynamics of MLP layers only. JoMA removes unrealistic assumptions in previous analysis (e.g., lack of residual connection), and predicts that the attention first becomes sparse (to learn salient tokens), then dense (to learn less salient tokens) in the presence of nonlinear activations, while in the linear case, it is consistent with existing works. We leverage JoMA to qualitatively explains how tokens are combined to form hierarchies in multilayer Transformers, when the input tokens are generated by a latent hierarchical generative model. Experiments on models trained from real-world dataset (Wikitext2/Wikitext103) and various pre- trained models (OPT, Pythia) verify our theoretical findings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LbJqRGNYCf",
    "arxiv_id": "2310.00535",
    "GitHub": [
      "https://github.com/facebookresearch/luckmatters"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18855,
    "title": "Delta-AI: Local objectives for amortized inference in sparse graphical models",
    "authors": [
      "Jean-Pierre Ren\u00e9 Falet",
      "Hae Beom Lee",
      "Nikolay Malkin",
      "Chen Sun",
      "Dragos Secrieru",
      "Dinghuai Zhang",
      "Guillaume Lajoie",
      "Yoshua Bengio"
    ],
    "abstract": "We present a new algorithm for amortized inference in sparse probabilistic graphical models (PGMs), which we call $\\Delta$-amortized inference ($\\Delta$-AI). Our approach is based on the observation that when the sampling of variables in a PGM is seen as a sequence of actions taken by an agent, sparsity of the PGM enables local credit assignment in the agent's policy learning objective. This yields a local constraint that can be turned into a local loss in the style of generative flow networks (GFlowNets) that enables off-policy training but avoids the need to instantiate all the random variables for each parameter update, thus speeding up training considerably. The $\\Delta$-AI objective matches the conditional distribution of a variable given its Markov blanket in a tractable learned sampler, which has the structure of a Bayesian network, with the same conditional distribution under the target PGM. As such, the trained sampler recovers marginals and conditional distributions of interest and enables inference of partial subsets of variables. We illustrate $\\Delta$-AI's effectiveness for sampling from synthetic PGMs and training latent variable models with sparse factor structure.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LemSSn8htt",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18854,
    "title": "Confidence-aware Reward Optimization for Fine-tuning Text-to-Image Models",
    "authors": [
      "Kyuyoung Kim",
      "Jongheon Jeong",
      "Minyong An",
      "Mohammad Ghavamzadeh",
      "Krishnamurthy Dj Dvijotham",
      "Jinwoo Shin",
      "Kimin Lee"
    ],
    "abstract": "Fine-tuning text-to-image models using reward functions trained on human feedback data has emerged as a powerful approach for aligning model behavior with human intent. However, excessive optimization with such reward models, which are only proxy objectives, can degrade the performance of the fine-tuned models, a phenomenon commonly referred to as reward overoptimization. We introduce the Text-Image Alignment Assessment (TIA2) benchmark, a diverse collection of text prompts, images, and human annotations, for studying the issue in depth. We evaluate several state-of-the-art reward models for text-to-image generation on our benchmark and find that they are often not well-aligned with human assessment. We empirically demonstrate that overoptimization can occur when a poorly aligned reward model is used as a fine-tuning objective. To address this, we introduce a simple method, TextNorm, for inducing confidence calibration in reward models by normalizing the scores across prompts that are semantically different from the original prompt. We demonstrate that using the confidence-calibrated scores in fine-tuning effectively reduces the risk of overoptimization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Let8OMe20n",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18853,
    "title": "Layer-wise linear mode connectivity",
    "authors": [
      "Linara Adilova",
      "Maksym Andriushchenko",
      "Michael Kamp",
      "Asja Fischer",
      "Martin Jaggi"
    ],
    "abstract": "Averaging neural network parameters is an intuitive method for fusing the knowledge of two independent models. It is most prominently used in federated learning. If models are averaged at the end of training, this can only lead to a good performing model if the loss surface of interest is very particular, i.e., the loss in the exact middle between the two models needs to be sufficiently low. This is impossible to guarantee for the non-convex losses of state-of-the-art networks. For averaging models trained on vastly different datasets, it was proposed to average only the parameters of particular layers or combinations of layers, resulting in better performing models. To get a better understanding of the effect of layer-wise averaging, we analyse the performance of the models that result from averaging single layers, or groups of layers. Based on our empirical and theoretical investigation, we introduce a novel notion of the layer-wise linear connectivity, and show that deep networks do not have layer-wise barriers between them. We analyze additionally the layer-wise personalization averaging and conjecture that in particular problem setup all the partial aggregations result in the approximately same performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LfmZh91tDI",
    "arxiv_id": "2307.06966",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18852,
    "title": "Transformer Fusion with Optimal Transport",
    "authors": [
      "Moritz Imfeld",
      "Jacopo Graldi",
      "Marco Giordano",
      "Thomas Hofmann",
      "Sotiris Anagnostidis",
      "Sidak Pal Singh"
    ],
    "abstract": "Fusion is a technique for merging multiple independently-trained neural networks in order to combine their capabilities. Past attempts have been restricted to the case of fully-connected, convolutional, and residual networks. In this paper, we present a systematic approach for fusing two or more transformer-based networks exploiting Optimal Transport to (soft-)align the various architectural components. We flesh out an abstraction for layer alignment, that can generalize to arbitrary architectures -- in principle -- and we apply this to the key ingredients of Transformers such as multi-head self-attention, layer-normalization, and residual connections, and we discuss how to handle them via various ablation studies. Furthermore, our method allows the fusion of models of different sizes  (heterogeneous fusion), providing a new and efficient way for compression of Transformers. The proposed approach is evaluated on both image classification tasks via Vision Transformer and natural language modeling tasks using BERT. Our approach consistently outperforms vanilla fusion, and, after a surprisingly short finetuning, also outperforms the individual converged parent models. In our analysis, we uncover intriguing insights about the significant role of soft alignment in the case of Transformers. Our results showcase the potential of fusing multiple Transformers, thus compounding their expertise, in the budding paradigm of model fusion and recombination.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LjeqMvQpen",
    "arxiv_id": "2310.05719",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18849,
    "title": "3D Feature Prediction for Masked-AutoEncoder-Based Point Cloud Pretraining",
    "authors": [
      "Siming Yan",
      "Yuqi Yang",
      "Yu-Xiao Guo",
      "Hao Pan",
      "Peng-Shuai Wang",
      "Xin Tong",
      "Yang Liu",
      "Qixing Huang"
    ],
    "abstract": "Masked autoencoders (MAE) have recently been introduced to 3D self-supervised pretraining for point clouds due to their great success in NLP and computer vision. Unlike MAEs used in the image domain, where the pretext task is to restore features at the masked pixels, such as colors, the existing 3D MAE works reconstruct the missing geometry only, i.e, the location of the masked points. In contrast to previous studies, we advocate that point location recovery is inessential and restoring intrinsic point features is much superior. To this end, we propose to ignore point position reconstruction and recover high-order features at masked points including surface normals and surface variations, through a novel attention-based decoder which is independent of the encoder design. We validate the effectiveness of our pretext task and decoder design using different encoder structures for 3D training and demonstrate the advantages of our pretrained networks on various point cloud analysis tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LokR2TTFMs",
    "arxiv_id": "2304.06911",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18848,
    "title": "Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis",
    "authors": [
      "Jie Hao",
      "Xiaochuan Gong",
      "Mingrui Liu"
    ],
    "abstract": "Bilevel optimization is an important formulation for many machine learning problems, such as meta-learning and hyperparameter optimization. Current bilevel optimization algorithms assume that the gradient of the upper-level function is Lipschitz (i.e., the upper-level function has a bounded smoothness parameter). However, recent studies reveal that certain neural networks such as recurrent neural networks (RNNs) and long-short-term memory networks (LSTMs) exhibit potential unbounded smoothness, rendering conventional bilevel optimization algorithms unsuitable for these neural networks. In this paper, we design a new bilevel optimization algorithm, namely BO-REP, to address this challenge. This algorithm updates the upper-level variable using normalized momentum and incorporates two novel techniques for updating the lower-level variable: \\textit{initialization refinement} and \\textit{periodic updates}. Specifically, once the upper-level variable is initialized, a subroutine is invoked to obtain a refined estimate of the corresponding optimal lower-level variable, and the lower-level variable is updated only after every specific period instead of each iteration. When the upper-level problem is nonconvex and unbounded smooth, and the lower-level problem is strongly convex, we prove that our algorithm requires $\\widetilde{\\mathcal{O}}(1/\\epsilon^4)$ \\footnote{Here $\\widetilde{\\mathcal{O}}(\\cdot)$ compresses logarithmic factors of $1/\\epsilon$ and $1/\\delta$, where $\\delta\\in(0,1)$ denotes the failure probability.} iterations to find an $\\epsilon$-stationary point in the stochastic setting, where each iteration involves calling a stochastic gradient or Hessian-vector product oracle. Notably, this result matches the state-of-the-art complexity results under the bounded smoothness setting and without mean-squared smoothness of the stochastic gradient, up to logarithmic factors. Our proof relies on novel technical lemmas for the periodically updated lower-level variable, which are of independent interest. Our experiments on hyper-representation learning, hyperparameter optimization, and data hyper-cleaning for text classification tasks demonstrate the effectiveness of our proposed algorithm. The code is available at [https://github.com/MingruiLiu-ML-Lab/Bilevel-Optimization-under-Unbounded-Smoothness](https://github.com/MingruiLiu-ML-Lab/Bilevel-Optimization-under-Unbounded-Smoothness).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=LqRGsGWOTX",
    "arxiv_id": "2401.09587",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18846,
    "title": "LaneSegNet: Map Learning with Lane Segment Perception for Autonomous Driving",
    "authors": [
      "Tianyu Li",
      "Peijin Jia",
      "Bangjun Wang",
      "Li Chen",
      "KUN JIANG",
      "Junchi Yan",
      "Hongyang Li"
    ],
    "abstract": "A map, as crucial information for downstream applications of an autonomous driving system, is usually represented in lanelines or centerlines. However, existing literature on map learning primarily focuses on either detecting geometry-based lanelines or perceiving topology relationships of centerlines. Both of these methods ignore the intrinsic relationship of lanelines and centerlines, that lanelines bind centerlines. While simply predicting both types of lane in one model is mutually excluded in learning objective, we advocate lane segment as a new representation that seamlessly incorporates both geometry and topology information. Thus, we introduce LaneSegNet, the first end-to-end mapping network generating lane segments to obtain a complete representation of the road structure. Our algorithm features two key modifications. One is a lane attention module to capture pivotal region details within the long-range feature space. Another is an identical initialization strategy for reference points, which enhances the learning of positional priors for lane attention. On the OpenLane-V2 dataset, LaneSegNet outperforms previous counterparts by a substantial gain across three tasks, i.e., map element detection (+4.8 mAP), centerline perception (+6.9 DET_l), and the newly defined one, lane segment perception (+5.6 mAP). Furthermore, it obtains a real-time inference speed of 14.7 FPS. Code would be released to the public.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LsURkIPYR5",
    "arxiv_id": "2312.16108",
    "GitHub": [
      "https://github.com/OpenDriveLab/LaneSegNet"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18842,
    "title": "Ins-DetCLIP: Aligning Detection Model to Follow Human-Language Instruction",
    "authors": [
      "Renjie Pi",
      "Lewei Yao",
      "Jianhua Han",
      "Xiaodan Liang",
      "Wei Zhang",
      "Hang Xu"
    ],
    "abstract": "This paper introduces Instruction-oriented Object Detection (IOD), a new task that enhances human-computer interaction by enabling object detectors to understand user instructions and locate relevant objects. Unlike traditional open-vocabulary object detection tasks that rely on users providing a list of required category names, IOD requires models to comprehend natural-language instructions, contextual reasoning, and output the name and location of the desired categories. This poses fresh challenges for modern object detection systems. To develop an IOD system, we create a dataset called IOD-Bench, which consists of instruction-guided detections, along with specialized evaluation metrics. We leverage large-scale language models (LLMs) to generate a diverse set of instructions (8k+) based on existing public object detection datasets, covering a wide range of real-world scenarios. As an initial approach to the IOD task, we propose a model called Ins-DetCLIP. It harnesses the extensive knowledge within LLMs to empower the detector with instruction-following capabilities. Specifically, our Ins-DetCLIP employs a visual encoder (i.e., DetCLIP, an open-vocabulary detector) to extract object-level features. These features are then aligned with the input instructions using a cross-modal fusion module integrated into a pre-trained LLM. Experimental results conducted on IOD-Bench demonstrate that our model consistently outperforms baseline methods that directly combine LLMs with detection models. This research aims to pave the way for a more adaptable and versatile interaction paradigm in modern object detection systems, making a significant contribution to the field.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=M0MF4t3hE9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18841,
    "title": "Exploiting Causal Graph Priors with Posterior Sampling for Reinforcement Learning",
    "authors": [
      "Mirco Mutti",
      "Riccardo De Santi",
      "Marcello Restelli",
      "Alexander Marx",
      "Giorgia Ramponi"
    ],
    "abstract": "Posterior sampling allows the exploitation of prior knowledge of the environment's transition dynamics to improve the sample efficiency of reinforcement learning. The prior is typically specified as a class of parametric distributions, a task that can be cumbersome in practice, often resulting in the choice of uninformative priors. In this work, we propose a novel posterior sampling approach in which the prior is given as a (partial) causal graph over the environment's variables. The latter is often more natural to design, such as listing known causal dependencies between biometric features in a medical treatment study. Specifically, we propose a hierarchical Bayesian procedure, called C-PSRL, simultaneously learning the full causal graph at the higher level and the parameters of the resulting factored dynamics at the lower level. For this procedure, we provide an analysis of its Bayesian regret, which explicitly connects the regret rate with the degree of prior knowledge. Our numerical evaluation conducted in illustrative domains confirms that C-PSRL strongly improves the efficiency of posterior sampling with an uninformative prior while performing close to posterior sampling with the full causal graph.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=M0xK8nPGvt",
    "arxiv_id": "2310.07518",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18838,
    "title": "Plug-and-Play Policy Planner for Large Language Model Powered Dialogue Agents",
    "authors": [
      "Yang Deng",
      "Wenxuan Zhang",
      "Wai Lam",
      "See-Kiong Ng",
      "Tat-Seng Chua"
    ],
    "abstract": "Proactive dialogues serve as a practical yet challenging dialogue problem in the era of large language models (LLMs), where the dialogue policy planning is the key to improving the proactivity of LLMs. Most existing studies enable the dialogue policy planning of LLMs using various prompting schemes or iteratively enhance this capability in handling the given case with verbal AI feedback. However, these approaches are either bounded by the policy planning capability of the frozen LLMs or hard to be transferred to new cases. In this work, we introduce a new dialogue policy planning paradigm to strategize LLMs for proactive dialogue problems with a tunable language model plug-in as a plug-and-play dialogue policy planner, named PPDPP. Specifically, we develop a novel training framework to facilitate supervised fine-tuning over available human-annotated data as well as reinforcement learning from goal-oriented AI feedback with dynamic interaction data collected by the LLM-based self-play simulation. In this manner, the LLM-powered dialogue agent can not only be generalized to different cases after the training, but also be applicable to different applications by just substituting the learned plug-in. In addition, we propose to evaluate the policy planning capability of dialogue systems under the interactive setting. Experimental results demonstrate that PPDPP consistently and substantially outperforms existing approaches on three different proactive dialogue applications, including negotiation, emotional support, and tutoring dialogues.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MCNqgUFTHI",
    "arxiv_id": "2311.00262",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18836,
    "title": "The Effectiveness of Random Forgetting for Robust Generalization",
    "authors": [
      "Vijaya Raghavan T Ramkumar",
      "Bahram Zonooz",
      "Elahe Arani"
    ],
    "abstract": "Deep neural networks are susceptible to adversarial attacks, which can compromise their performance and accuracy. Adversarial Training (AT) has emerged as a popular approach for protecting neural networks against such attacks. However, a key challenge of AT is robust overfitting, where the network's robust performance on test data deteriorates with further training, thus hindering generalization. Motivated by the concept of active forgetting in the brain, we introduce a novel learning paradigm called \"Forget to Mitigate Overfitting (FOMO)\". FOMO alternates between the forgetting phase, which randomly forgets a subset of weights and regulates the model's information through weight reinitialization, and the relearning phase, which emphasizes learning generalizable features. Our experiments on benchmark datasets and adversarial attacks show that FOMO alleviates robust overfitting by significantly reducing the gap between the best and last robust test accuracy while improving the state-of-the-art robustness. Furthermore, FOMO provides a better trade-off between the standard and robust accuracy outperforming baseline adversarial methods. Finally, our framework is robust to AutoAttacks and increases generalization in many real-world scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MEGQGNUfPx",
    "arxiv_id": "2402.11733",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18147,
    "title": "A Simple Romance Between Multi-Exit Vision Transformer and Token Reduction",
    "authors": [
      "Dongyang Liu",
      "Meina Kan",
      "Shiguang Shan",
      "Xilin CHEN"
    ],
    "abstract": "Vision Transformers (ViTs) are now flourishing in the computer vision area. Despite the remarkable success, ViTs suffer from high computational cost, which greatly hinders their practical usage. Token reduction, which identifies and discards unimportant tokens during forward propagation, has then been proposed to make ViTs more efficient. For token reduction methodologies, a scoring metric is essential to distinguish between important and unimportant tokens. The attention score from the $\\mathrm{[CLS]}$ token, which takes the responsibility to aggregate useful information and form the final output, has been established by prior works as an advantageous choice. Nevertheless, whereas the task pressure is applied at the end of the whole model, token reduction generally starts from very early blocks. Given the long distance in between, in the early blocks $\\mathrm{[CLS]}$ token lacks the impetus to gather task-relevant information, causing somewhat arbitrary attention score allocation. This phenomenon, in turn, degrades the reliability of token scoring and substantially compromises the effectiveness of token reduction methods. Inspired by advances in the domain of dynamic neural networks, in this paper, we introduce Multi-Exit Token Reduction (METR), a simple romance between multi-exit architecture and token reduction\u2014two areas previously considered orthogonal. By injecting early task pressure via multi-exit loss, the $\\mathrm{[CLS]}$ token is spurred to collect task-related information in even early blocks, thus bolstering the credibility of $\\mathrm{[CLS]}$ attention as a token-scoring metric. Additionally, we employ self-distillation to further refine the quality of early supervision. Extensive experiments substantiate both the existence and effectiveness of the newfound chemistry. Comparative assessments also indicate that METR outperforms state-of-the-art token reduction methods on standard benchmarks, especially under aggressive reduction ratio. Codes will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gJeYtRuguR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18834,
    "title": "High-dimensional SGD aligns with emerging outlier eigenspaces",
    "authors": [
      "Gerard Ben Arous",
      "Reza Gheissari",
      "Jiaoyang Huang",
      "Aukosh Jagannath"
    ],
    "abstract": "We rigorously study the joint evolution of training dynamics via stochastic gradient descent (SGD) and the spectra of empirical Hessian and gradient matrices. We prove that in two canonical classification tasks for multi-class high-dimensional mixtures and either 1 or 2-layer neural networks, the SGD trajectory rapidly aligns with emerging low-rank outlier eigenspaces of the Hessian and gradient matrices. Moreover, in multi-layer settings this alignment occurs per layer, with the final layer's outlier eigenspace evolving over the course of training, and exhibiting rank deficiency when the SGD converges to sub-optimal classifiers. This establishes  some of the rich predictions that have arisen from extensive numerical studies in the last decade about the spectra of Hessian and information matrices over the course of training in overparametrized networks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MHjigVnI04",
    "arxiv_id": "2310.03010",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18833,
    "title": "Symphony: Symmetry-Equivariant Point-Centered Spherical Harmonics for Molecule Generation",
    "authors": [
      "Ameya Daigavane",
      "Song Eun Kim",
      "Mario Geiger",
      "Tess Smidt"
    ],
    "abstract": "We present Symphony, an $E(3)$ equivariant autoregressive generative model for 3D molecular geometriesthat iteratively builds a molecule from molecular fragments.Existing autoregressive models such as G-SchNet and G-SphereNet  for molecules utilize rotationally invariant features to respect the 3D symmetries of molecules.In contrast, Symphony uses message-passing with higher-degree $E(3)$-equivariant features.This allows a novel representation of probability distributions via spherical harmonic signals to efficiently model the 3D geometry ofmolecules. We show that Symphony is able to accurately generate small molecules from the QM9 dataset, outperforming existingautoregressive models and approaching the performance of diffusion models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MIEnYtlGyv",
    "arxiv_id": "2311.16199",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18832,
    "title": "Knowledge Distillation Based on Transformed Teacher Matching",
    "authors": [
      "Kaixiang Zheng",
      "EN-HUI YANG"
    ],
    "abstract": "As a technique to bridge logit matching and probability distribution matching, temperature scaling plays a pivotal role in knowledge distillation (KD).  Conventionally, temperature scaling is applied to both teacher's logits and student's logits in KD. Motivated by some recent works, in this paper, we drop instead temperature scaling on the student side, and systematically study the resulting variant of KD, dubbed transformed teacher matching (TTM). By reinterpreting temperature scaling as a power transform of probability distribution, we show that in comparison with the original KD, TTM has an inherent R\u00e9nyi entropy term in its objective function, which serves as an extra regularization term.  Extensive experiment results demonstrate that thanks to this inherent regularization, TTM leads to trained students with better generalization than the original KD. To further enhance student's capability to match teacher's power transformed probability distribution, we introduce a sample-adaptive weighting coefficient into TTM, yielding a novel distillation approach dubbed weighted TTM (WTTM). It is shown, by comprehensive experiments, that although WTTM is simple, it is effective, improves upon TTM, and achieves state-of-the-art accuracy performance. Our source code is available at https://github.com/zkxufo/TTM.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MJ3K7uDGGl",
    "arxiv_id": "2402.11148",
    "GitHub": [
      "https://github.com/zkxufo/TTM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18831,
    "title": "Discovering Temporally-Aware Reinforcement Learning Algorithms",
    "authors": [
      "Matthew Thomas Jackson",
      "Chris Lu",
      "Louis Kirsch",
      "Robert Tjarko Lange",
      "Shimon Whiteson",
      "Jakob Nicolaus Foerster"
    ],
    "abstract": "Recent advancements in meta-learning have enabled the automatic discovery of novel reinforcement learning algorithms parameterized by surrogate objective functions. To improve upon manually designed algorithms, the parameterization of this learned objective function must be expressive enough to represent novel principles of learning (instead of merely recovering already established ones) while still generalizing to a wide range of settings outside of its meta-training distribution. However, existing methods focus on discovering objective functions that, like many widely used objective functions in reinforcement learning, do not take into account the total number of steps allowed for training, or \u201ctraining horizon\u201d. In contrast, humans use a plethora of different learning objectives across the course of acquiring a new ability. For instance, students may alter their studying techniques based on the proximity to exam deadlines and their self-assessed capabilities. This paper contends that ignoring the optimization time horizon significantly restricts the expressive potential of discovered learning algorithms. We propose a simple augmentation to two existing objective discovery approaches that allows the discovered algorithm to dynamically update its objective function throughout the agent\u2019s training procedure, resulting in expressive schedules and increased generalization across different training horizons. In the process, we find that commonly used meta-gradient approaches fail to discover such adaptive objective functions while evolution strategies discover highly dynamic learning rules. We demonstrate the effectiveness of our approach on a wide range of tasks and analyze the resulting learned algorithms, which we find effectively balance exploration and exploitation by modifying the structure of their learning rules throughout the agent\u2019s lifetime.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MJJcs3zbmi",
    "arxiv_id": "2402.05828",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18830,
    "title": "CARD: Channel Aligned Robust Blend Transformer for Time Series Forecasting",
    "authors": [
      "Xue Wang",
      "Tian Zhou",
      "Qingsong Wen",
      "Jinyang Gao",
      "Bolin Ding",
      "Rong Jin"
    ],
    "abstract": "Recent studies have demonstrated the great power of Transformer models for time series forecasting. One of the key elements that lead to the transformer's success is the channel-independent  (CI) strategy to improve the training robustness. However, the ignorance of the correlation among different channels in CI would limit the model's forecasting capacity. In this work, we design a special Transformer, i.e., **C**hannel **A**ligned **R**obust Blen**d**  Transformer (CARD for short), that addresses key shortcomings of CI type Transformer in time series forecasting. First, CARD introduces a channel-aligned attention structure that allows it to capture both temporal correlations among signals and dynamical dependence among multiple variables over time. Second, in order to efficiently utilize the multi-scale knowledge, we design a token blend module to generate tokens with different resolutions. Third, we introduce a robust loss function for time series forecasting to alleviate the potential overfitting issue. This new loss function weights the importance of forecasting over a finite horizon based on prediction uncertainties. Our evaluation of multiple long-term and short-term forecasting datasets demonstrates that CARD significantly outperforms state-of-the-art time series forecasting methods. The code is available at the following anonymous repository: https://anonymous.4open.science/r/CARD-6EEC",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MJksrOhurE",
    "arxiv_id": "2305.12095",
    "GitHub": [
      "https://github.com/wxie9/CARD"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18829,
    "title": "InternVid: A Large-scale Video-Text Dataset for Multimodal Understanding and Generation",
    "authors": [
      "Yi Wang",
      "Yinan He",
      "Yizhuo Li",
      "Kunchang Li",
      "Jiashuo Yu",
      "Xin Ma",
      "Xinhao Li",
      "Guo Chen",
      "Xinyuan Chen",
      "Yaohui Wang",
      "Ping Luo",
      "Ziwei Liu",
      "Yali Wang",
      "Limin Wang",
      "Yu Qiao"
    ],
    "abstract": "This paper introduces InternVid, a large-scale video-centric multimodal dataset that enables learning powerful and transferable video-text representations for multimodal understanding and generation. The InternVid dataset contains over 7 million videos lasting nearly 760K hours, yielding 234M video clips accompanied by detailed descriptions of total 4.1B words. Our core contribution is to develop a scalable approach to autonomously build a high-quality video-text dataset with large language models (LLM), thereby showcasing its efficacy in learning video-language representation at scale. Specifically, we utilize a multi-scale approach to generate video-related descriptions. Furthermore, we introduce ViCLIP, a video-text representation learning model based on ViT-L. Learned on InternVid via contrastive learning, this model demonstrates leading zero-shot action recognition and competitive video retrieval performance. Beyond basic video understanding tasks like recognition and retrieval, our dataset and model have broad applications. They are particularly beneficial for generating interleaved video-text data for learning a video-centric dialogue system, advancing video-to-text and text-to-video generation research. These proposed resources provide a tool for researchers and practitioners interested in multimodal video understanding and generation.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MLBdiWu4Fw",
    "arxiv_id": "2307.06942",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18827,
    "title": "Generative Neuro-Symbolic Visual Reasoning by Growing and Reusing Modules",
    "authors": [
      "Zhenfang Chen",
      "Rui Sun",
      "Wenjun Liu",
      "Yining Hong",
      "Chuang Gan"
    ],
    "abstract": "Recent works have shown that Large Language Models (LLMs) could empower traditional neuro-symbolic models via programming capabilities to translate lan- guages into module descriptions, thus achieving strong visual reasoning results while maintaining the model\u2019s transparency and efficiency. However, these mod- els usually exhaustively generate the entire code snippet given each new instance of a task, which is extremely ineffective. On the contrary, human beings grad- ually acquire knowledge that can be reused and grow into more profound skills for fast generalization to new tasks since we are an infant. Inspired by this, we propose generative neuro-symbolic visual reasoning by growing and reusing mod- ules. Specifically, our model consists of three unique stages, module initialization, module generation, and module execution. First, given a vision-language task, we adopt LLMs to examine whether we could reuse and grow over established mod- ules to handle this new task. If not, we initialize a new module needed by the task and specify the inputs and outputs of this new module. After that, the new module is created by querying LLMs to generate corresponding code snippets that match the requirements. In order to get a better sense of the new module\u2019s ability, we treat few-shot training examples as test cases to see if our new module could pass these cases. If yes, the new module is added to the module library for future reuse. Finally, we evaluate the performance of our model on the testing set by executing the parsed programs with the newly made visual modules to get the results. We find the proposed GNSVR model possesses several advantages. First, it performs competitively on standard tasks like visual question answering and referring ex- pression comprehension; Second, the visual modules learned from one task can be seamlessly transferred to new tasks; Last but not least, it is able to adapt to new visual reasoning tasks by observing a few training examples and reusing modules.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MNShbDSxKH",
    "arxiv_id": "2311.04901",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18826,
    "title": "SEABO: A Simple Search-Based Method for Offline Imitation Learning",
    "authors": [
      "Jiafei Lyu",
      "Xiaoteng Ma",
      "Le Wan",
      "Runze Liu",
      "Xiu Li",
      "Zongqing Lu"
    ],
    "abstract": "Offline reinforcement learning (RL) has attracted much attention due to its ability in learning from static offline datasets and eliminating the need of interacting with the environment. Nevertheless, the success of offline RL relies heavily on the offline transitions annotated with reward labels. In practice, we often need to hand-craft the reward function, which is sometimes difficult, labor-intensive, or inefficient. To tackle this challenge, we set our focus on the offline imitation learning (IL) setting, and aim at getting a reward function based on the expert data and unlabeled data. To that end, we propose a simple yet effective search-based offline IL method, tagged SEABO. SEABO allocates a larger reward to the transition that is close to its closest neighbor in the expert demonstration, and a smaller reward otherwise, all in an unsupervised learning manner. Experimental results on a variety of D4RL datasets indicate that SEABO can achieve competitive performance to offline RL algorithms with ground-truth rewards, given only a single expert trajectory, and can outperform prior reward learning and offline IL methods across many tasks. Moreover, we demonstrate that SEABO also works well if the expert demonstrations contain only observations. Our code is publicly available at https://github.com/dmksjfl/SEABO.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MNyOI3C7YB",
    "arxiv_id": "2402.03807",
    "GitHub": [
      "https://github.com/dmksjfl/SEABO"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18825,
    "title": "Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMs",
    "authors": [
      "Angelica Chen",
      "Ravid Shwartz-Ziv",
      "Kyunghyun Cho",
      "Matthew L Leavitt",
      "Naomi Saphra"
    ],
    "abstract": "Most interpretability research in NLP focuses on understanding the behavior and features of a fully trained model. However, certain insights into model behavior may only be accessible by observing the trajectory of the training process. We present a case study of syntax acquisition in masked language models (MLMs) that demonstrates how analyzing the evolution of interpretable artifacts throughout training deepens our understanding of emergent behavior. In particular, we study Syntactic Attention Structure (SAS), a naturally emerging property of MLMs wherein specific Transformer heads tend to focus on specific syntactic relations. We identify a brief window in pretraining when models abruptly acquire SAS, concurrent with a steep drop in loss. This breakthrough precipitates the subsequent acquisition of linguistic capabilities. We then examine the causal role of SAS by manipulating SAS during training, and demonstrate that SAS is necessary for the development of grammatical capabilities. We further find that SAS competes with other beneficial traits during training, and that briefly suppressing SAS improves model quality. These findings offer an interpretation of a real-world example of both simplicity bias and breakthrough training dynamics.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MO5PiKHELW",
    "arxiv_id": "2309.07311",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18823,
    "title": "Achieving Sample and Computational Efficient Reinforcement Learning by Action Space Reduction via Grouping",
    "authors": [
      "Yining Li",
      "Peizhong Ju",
      "Ness Shroff"
    ],
    "abstract": "Reinforcement learning often needs to deal with the exponential growth of states and actions when exploring optimal control in high-dimensional spaces (often known as the curse of dimensionality). In this work, we address this issue by learning the inherent structure of action-wise similar MDP to appropriately balance the performance degradation versus sample/computational complexity.  In particular, we partition the action spaces into multiple groups based on the similarity in transition distribution and reward function, and build a linear decomposition model to capture the difference between the intra-group transition kernel and the intra-group rewards. Both our theoretical analysis and experiments reveal a *surprising and counter-intuitive result*: while a more refined grouping strategy can reduce the approximation error caused by treating actions in the same group as identical, it also leads to increased estimation error when the size of samples or the computation resources is limited. This finding highlights the grouping strategy as a new degree of freedom that can be optimized to minimize the overall performance loss. To address this issue, we formulate a general optimization problem for determining the optimal grouping strategy, which strikes a balance between performance loss and sample/computational complexity. We further propose a computationally efficient method for selecting a nearly-optimal grouping strategy, which maintains its computational complexity independent of the size of the action space.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MOmqfJovQ6",
    "arxiv_id": "2306.12981",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18822,
    "title": "One-hot Generalized Linear Model for Switching Brain State Discovery",
    "authors": [
      "Chengrui Li",
      "Soon Ho Kim",
      "Chris Rodgers",
      "Hannah Choi",
      "Anqi Wu"
    ],
    "abstract": "Exposing meaningful and interpretable neural interactions is critical to understanding neural circuits. Inferred neural interactions from neural signals primarily reflect functional interactions. In a long experiment, subject animals may experience different stages defined by the experiment, stimuli, or behavioral states, and hence functional interactions can change over time. To model dynamically changing functional interactions, prior work employs state-switching generalized linear models with hidden Markov models (i.e., HMM-GLMs). However, we argue they lack biological plausibility, as functional interactions are shaped and confined by the underlying anatomical connectome. Here, we propose a novel prior-informed state-switching GLM. We introduce both a Gaussian prior and a one-hot prior over the GLM in each state. The priors are learnable. We will show that the learned prior should capture the state-constant interaction, shedding light on the underlying anatomical connectome and revealing more likely physical neuron interactions. The state-dependent interaction modeled by each GLM offers traceability to capture functional variations across multiple brain states. Our methods effectively recover true interaction structures in simulated data, achieve the highest predictive likelihood with real neural datasets, and render interaction structures and hidden states more interpretable when applied to real neural data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MREQ0k6qvD",
    "arxiv_id": "2310.15263",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18820,
    "title": "A Probabilistic Framework for Modular Continual Learning",
    "authors": [
      "Lazar Valkov",
      "Akash Srivastava",
      "Swarat Chaudhuri",
      "Charles Sutton"
    ],
    "abstract": "Modular approaches that use a different composition of modules for each problem are a promising direction in continual learning (CL). However, searching through the large, discrete space of module compositions is challenging, especially because evaluating a composition\u2019s performance requires a round of neural network training. We address this challenge through a modular CL framework, PICLE, that uses a probabilistic model to cheaply compute the fitness of each composition, allowing PICLE to achieve both perceptual, few-shot and latent transfer. The model combines prior knowledge about good module compositions with dataset-specific information. We evaluate PICLE using two benchmark suites designed to assess different desiderata of CL techniques. Comparing to a wide range of approaches, we show that PICLE is the first modular CL algorithm to achieve perceptual, few-shot and latent transfer while scaling well to large search spaces, outperforming previous state-of-the-art modular CL approaches on long problem sequences.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MVe2dnWPCu",
    "arxiv_id": "2306.06545",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18817,
    "title": "GPT-4 Is Too Smart To Be Safe: Stealthy Chat with LLMs via Cipher",
    "authors": [
      "Youliang Yuan",
      "Wenxiang Jiao",
      "Wenxuan Wang",
      "Jen-tse Huang",
      "Pinjia He",
      "Shuming Shi",
      "Zhaopeng Tu"
    ],
    "abstract": "Safety lies at the core of the development of Large Language Models (LLMs). There is ample work on aligning LLMs with human ethics and preferences, including data filtering in pretraining, supervised fine-tuning, reinforcement learning from human feedback, red teaming, etc. In this study, we discover that chat in cipher can bypass the safety alignment techniques of LLMs, which are mainly conducted in natural languages. We propose a novel framework CipherChat to systematically examine the generalizability of safety alignment to non-natural languages -- ciphers. CipherChat enables humans to chat with LLMs through cipher prompts topped with system role descriptions and few-shot enciphered demonstrations. We use CipherChat to assess state-of-the-art LLMs, including ChatGPT and GPT-4 for different representative human ciphers across 11 safety domains in both English and Chinese. Experimental results show that certain ciphers succeed almost 100% of the time in bypassing the safety alignment of GPT-4 in several safety domains, demonstrating the necessity of developing safety alignment for non-natural languages. Notably, we identify that LLMs seem to have a ''secret cipher'', and propose a novel SelfCipher that uses only role play and several unsafe demonstrations in natural language to evoke this capability. SelfCipher surprisingly outperforms existing human ciphers in almost all cases.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MbfAK4s61A",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18816,
    "title": "L2P-MIP: Learning to Presolve for Mixed Integer Programming",
    "authors": [
      "Chang Liu",
      "Zhichen Dong",
      "Haobo Ma",
      "Weilin Luo",
      "Xijun Li",
      "Bowen Pang",
      "Jia Zeng",
      "Junchi Yan"
    ],
    "abstract": "Modern solvers for solving mixed integer programming (MIP) often rely on the branch-and-bound (B&B) algorithm which could be of high time complexity, and presolving techniques are well designed to simplify the instance as pre-processing before B&B. However, such presolvers in existing literature or open-source solvers are mostly set by default agnostic to specific input instances, and few studies have been reported on tailoring presolving settings. In this paper, we aim to dive into this open question and show that the MIP solver can be indeed largely improved when switching the default instance-agnostic presolving into instance-specific presolving. Specifically, we propose a combination of supervised learning and classic heuristics to achieve efficient presolving adjusting, avoiding tedious reinforcement learning. Notably, our approach is orthogonal from many recent efforts in incorporating learning modules into the B&B framework after the presolving stage, and to our best knowledge, this is the first work for introducing learning to presolve in MIP solvers. Experiments on multiple real-world datasets show that well-trained neural networks can infer proper presolving for arbitrary incoming MIP instances in less than 0.5s, which is neglectable compared with the solving time often hours or days. We plan to open-source our code as a benchmark for this new task, and currently, the code is available at an anonymous repository.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=McfYbKnpT8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18815,
    "title": "Hebbian Learning based Orthogonal Projection for Continual Learning of Spiking Neural Networks",
    "authors": [
      "Mingqing Xiao",
      "Qingyan Meng",
      "Zongpeng Zhang",
      "Di He",
      "Zhouchen Lin"
    ],
    "abstract": "Neuromorphic computing with spiking neural networks is promising for energy-efficient artificial intelligence (AI) applications. However, different from humans who continually learn different tasks in a lifetime, neural network models suffer from catastrophic forgetting. How could neuronal operations solve this problem is an important question for AI and neuroscience. Many previous studies draw inspiration from observed neuroscience phenomena and propose episodic replay or synaptic metaplasticity, but they are not guaranteed to explicitly preserve knowledge for neuron populations. Other works focus on machine learning methods with more mathematical grounding, e.g., orthogonal projection on high dimensional spaces, but there is no neural correspondence for neuromorphic computing. In this work, we develop a new method with neuronal operations based on lateral connections and Hebbian learning, which can protect knowledge by projecting activity traces of neurons into an orthogonal subspace so that synaptic weight update will not interfere with old tasks. We show that Hebbian and anti-Hebbian learning on recurrent lateral connections can effectively extract the principal subspace of neural activities and enable orthogonal projection. This provides new insights into how neural circuits and Hebbian learning can help continual learning, and also how the concept of orthogonal projection can be realized in neuronal systems. Our method is also flexible to utilize arbitrary training methods based on presynaptic activities/traces. Experiments show that our method consistently solves forgetting for spiking neural networks with nearly zero forgetting under various supervised training methods with different error propagation approaches, and outperforms previous approaches under various settings. Our method can pave a solid path for building continual neuromorphic computing systems. The code is available at https://github.com/pkuxmq/HLOP-SNN.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MeB86edZ1P",
    "arxiv_id": "2402.11984",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18814,
    "title": "The Trickle-down Impact of Reward Inconsistency on RLHF",
    "authors": [
      "Lingfeng Shen",
      "Sihao Chen",
      "Linfeng Song",
      "Lifeng Jin",
      "Baolin Peng",
      "Haitao Mi",
      "Daniel Khashabi",
      "Dong Yu"
    ],
    "abstract": "Standard practice within Reinforcement Learning from Human Feedback (RLHF) involves optimizing against a Reward Model (RM), which itself is trained to reflect human preferences for desirable generations. A notable subject that is understudied is the (in-)consistency of RMs --- whether they can recognize the semantic changes to different prompts and appropriately adapt their reward assignments--- and their impact on the downstream RLHF model.In this paper, we visit a series of research questions relevant to RM inconsistency:(1) How can we measure the consistency of reward models? (2) How consistent are the existing RMs and how can we improve them? (3) In what ways does reward inconsistency influence the chatbots resulting from the RLHF model training?We propose **Contrast Instruction** -- a benchmarking strategy for the consistency of RM.  Each example in **Contrast Instruction** features a pair of lexically similar instructions with different ground truth responses. A consistent RM is expected to rank the corresponding instruction and response higher than other combinations. We observe that current RMs trained with the standard ranking objective fail miserably on \\contrast{} compared to average humans. To show that RM consistency can be improved efficiently without using extra training budget, we propose two techniques **ConvexDA** and **RewardFusion**, which enhance reward consistency through extrapolation during the RM training and inference stage, respectively.We show that RLHF models trained with a more consistent RM yield more useful responses, suggesting that reward inconsistency exhibits a trickle-down effect on the downstream RLHF process.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MeHmwCDifc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18813,
    "title": "Fast Ensembling with Diffusion Schr\u00f6dinger Bridge",
    "authors": [
      "Hyunsu Kim",
      "Jongmin Yoon",
      "Juho Lee"
    ],
    "abstract": "Deep Ensemble approach is a straightforward technique used to enhance the performance of deep neural networks by training them from different initial points, converging towards various local optima. However, a limitation of this methodology lies in its high computational overhead for inference, arising from the necessity to store numerous learned parameters and execute individual forward passes for each parameter during the inference stage.We propose a novel approach called Diffusion Bridge Network to address this challenge. Based on the theory of Schr\\\"odinger bridge, this method directly learns to simulate an Stochastic Differential Equation (SDE) that connects the output distribution of a single ensemble member to the output distribution of the ensembled model, allowing us to obtain ensemble prediction without having to invoke forward pass through all the ensemble models. By substituting the heavy ensembles with this lightweight neural network constructing DBN, we achieved inference with reduced computational cost while maintaining accuracy and uncertainty scores on benchmark datasets such as CIFAR-10, CIFAR-100, and TinyImageNet.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Mgq6kxl115",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18812,
    "title": "Learning to Act from Actionless Videos through Dense Correspondences",
    "authors": [
      "Po-Chen Ko",
      "Jiayuan Mao",
      "Yilun Du",
      "Shao-Hua Sun",
      "Joshua B. Tenenbaum"
    ],
    "abstract": "In this work, we present an approach to construct a video-based robot policy capable of reliably executing diverse tasks across different robots and environments from few video demonstrations without using any action annotations. Our method leverages images as a task-agnostic representation, encoding both the state and action information, and text as a general representation for specifying robot goals. By synthesizing videos that \u201challucinate\u201d robot executing actions and in combination with dense correspondences between frames, our approach can infer the closed-formed action to execute to an environment without the need of any explicit action labels. This unique capability allows us to train the policy solely based on RGB videos and deploy learned policies to various robotic tasks. We demonstrate the efficacy of our approach in learning policies on table-top manipulation and navigation tasks. Additionally, we contribute an open-source framework for efficient video modeling, enabling the training of high-fidelity policy models with four GPUs within a single day.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Mhb5fpA1T0",
    "arxiv_id": "2310.08576",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18811,
    "title": "COCO-Periph: Bridging the Gap Between Human and Machine Perception in the Periphery",
    "authors": [
      "Anne Harrington",
      "Vasha DuTell",
      "Mark Hamilton",
      "Ayush Tewari",
      "Simon Stent",
      "William T. Freeman",
      "Ruth Rosenholtz"
    ],
    "abstract": "Evaluating deep neural networks (DNNs) as models of human perception has given rich insights into both human visual processing and representational properties of DNNs. We extend this work by analyzing how well DNNs perform compared to humans when constrained by peripheral vision -- which limits human performance on a variety of tasks, but also benefits the visual system significantly. We evaluate this by (1) modifying the Texture Tiling Model (TTM), a well tested model of peripheral vision to be more flexibly used with DNNs, (2) generating a large dataset which we call COCO-Periph that contains images transformed to capture the information available in human peripheral vision, and (3) comparing DNNs to humans at peripheral object detection using a psychophysics experiment. Our results show that common DNNs underperform at object detection compared to humans when simulating peripheral vision with TTM. Training on COCO-Periph begins to reduce the gap between human and DNN performance and leads to small increases in corruption robustness, but DNNs still struggle to capture human-like sensitivity to peripheral clutter. Our work brings us closer to accurately modeling human vision, and paves the way for DNNs to mimic and sometimes benefit from properties of human visual processing.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MiRPBbQNHv",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18810,
    "title": "Experimental Design for Multi-Channel Imaging via Task-Driven Feature Selection",
    "authors": [
      "Stefano B. Blumberg",
      "Paddy J. Slator",
      "Daniel C. Alexander"
    ],
    "abstract": "This paper presents a data-driven, task-specific paradigm for experimental design, to shorten acquisition time, reduce costs, and accelerate the deployment of imaging devices.  Current standard approaches in experimental design focus on model-parameter estimation and require specification of a particular model, whereas in imaging, other tasks may drive the design.  Furthermore, such approaches are often lead to intractable optimisation problems in real-world imaging applications. Here we put forward a new paradigm for experimental design that simultaneously optimizes the design (set of image channels) and trains a machine-learning model to execute a user-specified image-analysis task. The approach obtains data densely-sampled over the measurement space (many image channels) for a small number of acquisitions, then identifies a subset of channels of pre-specified size that best supports the task.  We propose a method: TADRED for TAsk-DRiven experimental design in imaging, to identify the most informative channel-subset  whilst simultaneously training a network to execute the task given the subset. Experiments demonstrate the potential of TADRED in diverse imaging applications: several clinically-relevant tasks in magnetic resonance imaging; and remote sensing and physiological applications of hyperspectral imaging. Results show substantial improvement over classical experimental design, two recent application-specific methods within the new paradigm we explore, and state-of-the-art approaches in supervised feature selection.  We anticipate further applications of our approach; code (for reviewers) is available: \\cite{ouranonymouscode}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MloaGA6WwX",
    "arxiv_id": "2210.06891",
    "GitHub": [
      "https://github.com/sbb-gh/experimental-design-multichannel"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18809,
    "title": "DyST: Towards Dynamic Neural Scene Representations on Real-World Videos",
    "authors": [
      "Maximilian Seitzer",
      "Sjoerd van Steenkiste",
      "Thomas Kipf",
      "Klaus Greff",
      "Mehdi S. M. Sajjadi"
    ],
    "abstract": "Visual understanding of our world goes beyond the semantics and flat structure of individual images.In this paper, we work towards capturing both the 3D structure as well as the dynamics of real-world scenes from monocular real-world videos.Our model, the Dynamic Scene Transformer (DyST), builds upon recent work in neural scene representation and learns a latent decomposition into scene content as well as per-view scene dynamics and camera pose. This separation is achieved through a special co-training scheme on monocular videos and our new synthetic dataset DySO.DyST learns tangible latent representations for dynamic scenes that enable view generation with separate control over the camera and the content of the scene.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MnMWa94t12",
    "arxiv_id": "2310.06020",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18808,
    "title": "DittoGym: Learning to Control Soft Shape-Shifting Robots",
    "authors": [
      "Suning Huang",
      "Boyuan Chen",
      "Huazhe Xu",
      "Vincent Sitzmann"
    ],
    "abstract": "Robot co-design, where the morphology of a robot is optimized jointly with a learned policy to solve a specific task, is an emerging area of research. It holds particular promise for soft robots, which are amenable to novel manufacturing techniques that can realize learned morphologies and actuators. Inspired by nature and recent novel robot designs, we propose to go a step further and explore the novel reconfigurable robots, defined as robots that can change their morphology within their lifetime. We formalize control of reconfigurable soft robots as a high-dimensional reinforcement learning (RL) problem. We unify morphology change, locomotion, and environment interaction in the same action space, and introduce an appropriate, coarse-to-fine curriculum that enables us to discover policies that accomplish fine-grained control of the resulting robots. We also introduce DittoGym, a comprehensive RL benchmark for reconfigurable soft robots that require fine-grained morphology changes to accomplish the tasks. Finally, we evaluate our proposed coarse-to-fine algorithm on DittoGym,  and demonstrate robots that learn to change their morphology several times within a sequence, uniquely enabled by our RL algorithm. More results are available at https://dittogym.github.io.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MpyFAhH9CK",
    "arxiv_id": "2401.13231",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18807,
    "title": "Memorization Capacity of Multi-Head Attention in Transformers",
    "authors": [
      "Sadegh Mahdavi",
      "Renjie Liao",
      "Christos Thrampoulidis"
    ],
    "abstract": "Transformers have become the go-to architecture for language and vision tasks, yet their theoretical properties, especially memorization capacity, remain elusive. This paper investigates the memorization abilities of multi-head attention mechanisms, examining how many example sequences they can memorize, as a function of the number of heads and sequence length. Motivated by experimental findings on vision transformers, we introduce novel assumptions about the linear independence of input data, distinct from the commonly used general-position assumption. Under these assumptions, we demonstrate that an attention layer with $H$ heads, dimension $d$, and context size $n < d,$ featuring $\\Theta(Hd^2)$ parameters, can memorize $\\Omega(Hn)$ examples. Our analysis sheds light on how different attention heads handle various example sequences, aided by the softmax operator\u2019s saturation property. We validate our findings through experiments on synthetic data.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MrR3rMxqqv",
    "arxiv_id": "2306.02010",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18806,
    "title": "PeFLL: Personalized Federated Learning by Learning to Learn",
    "authors": [
      "Jonathan Scott",
      "Hossein Zakerinia",
      "Christoph H Lampert"
    ],
    "abstract": "We present PeFLL, a new personalized federated learning algorithm that improves over the state-of-the-art in three aspects: 1) it produces more accurate models, especially in the low-data regime, and not only for clients present during its training phase, but also for any that may emerge in the future; 2) it reduces the amount of on-client computation and client-server communication by providing future clients with ready-to-use personalized models that require no additional finetuning or optimization; 3) it comes with theoretical guarantees that establish generalization from the observed clients to future ones. At the core of PeFLL lies a learning-to-learn approach that jointly trains an embedding network and a hypernetwork. The embedding network is used to represent clients in a latent descriptor space in a way that reflects their similarity to each other. The hypernetwork takes as input such descriptors and outputs the parameters of fully personalized client models. In combination, both networks constitute a learning algorithm that achieves state-of-the-art performance in several personalized federated learning benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MrYiwlDRQO",
    "arxiv_id": "2306.05515",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18805,
    "title": "Causal Structure Recovery with Latent Variables under Milder Distributional and Graphical Assumptions",
    "authors": [
      "Xiu-Chuan Li",
      "Kun Zhang",
      "Tongliang Liu"
    ],
    "abstract": "Most traditional causal discovery approaches typically assume the absence of latent variables, a simplification that often does not align with real-world situations. Recently, there has been a surge of causal discovery methods that explicitly consider latent variables. While causal discovery with latent variables aims to reveal causal relations between observed variables in the presence of latent variables, latent causal structure learning seeks to identify latent variables and infer their causal relations, typically entailing strong distributional and graphical assumptions. In this paper, we endeavor to recover the whole causal structure involving both latent and observed variables under relatively milder assumptions. Specifically, we introduce two sets of assumptions, one allows arbitrary distribution and requires only one pure child per latent variable, the other requires no pure child and imposes the non-Gaussianity requirement on only a small subset of variables, and both of them allow causal edges between observed variables. Under either of them, we prove that the whole causal structure of linear latent variable models is identifiable. Our proof is constructive, leading to both theoretically sound and computationally efficient algorithms, which first identify latent variables from observed data and then infer causal relations between any two variables.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MukGKGtgnr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18804,
    "title": "Forward Learning with Top-Down Feedback: Empirical and Analytical Characterization",
    "authors": [
      "Ravi Francesco Srinivasan",
      "Francesca Mignacco",
      "Martino Sorbaro",
      "Maria Refinetti",
      "Avi Cooper",
      "Gabriel Kreiman",
      "Giorgia Dellaferrera"
    ],
    "abstract": "\"Forward-only\" algorithms, which train neural networks while avoiding a backward pass, have recently gained attention as a way of solving the biologically unrealistic aspects of backpropagation. Here, we first address compelling challenges related to the ``forward-only\" rules, which include reducing the performance gap with backpropagation and providing an analytical understanding of their dynamics. To this end, we show that the forward-only algorithm with top-down feedback is well-approximated by an \"adaptive-feedback-alignment\" algorithm and we analytically track its performance during learning in a prototype high-dimensional setting. Then, we compare different versions of forward-only algorithms, focusing on the Forward-Forward and PEPITA frameworks, and we show that they share the same principles. Overall, our work unveils the connections between three key neuro-inspired learning rules, providing a link between \"forward-only\" algorithms, i.e., Forward-Forward and PEPITA, and an approximation of backpropagation, i.e., Feedback Alignment.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=My7lkRNnL9",
    "arxiv_id": "2302.05440",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18803,
    "title": "Learning Multi-Faceted Prototypical User Interests",
    "authors": [
      "Nhu-Thuat Tran",
      "Hady W. Lauw"
    ],
    "abstract": "We seek to uncover the latent interest units from behavioral data to better learn user preferences under the VAE framework. Existing practices tend to ignore the multiple facets of item characteristics, which may not capture it at appropriate granularity. Moreover, current studies equate the granularity of item space to that of user interests, which we postulate is not ideal as user interests would likely map to a small subset of item space. In addition, the compositionality of user interests has received inadequate attention, preventing the modeling of interactions between explanatory factors driving a user's decision.To resolve this, we propose to align user interests with multi-faceted item characteristics. First, we involve prototype-based representation learning to discover item characteristics along multiple facets. Second, we compose user interests from uncovered item characteristics via binding mechanism, separating the granularity of user preferences from that of item space. Third, we design a dedicated bi-directional binding block, aiding the derivation of compositional user interests.On real-world datasets, the experimental results demonstrate the strong performance of our proposed method compared to a series of baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MzjiMxlWab",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18802,
    "title": "Vision-Language Models are Zero-Shot Reward Models for Reinforcement Learning",
    "authors": [
      "Juan Rocamonde",
      "Victoriano Montesinos",
      "Elvis Nava",
      "Ethan Perez",
      "David Lindner"
    ],
    "abstract": "Reinforcement learning (RL) requires either manually specifying a reward function, which is often infeasible, or learning a reward model from a large amount of human feedback, which is often very expensive. We study a more sampleefficient alternative: using pretrained vision-language models (VLMs) as zeroshot reward models (RMs) to specify tasks via natural language. We propose a natural and general approach to using VLMs as reward models, which we call VLM-RMs. We use VLM-RMs based on CLIP to train a MuJoCo humanoid to learn complex tasks without a manually specified reward function, such as kneeling, doing the splits, and sitting in a lotus position. For each of these tasks, we only provide a single sentence text prompt describing the desired task with minimal prompt engineering. We provide videos of the trained agents at: https://sites.google.com/view/anon-vlmrm. We can improve performance by providing a second \u201cbaseline\u201d prompt and projecting out parts of the CLIP embedding space irrelevant to distinguish between goal and baseline. Further, we find a strong scaling effect for VLM-RMs: larger VLMs trained with more compute and data are better reward models. The failure modes of VLM-RMs we encountered are all related to known capability limitations of current VLMs, such as limited spatial reasoning ability or visually unrealistic environments that are far off-distribution for the VLM. We find that VLM-RMs are remarkably robust as long as the VLM is large enough. This suggests that future VLMs will become more and more useful reward models for a wide range of RL applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=N0I2RtD8je",
    "arxiv_id": "2310.12921",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18801,
    "title": "Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time",
    "authors": [
      "Yuzhou Gu",
      "Zhao Song",
      "Junze Yin",
      "Lichen Zhang"
    ],
    "abstract": "Given a matrix $M\\in \\mathbb{R}^{m\\times n}$, the low rank matrix completion problem asks us to find a rank-$k$ approximation of $M$ as $UV^\\top$ for $U\\in \\mathbb{R}^{m\\times k}$ and $V\\in \\mathbb{R}^{n\\times k}$ by only observing a few entries specified by a set of entries $\\Omega\\subseteq [m]\\times [n]$. In particular, we examine an approach that is widely used in practice --- the alternating minimization framework. Jain, Netrapalli and Sanghavi showed that if $M$ has incoherent rows and columns, then alternating minimization provably recovers the matrix $M$ by observing a nearly linear in $n$ number of entries. While the sample complexity has been subsequently improved, alternating minimization steps are required to be computed exactly. This hinders the development of more efficient algorithms and fails to depict the practical implementation of alternating minimization, where the updates are usually performed approximately in favor of efficiency.In this paper, we take a major step towards a more efficient and error-robust alternating minimization framework. To this end, we develop an analytical framework for alternating minimization that can tolerate moderate amount of errors caused by approximate updates. Moreover, our algorithm runs in time $\\widetilde O(|\\Omega| k)$, which is nearly linear in the time to verify the solution while preserving the sample complexity. This improves upon all prior known alternating minimization approaches which require $\\widetilde O(|\\Omega| k^2)$ time.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=N0gT4A0jNV",
    "arxiv_id": "2302.11068",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18800,
    "title": "TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts",
    "authors": [
      "Hyunwook Lee",
      "Sungahn Ko"
    ],
    "abstract": "Accurate traffic forecasting is challenging due to the complex dependency on road networks, various types of roads, and the abrupt speed change due to the events. Recent works mainly focus on dynamic spatial modeling with adaptive graph embedding or graph attention having less consideration for temporal characteristics and in-situ modeling. In this paper, we propose a novel deep learning model named TESTAM, which individually models recurring and non-recurring traffic patterns by a mixture-of-experts model with three experts on temporal modeling, spatio-temporal modeling with static graph, and dynamic spatio-temporal dependency modeling with dynamic graph. By introducing different experts and properly routing them, TESTAM could better model various circumstances, including spatially isolated nodes, highly related nodes, and recurring and non-recurring events. For the proper routing, we reformulate a gating problem into a classification problem with pseudo labels. Experimental results on three public traffic network datasets, METR-LA, PEMS-BAY, and EXPY-TKY, demonstrate that TESTAM achieves a better indication and modeling of recurring and non-recurring traffic.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=N0nTk5BSvO",
    "arxiv_id": "2403.02600",
    "GitHub": [
      "https://github.com/HyunWookL/TESTAM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18799,
    "title": "Win-Win: Training High-Resolution Vision Transformers from Two Windows",
    "authors": [
      "Vincent Leroy",
      "Jerome Revaud",
      "Thomas Lucas",
      "Philippe Weinzaepfel"
    ],
    "abstract": "Transformers have become the standard in state-of-the-art vision architectures, achieving impressive performance on both image-level and dense pixelwise tasks. However, training vision transformers for high-resolution pixelwise tasks has a prohibitive cost. Typical solutions boil down to hierarchical architectures, fast and approximate attention, or training on low-resolution crops. This latter solution does not constrain architectural choices, but it leads to a clear performance drop when testing at resolutions significantly higher than that used for training, thus requiring ad-hoc and slow post-processing schemes. In this paper, we propose a novel strategy for efficient training and inference of high-resolution vision transformers: the key principle is to mask out most of the high-resolution inputs during training, keeping only N random windows. This allows the model to learn local interactions between tokens inside each window, and global interactions between tokens from different windows. As a result, the model can directly process the high-resolution input at test time without any special trick. We show that this strategy is effective when using relative positional embedding such as rotary embeddings. It is 4 times faster to train than a full-resolution network, and it is straightforward to use at test time compared to existing approaches. We apply this strategy to the dense monocular task of semantic segmentation, and find that a simple setting with 2 windows performs best, hence the name of our method: Win-Win. To demonstrate the generality of our contribution, we further extend it to the binocular task of optical flow, reaching state-of-the-art performance on the Spring benchmark that contains Full-HD images with an inference time an orderof magnitude faster than the best competitor.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=N23A4ybMJr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18797,
    "title": "Query-Dependent Prompt Evaluation and Optimization with Offline Inverse RL",
    "authors": [
      "Hao Sun",
      "Alihan H\u00fcy\u00fck",
      "Mihaela van der Schaar"
    ],
    "abstract": "In this study, we aim to enhance the arithmetic reasoning ability of Large Language Models (LLMs) through zero-shot prompt optimization. We identify a previously overlooked objective of query dependency in such optimization and elucidate two ensuing challenges that impede the successful and economical design of prompt optimization techniques. One primary issue is the absence of an effective method to evaluate prompts during inference when the golden answer is unavailable. Concurrently, learning via interactions with the LLMs to navigate the expansive natural language prompting space proves to be resource-intensive.To address this, we introduce Prompt-OIRL, which harnesses offline inverse reinforcement learning to draw insights from offline prompting demonstration data. Such data exists as by-products when diverse prompts are benchmarked on open-accessible datasets. With Prompt-OIRL, the query-dependent prompt optimization objective is achieved by first learning an offline reward model. This model can evaluate any query-prompt pairs without accessing LLMs. Subsequently, a best-of-N strategy is deployed to recommend the optimal prompt. Our experimental evaluations across various LLM scales and arithmetic reasoning datasets underscore both the efficacy and economic viability of the proposed approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=N6o0ZtPzTg",
    "arxiv_id": "2309.06553",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18796,
    "title": "MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Models",
    "authors": [
      "Longhui Yu",
      "Weisen Jiang",
      "Han Shi",
      "Jincheng YU",
      "Zhengying Liu",
      "Yu Zhang",
      "James Kwok",
      "Zhenguo Li",
      "Adrian Weller",
      "Weiyang Liu"
    ],
    "abstract": "Large language models (LLMs) have pushed the limits of natural language understanding and exhibited excellent problem-solving ability. Despite the great success, most existing open-source LLMs (\\eg, LLaMA-2) are still far away from satisfactory for solving mathematical problems due to the complex reasoning procedures. To bridge this gap, we propose \\emph{MetaMath}, a finetuned language model that specializes in mathematical reasoning. Specifically, we start by bootstrapping mathematical questions by rewriting the question from multiple perspectives, which results in a new dataset called {MetaMathQA}. Then we finetune the LLaMA-2 models on MetaMathQA. Experimental results on two popular benchmarks (\\ie, GSM8K and MATH) for mathematical reasoning demonstrate that MetaMath outperforms a suite of open-source LLMs by a significant margin.  Our MetaMath-7B model achieves $66.5\\%$ on GSM8K and $19.8\\%$ on MATH, exceeding the state-of-the-art models of the same size by $11.5\\%$ and $8.7\\%$. Particularly, MetaMath-70B achieves an accuracy of $82.3\\%$ on GSM8K, slightly better than GPT-3.5-Turbo. We release the MetaMathQA dataset, the MetaMath models with different model sizes and the training code for public use.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=N8N0hgNDRt",
    "arxiv_id": "2309.12284",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18795,
    "title": "V-DETR: DETR with Vertex Relative Position Encoding for 3D Object Detection",
    "authors": [
      "Yichao Shen",
      "Zigang Geng",
      "Yuhui Yuan",
      "Yutong Lin",
      "Ze Liu",
      "Chunyu Wang",
      "Han Hu",
      "Nanning Zheng",
      "Baining Guo"
    ],
    "abstract": "We introduce a highly performant 3D object detector for point clouds using the DETR framework. The prior attempts all end up with suboptimal results because they fail to learn accurate inductive biases from the limited scale of training data. In particular, the queries often attend to points that are far away from the target objects, violating the locality principle in object detection. To address the limitation, we introduce a novel 3D Vertex Relative Position Encoding (3DV-RPE) method which computes position encoding for each point based on its relative position to the 3D boxes predicted by the queries in each decoder layer, thus providing clear information to guide the model to focus on points near the objects, in accordance with the principle of locality. Furthermore, we have systematically refined our pipeline, including data normalization, to better align with the task requirements. Our approach demonstrates remarkable performance on the demanding ScanNetV2 benchmark, showcasing substantial enhancements over the prior state-of-the-art CAGroup3D. Specifically, we achieve an increase in $AP_{25}$  from $75.1\\%$ to $77.8\\%$ and in  ${AP}_{50}$ from $61.3\\%$ to $66.0\\%$, all while achieving a nearly $2\\times$ speed improvement during inference.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NDkpxG94sF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18793,
    "title": "Reclaiming the Source of Programmatic Policies: Programmatic versus Latent Spaces",
    "authors": [
      "Tales Henrique Carvalho",
      "Kenneth Tjhia",
      "Levi Lelis"
    ],
    "abstract": "Recent works have introduced LEAPS and HPRL, systems that learn latent spaces of domain-specific languages, which are used to define programmatic policies for partially observable Markov decision processes (POMDPs). These systems induce a latent space while optimizing losses such as the behavior loss, which aim to achieve locality in program behavior, meaning that vectors close in the latent space should correspond to similarly behaving programs. In this paper, we show that the programmatic space, induced by the domain-specific language and requiring no training, presents values for the behavior loss similar to those observed in latent spaces presented in previous work. Moreover, algorithms searching in the programmatic space significantly outperform those in LEAPS and HPRL. To explain our results, we measured the ``friendliness'' of the two spaces to local search algorithms. We discovered that algorithms are more likely to stop at local maxima when searching in the latent space than when searching in the programmatic space. This implies that the optimization topology of the programmatic space, induced by the reward function in conjunction with the neighborhood function, is more conducive to search than that of the latent space. This result provides an explanation for the superior performance in the programmatic space.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NGVljI6HkR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18791,
    "title": "Hypergraph Dynamic System",
    "authors": [
      "Jielong Yan",
      "Yifan Feng",
      "Shihui Ying",
      "Yue Gao"
    ],
    "abstract": "Recently, hypergraph neural networks (HGNNs) exhibit the potential to tackle tasks with high-order correlations and have achieved success in many tasks. However, existing evolution on the hypergraph has poor controllability and lacks sufficient theoretical support (like dynamic systems), thus yielding sub-optimal performance.One typical scenario is that only one or two layers of HGNNs can achieve good results and more layers lead to degeneration of performance.Under such circumstances, it is important to increase the controllability of HGNNs.In this paper, we first introduce hypergraph dynamic systems (HDS), which bridge hypergraphs and dynamic systems and characterize the continuous dynamics of representations.We then propose a control-diffusion hypergraph dynamic system by an ordinary differential equation (ODE).We design a multi-layer HDS$^{ode}$ as a neural implementation, which contains control steps and diffusion steps.HDS$^{ode}$ has the properties of controllability and stabilization and is allowed to capture long-range correlations among vertices.Experiments on $7$ datasets demonstrate HDS$^{ode}$ beat all compared methods.HDS$^{ode}$ achieves stable performance with increased layers and solves the poor controllability of HGNNs.We also provide the feature visualization of the evolutionary process to demonstrate the controllability and stabilization of HDS$^{ode}$.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NLbRvr840Q",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18786,
    "title": "Optimal Sample Complexity of Contrastive Learning",
    "authors": [
      "Noga Alon",
      "Dmitrii Avdiukhin",
      "Dor Elboim",
      "Orr Fischer",
      "Grigory Yaroslavtsev"
    ],
    "abstract": "Contrastive learning is a highly successful technique for learning representations of data from labeled tuples, specifying the distance relations within the tuple. We study the sample complexity of contrastive learning, i.e. the minimum number of labeled tuples sufficient for getting high generalization accuracy. We give tight bounds on the sample complexity in a variety of settings, focusing on arbitrary distance functions,  $\\ell_p$-distances, and tree metrics. Our main result is an (almost) optimal bound on the sample complexity of learning $\\ell_p$-distances for integer $p$. For any $p \\ge 1$, we show that $\\tilde \\Theta(nd)$ labeled tuples are necessary and sufficient for learning $d$-dimensional representations of $n$-point datasets. Our results hold for an arbitrary distribution of the input samples and are based on giving the corresponding bounds on the Vapnik-Chervonenkis/Natarajan dimension of the associated problems. We further show that the theoretical bounds on sample complexity obtained via VC/Natarajan dimension can have strong predictive power for experimental results, in contrast with the folklore belief about a substantial gap between the statistical learning theory and the practice of deep learning.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=NU9AYHJvYe",
    "arxiv_id": "2312.00379",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18785,
    "title": "Long-tailed Diffusion Models with Oriented Calibration",
    "authors": [
      "Tianjiao Zhang",
      "Huangjie Zheng",
      "Jiangchao Yao",
      "Xiangfeng Wang",
      "Mingyuan Zhou",
      "Ya Zhang",
      "Yanfeng Wang"
    ],
    "abstract": "Diffusion models have the ability to produce high-quality images with remarkable realism and diversity. Their effectiveness heavily relies on massive training on large-scale datasets, which, however, can be considerably impaired in the presence of real-world long-tail data. For long tail diffusion model generation, current works focus on the calibration and enhancement of the tail generation with head-tail knowledge transfer. The transfer process relies on the abundant diversity derived from the head class and, more significantly, the condition capacity of the model prediction. However, it is worth noting that the dependency on the conditional model prediction to realize the knowledge transfer might exhibit bias during training, leading to unsatisfactory generation results and lack of robustness. To address the issue, we directly establish the knowledge transfer from head data samples, based on the multi-objective characteristics of the score function in the diffusion process. To this end, a directional calibration for the estimation of noisy tail sample score is performed towards the clean head samples~(T2H), leveraging the similarity within the data distribution from head to tail classes. This augmentation for the tail score estimation encourages better diversity in generating the samples of tail categories. We extensively evaluate our approach with experiments on multiple benchmark datasets, demonstrating its effectiveness and superior performance compared to existing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NW2s5XXwXU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18784,
    "title": "Federated Text-driven Prompt Generation for Vision-Language Models",
    "authors": [
      "Chen Qiu",
      "Xingyu Li",
      "Chaithanya Kumar Mummadi",
      "Madan Ravi Ganesh",
      "Zhenzhen Li",
      "Lu Peng",
      "Wan-Yi Lin"
    ],
    "abstract": "Prompt learning for vision-language models, e.g., CoOp, has shown great success in adapting CLIP to different downstream tasks, making it a promising solution for federated learning due to computational reasons. Existing prompt learning techniques replace hand-crafted text prompts with learned vectors that offer improvements on seen classes but struggle to generalize to unseen classes. Our work addresses this challenge by proposing Federated Text-driven Prompt Generation (FedTPG), which learns a unified prompt generation network across multiple remote clients in a scalable manner. The prompt generation network is conditioned on task-related text input, thus, is context-aware, making it suitable to generalize for both seen and unseen classes. Our comprehensive empirical evaluations on nine diverse image classification datasets show that our method is superior to existing federated prompt learning methods, that achieve overall better generalization on both seen and unseen classes and is also generalizable to unseen datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NW31gAylIm",
    "arxiv_id": "2310.06123",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18783,
    "title": "Fake It Till Make It: Federated Learning with Consensus-Oriented Generation",
    "authors": [
      "Rui Ye",
      "Yaxin Du",
      "Zhenyang Ni",
      "Yanfeng Wang",
      "Siheng Chen"
    ],
    "abstract": "In federated learning (FL), data heterogeneity is one key bottleneck that causes model divergence and limits performance. Addressing this, existing methods often regard data heterogeneity as an inherent property and propose to mitigate its adverse effects by correcting models. In this paper, we seek to break this inherent property by generating data to complement the original dataset to fundamentally mitigate heterogeneity level. As a novel attempt from the perspective of data, we propose federated learning with consensus-oriented generation (FedCOG). FedCOG consists of two key components at the client side: complementary data generation, which generates data extracted from the shared global model to complement the original dataset, and knowledge-distillation-based model training, which distills knowledge from global model to local model based on the generated data to mitigate over-fitting the original heterogeneous dataset.FedCOG has two critical advantages: 1) it can be a plug-and-play module to further improve the performance of most existing FL methods, and 2) it is naturally compatible with standard FL protocols such as Secure Aggregation since it makes no modification in communication process.Extensive experiments on classical and real-world FL datasets show that FedCOG consistently outperforms state-of-the-art methods and has the plug-and-play property.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NY3wMJuaLf",
    "arxiv_id": "2312.05966",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18781,
    "title": "Towards Imitation Learning to Branch for MIP: A Hybrid Reinforcement Learning based Sample Augmentation Approach",
    "authors": [
      "Changwen Zhang",
      "Wenli Ouyang",
      "Hao Yuan",
      "Liming Gong",
      "Yong Sun",
      "Ziao Guo",
      "Zhichen Dong",
      "Junchi Yan"
    ],
    "abstract": "Branch-and-bound (B\\&B) has long been favored for tackling complex Mixed Integer Programming (MIP) problems, where the choice of branching strategy plays a pivotal role. Recently, Imitation Learning (IL)-based policies have emerged as potent alternatives to traditional rule-based approaches. However, it is nontrivial of acquiring high-quality training samples, and IL often converges to suboptimal variable choices for branching, restricting the overall performance. In response to these challenges, we propose a novel hybrid online and offline reinforcement learning (RL) approach to enhance the branching policy by cost-effective training sample augmentation. In online phase, we train an online RL agent to dynamically decide the sample generation processes, drawing from either the learning-based policy or the expert policy. The objective here is to strike an optimal balance between the exploration and exploitation of the sample generation process. In offline phase, a value function is trained to fit the cumulative reward for each decision and to filter the samples with high cumulative returns. This dual-purpose function not only reduces training complexity but also enhances the quality of the samples. To assess the efficacy of our proposed data augmentation mechanism, we conduct comprehensive evaluations across a range of MIP problems. The results consistently show that our method excels in making superior branching decisions compared to state-of-the-art learning-based models and the open-source solver SCIP. Notably, it even often outperforms the commercial solver Gurobi.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NdcQQ82mfy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18780,
    "title": "Training Socially Aligned Language Models on Simulated Social Interactions",
    "authors": [
      "Ruibo Liu",
      "Ruixin Yang",
      "Chenyan Jia",
      "Ge Zhang",
      "Diyi Yang",
      "Soroush Vosoughi"
    ],
    "abstract": "The goal of social alignment for AI systems is to make sure these models can conduct themselves appropriately following social values. Unlike humans who establish a consensus on value judgments through social interaction, current language models (LMs) are trained to rigidly recite the corpus in social isolation, which causes poor generalization in unfamiliar cases and the lack of robustness under adversarial attacks. In this work, we introduce a new training paradigm that enables LMs to learn from simulated social interactions. Compared with existing methods, our method is much more scalable and efficient, and shows superior performance in alignment benchmarks and human evaluation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NddKiWtdUm",
    "arxiv_id": "2305.16960",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18779,
    "title": "Replay across Experiments: A Natural Extension of Off-Policy RL",
    "authors": [
      "Dhruva Tirumala",
      "Thomas Lampe",
      "Jose Enrique Chen",
      "Tuomas Haarnoja",
      "Sandy Huang",
      "Guy Lever",
      "Ben Moran",
      "Tim Hertweck",
      "Leonard Hasenclever",
      "Martin Riedmiller",
      "Nicolas Heess",
      "Markus Wulfmeier"
    ],
    "abstract": "Replaying data is a principal mechanism underlying the stability and data efficiency of off-policy reinforcement learning (RL).We present an effective yet simple framework to extend the use of replays across multiple experiments, minimally adapting the RL workflow for sizeable improvements in controller performance and research iteration times.At its core, Replay across Experiments (RaE) involves reusing experience from previous experiments to improve exploration and bootstrap learning while reducing required changes to a minimum in comparison to prior work. We empirically show benefits across a number of RL algorithms and challenging control domains spanning both locomotion and manipulation, including hard exploration tasks from egocentric vision. Through comprehensive ablations, we demonstrate  robustness to the quality and amount of data available and various hyperparameter choices. Finally, we discuss how our approach can be applied more broadly across research life cycles and can increase resilience by reloading data across random seeds or hyperparameter variations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Nf4Lm6fXN8",
    "arxiv_id": "2311.15951",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18778,
    "title": "Predictive, scalable and interpretable knowledge tracing on structured domains",
    "authors": [
      "Hanqi Zhou",
      "Robert Bamler",
      "Charley M Wu",
      "\u00c1lvaro Tejero-Cantero"
    ],
    "abstract": "Intelligent tutoring systems optimize the selection and timing of learning materials to enhance understanding and long-term retention. This requires estimates of both the learner's progress (\"knowledge tracing\"; KT), and the prerequisite structure of the learning domain (\"knowledge mapping\"). While recent deep learning models achieve high KT accuracy, they do so at the expense of the interpretability of psychologically-inspired models. In this work, we present a solution to this trade-off. PSI-KT is a hierarchical generative approach that explicitly models how both individual cognitive traits and the prerequisite structure of knowledge influence learning dynamics, thus achieving interpretability by design. Moreover, by using scalable Bayesian inference, PSI-KT targets the real-world need for efficient personalization even with a growing body of learners and interaction data. Evaluated on three datasets from online learning platforms, PSI-KT achieves superior multi-step **p**redictive accuracy and **s**calable inference in continual-learning settings, all while providing **i**nterpretable representations of learner-specific traits and the prerequisite structure of knowledge that causally supports learning. In sum, predictive, scalable and interpretable knowledge tracing with solid knowledge mapping lays a key foundation for effective personalized learning to make education accessible to a broad, global audience.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=NgaLU2fP5D",
    "arxiv_id": "2403.13179",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18777,
    "title": "MOTOR: A Time-to-Event Foundation Model For Structured Medical Records",
    "authors": [
      "Ethan Steinberg",
      "Jason Alan Fries",
      "Yizhe Xu",
      "Nigam Shah"
    ],
    "abstract": "We present a self-supervised, time-to-event (TTE) foundation model called MOTOR (Many Outcome Time Oriented Representations) which is pretrained on timestamped sequences of events in electronic health records (EHR) and health insurance claims. TTE models are used for estimating the probability distribution of the time until a specific event occurs, which is an important task in medical settings. TTE models provide many advantages over classification using fixed time horizons, including naturally handling censored observations, but are challenging to train with limited labeled data. MOTOR addresses this challenge by pretraining on up to 55M patient records (9B clinical events). We evaluate MOTOR's transfer learning performance on 19 tasks, across 3 patient databases (a private EHR system, MIMIC-IV, and Merative claims data). Task-specific models adapted from MOTOR improve time-dependent C statistics by 4.6\\% over state-of-the-art, improve label efficiency by up to 95\\% ,and are more robust to temporal distributional shifts. We further evaluate cross-site portability by adapting our MOTOR foundation model for six prediction tasks on the MIMIC-IV dataset, where it outperforms all baselines. MOTOR is the first foundation model for medical TTE predictions and we release a 143M parameter pretrained model for research use at [redacted URL].",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=NialiwI2V6",
    "arxiv_id": "2301.03150",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18775,
    "title": "VeRA: Vector-based Random Matrix Adaptation",
    "authors": [
      "Dawid Jan Kopiczko",
      "Tijmen Blankevoort",
      "Yuki M Asano"
    ],
    "abstract": "It is becoming common practice for natural language processing to finetune pretrained language models for several downstream tasks at the same time. In practice, one might see several use cases based on the same model running simultaneously. Yet, this practice comes with considerable storage requirements, an issue that becomes particularly acute when scaling to large models or deploying numerous per-user or per-task adapted models. Although parameter-efficient finetuning methods such as LoRA exist, they do not fully mitigate this storage challenge. To this end, we introduce Efficient Low-Rank Adaptation with Random Matrices (ELoRA), which takes parameter efficiency to the extreme. By freezing a single pair of random low-rank matrices, shared across all layers, and using small layer-wise trainable scaling vectors, ELoRA achieves a 10x reduction in trainable parameters compared to LoRA without compromising performance levels. We demonstrate the effectiveness of the method on the GLUE benchmark and analyze its parameter-performance trade-off. Finally, using the Llama2 7B model, we show that ELoRA can also be used for instruction-tuning with merely 1.4M parameters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NjNfLdxr3A",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18773,
    "title": "Fantastic Generalization Measures are Nowhere to be Found",
    "authors": [
      "Michael Gastpar",
      "Ido Nachum",
      "Jonathan Shafer",
      "Thomas Weinberger"
    ],
    "abstract": "Numerous generalization bounds have been proposed in the literature as potential explanations for the ability of neural networks to generalize in the overparameterized setting. However, none of these bounds are tight. For instance, in their paper \u201cFantastic Generalization Measures and Where to Find Them\u201d, Jiang et al. (2020) examine more than a dozen generalization bounds, and show empirically that none of them imply guarantees that can explain the remarkable performance of neural networks. This raises the question of whether tight generalization bounds are at all possible. We consider two types of generalization bounds common in the literature: (1) bounds that depend on the training set and the output of the learning algorithm. There are multiple bounds of this type in the literature (e.g., norm- and margin-based bounds), but we prove mathematically that no such bound can be uniformly tight in the overparameterized setting; (2) bounds that depend on the training set and on the learning algorithm (e.g., stability bounds). For these bounds, we show a trade-off between the algorithm's performance and the bound's tightness. Namely, under mild assumptions, if the algorithm achieves good accuracy in the overparameterized setting, then no generalization bound can be tight for it. We conclude that generalization bounds in the overparameterized setting cannot be tight without suitable assumptions on the population distribution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NkmJotfL42",
    "arxiv_id": "2309.13658",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18772,
    "title": "Steve-Eye: Equipping LLM-based Embodied Agents with Visual Perception in Open Worlds",
    "authors": [
      "Sipeng Zheng",
      "jiazheng liu",
      "Yicheng Feng",
      "Zongqing Lu"
    ],
    "abstract": "Recent studies have presented compelling evidence that large language models (LLMs) can equip embodied agents with the self-driven capability to interact with the world, which marks an initial step toward versatile robotics.However, these efforts tend to overlook the visual richness of open worlds, rendering the entire interactive process akin to ``a blindfolded text-based game.''Consequently, LLM-based agents frequently encounter challenges in intuitively comprehending their surroundings and producing responses that are easy to understand.In this paper, we propose Steve-Eye, an end-to-end trained large multimodal model designed to address this limitation.Steve-Eye integrates the LLM with a visual encoder which enables it to process visual-text inputs and generate multimodal feedback.In addition, we use a semi-automatic strategy to collect an extensive dataset comprising 850K open-world instruction pairs, empowering our model to encompass three essential functions for an agent: multimodal perception, foundational knowledge base, and skill prediction and planning.Lastly, we develop three open-world evaluation benchmarks, then carry out extensive experiments from a wide range of perspectives to validate our model's capability to strategically act and plan.Codes and datasets will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NltzxpG0nz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18771,
    "title": "Perceptual Group Tokenizer: Building Perception with Iterative Grouping",
    "authors": [
      "Zhiwei Deng",
      "Ting Chen",
      "Yang Li"
    ],
    "abstract": "Human visual recognition system shows astonishing capability of compressing visual information into a set of tokens containing rich representations without label supervision. One critical driving principle behind it is perceptual grouping. Despite being widely used in computer vision in the early 2010s, it remains a mystery whether perceptual grouping can be leveraged to derive a neural visual recognition backbone that generates as powerful representations. In this paper, we propose the Perceptual Group Tokenizer, a model that entirely relies on grouping operations to extract visual features and perform self-supervised representation learning, where a series of grouping operations are used to iteratively hypothesize the context for pixels or superpixels to refine feature representations. We show that the proposed model can achieve competitive performance compared to state-of-the-art vision architectures, and inherits desirable properties including adaptive computation without re-training, and interpretability. Specifically, Perceptual Group Tokenizer achieves 79.7% on ImageNet-1K self-supervised learning benchmark with linear probe evaluation, marking a new progress under this paradigm.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NnYaYVODyV",
    "arxiv_id": "2311.18296",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18769,
    "title": "Intelligent Switching for Reset-Free RL",
    "authors": [
      "Darshan Patil",
      "Janarthanan Rajendran",
      "Glen Berseth",
      "Sarath Chandar"
    ],
    "abstract": "In the real world, the strong episode resetting mechanisms that are needed to trainagents in simulation are unavailable. The resetting assumption limits the potentialof reinforcement learning in the real world, as providing resets to an agent usuallyrequires the creation of additional handcrafted mechanisms or human interventions.Recent work aims to train agents (forward) with learned resets by constructinga second (backward) agent that returns the forward agent to the initial state. Wefind that the termination and timing of the transitions between these two agentsare crucial for algorithm success. With this in mind, we create a new algorithm,Reset Free RL with Intelligently Switching Controller (RISC) which intelligentlyswitches between the two agents based on the agent\u2019s confidence in achieving itscurrent goal. Our new method achieves state-of-the-art performance on severalchallenging environments for reset-free RL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Nq45xeghcL",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18768,
    "title": "PromptTTS 2: Describing and Generating Voices with Text Prompt",
    "authors": [
      "Yichong Leng",
      "ZHifang Guo",
      "Kai Shen",
      "Zeqian Ju",
      "Xu Tan",
      "Eric Liu",
      "Yufei Liu",
      "Dongchao Yang",
      "leying zhang",
      "Kaitao Song",
      "Lei He",
      "Xiangyang Li",
      "sheng zhao",
      "Tao Qin",
      "Jiang Bian"
    ],
    "abstract": "Speech conveys more information than text, as the same word can be uttered in various voices to convey diverse information. Compared to traditional text-to-speech (TTS) methods relying on speech prompts (reference speech) for voice variability, using text prompts (descriptions) is more user-friendly since speech prompts can be hard to find or may not exist at all. TTS approaches based on the text prompt face two main challenges: 1) the one-to-many problem, where not all details about voice variability can be described in the text prompt, and 2) the limited availability of text prompt datasets, where vendors and large cost of data labeling are required to write text prompts for speech. In this work, we introduce PromptTTS 2 to address these challenges with a variation network to provide variability information of voice not captured by text prompts, and a prompt generation pipeline to utilize the large language models (LLM) to compose high quality text prompts. Specifically, the variation network predicts the representation extracted from the reference speech (which contains full information about voice variability) based on the text prompt representation. For the prompt generation pipeline, it generates text prompts for speech with a speech language understanding model to recognize voice attributes (e.g., gender, speed) from speech and a large language model to formulate text prompts based on the recognition results. Experiments on a large-scale (44K hours) speech dataset demonstrate that compared to the previous works, PromptTTS 2 generates voices more consistent with text prompts and supports the sampling of diverse voice variability, thereby offering users more choices on voice generation. Additionally, the prompt generation pipeline produces high-quality text prompts, eliminating the large labeling cost. The demo page of PromptTTS 2 is available (https://speechresearch.github.io/prompttts2).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NsCXDyv2Bn",
    "arxiv_id": "2309.02285",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18767,
    "title": "Lagrangian Flow Networks for Conservation Laws",
    "authors": [
      "Fabricio Arend Torres",
      "Marcello Massimo Negri",
      "Marco Inversi",
      "Jonathan Aellen",
      "Volker Roth"
    ],
    "abstract": "We introduce Lagrangian Flow Networks (LFlows) for modeling fluid densities and velocities continuously in space and time.By construction, the proposed LFlows satisfy the continuity equation,a PDE describing mass conservation in its differentiable form. Our model is based on the insight that solutions to the continuity equation can be expressed astime-dependent density transformations via differentiable and invertible maps.This follows from classical theory of the existence and uniqueness of Lagrangian flows for smooth vector fields.Hence, we model fluid densities by transforming a base density with parameterized diffeomorphisms conditioned on time.The key benefit compared to methods relying on numerical ODE solvers or PINNs is that the analytic expression of the velocity is always consistent with changes in density.Furthermore, we require neither expensive numerical solvers, nor additional penalties to enforce the PDE.LFlows show higher predictive accuracy in density modeling tasks compared to competing models in 2D and 3D,while being computationally efficient.As a real-world application, we model bird migration based on sparse weather radar measurements.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Nshk5YpdWE",
    "arxiv_id": "2305.16846",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18766,
    "title": "Learning to Jointly Understand Visual and Tactile Signals",
    "authors": [
      "Yichen Li",
      "Yilun Du",
      "Chao Liu",
      "Chao Liu",
      "Francis Williams",
      "Michael Foshey",
      "Benjamin Eckart",
      "Jan Kautz",
      "Joshua B. Tenenbaum",
      "Antonio Torralba",
      "Wojciech Matusik"
    ],
    "abstract": "Modeling and analyzing object and shape has been well studied in the past. However, manipulation of these complex tools and articulated objects remains difficult for autonomous agents. Our human hands, however, are dexterous and adaptive. We can easily adapt a manipulation skill on one object to all objects in the class and to other similar classes. Our intuition comes from that there is a close connection between manipulations and topology and articulation of objects. The possible articulation of objects indicates the types of manipulation necessary to operate the object. In this work, we aim to take a manipulation perspective to understand everyday objects and tools. We collect a multi-modal visual-tactile dataset that contains paired full-hand force pressure maps and manipulation videos. We also propose a novel method to learn a cross-modal latent manifold that allow for cross-modal prediction and discovery of latent structure in different data modalities. We conduct extensive experiments to demonstrate the effectiveness of our method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NtQqIcSbqv",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18765,
    "title": "3D Reconstruction with Generalizable Neural Fields using Scene Priors",
    "authors": [
      "Yang Fu",
      "Shalini De Mello",
      "Xueting Li",
      "Amey Kulkarni",
      "Jan Kautz",
      "Xiaolong Wang",
      "Sifei Liu"
    ],
    "abstract": "High-fidelity 3D scene reconstruction has been substantially advanced by recent progress in neural fields. However, most existing methods train a separate network from scratch for each individual scene. This is not scalable, inefficient, and unable to yield good results given limited views. While learning-based multi-view stereo methods alleviate this issue to some extent, their multi-view setting makes it less flexible to scale up and to broad applications. Instead, we introduce training generalizable Neural Fields incorporating scene Priors (NFPs). The NFP network maps any single-view RGB-D image into signed distance and radiance values. A complete scene can be reconstructed by merging individual frames in the volumetric space WITHOUT a fusion module, which provides better flexibility.  The scene priors can be trained on large-scale datasets, allowing for fast adaptation to the reconstruction of a new scene with fewer views. NFP not only demonstrates SOTA scene reconstruction performance and efficiency, but it also supports single-image novel-view synthesis, which is under-explored in neural fields.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Nu7dDaVF5a",
    "arxiv_id": "2309.15164",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18764,
    "title": "InstructCV: Instruction-Tuned Text-to-Image Diffusion Models as Vision Generalists",
    "authors": [
      "Yulu Gan",
      "Sungwoo Park",
      "Alexander Marcel Schubert",
      "Anthony Philippakis",
      "Ahmed Alaa"
    ],
    "abstract": "Recent advances in generative diffusion models have enabled text-controlled synthesis of realistic and diverse images with impressive quality. Despite these remarkable advances, the application of text-to-image generative models in computer vision for standard visual recognition tasks remains limited. The current de facto approach for these tasks is to design model architectures and loss functions that are tailored to the task at hand. In this paper, we develop a unified language interface for computer vision tasks that abstracts away task specific design choices and enables task execution by following natural language instructions. Our approach involves casting multiple computer vision tasks as text-to-image generation problems. Here, the text represents an instruction describing the task, and the resulting image is a visually-encoded task output. To train our model, we pool commonly-used computer vision datasets covering a range of tasks, including segmentation, object detection, depth estimation, and classification. We then use a large language model to paraphrase prompt templates that convey the specific tasks to be conducted on each image, and through this process, we create a multi-modal and multi-task training dataset comprising input and output images along with annotated instructions. Following the InstructPix2Pix architecture, we apply instruction-tuning to a text-to-image diffusion model using our constructed dataset, steering its functionality from a generative model to an instruction-guided multi-task vision learner. Experiments demonstrate that our model, dubbed InstructCV, performs competitively compared to other generalist and task-specific vision models. Moreover, it exhibits compelling generalization capabilities to unseen data, categories, and user instructions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Nu9mOSq7eH",
    "arxiv_id": "2310.00390",
    "GitHub": [
      "https://github.com/AlaaLab/InstructCV"
    ],
    "Space": [
      "alaa-lab/InstructCV"
    ],
    "Model": [
      "alaa-lab/InstructCV"
    ],
    "Dataset": []
  },
  {
    "id": 18763,
    "title": "FOSI: Hybrid First and Second Order Optimization",
    "authors": [
      "Hadar Sivan",
      "Moshe Gabel",
      "Assaf Schuster"
    ],
    "abstract": "Popular machine learning approaches forgo second-order information due to the difficulty of computing curvature in high dimensions.We present FOSI, a novel meta-algorithm that improves the performance of any base first-order optimizer by efficiently incorporating second-order information during the optimization process.In each iteration, FOSI implicitly splits the function into two quadratic functions defined on orthogonal subspaces, then uses a second-order method to minimize the first, and the base optimizer to minimize the other.We formally analyze FOSI's convergence and the conditions under which it improves a base optimizer.Our empirical evaluation demonstrates that FOSI improves the convergence rate and optimization time of first-order methods such as Heavy-Ball and Adam, and outperforms second-order methods (K-FAC and L-BFGS).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NvbeD9Ttkx",
    "arxiv_id": "2302.08484",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18762,
    "title": "Unleashing Large-Scale Video Generative Pre-training for Visual Robot Manipulation",
    "authors": [
      "Hongtao Wu",
      "Ya Jing",
      "Chilam Cheang",
      "Guangzeng Chen",
      "Jiafeng Xu",
      "Xinghang Li",
      "Minghuan Liu",
      "Hang Li",
      "Tao Kong"
    ],
    "abstract": "Generative pre-trained models have demonstrated remarkable effectiveness in language and vision domains by learning useful representations. In this paper, we extend the scope of this effectiveness by showing that visual robot manipulation can significantly benefit from large-scale video generative pre-training. We introduce GR-1, a straightforward GPT-style model designed for multi-task language-conditioned visual robot manipulation. GR-1 takes as inputs a language instruction, a sequence of observation images, and a sequence of robot states. It predicts robot actions as well as future images in an end-to-end manner. Thanks to a flexible design, GR-1 can be seamlessly finetuned on robot data after pre-trained on a large-scale video dataset. We perform extensive experiments on the challenging CALVIN benchmark and a real robot. On CALVIN benchmark, our method outperforms state-of-the-art baseline methods and improves the success rate from 88.9% to 94.9%. When trained on 10% data of the full dataset, GR-1 achieves a success rate of 77.8%, while the best baseline method achieves 66.8%. In the zero-shot generalization setting, GR-1 improves the success rate from 53.3% to 85.4%. In real robot experiments, GR-1 also outperforms the comparing baseline method. We provide inaugural evidence that a unified GPT-style transformer, augmented with large-scale video generative pre-training, exhibits remarkable generalization to multi-task visual robot manipulation. Code will be made available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NxoFmGgWC9",
    "arxiv_id": "2312.13139",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18760,
    "title": "Masked Audio Generation using a Single Non-Autoregressive Transformer",
    "authors": [
      "Alon Ziv",
      "Itai Gat",
      "Gael Le Lan",
      "Tal Remez",
      "Felix Kreuk",
      "Jade Copet",
      "Alexandre D\u00e9fossez",
      "Gabriel Synnaeve",
      "Yossi Adi"
    ],
    "abstract": "We introduce MAGNeT, a masked generative sequence modeling method that operates directly over several streams of discrete audio representation, i.e., tokens. Unlike prior work, MAGNeT is comprised of a single-stage, non-autoregressive transformer encoder. During training, we predict spans of masked tokens obtained from the masking scheduler, while during inference we gradually construct the output sequence using several decoding steps. To further enhance the quality of the generated audio, we introduce a novel model rescorer method. In which, we leverage an external pre-trained model to rescore and rank predictions from MAGNeT which will be then used for later decoding steps. Lastly, we explore a hybrid version of MAGNeT, in which we fuse between autoregressive and non-autoregressive models to generate the first few seconds in an autoregressive manner while the rest of the sequence is being decoded in parallel. We demonstrate the efficiency of MAGNeT over the task of text-to-music generation and conduct extensive empirical evaluation, considering both automatic and human studies. We show the proposed approach is comparable to the evaluated baselines while being significantly faster (x7 faster than the autoregressive baseline). Through ablation studies and analysis, we shed light on the importance of each of the components comprising MAGNeT, together with pointing to the trade-offs between autoregressive and non-autoregressive considering latency, throughput, and generation quality. Samples are available as part of the supplemental material.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ny8NiVfi95",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18759,
    "title": "Toward effective protection against diffusion-based mimicry through score distillation",
    "authors": [
      "Haotian Xue",
      "Chumeng Liang",
      "Xiaoyu Wu",
      "Yongxin Chen"
    ],
    "abstract": "While generative diffusion models excel in producing high-quality images, they can also be misused to mimic authorized images, posing a significant threat to AI systems. Efforts have been made to add calibrated perturbations to protect images from diffusion-based mimicry pipelines. However, most of the existing methods are too ineffective and even impractical to be used by individual users due to their high computation and memory requirements. In this work, we present novel findings on attacking latent diffusion models (LDM) and propose new plug-and-play strategies for more effective protection. In particular, we explore the bottleneck in attacking an LDM, discovering that the encoder module rather than the denoiser module is the vulnerable point. Based on this insight, we present our strategy using Score Distillation Sampling (SDS) to double the speed of protection and reduce memory occupation by half without compromising its strength. Additionally, we provide a robust protection strategy by counterintuitively minimizing the semantic loss, which can assist in generating more natural perturbations. Finally, we conduct extensive experiments to substantiate our findings and comprehensively evaluate our newly proposed strategies. We hope our insights and protective measures can contribute to better defense against malicious diffusion-based mimicry, advancing the development of secure AI systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NzxCMe88HX",
    "arxiv_id": "2311.12832",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18758,
    "title": "Progressive3D: Progressively Local Editing for Text-to-3D Content Creation with Complex Semantic Prompts",
    "authors": [
      "Xinhua Cheng",
      "Tianyu Yang",
      "Jianan Wang",
      "Yu Li",
      "Lei Zhang",
      "Jian Zhang",
      "Li Yuan"
    ],
    "abstract": "Recent text-to-3D generation methods achieve impressive 3D content creation capacity thanks to the advances in image diffusion models and optimizing strategies. However, current methods struggle to generate correct 3D content for a complex prompt in semantics, i.e., a prompt describing multiple interacted objects binding with different attributes. In this work, we propose a general framework named Progressive3D, which decomposes the entire generation into a series of locally progressive editing steps to create precise 3D content for complex prompts, and we constrain the content change to only occur in regions determined by user-defined region prompts in each editing step. Furthermore, we propose an overlapped semantic component suppression technique to encourage the optimization process to focus more on the semantic differences between prompts. Extensive experiments demonstrate that the proposed Progressive3D framework generates precise 3D content for prompts with complex semantics through progressive editing steps and is general for various text-to-3D methods driven by different 3D representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=O072Rc8uUy",
    "arxiv_id": "2310.11784",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18757,
    "title": "Modelling complex vector drawings with stroke-clouds",
    "authors": [
      "Alexander Ashcroft",
      "Ayan Das",
      "Yulia Gryaditskaya",
      "Zhiyu Qu",
      "Yi-Zhe Song"
    ],
    "abstract": "Vector drawings are innately interactive as they preserve creational cues. Despitethis desirable property they remain relatively under explored due to the difficultiesin modeling complex vector drawings. This is in part due to the primarily _sequential and auto-regressive nature_ of existing approaches failing to scale beyond simpledrawings. In this paper, we define generative models over _highly complex_ vectordrawings by first representing them as \u201cstroke-clouds\u201d \u2013 _sets_ of arbitrary cardinality comprised of semantically meaningful strokes. The dimensionality of thestrokes is a design choice that allows the model to adapt to a range of complexities.We learn to encode these _set of strokes_ into compact latent codes by a probabilisticreconstruction procedure backed by _De-Finetti\u2019s Theorem of Exchangability_. Theparametric generative model is then defined over the latent vectors of the encodedstroke-clouds. The resulting \u201cLatent stroke-cloud generator (LSG)\u201d thus capturesthe distribution of complex vector drawings on an implicit _set space_. We demonstrate the efficacy of our model on complex drawings (a newly created Animeline-art dataset) through a rangeof generative tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=O2jyuo89CK",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18755,
    "title": "Leveraging Optimization for Adaptive Attacks on Image Watermarks",
    "authors": [
      "Nils Lukas",
      "Abdulrahman Diaa",
      "Lucas Fenaux",
      "Florian Kerschbaum"
    ],
    "abstract": "Untrustworthy users can misuse image generators to synthesize high-quality deepfakes and engage in online spam or disinformation campaigns. Watermarking deters misuse by marking generated content with a hidden message, enabling its detection using a secret watermarking key. A core security property of watermarking is robustness, which states that an attacker can only evade detection by substantially degrading image quality. Assessing robustness requires designing an adaptive attack for the specific watermarking algorithm.  A challenge when evaluating watermarking algorithms and their (adaptive) attacks is to determine whether an adaptive attack is optimal, i.e., it is the best possible attack. We solve this problem by defining an objective function and then approach adaptive attacks as an optimization problem. The core idea of our adaptive attacks is to replicate secret watermarking keys locally by creating surrogate keys that are differentiable and can be used to optimize the attack's parameters. We demonstrate for Stable Diffusion models that such an attacker can break all five surveyed watermarking methods at negligible degradation in image quality. These findings emphasize the need for more rigorous robustness testing against adaptive, learnable attackers.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=O9PArxKLe1",
    "arxiv_id": "2309.16952",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18754,
    "title": "Biased Temporal Convolution Graph Network for Time Series Forecasting with Missing Values",
    "authors": [
      "Xiaodan Chen",
      "Xiucheng Li",
      "Bo Liu",
      "Zhijun Li"
    ],
    "abstract": "Multivariate time series forecasting plays an important role in various applications ranging from meteorology study, traffic management to economics planning. In the past decades, many efforts have been made toward accurate and reliable forecasting by exploring both temporal dynamics and spatial correlation. Especially, the development of Transformer-based methods has significantly enhanced long-term forecasting accuracy in very recent years. The existing forecasting methods often assume intact input data, however, in practice the time series data is often partially observed due to device malfunction or costly data acquisition, which can seriously impede the performance of the existing approaches. A naive employment of imputation methods unavoidably involves error accumulation and leads to suboptimal solutions. Motivated by this, we propose a Biased Temporal Convolution Graph Network that jointly captures the temporal dependencies and spatial structure. In particular, we inject bias into the two carefully developed modules---the Multi-Scale Instance PartialTCN and Biased GCN---to account for missing patterns. The experimental results show that our proposed model is able to achieve up to $11$\\% improvements over the existing methods on five real-world benchmark datasets. Code is available at this repository: https://anonymous.4open.science/r/BiaTCGNet-1F80/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=O9nZCwdGcG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18753,
    "title": "Defining and extracting generalizable interaction primitives from DNNs",
    "authors": [
      "Lu Chen",
      "Siyu Lou",
      "Benhao Huang",
      "Quanshi Zhang"
    ],
    "abstract": "Faithfully summarizing the knowledge encoded by a deep neural network (DNN) into a few symbolic primitive patterns without losing much information represents a core challenge in explainable AI. To this end, Ren et al. (2023) have derived a series of theorems to prove that the inference score of a DNN can be explained as a small set of interactions between input variables. However, the lack of generalization power makes it still hard to consider such interactions as faithful primitive patterns encoded by the DNN. Therefore, given different DNNs trained for the same task, we develop a new method to extract interactions that are shared by these DNNs. Experiments show that the extracted interactions can better reflect common knowledge shared by different DNNs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OCqyFVFNeF",
    "arxiv_id": "2401.16318",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18752,
    "title": "Aligning Relational Learning with Lipschitz Fairness",
    "authors": [
      "Yaning Jia",
      "Chunhui Zhang",
      "Soroush Vosoughi"
    ],
    "abstract": "Relational learning has gained significant attention, led by the expressiveness of Graph Neural Networks (GNNs) on graph data. While the inherent biases in common graph data are involved in GNN training, it poses a serious challenge to constraining the GNN output perturbations induced by input biases, thereby safeguarding fairness during training. The Lipschitz constant, a technique from robust statistics, can limit the maximum changes in the output concerning the input, taking into account associated irrelevant biased factors. It is an efficient and provable method to examine the output stability of machine learning models without incurring additional computational costs. Recently, its use in controlling the stability of Euclidean neural networks, the calculation of the precise Lipschitz constant remains elusive for non-Euclidean neural networks like GNNs, especially within fairness contexts. However, no existing research has investigated Lipschitz constants to shed light on stabilizing the GNN outputs, especially when working on graph data with implicit biases. To narrow this gap, we begin with the general GNNs operating on an attributed graph, and formulate a Lipschitz constant to limit the changes in the output regarding biases associated with the input. Additionally, we theoretically analyze how the Lipschitz constant of a GNN model could constrain the output perturbations induced by biases learned from data for fairness training. We experimentally validate the Lipschitz constant's effectiveness in limiting biases of the model output. Finally, from a training dynamics perspective, we demonstrate why the theoretical Lipschitz constant can effectively guide the GNN training to better trade-off between accuracy and fairness.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ODSgo2m8aE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18751,
    "title": "DragonDiffusion: Enabling Drag-style Manipulation on Diffusion Models",
    "authors": [
      "Chong Mou",
      "Xintao Wang",
      "Jiechong Song",
      "Ying Shan",
      "Jian Zhang"
    ],
    "abstract": "Despite the ability of existing large-scale text-to-image (T2I) diffusion models to generate high-quality images from detailed textual descriptions, they often lack the ability to precisely edit the generated or real images. In this paper, we propose a novel image editing method, DragonDiffusion, enabling Drag-style manipulation on Diffusion models. Specifically, we treat image editing as the change of feature correspondence in a pre-trained diffusion model. By leveraging feature correspondence, we develop energy functions that align with the editing target, transforming image editing operations into gradient guidance. Based on this guidance approach, we also construct multi-scale guidance that considers both semantic and geometric alignment. Furthermore, we incorporate a visual cross-attention strategy based on a memory bank design to ensure consistency between the edited result and original image. Benefiting from these efficient designs, all content editing and consistency operations come from the feature correspondence without extra model fine-tuning or additional modules. Extensive experiments demonstrate that our method has promising performance on various image editing tasks, including editing within a single image (e.g., object moving, resizing, and content dragging) and across images (e.g., appearance replacing and object pasting).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=OEL4FJMg1b",
    "arxiv_id": "2307.02421",
    "GitHub": [
      "https://github.com/MC-E/DragonDiffusion"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18750,
    "title": "Doubly Robust Instance-Reweighted Adversarial Training",
    "authors": [
      "Daouda Sow",
      "Sen Lin",
      "Zhangyang Wang",
      "Yingbin Liang"
    ],
    "abstract": "Assigning importance weights to adversarial data has achieved great success in training adversarially robust networks under limited model capacity. However, existing instance-reweighted adversarial training (AT) methods heavily depend on heuristics and/or geometric interpretations to determine those importance weights, making these algorithms lack rigorous theoretical justification/guarantee. Moreover, recent research has shown that adversarial training suffers from a severe non-uniform robust performance across the training distribution, e.g., data points belonging to some classes can be much more vulnerable to adversarial attacks than others. To address both issues, in this paper, we propose a novel doubly-robust instance reweighted AT framework, which allows to obtain the importance weights via exploring distributionally robust optimization (DRO) techniques, and at the same time boosts the robustness on the most vulnerable examples. In particular, our importance weights are obtained by optimizing the KL-divergence regularized loss function, which allows us to devise new algorithms with a theoretical convergence guarantee. Experiments on standard classification datasets demonstrate that our proposed approach outperforms related state-of-the-art baseline methods in terms of average robust performance, and at the same time improves the robustness against attacks on the weakest data points. Codes can be found in the Supplement.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OF5x1dzWSS",
    "arxiv_id": "2308.00311",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18747,
    "title": "GenSim: Generating Robotic Simulation Tasks via Large Language Models",
    "authors": [
      "Lirui Wang",
      "Yiyang Ling",
      "Zhecheng Yuan",
      "Mohit Shridhar",
      "Chen Bao",
      "Yuzhe Qin",
      "Bailin Wang",
      "Huazhe Xu",
      "Xiaolong Wang"
    ],
    "abstract": "Collecting large amounts of real-world interaction data to train general robotic policies is often prohibitively expensive, thus motivating the use of simulation data. However, existing methods for data generation have generally focused on scene-level diversity (e.g., object instances and poses) rather than task-level diversity, due to the human effort required to come up with and verify novel tasks. This has made it challenging for policies trained on simulation data to demonstrate significant task-level generalization. In this paper, we propose to automatically generate rich simulation environments and expert demonstrations by exploiting a large language models' (LLM) grounding and coding ability. Our approach, dubbed GenSim, has two modes: goal-directed generation, wherein a target task is given to the LLM and the LLM proposes a task curriculum to solve the target task, and exploratory generation, wherein the LLM  bootstraps from previous tasks and iteratively proposes novel tasks that would be helpful in solving more complex tasks. We use GPT4 to expand the existing benchmark by ten times to over 100 tasks, on which we conduct supervised finetuning and evaluate several LLMs including finetuned GPTs and Code Llama on code generation for robotic simulation tasks. Furthermore, we observe that LLMs-generated simulation programs can enhance task-level generalization significantly when used for multitask policy training. We further find that with minimal sim-to-real adaptation, the multitask policies pretrained on GPT4-generated simulation tasks exhibit stronger transfer to unseen long-horizon tasks in the real world and outperform baselines by 25%. See our project website (https://gen-sim.github.io) and demo (https://huggingface.co/spaces/Gen-Sim/Gen-Sim) for visualizations and open-source models and datasets.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=OI3RoHoWAN",
    "arxiv_id": "2310.01361",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18746,
    "title": "Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimization",
    "authors": [
      "Dinghuai Zhang",
      "Ricky T. Q. Chen",
      "Cheng-Hao Liu",
      "Aaron Courville",
      "Yoshua Bengio"
    ],
    "abstract": "We tackle the problem of sampling from intractable high-dimensional density functions, a fundamental task that often appears in machine learning and statistics. We extend recent sampling-based approaches that leverage controlled stochastic processes to model approximate samples from these target densities.  The main drawback of these approaches is that the training objective requires full trajectories to compute, resulting in sluggish credit assignment issues due to use of entire trajectories and a weak learning signal.In this work, we present Diffusion Generative Flow Samplers (DGFS), a sampling-based framework where the learning process can be tractably broken down into short partial trajectory segments, via parameterizing an additional ``flow function''.Our method takes inspiration from the theory developed for generative flow networks (GFlowNets), allowing us to make use of intermediate learning signals and benefit from off-policy exploration capabilities.Through a variety of challenging experiments, we demonstrate that DGFS results in more accurate estimates of the normalization constant than closely-related prior methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OIsahq1UYC",
    "arxiv_id": "2310.02679",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18745,
    "title": "MAP IT to Visualize Representations",
    "authors": [
      "Robert Jenssen"
    ],
    "abstract": "MAP IT visualizes representations by taking a fundamentally different approach to dimensionality reduction. MAP IT aligns distributions over discrete marginal probabilities in the input space versus the target space, thus capturing information in local regions, as opposed to current methods which align based on individual probabilities between pairs of data points (states) only. The MAP IT theory reveals that alignment based on a projective divergence avoids normalization of weights (to obtain true probabilities) entirely, and further reveals a dual viewpoint via continuous densities and kernel smoothing. MAP IT is shown to produce visualizations which capture class structure better than the current state of the art while being inherently scalable.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OKf6JtXtoy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18744,
    "title": "Headless Language Models: Learning without Predicting with Contrastive Weight Tying",
    "authors": [
      "Nathan Godey",
      "\u00c9ric Villemonte de la Clergerie",
      "Beno\u00eet Sagot"
    ],
    "abstract": "Self-supervised pre-training of language models usually consists in predicting probability distributions over extensive token vocabularies. In this study, we propose an innovative method that shifts away from probability prediction and instead focuses on reconstructing input embeddings in a contrastive fashion via Constrastive Weight Tying (CWT). We apply this approach to pretrain Headless Language Models in both monolingual and multilingual contexts. Our method offers practical advantages, substantially reducing training computational requirements by up to 20 times, while simultaneously enhancing downstream performance and data efficiency. We observe a significant +1.6 GLUE score increase and a notable +2.7 LAMBADA accuracy improvement compared to classical LMs within similar compute budgets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ONPECq0Rk7",
    "arxiv_id": "2309.08351",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18743,
    "title": "Large Language Models to Enhance Bayesian Optimization",
    "authors": [
      "Tennison Liu",
      "Nicol\u00e1s Astorga",
      "Nabeel Seedat",
      "Mihaela van der Schaar"
    ],
    "abstract": "Bayesian optimization (BO) is a powerful approach for optimizing complex and expensive-to-evaluate black-box functions. Its importance is underscored in many applications, notably including hyperparameter tuning, but its efficacy depends on efficiently balancing exploration and exploitation. While there has been substantial progress in BO methods, striking this balance still remains a delicate process. In this light, we present $\\texttt{LLAMBO}$, a novel approach that integrates the capabilities of large language models (LLM) within BO. At a high level, we frame the BO problem in natural language terms, enabling LLMs to iteratively propose promising solutions conditioned on historical evaluations. More specifically, we explore how combining contextual understanding, few-shot learning proficiency, and domain knowledge of LLMs can enhance various components of model-based BO. Our findings illustrate that $\\texttt{LLAMBO}$ is effective at zero-shot warmstarting, and improves surrogate modeling and candidate sampling, especially in the early stages of search when observations are sparse. Our approach is performed in context and does not require LLM finetuning. Additionally, it is modular by design, allowing individual components to be integrated into existing BO frameworks, or function cohesively as an end-to-end method. We empirically validate $\\texttt{LLAMBO}$'s efficacy on the problem of hyperparameter tuning, highlighting strong empirical performance across a range of diverse benchmarks, proprietary, and synthetic tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OOxotBmGol",
    "arxiv_id": "2402.03921",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18742,
    "title": "CoT3DRef: Chain-of-Thoughts Data-Efficient 3D Visual Grounding",
    "authors": [
      "Eslam Mohamed BAKR",
      "Mohamed Ayman Mohamed",
      "Mahmoud Ahmed",
      "Habib Slim",
      "Mohamed Elhoseiny"
    ],
    "abstract": "3D visual grounding is the ability to localize objects in 3D scenes conditioned onan input utterance. Most existing methods devote the referring head to localize thereferred object directly. However, this approach will fail in complex scenarios andnot illustrate how and why the network reaches the final decision. In this paper,we address this question \u201cCan we design an interpretable 3D visual groundingframework that has the potential to mimic the human perception system?\u201d. To thisend, we formulate the 3D visual grounding problem as a sequence-to-sequence(Seq2Seq) task by first predicting a chain of anchors and then utilizing them to pre-dict the final target. Following the chain of thoughts approach enables us to decom-pose the referring task into interpretable intermediate steps, which in turn, booststhe performance and makes our framework extremely data-efficient. Interpretabil-ity not only improves the overall performance but also helps us identify failurecases. Moreover, our proposed framework can be easily integrated into any existingarchitecture. We validate our approach through comprehensive experiments on theNr3D and Sr3D benchmarks and show consistent performance gains compared toexisting methods without requiring any manually annotated data. Furthermore, ourproposed framework, dubbed CoT3DRef, is significantly data-efficient, whereaswhen trained only on 10% of the data, we match the SOTA performance that trainedon the entire data. The code is available at https://cot3dref.github.io/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ORUiqcLpV6",
    "arxiv_id": "2310.06214",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18741,
    "title": "$\\infty$-Diff: Infinite Resolution Diffusion with Subsampled Mollified States",
    "authors": [
      "Sam Bond-Taylor",
      "Chris G. Willcocks"
    ],
    "abstract": "We introduce $\\infty$-Diff, a generative diffusion model defined in an infinite-dimensional Hilbert space that allows infinite resolution data to be modelled. By randomly sampling subsets of coordinates during training and learning to denoise the content at those coordinates, a continuous function is learned that allows sampling at arbitrary resolutions. Prior infinite-dimensional generative models use point-wise functions that require latent compression for global context. In contrast, we propose using non-local integral operators to map between Hilbert spaces, allowing spatial information aggregation; to facilitate this, we design a powerful and efficient multi-scale architecture that operates directly on raw sparse coordinates. Training on high-resolution datasets we demonstrate that high-quality diffusion models can be learned with even $8\\times$ subsampling rates, enabling substantial improvements in run-time and memory requirements, achieving significantly higher sample quality as evidenced by lower FID scores, while also being able to effectively scale to higher resolutions than the training data while retaining detail.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OUeIBFhyem",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18740,
    "title": "Reward Design for Justifiable Sequential Decision-Making",
    "authors": [
      "Aleksa Sukovic",
      "Goran Radanovic"
    ],
    "abstract": "Equipping agents with the capacity to justify made decisions using supporting evidence represents a cornerstone of accountable decision-making. Furthermore, ensuring that justifications are in line with human expectations and societal norms is vital, especially in high-stakes situations such as healthcare. In this work, we propose the use of a debate-based reward model for reinforcement learning agents, where an outcome of a zero-sum debate game quantifies the justifiability of a decision in a particular state. This reward model is then used to train a justifiable policy, whose decisions can be more easily corroborated with supporting evidence. In the debate game, two argumentative agents take turns providing supporting evidence for two competing decisions. Given the proposed evidence, a proxy of a human judge evaluates which decision is more justified. We demonstrate the potential of our approach in learning policies for prescribing and justifying treatment decisions of septic patients. We show that shaping the reward with the feedback signal generated by the debate-based reward model yields effective policies highly favored by the judge when compared to the policy obtained solely from the environment rewards. Moreover, in terms of the overall performance and justifiability of trained policies, the debate-based feedback is comparable to the feedback obtained from an ideal judge proxy that evaluates decisions using the full information encoded in the state. This suggests that the debate game outputs key information contained in states that is most relevant for evaluating decisions, which in turn substantiates the practicality of combining our approach with human-in-the-loop evaluations. Lastly, we showcase that agents trained via multi-agent debate learn to propose evidence that is resilient to refutations and closely aligns with human preferences.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OUkZXbbwQr",
    "arxiv_id": "2402.15826",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18738,
    "title": "Less or More From Teacher: Exploiting Trilateral Geometry For Knowledge Distillation",
    "authors": [
      "Chengming Hu",
      "Haolun Wu",
      "Xuan Li",
      "Chen Ma",
      "Xi Chen",
      "Boyu Wang",
      "Jun Yan",
      "Xue Liu"
    ],
    "abstract": "Knowledge distillation aims to train a compact student network using soft supervision from a larger teacher network and hard supervision from ground truths. However, determining an optimal knowledge fusion ratio that balances these supervisory signals remains challenging. Prior methods generally resort to a constant or heuristic-based fusion ratio, which often falls short of a proper balance. In this study, we introduce a novel adaptive method for learning a sample-wise knowledge fusion ratio, exploiting both the correctness of teacher and student, as well as how well the student mimics the teacher on each sample. Our method naturally leads to the \\textit{intra-sample} trilateral geometric relations among the student prediction ($\\mathcal{S}$), teacher prediction ($\\mathcal{T}$), and ground truth ($\\mathcal{G}$). To counterbalance the impact of outliers, we further extend to the \\textit{inter-sample} relations, incorporating the teacher's global average prediction ($\\mathcal{\\bar{T}})$ for samples within the same class.  A simple neural network then learns the implicit mapping from the intra- and inter-sample relations to an adaptive, sample-wise knowledge fusion ratio in a bilevel-optimization manner. Our approach provides a simple, practical, and adaptable solution for knowledge distillation that can be employed across various architectures and model sizes. Extensive experiments demonstrate consistent improvements over other loss re-weighting methods on image classification, attack detection, and click-through rate prediction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OZitfSXpdT",
    "arxiv_id": "2312.15112",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18737,
    "title": "Efficient Sharpness-Aware Minimization for Molecular Graph Transformer Models",
    "authors": [
      "Yili Wang",
      "Kaixiong Zhou",
      "Ninghao Liu",
      "Ying Wang",
      "Xin Wang"
    ],
    "abstract": "Sharpness-aware minimization (SAM) has received increasing attention in computer vision since it can effectively eliminate the sharp local minima from the training trajectory and mitigate generalization degradation. However, SAM requires two sequential gradient computations during the optimization of each step: one to obtain the perturbation gradient and the other to obtain the updating gradient. Compared with the base optimizer (e.g., Adam), SAM doubles the time overhead due to the additional perturbation gradient. By dissecting the theory of SAM and observing the training gradient of the molecular graph transformer, we propose a new algorithm named GraphSAM,  which reduces the training cost of SAM and improves the generalization performance of graph transformer models. There are two key factors that contribute to this result: (i) \\textit{gradient approximation}: we use the updating gradient of the previous step to approximate the perturbation gradient at the intermediate steps smoothly (\\textbf{increases efficiency}); (ii) \\textit{loss landscape approximation}: we theoretically prove that the loss landscape of GraphSAM is limited to a small range centered on the expected loss of SAM (\\textbf{guarantees generalization performance}). The extensive experiments on six datasets with different tasks demonstrate the superiority of GraphSAM, especially in optimizing the model update process.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Od39h4XQ3Y",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18736,
    "title": "More is Better: when Infinite Overparameterization is Optimal and Overfitting is Obligatory",
    "authors": [
      "James B Simon",
      "Dhruva Karkada",
      "Nikhil Ghosh",
      "Mikhail Belkin"
    ],
    "abstract": "In our era of enormous neural networks, empirical progress has been driven by the philosophy that *more is better.*Recent deep learning practice has found repeatedly that larger model size, more data, and more computation (resulting in lower training loss) optimizing to near-interpolation improves performance. In this paper, we give theoretical backing to these empirical observations by showing that these three properties hold in random feature (RF) regression, a class of models equivalent to shallow networks with only the last layer trained.Concretely, we first show that the test risk of RF regression decreases monotonically with both the number of features and samples, provided the ridge penalty is tuned optimally. In particular, this implies that infinite width RF architectures are preferable to those of any finite width. We then proceed to demonstrate that, for a large class of tasks characterized by powerlaw eigenstructure, training to near-zero training loss is *obligatory:* near-optimal performance can *only* be achieved when the training error is much smaller than the test error. Grounding our theory in real-world data, we find empirically that standard computer vision tasks with convolutional neural kernels clearly fall into this class. Taken together, our results tell a simple, testable story of the benefits of overparameterization and overfitting in random feature models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OdpIjS0vkO",
    "arxiv_id": "2311.14646",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18733,
    "title": "Anisotropy helps: improved statistical and computational complexity of the mean-field Langevin dynamics under structured data",
    "authors": [
      "Atsushi Nitanda",
      "Kazusato Oko",
      "Taiji Suzuki",
      "Denny Wu"
    ],
    "abstract": "Recent works have shown that neural networks optimized by gradient-based methods can adapt to sparse or low-dimensional target functions through feature learning; an often studied target is the sparse parity function defined on the unit hypercube. However, such isotropic data setting does not capture the anisotropy and low intrinsic dimensionality exhibited in realistic datasets. In this work, we address this shortcoming by studying how gradient-based feature learning interacts with structured (anisotropic) input data: we consider the sparse parity problem on high-dimensional orthotope where the feature coordinates have varying magnitudes, and analyze the learning complexity of the mean-field Langevin dynamics (MFLD), which describes the noisy gradient descent update on two-layer neural network. We show that the statistical complexity (i.e. sample size) and computational complexity (i.e. width of the neural network) of MFLD can both be improved when prominent directions of the anisotropic input data aligns with the support of the target function. Moreover, by employing an anisotropic weight decay regularization determined by the gradient covariance, the problem can be efficiently learned by a constant-width neural network.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Of2nEDc4s7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18732,
    "title": "ALAM: Averaged Low-Precision Activation for Memory-Efficient Training of Transformer Models",
    "authors": [
      "Sunghyeon Woo",
      "Sunwoo Lee",
      "Dongsuk Jeon"
    ],
    "abstract": "One of the key challenges in deep neural network training is the substantial amount of GPU memory required to store activations obtained in the forward pass. Various Activation-Compressed Training (ACT) schemes have been proposed to mitigate this issue; however, it is challenging to adopt those approaches in recent transformer-based large language models (LLMs), which experience significant performance drops when the activations are deeply compressed during training. In this paper, we introduce ALAM, a novel ACT framework that utilizes average quantization and a lightweight sensitivity calculation scheme, enabling large memory saving in LLMs while maintaining training performance. We first demonstrate that compressing activations into their group average values minimizes the gradient variance. Employing this property, we propose Average Quantization which provides high-quality deeply compressed activations with an effective precision of less than 1 bit and improved flexibility of precision allocation. In addition, we present a cost-effective yet accurate sensitivity calculation algorithm that solely relies on the L2 norm of parameter gradients, substantially reducing memory overhead due to sensitivity calculation. In experiments, the ALAM framework significantly reduces activation memory without compromising accuracy, achieving up to a 12.5$\\times$ compression rate in LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OfXqQ5TRwp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18731,
    "title": "Estimating Conditional Mutual Information for Dynamic Feature Selection",
    "authors": [
      "Soham Gadgil",
      "Ian Connick Covert",
      "Su-In Lee"
    ],
    "abstract": "Dynamic feature selection, where we sequentially query features to make accurate predictions with a minimal budget, is a promising paradigm to reduce feature acquisition costs and provide transparency into the prediction process. The problem is challenging, however, as it requires both making predictions with arbitrary feature sets and learning a policy to identify the most valuable selections. Here, we take an information-theoretic perspective and prioritize features based on their mutual information with the response variable. The main challenge is implementing this policy, and we design a new approach that estimates the mutual information in a discriminative rather than a generative fashion. Building on our learning approach, we introduce several further improvements: allowing variable feature budgets across samples, enabling non-uniform costs between features, incorporating prior information, and exploring modern architectures to handle partial input information. We find that our method provides consistent gains over recent state-of-the-art methods across a variety of datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Oju2Qu9jvn",
    "arxiv_id": "2306.03301",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18730,
    "title": "PILOT: An $\\mathcal{O}(1/K)$-Convergent Approach for Policy Evaluation with Nonlinear Function Approximation",
    "authors": [
      "Zhuqing Liu",
      "Xin Zhang",
      "Jia Liu",
      "Zhengyuan Zhu",
      "Songtao Lu"
    ],
    "abstract": "Learning an accurate value function for a given policy is a critical step in solving reinforcement learning (RL) problems. So far, however, the convergence speed and sample complexity performances of most existing policy evaluation algorithms remain unsatisfactory, particularly with non-linear function approximation. This challenge motivates us to develop a new path-integrated primal-dual stochastic gradient (PILOT) method, that is able to achieve a fast convergence speed for RL policy evaluation with nonlinear function approximation. To further alleviate the periodic full gradient evaluation requirement, we further propose an enhanced method with an adaptive-batch adjustment called PILOT$^+$. The main advantages of our methods include: i) PILOT allows the use of {\\em{constant}} step sizes and achieves the $\\mathcal{O}(1/K)$ convergence rate to first-order stationary points of non-convex policy evaluation problems; ii) PILOT is a generic {\\em{single}}-timescale algorithm that is also applicable for solving a large class of non-convex strongly-concave minimax optimization problems; iii) By adaptively adjusting the batch size via historical stochastic gradient information, PILOT$^+$ is more sample-efficient empirically without loss of theoretical convergence rate. Our extensive numerical experiments verify our theoretical findings and showcase the high efficiency of the proposed PILOT and PILOT$^+$ algorithms compared with the state-of-the-art methods.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=OkHHJcMroY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18729,
    "title": "DiLu: A Knowledge-Driven Approach to Autonomous Driving with Large Language Models",
    "authors": [
      "Licheng Wen",
      "Daocheng Fu",
      "Xin Li",
      "Xinyu Cai",
      "Tao MA",
      "Pinlong Cai",
      "Min Dou",
      "Botian Shi",
      "Liang He",
      "Yu Qiao"
    ],
    "abstract": "Recent advancements in autonomous driving have relied on data-driven approaches, which are widely adopted but face challenges including dataset bias, overfitting, and uninterpretability. Drawing inspiration from the knowledge-driven nature of human driving, we explore the question of how to instill similar capabilities into autonomous driving systems and summarize a paradigm that integrates an interactive environment, a driver agent, as well as a memory component to address this question. Leveraging large language models (LLMs) with emergent abilities, we propose the DiLu framework, which combines a Reasoning and a Reflection module to enable the system to perform decision-making based on common-sense knowledge and evolve continuously. Extensive experiments prove DiLu's capability to accumulate experience and demonstrate a significant advantage in generalization ability over reinforcement learning-based methods.Moreover, DiLu is able to directly acquire experiences from real-world datasets which highlights its potential to be deployed on practical autonomous driving systems.To the best of our knowledge, we are the first to leverage knowledge-driven capability in decision-making for autonomous vehicles. Through the proposed DiLu framework, LLM is strengthened to apply knowledge and to reason causally in the autonomous driving domain.Project page: https://pjlab-adg.github.io/DiLu/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OqTMUPuLuC",
    "arxiv_id": "2309.16292",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18726,
    "title": "ImagenHub: Standardizing the evaluation of conditional image generation models",
    "authors": [
      "Max Ku",
      "Tianle Li",
      "Kai Zhang",
      "Yujie Lu",
      "Xingyu Fu",
      "Wenwen Zhuang",
      "Wenhu Chen"
    ],
    "abstract": "Recently, a myriad of conditional image generation and editing models have been developed to serve different downstream tasks, including text-to-image generation, text-guided image editing, subject-driven image generation, control-guided image generation, etc. However, we observe huge inconsistencies in experimental conditions: datasets, inference, and evaluation metrics -- render fair comparisons difficult.    This paper proposes ImagenHub, which is a one-stop library to standardize the inference and evaluation of all the conditional image generation models. Firstly, we define seven prominent tasks and curate high-quality evaluation datasets for them. Secondly, we built a unified inference pipeline to ensure fair comparison. Thirdly, we design two human evaluation scores, i.e. Semantic Consistency and Perceptual Quality, along with comprehensive guidelines to evaluate generated images. We train expert raters to evaluate the model outputs based on the proposed metrics. Our human evaluation achieves a high inter-worker agreement of Krippendorff\u2019s alpha on 76\\% models with a value higher than 0.4. We comprehensively evaluated a total of around 30 models and observed three key takeaways: (1) the existing models\u2019 performance is generally unsatisfying except for Text-guided Image Generation and Subject-driven Image Generation, with 74\\% models achieving an overall score lower than 0.5. (2) we examined the claims from published papers and found 83\\% of them hold with a few exceptions. (3) None of the existing automatic metrics has a Spearman's correlation higher than 0.2 except subject-driven image generation. Moving forward, we will continue our efforts to evaluate newly published models and update our leaderboard to keep track of the progress in conditional image generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OuV9ZrkQlc",
    "arxiv_id": "2310.01596",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18724,
    "title": "Augmented Bayesian Policy Search",
    "authors": [
      "Mahdi Kallel",
      "Debabrota Basu",
      "Riad Akrour",
      "Carlo D'Eramo"
    ],
    "abstract": "Deterministic policies are often preferred over stochastic ones when implemented on physical systems. They can prevent erratic and harmful behaviors while being easier to implement and interpret. However, in practice, exploration is largely performed by stochastic policies.First-order Bayesian Optimization (BO) methods offer a principled way of performing exploration using deterministic policies. This is done through a learned probabilistic model of the objective function and its gradient. Nonetheless, such approaches treat policy search as a black-box problem, and thus, neglect the reinforcement learning nature of the problem. In this work, we leverage the performance difference lemma to introduce a novel mean function for the probabilistic model. This results in augmenting BO methods with the action-value function. Hence, we call our method Augmented Bayesian Search (ABS).Interestingly, this new mean function enhances the posterior gradient with the deterministic policy gradient, effectively bridging the gap between BO and policy gradient methods. The resulting algorithm combines the convenience of the direct policy search with the scalability of reinforcement learning.We validate ABS on high-dimensional locomotion problems and demonstrate competitive performance compared to existing direct policy search schemes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OvlcyABNQT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18723,
    "title": "Unlocking the Power of Representations in Long-term Novelty-based Exploration",
    "authors": [
      "Alaa Saade",
      "Steven Kapturowski",
      "Daniele Calandriello",
      "Charles Blundell",
      "Pablo Sprechmann",
      "Leopoldo Sarra",
      "Oliver Groth",
      "Michal Valko",
      "Bilal Piot"
    ],
    "abstract": "We introduce Robust Exploration via Clustering-based Online Density Estimation (RECODE), a non-parametric method for novelty-based exploration that estimates visitation counts for clusters of states based on their similarity in a chosen embedding space. By adapting classical clustering to the nonstationary setting of Deep RL, RECODE can efficiently track state visitation counts over thousands of episodes. We further propose a novel generalization of the inverse dynamics loss, which leverages masked transformer architectures for multi-step prediction; which in conjunction with \\DETOCS achieves a new state-of-the-art in a suite of challenging 3D-exploration tasks in DM-Hard-8. RECODE also sets new state-of-the-art in hard exploration Atari games, and is the first agent to reach the end screen in \"Pitfall!\"",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=OwtMhMSybu",
    "arxiv_id": "2305.01521",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18720,
    "title": "H2O-SDF: Two-phase Learning for 3D Indoor Reconstruction using Object Surface Fields",
    "authors": [
      "Minyoung Park",
      "Mirae Do",
      "Yeon Jae Shin",
      "Jaeseok Yoo",
      "Jongkwang Hong",
      "Joongrock Kim",
      "Chul Lee"
    ],
    "abstract": "Advanced techniques using Neural Radiance Fields (NeRF), Signed Distance Fields (SDF), and Occupancy Fields have recently emerged as solutions for 3D indoor scene reconstruction. We introduce a novel two-phase learning approach, H2O-SDF,  that discriminates between object and non-object regions within indoor environments. This method achieves a nuanced balance, carefully preserving the geometric integrity of room layouts while also capturing intricate surface details of specific objects. A cornerstone of our two-phase learning framework is the introduction of the Object Surface Field (OSF), a novel concept designed to mitigate the persistent vanishing gradient problem that has previously hindered the capture of high-frequency details in other methods. Our proposed approach is validated through several experiments that include ablation studies.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=P1ANzoGg3W",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18719,
    "title": "Implicit bias of SGD in $L_2$-regularized linear DNNs: One-way jumps from high to low rank",
    "authors": [
      "Zihan Wang",
      "Arthur Jacot"
    ],
    "abstract": "The $L_{2}$-regularized loss of Deep Linear Networks (DLNs) withmore than one hidden layers has multiple local minima, correspondingto matrices with different ranks. In tasks such as matrix completion,the goal is to converge to the local minimum with the smallest rankthat still fits the training data. While rank-underestimating minimacan be avoided since they do not fit the data, GD might getstuck at rank-overestimating minima. We show that with SGD, there is always a probability to jumpfrom a higher rank minimum to a lower rank one, but the probabilityof jumping back is zero. More precisely, we define a sequence of sets$B_{1}\\subset B_{2}\\subset\\cdots\\subset B_{R}$ so that $B_{r}$contains all minima of rank $r$ or less (and not more) that are absorbingfor small enough ridge parameters $\\lambda$ and learning rates $\\eta$:SGD has prob. 0 of leaving $B_{r}$, and from any starting point thereis a non-zero prob. for SGD to go in $B_{r}$.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=P1aobHnjjj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18718,
    "title": "BRUSLEATTACK: A QUERY-EFFICIENT SCORE- BASED BLACK-BOX SPARSE ADVERSARIAL ATTACK",
    "authors": [
      "Quoc Viet Vo",
      "Ehsan Abbasnejad",
      "Damith Ranasinghe"
    ],
    "abstract": "We study the unique, less-well understood problem of generating sparse adversarial samples simply by observing the score-based replies to model queries. Sparse attacks aim to discover a minimum number\u2014the $l_0$ bounded\u2014perturbations to model inputs to craft adversarial examples and misguide model decisions. But, in contrast to query-based dense attack counterparts against black-box models, constructing sparse adversarial perturbations, even when models serve confidence score information to queries in a score-based setting, is non-trivial. Because, such an attack leads to: i) an NP-hard problem; and ii) a non-differentiable search space. We develop the BRUSLEATTACK\u2014a new, faster (more query-efficient) algorithm formulation for the problem. We conduct extensive attack evaluations including an attack demonstration against a Machine Learning as a Service (MLaaS) offering exemplified by __Google Cloud Vision__ and robustness testing of adversarial training regimes and a recent defense against black-box attacks. The proposed attack scales to achieve state-of-the-art attack success rates and query efficiency on standard computer vision tasks such as ImageNet across different model architectures. Our artifacts and DIY attack samples are available on GitHub. Importantly, our work facilitates faster evaluation of model vulnerabilities and raises our vigilance on the safety, security and reliability of deployed systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PAfnMGXief",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18717,
    "title": "Safe and Robust Watermark Injection with a Single OoD Image",
    "authors": [
      "Shuyang Yu",
      "Junyuan Hong",
      "Haobo Zhang",
      "Haotao Wang",
      "Zhangyang Wang",
      "Jiayu Zhou"
    ],
    "abstract": "Training a high-performance deep neural network requires large amounts of data and computational resources. Protecting the intellectual property (IP) and commercial ownership of a deep model is challenging yet increasingly crucial. A major stream of watermarking strategies implants verifiable backdoor triggers by poisoning training samples, but these are often unrealistic due to data privacy and safety concerns and are vulnerable to minor model changes such as fine-tuning. To overcome these challenges, we propose a safe and robust backdoor-based watermark injection technique that leverages the diverse knowledge from a single out-of-distribution (OoD) image, which serves as a secret key for IP verification. The independence of training data makes it agnostic to third-party promises of IP security. We induce robustness via random perturbation of model parameters during watermark injection to defend against common watermark removal attacks, including fine-tuning, pruning, and model extraction. Our experimental results demonstrate that the proposed watermarking approach is not only time- and sample-efficient without training data, but also robust against the watermark removal attacks above.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PCm1oT8pZI",
    "arxiv_id": "2309.01786",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18716,
    "title": "RTFS-Net: Recurrent Time-Frequency Modelling for Efficient Audio-Visual Speech Separation",
    "authors": [
      "Samuel Pegg",
      "Kai Li",
      "Xiaolin Hu"
    ],
    "abstract": "Audio-visual speech separation methods aim to integrate different modalities to generate high-quality separated speech, thereby enhancing the performance of downstream tasks such as speech recognition. Most existing state-of-the-art (SOTA) models operate in the time domain. However, their overly simplistic approach to modeling acoustic features often necessitates larger and more computationally intensive models in order to achieve SOTA performance. In this paper, we present a novel time-frequency domain audio-visual speech separation method: Recurrent Time-Frequency Separation Network (RTFS-Net), which applies its algorithms on the complex time-frequency bins yielded by the Short-Time Fourier Transform. We model and capture the time and frequency dimensions of the audio independently using a multi-layered RNN along each dimension. Furthermore, we introduce a unique attention-based fusion technique for the efficient integration of audio and visual information, and a new mask separation approach that takes advantage of the intrinsic spectral nature of the acoustic features for a clearer separation. RTFS-Net outperforms the previous SOTA method using only 10% of the parameters and 18% of the MACs. This is the first time-frequency domain audio-visual speech separation method to outperform all contemporary time-domain counterparts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PEuDO2EiDr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18715,
    "title": "Compositional VLM: Composing Visual Entities and Relationships in Large Language Models Via Communicative Decoding",
    "authors": [
      "Junyan Li",
      "Delin Chen",
      "Yining Hong",
      "Zhenfang Chen",
      "Peihao Chen",
      "Yikang Shen",
      "Chuang Gan"
    ],
    "abstract": "A remarkable ability of human beings resides in compositional reasoning, i.e., the capacity to make \"infinite use of finite means\". However, current large vision-language foundation models (VLMs)  fall short of such compositional abilities due to their ``bag-of-words\" behaviors and inability to construct words that correctly represent visual entities and the relations among the entities. To this end, we propose Compositional VLM, which can guide the LLM to explicitly compose visual entities and relationships among the text and dynamically communicate with the vision encoder and detection network to achieve vision-language communicative decoding. Specifically, we first devise a set of novel communication tokens for the LLM, for dynamic communication between the visual detection system and the language system. A communication token is generated by the LLM following a visual entity or a relation, to inform the detection network to propose regions that are relevant to the sentence generated so far. The proposed regions-of-interests (ROIs) are then fed back into the LLM for better language generation contingent on the relevant regions. The LLM is thus able to compose the visual entities and relationships through the communication tokens. The vision-to-language and language-to-vision communication are iteratively performed until the entire sentence is generated. Our framework seamlessly bridges the gap between visual perception and LLMs and outperforms previous VLMs by a large margin on compositional reasoning benchmarks (e.g., ~20% in HICO-DET mAP, ~14% in Cola top-1 accuracy, and ~3% on ARO top-1 accuracy). We also achieve state-of-the-art performances on traditional vision-language tasks such as referring expression comprehension and visual question answering.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PHGxChm1l5",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18714,
    "title": "Unconstrained Stochastic CCA: Unifying Multiview and Self-Supervised Learning",
    "authors": [
      "James Chapman",
      "Lennie Wells",
      "Ana Lawry Aguila"
    ],
    "abstract": "The Canonical Correlation Analysis (CCA) family of methods is foundational in multi-view learning.Regularised linear CCA methods can be seen to generalise Partial Least Squares (PLS) and unified with a Generalized Eigenvalue Problem (GEP) framework.However, classical algorithms for these linear methods are computationally infeasible for large-scale data.Extensions to Deep CCA show great promise, but current training procedures are slow and complicated.First we propose a novel unconstrained objective that characterizes the top subspace of GEPs.Our core contribution is a family of fast algorithms for stochastic PLS, stochastic CCA, and Deep CCA, simply obtained by applying stochastic gradient descent (SGD) to the corresponding CCA objectives.These methods show far faster convergence and recover higher correlations than the previous state-of-the-art on all standard CCA and Deep CCA benchmarks.This speed allows us to perform a first-of-its-kind PLS analysis of an extremely large biomedical dataset from the UK Biobank, with over 33,000 individuals and 500,000 variants.Finally, we not only match the performance of `CCA-family' Self-Supervised Learning (SSL) methods on CIFAR-10 and CIFAR-100 with minimal hyper-parameter tuning, but also establish the first solid theoretical links to classical CCA, laying the groundwork for future insights.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PHLVmV88Zy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18712,
    "title": "EasyTPP: Towards Open Benchmarking Temporal Point Processes",
    "authors": [
      "Siqiao Xue",
      "Xiaoming Shi",
      "Zhixuan Chu",
      "Yan Wang",
      "Hongyan Hao",
      "Fan Zhou",
      "Caigao JIANG",
      "Chen Pan",
      "James Y. Zhang",
      "Qingsong Wen",
      "JUN ZHOU",
      "Hongyuan Mei"
    ],
    "abstract": "Continuous-time event sequences play a vital role in real-world domains such as healthcare, finance, online shopping, social networks, and so on. To model such data, temporal point processes (TPPs) have emerged as the most natural and competitive models, making a significant impact in both academic and application communities. Despite the emergence of many powerful models in recent years, there hasn't been a central benchmark for these models and future research endeavors. This lack of standardization impedes researchers and practitioners from comparing methods and reproducing results, potentially slowing down progress in this field. In this paper, we present EasyTPP, the first central repository of research assets (e.g., data, models, evaluation programs, documentations) in the area of event sequence modeling. Our EasyTPP makes several unique contributions to this area: a unified interface of using existing datasets and adding new datasets; a wide range of evaluation programs that are easy to use and extend as well as facilitate reproducible research; implementations of popular neural TPPs, together with a rich library of modules by composing which one could quickly build complex models. All the data and implementation can be found anonymously at Github repository: https://github.com/Anonymous0006/EasyTPP. We will actively maintain this benchmark and welcome contributions from other researchers and practitioners. Our benchmark will help promote reproducible research in this field, thus accelerating research progress as well as making more significant real-world impacts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PJwAkg0z7h",
    "arxiv_id": "2307.08097",
    "GitHub": [
      "https://github.com/ant-research/EasyTemporalPointProcess"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18709,
    "title": "ACRF: Compressing Explicit Neural Radiance Fields via Attribute Compression",
    "authors": [
      "Guangchi Fang",
      "Qingyong Hu",
      "Longguang Wang",
      "Yulan Guo"
    ],
    "abstract": "In this work, we study the problem of explicit NeRF compression. Through analyzing recent explicit NeRF models, we reformulate the task of explicit NeRF compression as 3D data compression. We further introduce our NeRF compression framework, Attributed Compression of Radiance Field (ACRF), which focuses on the compression of the explicit neural 3D representation. The neural 3D structure is pruned and converted to points with features, which are further encoded using importance-guided feature encoding. Furthermore, we employ an importance-prioritized entropy model to estimate the probability distribution of transform coefficients, which are then entropy coded with an arithmetic coder using the predicted distribution. Within this framework, we present two models, ACRF and ACRF-F, to strike a balance between compression performance and encoding time budget. Our experiments, which include both synthetic and real-world datasets such as Synthetic-NeRF and Tanks&Temples, demonstrate the superior performance of our proposed algorithm.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=POFrdKvpea",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18708,
    "title": "Transport meets Variational Inference: Controlled Monte Carlo Diffusions",
    "authors": [
      "Francisco Vargas",
      "Shreyas Padhy",
      "Denis Blessing",
      "Nikolas N\u00fcsken"
    ],
    "abstract": "Connecting optimal transport and variational inference, we present a principled and systematic framework for sampling and generative modelling centred around divergences on path space. Our work culminates in the development of the Controlled Monte Carlo Diffusion sampler (CMCD) for Bayesian computation, a score-based annealing technique that crucially adapts both forward and backward dynamics in a diffusion model. On the way, we clarify the relationship between the EM-algorithm and iterative proportional fitting (IPF) for Schroedinger bridges, deriving as well a regularised objective that bypasses the iterative bottleneck of standard IPF-updates. Finally, we show that CMCD has a strong foundation in the Jarzinsky and Crooks identities from statistical physics, and that it convincingly outperforms competing approaches across a wide array of experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PP1rudnxiW",
    "arxiv_id": "2307.01050",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18707,
    "title": "Confidential-DPproof: Confidential Proof of Differentially Private Training",
    "authors": [
      "Ali Shahin Shamsabadi",
      "Gefei Tan",
      "Tudor Ioan Cebere",
      "Aur\u00e9lien Bellet",
      "Hamed Haddadi",
      "Nicolas Papernot",
      "Xiao Wang",
      "Adrian Weller"
    ],
    "abstract": "Post hoc privacy auditing techniques can be used to test the privacy guarantees of a model, but come with several limitations: (i) they can only establish lower bounds on the privacy loss, (ii) the intermediate model updates and some data must be shared with the auditor to get a better approximation of the privacy loss, and (iii) the auditor typically faces a steep computational cost to run a large number of attacks. In this paper, we propose to proactively generate a cryptographic certificate of privacy during training to forego such auditing limitations. We introduce Confidential-DPproof , a framework for Confidential Proof of Differentially Private Training, which enhances training with a certificate of the $(\\varepsilon,\\delta)$-DP guarantee achieved. To obtain this certificate without revealing information about the training data or model, we design a customized zero-knowledge proof protocol tailored to the requirements introduced by differentially private training, including random noise addition and privacy amplification by subsampling. In experiments on CIFAR-10, Confidential-DPproof trains a model achieving state-of-the-art $91$% test accuracy with a certified privacy guarantee of $(\\varepsilon=0.55,\\delta=10^{-5})$-DP in approximately 100 hours.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=PQY2v6VtGe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18706,
    "title": "Decentralized Riemannian Conjugate Gradient Method on the Stiefel Manifold",
    "authors": [
      "Jun Chen",
      "Haishan Ye",
      "Mengmeng Wang",
      "Tianxin Huang",
      "Guang Dai",
      "Ivor Tsang",
      "Yong Liu"
    ],
    "abstract": "The conjugate gradient method is a crucial first-order optimization method that generally converges faster than the steepest descent method, and its computational cost is much lower than the second-order methods. However, while various types of conjugate gradient methods have been studied in Euclidean spaces and on Riemannian manifolds, there is little study for those in distributed scenarios. This paper proposes a decentralized Riemannian conjugate gradient descent (DRCGD) method that aims at minimizing a global function over the Stiefel manifold. The optimization problem is distributed among a network of agents, where each agent is associated with a local function, and the communication between agents occurs over an undirected connected graph. Since the Stiefel manifold is a non-convex set, a global function is represented as a finite sum of possibly non-convex (but smooth) local functions. The proposed method is free from expensive Riemannian geometric operations such as retractions, exponential maps, and vector transports, thereby reducing the computational complexity required by each agent. To the best of our knowledge, DRCGD is the first decentralized Riemannian conjugate gradient algorithm to achieve global convergence over the Stiefel manifold. The numerical experiments reveal that the advantages of our DRCGD.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PQbFUMKLFp",
    "arxiv_id": "2308.10547",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18704,
    "title": "Understanding the Effects of RLHF on LLM Generalisation and Diversity",
    "authors": [
      "Robert Kirk",
      "Ishita Mediratta",
      "Christoforos Nalmpantis",
      "Jelena Luketina",
      "Eric Hambro",
      "Edward Grefenstette",
      "Roberta Raileanu"
    ],
    "abstract": "Large language models (LLMs) fine-tuned with reinforcement learning from humanfeedback (RLHF) have been used in some of the most widely deployed AI modelsto date, such as OpenAI\u2019s ChatGPT or Anthropic\u2019s Claude. While there has beensignificant work developing these methods, our understanding of the benefits anddownsides of each stage in RLHF is still limited. To fill this gap, we present anextensive analysis of how each stage of the process (i.e. supervised fine-tuning(SFT), reward modelling, and RLHF) affects two key properties: out-of-distributiongeneralisation (OOD) and output diversity. OOD generalisation is crucial given thewide range of real-world scenarios in which these models are being used, whileoutput diversity refers to the model\u2019s ability to generate varied outputs, and isimportant for a variety of use cases. We perform our analysis across two basemodels on both summarisation and instruction following tasks, the latter beinghighly relevant for current LLM use cases. We find that RLHF generalises betterthan SFT to new inputs, particularly as the distribution shift between train and testbecomes larger. However, RLHF significantly reduces output diversity compared toSFT across a variety of measures, implying a tradeoff in current LLM fine-tuningmethods between generalisation and diversity. Our results provide guidance onwhich fine-tuning method should be used depending on the application, and showthat more research is needed to improve the tradeoff between generalisation anddiversity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PXD3FAVHJT",
    "arxiv_id": "2310.06452",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18703,
    "title": "SOHES: Self-supervised Open-world Hierarchical Entity Segmentation",
    "authors": [
      "Shengcao Cao",
      "Jiuxiang Gu",
      "Jason Kuen",
      "Hao Tan",
      "Ruiyi Zhang",
      "Handong Zhao",
      "Ani Nenkova",
      "Liangyan Gui",
      "Tong Sun",
      "Yu-Xiong Wang"
    ],
    "abstract": "Open-world entity segmentation, as an emerging computer vision task, aims at segmenting entities in images without being restricted by pre-defined classes, offering impressive generalization capabilities on unseen images and concepts. Despite its promise, existing entity segmentation methods like Segment Anything Model (SAM) rely heavily on costly expert annotators. This work presents Self-supervised Open-world Hierarchical Entity Segmentation (SOHES), a novel approach that sidesteps the need for human annotations. SOHES operates in three phases: self-exploration, self-instruction, and self-correction. Given a pre-trained self-supervised representation, we produce abundant high-quality pseudo-labels through visual feature clustering. Then, we train a segmentation model on the pseudo-labels, and rectify the noises in pseudo-labels via a teacher-student mutual-learning procedure. Beyond segmenting entities, SOHES also captures their constituent parts, providing a hierarchical understanding of visual entities. Using raw images as the sole training data, our method achieves unprecedented performance in self-supervised open-world segmentation, marking a significant milestone towards high-quality open-world entity segmentation in the absence of human-annotated masks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PXNrncg2DF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18702,
    "title": "MixSATGEN: Learning Graph Mixing for SAT Instance Generation",
    "authors": [
      "Xinyan Chen",
      "Yang Li",
      "Runzhong Wang",
      "Junchi Yan"
    ],
    "abstract": "The Boolean satisfiability problem (SAT) stands as a canonical NP-complete combinatorial optimization (CO) problem, with wide impact on both theoretical and industrial scenarios. In particular, the scarcity of real-world SAT instances and their usefulness for tuning SAT solvers underscore the necessity for effective and efficient ways of hard instance generation, whereas existing methods either struggle to maintain plausible hardness or suffer from limited applicability. Different from the typical construction-based methods, this paper introduces an adaptive and efficient graph interpolation approach that in place modifies the raw structure of graph-represented SAT instance by replacing it with a counterpart from another instance. Specifically, our method involves a two-stage matching and mixing pipeline. The matching aims to find a correspondence map of literal nodes from two instance graphs via learned features from a matching network; while the mixing stage involves iteratively exchanging clause pairs with the highest correspondence scores until a specified replacement ratio is achieved. We further show that under our matching-mixing framework, moderate randomness can avoid hardness degradation of SAT instances by introducing Gumbel noise. Experimental results show the superiority of the proposed method with both resemblance in structure and hardness, as well as general applicability in an efficient way. Source code will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PXXuLvIH5r",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18700,
    "title": "Pre-training with Synthetic Data Helps Offline Reinforcement Learning",
    "authors": [
      "Zecheng Wang",
      "Che Wang",
      "Zixuan Dong",
      "Keith W. Ross"
    ],
    "abstract": "Recently, it has been shown that for offline deep reinforcement learning (DRL), pre-training Decision Transformer with a large language corpus can improve downstream performance (Reid et al., 2022). A natural question to ask is whether this performance gain can only be achieved with language pre-training, or can be achieved with simpler pre-training schemes which do not involve language. In this paper, we first show that language is not essential for improved performance, and indeed pre-training with synthetic IID data for a small number of updates can match the performance gains from pre-training with a large language corpus; moreover, pre-training with data generated by a one-step Markov chain can further improve the performance. Inspired by these experimental results, we then consider pre-training Conservative Q-Learning (CQL), a popular offline DRL algorithm, which is Q-learning-based and typically employs a Multi-Layer Perceptron (MLP) backbone. Surprisingly, pre-training with simple synthetic data for a small number of updates can also improve CQL, providing consistent performance improvement on D4RL Gym locomotion datasets. The results of this paper not only illustrate the importance of pre-training for offline DRL but also show that the pre-training data can be synthetic and generated with remarkably simple mechanisms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PcxQgtHGj2",
    "arxiv_id": "2310.00771",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18699,
    "title": "CrossQ: Batch Normalization in Deep Reinforcement Learning for Greater Sample Efficiency and Simplicity",
    "authors": [
      "Aditya Bhatt",
      "Daniel Palenicek",
      "Boris Belousov",
      "Max Argus",
      "Artemij Amiranashvili",
      "Thomas Brox",
      "Jan Peters"
    ],
    "abstract": "Sample efficiency is a crucial problem in deep reinforcement learning. Recent algorithms, such as REDQ and DroQ, found a way to improve the sample efficiency by increasing the update-to-data (UTD) ratio to 20 gradient update steps on the critic per environment sample. However, this comes at the expense of a greatly increased computational cost. To reduce this computational burden, we introduce CrossQ: a lightweight algorithm that makes careful use of Batch Normalization and removes target networks to surpass the state-of-the-art in sample efficiency while maintaining a low UTD ratio of 1. Notably, CrossQ does not rely on advanced bias-reduction schemes used in current methods. CrossQ\u2019s contributions are thus threefold: (1) state-of-the-art sample efficiency, (2) substantial reduction in computational cost compared to REDQ and DroQ, and (3) ease of implementation, requiring just a few lines of code on top of SAC.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=PczQtTsTIX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18696,
    "title": "From Molecules to Materials: Pre-training Large Generalizable Models for Atomic Property Prediction",
    "authors": [
      "Nima Shoghi",
      "Adeesh Kolluru",
      "John R. Kitchin",
      "Zachary Ward Ulissi",
      "C. Lawrence Zitnick",
      "Brandon M Wood"
    ],
    "abstract": "The role of machine learning in computing atomic properties is expanding rapidly for a wide range of applications from healthcare to climate change. One important ingredient that has enabled this development is the creation of large and diverse molecular datasets. Given the extreme computational cost of these datasets, an important question moving forward is: Can we limit the need for exhaustive large dataset creation by pre-training a foundation style model over multiple chemical domains to generate transferable atomic representations for downstream fine-tuning tasks? Generalization across the entire molecular space is challenging due to the range and complexity of atomic interactions that exist. In this paper, we present Joint Multi-domain Pre-training (JMP), a robust supervised pre-training strategy that utilizes data from multiple chemical domains, $\\sim$120 million examples in total. We demonstrate state-of-the-art results across many targets of the rMD17, QM9, MatBench, QMOF, SPICE, and MD22 datasets. Finally, we conduct ablations to study the impact of different components of JMP on downstream performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PfPnugdxup",
    "arxiv_id": "2310.16802",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18694,
    "title": "Deep Geodesic Canonical Correlation Analysis for Covariance-Based Neuroimaging Data",
    "authors": [
      "Ce Ju",
      "Reinmar J Kobler",
      "Liyao Tang",
      "Cuntai Guan",
      "Motoaki Kawanabe"
    ],
    "abstract": "In human neuroimaging, multi-modal imaging techniques are frequently combined to enhance our comprehension of whole-brain dynamics and improve diagnosis in clinical practice. Modalities like electroencephalography and functional magnetic resonance imaging provide distinct views of brain dynamics due to diametral spatiotemporal sensitivities and underlying neurophysiological coupling mechanisms. These distinct views pose a considerable challenge to learning a shared representation space, especially when dealing with covariance-based data characterized by their geometric structure. To capitalize on the geometric structure, we introduce a measure called geodesic correlation, which expands traditional correlation consistency to covariance-based data on the symmetric positive definite (SPD) manifold. This measure is derived from classical canonical correlation analysis and serves to evaluate the consistency of latent representations obtained from paired views. For multi-view/-modal, self-supervised learning where one or both latent views are SPD, we propose an innovative geometric deep learning framework termed DeepGeoCCA. Its primary objective is to enhance the geodesic correlation of unlabeled, paired data, thereby generating novel representations while retaining the geometric structures. In simulations and experiments with multi-view and multi-modal human neuroimaging data, we find that DeepGeoCCA learns latent representations with high geodesic consistency for unseen data while retaining relevant information for downstream tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=PnR1MNen7u",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18693,
    "title": "A Linear Algebraic Framework for Counterfactual Generation",
    "authors": [
      "Jong-Hoon Ahn",
      "Akshay Vashist"
    ],
    "abstract": "Estimating time-varying causal effects from real-world data attracts growing attention due to the high cost of performing interventional experiments and the wide availability of observational data. However, counterfactual data are not accessible, and true calculation of causal effects cannot be performed at the individual level. This paper proposes a linear algebraic framework to generate synthetic counterfactual data that exactly matches pretreatment factual data. Receiving treatment at a time $T_0$ cannot cause any difference reversely to counterfactual generation at $t < T_0$. If we hold this strictness on counterfactual generation, our approach claims the first-ever counterfactual generative model to create personalized clinical trial digital twins. Moreover, using simulated ground truth counterfactual data, we show that our method greatly outperforms the most cited methods of counterfactual generation and individual treatment effect estimation. We also provide a formula that can estimate the time-varying variance of individual treatment effects, interpreted as a confidence of generated counterfactuals to true values.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PoDkdFQIu3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18692,
    "title": "Learning to Solve Bilevel Programs with Binary Tender",
    "authors": [
      "Bo Zhou",
      "Ruiwei Jiang",
      "Siqian Shen"
    ],
    "abstract": "Bilevel programs (BPs) find a wide range of applications in fields such as energy, transportation, and machine learning. As compared to BPs with continuous (linear/convex) optimization problems in both levels, the BPs with discrete decision variables have received much less attention, largely due to the ensuing computational intractability and the incapability of gradient-based algorithms for handling discrete optimization formulations. In this paper, we develop deep learning techniques to address this challenge. Specifically, we consider a BP with binary tender, wherein the upper and lower levels are linked via binary variables. We train a neural network to approximate the optimal value of the lower-level problem, as a function of the binary tender. Then, we obtain a single-level reformulation of the BP through a mixed-integer representation of the value function. Furthermore, we conduct a comparative analysis between two types of neural networks: general neural networks and the novel input supermodular neural networks, studying their representational capacities. To solve high-dimensional BPs, we introduce an enhanced sampling method to generate higher-quality samples and implement an iterative process to refine solutions. We demonstrate the performance of these approaches through extensive numerical experiments, whose lower-level problems are linear and mixed-integer programs, respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PsDFgTosqb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18690,
    "title": "Geographic Location Encoding with Spherical Harmonics and Sinusoidal Representation Networks",
    "authors": [
      "Marc Ru\u00dfwurm",
      "Konstantin Klemmer",
      "Esther Rolf",
      "Robin Zbinden",
      "Devis Tuia"
    ],
    "abstract": "Learning feature representations of geographical space is vital for any machine learning model that integrates geolocated data, spanning application domains such as remote sensing, ecology, or epidemiology.Recent work mostly embeds coordinates using sine and cosine projections based on Double Fourier Sphere (DFS) features -- these embeddings assume a rectangular data domain even on global data, which can lead to artifacts, especially at the poles. At the same time, relatively little attention has been paid to the exact design of the neural network architectures these functional embeddings are combined with. This work proposes a novel location encoder for globally distributed geographic data that combines spherical harmonic basis functions, natively defined on spherical surfaces, with sinusoidal representation networks (SirenNets) that can be interpreted as learned Double Fourier Sphere embedding. We systematically evaluate the cross-product of positional embeddings and neural network architectures across various classification and regression benchmarks and synthetic evaluation datasets. In contrast to previous approaches that require the combination of both positional encoding and neural networks to learn meaningful representations, we show that both spherical harmonics and sinusoidal representation networks are competitive on their own but set state-of-the-art performances across tasks when combined.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=PudduufFLa",
    "arxiv_id": "2310.06743",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18689,
    "title": "Quadratic models for understanding catapult dynamics of neural networks",
    "authors": [
      "Libin Zhu",
      "Chaoyue Liu",
      "Adityanarayanan Radhakrishnan",
      "Mikhail Belkin"
    ],
    "abstract": "While neural networks can be approximated by linear models as their width increases, certain properties of wide neural networks cannot be captured by linear models. In this work we show that recently proposed Neural Quadratic Models can exhibit the \"catapult phase\" Lewkowycz et al. (2020) that arises when training such models with large learning rates. We then empirically show that the behaviour of quadratic models parallels that of neural networks in generalization, especially in the catapult phase regime. Our analysis further demonstrates that quadratic models are an effective tool for analysis of neural networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PvJnX3dwsD",
    "arxiv_id": "2205.11787",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18688,
    "title": "Masked Completion via Structured Diffusion with White-Box Transformers",
    "authors": [
      "Druv Pai",
      "Sam Buchanan",
      "Ziyang Wu",
      "Yaodong Yu",
      "Yi Ma"
    ],
    "abstract": "Modern learning frameworks often train deep neural networks with massive amounts of unlabeled data to learn representations by solving simple pretext tasks, then use the representations as foundations for downstream tasks. These networks are empirically designed; as such, they are usually not interpretable, their representations are not structured, and their designs are potentially redundant. White-box deep networks, in which each layer explicitly identifies and transforms structures in the data, present a promising alternative. However, existing white-box architectures have only been shown to work at scale in supervised settings with labeled data, such as classification. In this work, we provide the first instantiation of the white-box design paradigm that can be applied to large-scale unsupervised representation learning. We do this by exploiting a fundamental connection between diffusion, compression, and (masked) completion, deriving a deep transformer-like masked autoencoder architecture, called CRATE-MAE, in which the role of each layer is  mathematically fully interpretable:  they transform the data distribution to and from a structured representation. Extensive empirical evaluations confirm our analytical insights. CRATE-MAE demonstrates highly promising performance on large-scale imagery datasets while using only ~30% of the parameters compared to the standard masked autoencoder with the same model configuration. The representations learned by CRATE-MAE have explicit structure and also contain semantic meaning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PvyOYleymy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18687,
    "title": "A Simple and Effective Pruning Approach for Large Language Models",
    "authors": [
      "Mingjie Sun",
      "Zhuang Liu",
      "Anna Bair",
      "J Zico Kolter"
    ],
    "abstract": "As their size increases, Large Languages Models (LLMs) are natural candidates for network pruning methods: approaches that drop a subset of network weights while striving to preserve performance. Existing methods, however, require either retraining, which is rarely affordable for billion-scale LLMs, or solving a weight reconstruction problem reliant on second-order information, which may also becomputationally expensive. In this paper, we introduce a novel, straightforward yet effective pruning method, termed Wanda (Pruning by Weights and activations), designed to induce sparsity in pretrained LLMs. Motivated by the recent observation of emergent large magnitude features in LLMs, our approach prunes weights with the smallest magnitudes multiplied by the corresponding input activations, ona per-output basis. Notably, Wanda requires no retraining or weight update, and the pruned LLM can be used as is. We conduct a thorough evaluation of our method on LLaMA and LLaMA-2 across various language benchmarks. Wanda significantly outperforms the established baseline of magnitude pruning and performs competitively against recent methods involving intensive weight updates.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PxoFut3dWW",
    "arxiv_id": "2306.11695",
    "GitHub": [
      "https://github.com/locuslab/wanda"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18686,
    "title": "SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression",
    "authors": [
      "Tim Dettmers",
      "Ruslan A. Svirschevski",
      "Vage Egiazarian",
      "Denis Kuznedelev",
      "Elias Frantar",
      "Saleh Ashkboos",
      "Alexander Borzunov",
      "Torsten Hoefler",
      "Dan Alistarh"
    ],
    "abstract": "Recent advances in large language model (LLM) pretraining have led to high-quality LLMs with impressive abilities. By compressing such LLMs via quantization to 3-4 bits per parameter, they can fit into memory-limited devices such as laptops and mobile phones, enabling personalized use. Quantizing models to 3-4 bits per parameter can lead to moderate to high accuracy losses, especially for smaller models (1-10B parameters), which are suitable for edge deployment. To address this accuracy issue, we introduce the Sparse-Quantized Representation (SpQR), a new compressed format and quantization technique that enables for the first time \\emph{near-lossless} compression of LLMs across model scales while reaching similar compression levels to previous methods. SpQR works by identifying and isolating \\emph{outlier weights}, which cause particularly large quantization errors, and storing them in higher precision while compressing all other weights to 3-4 bits, and achieves relative accuracy losses of less than $1\\%$ in perplexity for highly-accurate LLaMA and Falcon LLMs. This makes it possible to run a 33B parameter LLM on a single 24 GB consumer GPU without performance degradation at 15\\% speedup, thus making powerful LLMs available to consumers without any downsides. SpQR comes with efficient algorithms for both encoding weights into its format, as well as decoding them efficiently at runtime. Specifically, we provide an efficient GPU inference algorithm for SpQR, which yields faster inference than 16-bit baselines at similar accuracy while enabling memory compression gains of more than 4x.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Q1u25ahSuy",
    "arxiv_id": "2306.03078",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18685,
    "title": "MixSup: Mixed-grained Supervision for Label-efficient LiDAR-based 3D Object Detection",
    "authors": [
      "Yuxue Yang",
      "Lue Fan",
      "Zhaoxiang Zhang"
    ],
    "abstract": "Label-efficient LiDAR-based 3D object detection is currently dominated by weak/semi-supervised methods. Instead of exclusively following one of them, we propose MixSup, a more practical paradigm simultaneously utilizing massive cheap coarse labels and a limited number of accurate labels for Mixed-grained Supervision. We start by observing that point clouds are usually textureless, making it hard to learn semantics. However, point clouds are geometrically rich and scale-invariant to the distances from sensors, making it relatively easy to learn the geometry of objects, such as poses and shapes. Thus, MixSup leverages massive coarse cluster-level labels to learn semantics and a few expensive box-level labels to learn accurate poses and shapes. We redesign the label assignment in mainstream detectors, which allows them seamlessly integrated into MixSup, enabling practicality and universality. We validate its effectiveness in nuScenes, Waymo Open Dataset, and KITTI, employing various detectors. MixSup achieves up to 97.31% of fully supervised performance, using cheap cluster annotations and only 10% box annotations. Furthermore, we utilize the emerging Segment Anything Model (SAM) to automatically generate massive coarse labels, further reducing the annotation burden. The code will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Q1vkAhdI6j",
    "arxiv_id": "2401.16305",
    "GitHub": [
      "https://github.com/BraveGroup/PointSAM-for-MixSup"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18684,
    "title": "Lemur: Integrating Large Language Models in Automated Program Verification",
    "authors": [
      "Haoze Wu",
      "Clark Barrett",
      "Nina Narodytska"
    ],
    "abstract": "The demonstrated code-understanding capability of LLMs raises the question of whether they can be used for automated program verification, a task that typically demands high-level abstract reasoning about program properties that is challenging for verification tools. We propose a general methodology to combine the power of LLMs and automated reasoners for automated program verification. We formally describe this methodology as a set of derivation rules and prove its soundness. We instantiate the calculus as a sound automated verification procedure, which led to practical improvements on a set of synthetic and competition benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Q3YaCghZNt",
    "arxiv_id": "2310.04870",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18683,
    "title": "Masked Autoencoders with Multi-Window Local-Global Attention Are Better Audio Learners",
    "authors": [
      "Sarthak Yadav",
      "Sergios Theodoridis",
      "Lars Kai Hansen",
      "Zheng-Hua Tan"
    ],
    "abstract": "In this work, we propose a Multi-Window Masked Autoencoder (MW-MAE) fitted with a novel Multi-Window Multi-Head Attention (MW-MHA) module that facilitates the modelling of local-global interactions in every decoder transformer block through attention heads of several distinct local and global windows. Empirical results on ten downstream audio tasks show that MW-MAEs consistently outperform standard MAEs in overall performance and learn better general-purpose audio representations, along with demonstrating considerably better scaling characteristics. Investigating attention distances and entropies reveals that MW-MAE encoders learn heads with broader local and global attention. Analyzing attention head feature representations through Projection Weighted Canonical Correlation Analysis (PWCCA) shows that attention heads with the same window sizes across the decoder layers of the MW-MAE learn correlated feature representations which enables each block to independently capture local and global information, leading to a decoupled decoder feature hierarchy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Q53QLftNkA",
    "arxiv_id": "2306.00561",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18682,
    "title": "Adaptive Sharpness-Aware Pruning for Robust Sparse Networks",
    "authors": [
      "Anna Bair",
      "Hongxu Yin",
      "Maying Shen",
      "Pavlo Molchanov",
      "Jose M. Alvarez"
    ],
    "abstract": "Robustness and compactness are two essential attributes of deep learning models that are deployed in the real world. The goals of robustness and compactness may seem to be at odds, since robustness requires generalization across domains, while the process of compression exploits specificity in one domain. We introduce \\textit{Adaptive Sharpness-Aware Pruning (AdaSAP)}, which unifies these goals through the lens of network sharpness. The AdaSAP method produces sparse networks that are robust to input variations which are \\textit{unseen at training time}. We achieve this by strategically incorporating weight perturbations in order to optimize the loss landscape. This allows the model to be both primed for pruning and regularized for improved robustness. AdaSAP improves the robust accuracy of pruned models on image classification by up to +6\\% on ImageNet C and +4\\% on ImageNet V2, and on object detection by +4\\% on a corrupted Pascal VOC dataset, over a wide range of compression ratios, pruning criteria, and network architectures, outperforming recent pruning art by large margins.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QFYVVwiAM8",
    "arxiv_id": "2306.14306",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18681,
    "title": "Less is More: One-shot Subgraph Reasoning on Large-scale Knowledge Graphs",
    "authors": [
      "Zhanke Zhou",
      "Yongqi Zhang",
      "Jiangchao Yao",
      "quanming yao",
      "Bo Han"
    ],
    "abstract": "To deduce new facts on knowledge graph (KG), a reasoning system learns from the graph structure and collects local evidence to find the answer. However, existing methods suffer from a severe scalability problem due to the utilization of the whole KG for reasoning, which hinders their promise on large-scale KG and cannot be directly addressed by vanilla sampling methods. In this work, we propose the one-shot subgraph reasoning to achieve efficient as well as adaptive KG reasoning. The design principle is that, instead of directly acting on the whole KG, the reasoning procedure is decoupled into two steps, i.e., (i) extracting only one query-dependent subgraph and (ii) reasoning on this single subgraph. We reveal that the non-parametric and computation-efficient heuristics Personalized PageRank (PPR) can effectively identify the potential answers and supports to the reasoning. With the promoted efficiency, we further introduce the subgraph-based searching of optimal configurations in both data and model spaces. Empirically, our method achieves promoted efficiency and also leading performances on five large-scale benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QHROe7Mfcb",
    "arxiv_id": "2403.10231",
    "GitHub": [
      "https://github.com/tmlr-group/one-shot-subgraph"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18678,
    "title": "MovingParts: Motion-based 3D Part Discovery in Dynamic Radiance Field",
    "authors": [
      "Kaizhi Yang",
      "Xiaoshuai Zhang",
      "Zhiao Huang",
      "Xuejin Chen",
      "Zexiang Xu",
      "Hao Su"
    ],
    "abstract": "We present MovingParts, a NeRF-based method for dynamic scene reconstruction and part discovery. We consider motion as an important cue for identifying parts, that all particles on the same part share the common motion pattern. From the perspective of fluid simulation, existing deformation-based methods for dynamic NeRF can be seen as parameterizing the scene motion under the Eulerian view, i.e., focusing on specific locations in space through which the fluid flows as time passes. However, it is intractable to extract the motion of constituting objects or parts using the Eulerian view representation. In this work, we introduce the dual Lagrangian view and enforce representations under the Eulerian/Lagrangian views to be cycle-consistent. Under the Lagrangian view, we parameterize the scene motion by tracking the trajectory of particles on objects. The Lagrangian view makes it convenient to discover parts by factorizing the scene motion as a composition of part-level rigid motions. Experimentally, our method can achieve fast and high-quality dynamic scene reconstruction from even a single moving camera, and the induced part-based representation allows direct applications of part tracking, animation, 3D scene editing, etc.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=QQ6RgKYiQq",
    "arxiv_id": "2303.05703",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18677,
    "title": "MOFI: Learning Image Representations from Noisy Entity Annotated Images",
    "authors": [
      "Wentao Wu",
      "Aleksei Timofeev",
      "Chen Chen",
      "Bowen Zhang",
      "Kun Duan",
      "Shuangning Liu",
      "Yantao Zheng",
      "Jonathon Shlens",
      "Xianzhi Du",
      "Yinfei Yang"
    ],
    "abstract": "We present MOFI, a new vision foundation model designed to learn image representations from noisy entity annotated images. MOFI differs from previous work in two key aspects: (i) pre-training data, and (ii) training recipe. Regarding data, we introduce a new approach to automatically assign entity labels to images from noisy image-text pairs. Our approach involves employing a named entity recognition model to extract entities from the alt-text, and then using a CLIP model to select the correct entities as labels of the paired image. The approach is simple, does not require costly human annotation, and can be readily scaled up to billions of image-text pairs mined from the web. Through this method, we have created Image-to-Entities (I2E), a new large-scale dataset with 1 billion images and 2 million distinct entities, covering rich visual concepts in the wild. Building upon the I2E dataset, we study different training recipes, including supervised pre-training, contrastive pre-training, and multi-task learning. For constrastive pre-training, we treat entity names as free-form text, and further enrich them with entity descriptions. Experiments show that supervised pre-training with large-scale fine-grained entity labels is highly effective for image retrieval tasks, and multi-task training further improves the performance. The final MOFI model achieves 86.66% mAP on the challenging GPR1200 dataset, surpassing the previous state-of-the-art performance of 72.19% from OpenAI's CLIP model. Further experiments on zero-shot and linear probe image classification also show that MOFI outperforms a CLIP model trained on the original image-text data, demonstrating the effectiveness of the I2E dataset in learning strong image representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QQYpgReSRk",
    "arxiv_id": "2306.07952",
    "GitHub": [
      "https://github.com/apple/ml-mofi"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18676,
    "title": "OpenTab: Advancing Large Language Models as Open-domain Table Reasoners",
    "authors": [
      "Kezhi Kong",
      "Jiani Zhang",
      "Zhengyuan Shen",
      "Balasubramaniam Srinivasan",
      "Chuan Lei",
      "Christos Faloutsos",
      "Huzefa Rangwala",
      "George Karypis"
    ],
    "abstract": "Large Language Models (LLMs) trained on large volumes of data excel at various natural language tasks, but they cannot handle tasks requiring knowledge that has not been trained on previously. One solution is to use a retriever that fetches relevant information to expand LLM's knowledge scope. However, existing textual-oriented retrieval-based LLMs are not ideal on structured table data due to diversified data modalities and large table sizes. In this work, we propose OpenTab, an open-domain table reasoning framework powered by LLMs. Overall, OpenTab leverages table retriever to fetch relevant tables and then generates SQL programs to parse the retrieved tables efficiently. Utilizing the intermediate data derived from the SQL executions, it conducts grounded inference to produce accurate response. Extensive experimental evaluation shows that OpenTab significantly outperforms baselines in both open- and closed-domain settings, achieving up to 21.5% higher accuracy. We further run ablation studies to validate the efficacy of our proposed designs of the system.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Qa0ULgosc9",
    "arxiv_id": "2402.14361",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18675,
    "title": "Scaling Supervised Local Learning with Augmented Auxiliary Networks",
    "authors": [
      "Chenxiang Ma",
      "Jibin Wu",
      "Chenyang Si",
      "KC Tan"
    ],
    "abstract": "Deep neural networks are typically trained using global error signals that backpropagate (BP) end-to-end, which is not only biologically implausible but also suffers from the update locking problem and requires huge memory consumption. Local learning, which updates each layer independently with a gradient-isolated auxiliary network, offers a promising alternative to address the above problems. However, existing local learning methods are confronted with a large accuracy gap with the BP counterpart, particularly for large-scale networks. This is due to the weak coupling between local layers and their subsequent network layers, as there is no gradient communication across layers. To tackle this issue, we put forward an augmented local learning method, dubbed AugLocal. AugLocal constructs each hidden layer\u2019s auxiliary network by uniformly selecting a small subset of layers from its subsequent network layers to enhance their synergy. We also propose to linearly reduce the depth of auxiliary networks as the hidden layer goes deeper, ensuring sufficient network capacity while reducing the computational cost of auxiliary networks. Our extensive experiments on four image classification datasets (i.e., CIFAR-10, SVHN, STL-10, and ImageNet) demonstrate that AugLocal can effectively scale up to tens of local layers with a comparable accuracy to BP-trained networks while reducing GPU memory usage by around 40%. The proposed AugLocal method, therefore, opens up a myriad of opportunities for training high-performance deep neural networks on resource-constrained platforms. Our code will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Qbf1hy8b7m",
    "arxiv_id": "2402.17318",
    "GitHub": [
      "https://github.com/ChenxiangMA/AugLocal"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18674,
    "title": "Scalable and Effective Implicit Graph Neural Networks on Large Graphs",
    "authors": [
      "Juncheng Liu",
      "Bryan Hooi",
      "Kenji Kawaguchi",
      "Yiwei Wang",
      "Chaosheng Dong",
      "Xiaokui Xiao"
    ],
    "abstract": "Graph Neural Networks (GNNs) have become the de facto standard for modeling graph-structured data in various applications. Among them, implicit GNNs have shown a superior ability to effectively capture long-range dependencies in underlying graphs. However, implicit GNNs tend to be computationally expensive and have high memory usage, due to 1) their use of full-batch training; and 2) they require a large number of iterations to solve a fixed-point equation. These compromise the scalability and efficiency of implicit GNNs especially on large graphs. In this paper, we aim to answer the question: how can we efficiently train implicit GNNs to provide effective predictions on large graphs? We propose a new scalable and effective implicit GNN (SEIGNN) with a mini-batch training method and a stochastic solver, which can be trained efficiently on large graphs. Specifically, SEIGNN can more effectively incorporate global and long-range information by introducing coarse-level nodes in the mini-batch training method. It also achieves reduced training time by obtaining unbiased approximate solutions with fewer iterations in the proposed solver. Comprehensive experiments on various large graphs demonstrate that SEIGNN outperforms baselines and achieves higher accuracy with less training time compared with existing implicit GNNs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QcMdPYBwTu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18673,
    "title": "Learning Hierarchical Polynomials with Three-Layer Neural Networks",
    "authors": [
      "Zihao Wang",
      "Eshaan Nichani",
      "Jason D. Lee"
    ],
    "abstract": "We study the problem of learning hierarchical polynomials over the standard Gaussian distribution with three-layer neural networks. We specifically consider target functions of the form $h = g \\circ p$ where $p : \\mathbb{R}^d \\rightarrow \\mathbb{R}$ is a degree $k$ polynomial and $g: \\mathbb{R} \\rightarrow \\mathbb{R}$ is a degree $q$ polynomial. This function class generalizes the single-index model, which corresponds to $k=1$, and is a natural class of functions possessing an underlying hierarchical structure. Our main result shows that for a large subclass of degree $k$ polynomials $p$, a three-layer neural network trained via layerwise gradient descent on the square loss learns the target $h$ up to vanishing test error in $\\widetilde O(d^k)$ samples and polynomial time. This is a strict improvement over kernel methods, which require $\\widetilde \\Theta(d^{kq})$ samples, as well as existing guarantees for two-layer networks, which require the target function to be low-rank. Our result also generalizes prior works on three-layer neural networks, which were restricted to the case of $p$ being a quadratic. When $p$ is indeed a quadratic, we achieve the information-theoretically optimal sample complexity $\\widetilde O(d^2)$, which is an improvement over prior work (Nichani et al., 2023) requiring a sample size of $\\widetilde\\Theta(d^4)$. Our proof proceeds by showing that during the first stage of training the network performs feature learning to recover the feature $p$ with $\\widetilde O(d^k)$ samples. This work demonstrates the ability of three-layer neural networks to learn complex features and as a result learn a broad class of hierarchical functions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QgwAYFrh9t",
    "arxiv_id": "2311.13774",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18672,
    "title": "Efficient Heterogeneous Meta-Learning via Channel Shuffling Modulation",
    "authors": [
      "Minh Hoang",
      "Carl Kingsford"
    ],
    "abstract": "We tackle the problem of meta-learning across heterogenous tasks. This problem seeks to extract and generalize transferable meta-knowledge through streaming task sets from a multi-modal task distribution. The extracted meta-knowledge can be used to create predictors for new tasks using a small number of labeled samples. Most meta-learning methods assume a homogeneous task distribution, thus limiting their generalization capacity when handling multi-modal task distributions. Recent work has shown that the generalization of meta-learning depends on the similarity of tasks in the training distribution, and this has led to many clustering approaches that aim to detect homogeneous clusters of tasks. However, these methods suffer from a significant increase in parameter complexity. To overcome this weakness, we propose a new heterogeneous meta-learning strategy that efficiently captures the multi-modality of the task distribution via modulating the routing between convolution channels in the network, instead of directly modulating the network weights. This new mechanism can be cast as a permutation learning problem. We further introduce a novel neural permutation layer based on the classical Benes routing network, which has sub-quadratic parameter complexity in the total number of channels, as compared to the quadratic complexity of the state-of-the-art Gumbel-Sinkhorn layer. We demonstrate our approach on various multi-modal meta-learning benchmarks, showing that our framework outperforms previous methods in both generalization accuracy and convergence speed.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QiJuMJl0QS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18670,
    "title": "Towards Category Unification of 3D Single Object Tracking on Point Clouds",
    "authors": [
      "Jiahao Nie",
      "Zhiwei He",
      "Xudong Lv",
      "Xueyi Zhou",
      "Dong-Kyu Chae",
      "Fei Xie"
    ],
    "abstract": "Category-specific models are provenly valuable methods in 3D single object tracking (SOT) regardless of Siamese or motion-centric paradigms. However, such over-specialize model designs incur redundant parameters, thus limiting the broader applicability of 3D SOT task. This paper first introduces unified models that can simultaneously track objects across all categories using a single network with shared model parameters. Specifically, we propose to explicitly encode distinct attributes associated to different object categories, enabling the model to adapt to cross-category data. We discover that the attribute variances of point cloud objects primarily occur from the size and shape (e.g., large and square vehicles vs. small and slender humans). Based on this observation, we design a novel point set representation learning network inheriting transformer architecture, termed AdaFormer, which adaptively encodes the dynamically varying shape and size information from cross-category data in a unified manner. We further incorporate the size and shape prior derived from the known template targets into the model\u2019s inputs and learning objective, facilitating the learning of unified representation. Equipped with such designs, we construct two unified models SiamCUT and MoCUT, following the Siamese and motion-centric paradigms, respectively. Extensive experiments demonstrate that the proposed unified models exhibit strong generalization and stability. Furthermore, our unified models outperform the category-specific counterparts by a significant margin (e.g., on KITTI dataset, 12% and 3% performance gains on the Siamese and motion paradigms, respectively). Code and models will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QlqdXrzzD1",
    "arxiv_id": "2401.11204",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18669,
    "title": "Get more for less: Principled Data Selection for Warming Up Fine-Tuning in LLMs",
    "authors": [
      "Feiyang Kang",
      "Hoang Anh Just",
      "Yifan Sun",
      "Himanshu Jahagirdar",
      "Yuanzhi Zhang",
      "Rongxing Du",
      "Anit Kumar Sahu",
      "Ruoxi Jia"
    ],
    "abstract": "This work focuses on leveraging and selecting from vast, unlabeled, open data to \\emph{pre-fine-tune} a pre-trained language model. The goal is to minimize the need for costly domain-specific data for subsequent fine-tuning while achieving desired performance levels. While many data selection algorithms have been designed for small-scale applications, rendering them unsuitable for our context, some emerging methods do cater to language data scales. However, they often prioritize data that aligns with the target distribution. While this strategy may be effective when training a model from scratch, it can yield limited results when the model has already been pre-trained on a different distribution. Differing from prior work, our key idea is to select data that nudges the pre-training distribution closer to the target distribution. We show the optimality of this approach for fine-tuning tasks under certain conditions. We demonstrate the efficacy of our methodology across a diverse array of tasks, showing that it consistently surpasses other selection methods. Moreover, our proposed method is significantly faster than existing techniques, scaling to millions of samples within a single GPU hour. Our code is open-sourced \\footnote{Code repository: \\url{https://anonymous.4open.science/r/DV4LLM-D761/}}. While fine-tuning offers significant potential for enhancing performance across diverse tasks, its associated costs often limit its widespread adoption; with this work, we hope to lay the groundwork for cost-effective fine-tuning, making its benefits more accessible.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QmYNBVukex",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18668,
    "title": "LanguageBind: Extending Video-Language Pretraining to N-modality by Language-based Semantic Alignment",
    "authors": [
      "Bin Zhu",
      "Bin Lin",
      "Munan Ning",
      "Yang Yan",
      "Jiaxi Cui",
      "WANG HongFa",
      "Yatian Pang",
      "Wenhao Jiang",
      "Junwu Zhang",
      "Zongwei Li",
      "Cai Wan Zhang",
      "Zhifeng Li",
      "Wei Liu",
      "Li Yuan"
    ],
    "abstract": "The video-language (VL) pretraining has achieved remarkable improvement in multiple downstream tasks. However, the current VL pretraining framework is hard to extend to multiple modalities (N modalities, $N\\geq3$) beyond vision and language. We thus propose LanguageBind, taking the language as the bind across different modalities because the language modality is well-explored and contains rich semantics. Specifically, we freeze the language encoder acquired by VL pretraining, then train encoders for other modalities with contrastive learning. As a result, all modalities are mapped to a shared feature space, implementing multi-modal semantic alignment. While LanguageBind ensures that we can extend VL modalities to N modalities, we also need a high-quality dataset with alignment data pairs centered on language. We thus propose VIDAL-10M with Video, Infrared, Depth, Audio and their corresponding Language, naming as VIDAL-10M. In our VIDAL-10M, all videos are from short video platforms with complete semantics rather than truncated segments from long videos, and all the video, depth, infrared, and audio modalities are aligned to their textual descriptions. After pretraining on VIDAL-10M, we outperform ImageBind by 1.2% R@1 on the MSR-VTT dataset with only 15% of the parameters in the zero-shot video-text retrieval, validating the high quality of our dataset. Beyond this, our LanguageBind has achieved great improvement in the zero-shot video, audio, depth, and infrared understanding tasks. For instance, on the LLVIP and NYU-D datasets, LanguageBind outperforms ImageBind-huge with 23.8% and 11.1% top-1 accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QmZKc7UZCy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18667,
    "title": "Localizing and Editing Knowledge In Text-to-Image Generative Models",
    "authors": [
      "Samyadeep Basu",
      "Nanxuan Zhao",
      "Vlad I Morariu",
      "Soheil Feizi",
      "Varun Manjunatha"
    ],
    "abstract": "Text-to-Image Diffusion Models such as Stable-Diffusion and Imagen have achieved unprecedented quality of photorealism with state-of-the-art FID scores on MS-COCO and other generation benchmarks. Given a caption, image generation requires fine-grained knowledge about attributes such as object structure, style, and viewpoint amongst others. Where does this information reside in text-to-image generative models? In our paper, we tackle this question and understand how knowledge corresponding to distinct visual attributes is stored in large-scale text-to-image diffusion models. We adapt Causal Mediation Analysis for text-to-image models and trace knowledge about distinct visual attributes to various (causal) components in the (i) UNet and (ii) text-encoder of the diffusion model. In particular, we show that unlike large-language models, knowledge about different attributes is not localized in isolated components, but is instead distributed amongst a set of components in the conditional UNet. These sets of components are often distinct for different visual attributes (e.g.,  style} / objects).  Remarkably, we find that the text-encoder in public text-to-image models such as Stable-Diffusion contains {\\it only} one causal state across different visual attributes, and this is the first self-attention layer corresponding to the last subject token of the attribute in the caption. This is in stark contrast to the causal states in other language models which are often the mid-MLP layers.  Based on this observation of only one causal state in the text-encoder, we introduce a fast, data-free model editing method DiffQuickFix which can effectively edit concepts (remove or update knowledge) in text-to-image models. DiffQuickFix can edit (ablate) concepts in under a second with a closed-form update, providing a significant 1000x speedup and comparable editing performance to existing fine-tuning based editing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Qmw9ne6SOQ",
    "arxiv_id": "2310.13730",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18666,
    "title": "Learning Multi-Agent Communication from Graph Modeling Perspective",
    "authors": [
      "Shengchao Hu",
      "Li Shen",
      "Ya Zhang",
      "Dacheng Tao"
    ],
    "abstract": "In numerous artificial intelligence applications, the collaborative efforts of multiple intelligent agents are imperative for the successful attainment of target objectives. To enhance coordination among these agents, a distributed communication framework is often employed. However, information sharing among all agents proves to be resource-intensive, while the adoption of a manually pre-defined communication architecture imposes limitations on inter-agent communication, thereby constraining the potential for collaborative efforts. In this study, we introduce a novel approach wherein we conceptualize the communication architecture among agents as a learnable graph. We formulate this problem as the task of determining the communication graph while enabling the architecture parameters to update normally, thus necessitating a bi-level optimization process. Utilizing continuous relaxation of the graph representation and incorporating attention units, our proposed approach, CommFormer, efficiently optimizes the communication graph and concurrently refines architectural parameters through gradient descent in an end-to-end manner. Extensive experiments on StarCraftII combat games substantiate the robustness of our model across diverse cooperative scenarios, where agents are able to develop more coordinated and sophisticated strategies regardless of changes in the number of agents.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Qox9rO0kN0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18665,
    "title": "It's Never Too Late: Fusing Acoustic Information into Large Language Models for Automatic Speech Recognition",
    "authors": [
      "CHEN CHEN",
      "Ruizhe Li",
      "Yuchen Hu",
      "Sabato Marco Siniscalchi",
      "Pin-Yu Chen",
      "Ensiong Chng",
      "Chao-Han Huck Yang"
    ],
    "abstract": "Recent studies have successfully shown that large language models (LLMs) can be successfully used for generative error correction (GER) on top of the automatic speech recognition (ASR) output. Specifically, an LLM is utilized to carry out a direct mapping from the N-best hypotheses list generated by an ASR system to the predicted output transcription. However, despite its effectiveness, GER introduces extra data uncertainty since the LLM is trained without taking into account acoustic information available in the speech signal. In this work, we aim to overcome such a limitation by infusing acoustic information before generating the predicted transcription through a novel late fusion solution termed Uncertainty-Aware Dynamic Fusion (UADF). UADF is a multimodal fusion approach implemented into an auto-regressive decoding process and works in two stages: (i) It first analyzes and calibrates the token-level LLM decision, and (ii) it then dynamically assimilates the information from the acoustic modality. Experimental evidence collected from various ASR tasks shows that UADF surpasses existing fusion mechanisms in several ways. It yields significant improvements in word error rate (WER) while mitigating data uncertainty issues in LLM and addressing the poor generalization relied with sole modality during fusion. We also demonstrate that UADF seamlessly adapts to audio-visual speech recognition.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QqjFHyQwtF",
    "arxiv_id": "2402.05457",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18664,
    "title": "PRIME: Prioritizing Interpretability in Failure Mode Extraction",
    "authors": [
      "Keivan Rezaei",
      "Mehrdad Saberi",
      "Mazda Moayeri",
      "Soheil Feizi"
    ],
    "abstract": "In this work, we study the challenge of providing human-understandable descriptions for failure modes in trained image classification models.Existing works address this problem by first identifying clusters (or directions) of incorrectly classified samples in a latent space and then aiming to provide human-understandable text descriptions for them.We observe that in some cases, describing text does not match wellwith identified failure modes, partially owing to the fact that shared interpretable attributes of failure modes may not be captured using clustering in the feature space.To improve on these shortcomings, we propose a novel approach that prioritizes interpretability in this problem: we start by obtaining human-understandable concepts (tags) of images in the dataset andthen analyze the model's behavior based on the presence or absence of combinations of these tags.Our method also ensures that the tags describing a failure mode form a minimal set,avoiding redundant and noisy descriptions.Through several experiments on different datasets, we show that our method successfully identifies failure modes and generates high-quality text descriptions associated with them.These results highlight the importance of prioritizing interpretability in understanding model failures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QrEHs9w5UF",
    "arxiv_id": "2310.00164",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18663,
    "title": "Algorithms for Caching and MTS with reduced number of predictions",
    "authors": [
      "Karim Ahmed Abdel Sadek",
      "Marek Elias"
    ],
    "abstract": "ML-augmented algorithms utilize predictions to achieve performance beyond their worst-case bounds. Producing these predictions might be a costly operation \u2013 this motivated Im et al. [2022] to introduce the study of algorithms which use predictions parsimoniously. We design parsimonious algorithms for caching and MTS with action predictions, proposed by Antoniadis et al. [2023], focusing on the parameters of consistency (performance with perfect predictions) and smoothness (dependence of their performance on prediction error). Our algorithm for caching is 1-consistent, robust, and its smoothness deteriorates with decreasing number of available predictions. We propose an algorithm for general MTS whose consistency and smoothness both scale linearly with the decreasing number of predictions. Without restriction on the number of available predictions, both algorithms match the earlier guarantees achieved by Antoniadis et al. [2023].",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QuIiLSktO4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18662,
    "title": "Pseudo-Generalized Dynamic View Synthesis from a Video",
    "authors": [
      "Xiaoming Zhao",
      "R Alex Colburn",
      "Fangchang Ma",
      "Miguel \u00c1ngel Bautista",
      "Joshua M. Susskind",
      "Alex Schwing"
    ],
    "abstract": "Rendering scenes observed in a monocular video from novel viewpoints is a challenging problem. For static scenes the community has studied both scene-specific optimization techniques, which optimize on every test scene, and generalized techniques, which only run a deep net forward pass on a test scene. In contrast, for dynamic scenes, scene-specific optimization techniques exist, but, to our best knowledge, there is currently no generalized method for dynamic novel view synthesis from a given monocular video. To explore whether generalized dynamic novel view synthesis from monocular videos is possible today, we establish an analysis framework based on existing techniques and work toward the generalized approach. We find a pseudo-generalized process without scene-specific \\emph{appearance} optimization is possible, but geometrically and temporally consistent depth estimates  are  needed. Despite no scene-specific appearance optimization, the pseudo-generalized approach improves upon some scene-specific methods.For more information see project page at https://xiaoming-zhao.github.io/projects/pgdvs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QuVlUn4T2G",
    "arxiv_id": "2310.08587",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18660,
    "title": "TorchRL: A data-driven decision-making library for PyTorch",
    "authors": [
      "Albert Bou",
      "Matteo Bettini",
      "Sebastian Dittert",
      "Vikash Kumar",
      "Shagun Sodhani",
      "Xiaomeng Yang",
      "Gianni De Fabritiis",
      "Vincent Moens"
    ],
    "abstract": "PyTorch has ascended as a premier machine learning framework, yet it lacks a native and comprehensive library for decision and control tasks suitable for large development teams dealing with complex real-world data and environments. To address this issue, we propose TorchRL, a generalistic control library for PyTorch that provides well-integrated, yet standalone components. We introduce a new and flexible PyTorch primitive, the TensorDict, which facilitates streamlined algorithm development across the many branches of Reinforcement Learning (RL) and control. We provide a detailed description of the building blocks and an extensive overview of the library across domains and tasks. Finally, we experimentally demonstrate its reliability and flexibility, and show comparative benchmarks to demonstrate its computational efficiency. TorchRL fosters long-term support and is publicly available on GitHub for greater reproducibility and collaboration within the research community. The code is open-sourced on GitHub.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=QxItoEAVMb",
    "arxiv_id": "2306.00577",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18659,
    "title": "Spatio-Temporal Few-Shot Learning via Diffusive Neural Network Generation",
    "authors": [
      "Yuan Yuan",
      "Chenyang Shao",
      "Jingtao Ding",
      "Depeng Jin",
      "Yong Li"
    ],
    "abstract": "Spatio-temporal graph (STG) learning is foundational for smart city applications, yet it is often hindered by data scarcity in many cities and regions. To bridge this gap, we propose a novel generative pre-training framework, GPDiff, for STG transfer learning. Unlike conventional approaches that heavily rely on common feature extraction or intricate transfer learning designs, our solution takes a novel approach by performing generative pre-training on a collection of model parameters optimized with data from source cities. We recast STG transfer learning as pre-training a generative hypernetwork, which generates tailored model parameters guided by prompts, allowing for adaptability to diverse data distributions and city-specific characteristics. GPDiff employs a diffusion model with a transformer-based denoising network, which is model-agnostic to integrate with powerful STG models.  By addressing challenges arising from data gaps and the complexity of generalizing knowledge across cities, our framework consistently outperforms state-of-the-art baselines on multiple real-world datasets for tasks such as traffic speed prediction and crowd flow prediction. The implementation of our approach is available: https://anonymous.4open.science/r/GPDiff.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QyFm3D3Tzi",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18658,
    "title": "Large Brain Model for Learning Generic Representations with Tremendous EEG Data in BCI",
    "authors": [
      "Weibang Jiang",
      "Liming Zhao",
      "Bao-liang Lu"
    ],
    "abstract": "The current electroencephalogram (EEG) based deep learning models are typically designed for specific datasets and applications in brain-computer interaction (BCI), limiting the scale of the models and thus diminishing their perceptual capabilities and generalizability. Recently, Large Language Models (LLMs) have achieved unprecedented success in text processing, prompting us to explore the capabilities of Large EEG Models (LEMs). We hope that LEMs can break through the limitations of different task types of EEG datasets, and obtain universal perceptual capabilities of EEG signals through unsupervised pre-training. Then the models can be fine-tuned for different downstream tasks. However, compared to text data, the volume of EEG datasets is generally small and the format varies widely. For example, there can be mismatched numbers of electrodes, unequal length data samples, varied task designs, and low signal-to-noise ratio. To overcome these challenges, we propose a unified foundation model for EEG called Large Brain Model (LaBraM). LaBraM enables cross-dataset learning by segmenting the EEG signals into EEG channel patches. Vector-quantized neural spectrum prediction is used to train a semantically rich neural tokenizer that encodes continuous raw EEG channel patches into compact neural codes. We then pre-train neural Transformers by predicting the original neural codes for the masked EEG channel patches. The LaBraMs were pre-trained on about 2,500 hours of various types of EEG signals from around 20 datasets and validated on multiple different types of downstream tasks. Experiments on abnormal detection, event type classification, emotion recognition, and gait prediction show that our LaBraM outperforms all compared SOTA methods in their respective fields. Our code is available at https://github.com/935963004/LaBraM.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=QzTpTRVtrP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18657,
    "title": "MetaTool Benchmark for Large Language Models: Deciding Whether to Use Tools and Which to Use",
    "authors": [
      "Yue Huang",
      "Jiawen Shi",
      "Yuan Li",
      "Chenrui Fan",
      "Siyuan Wu",
      "Qihui Zhang",
      "Yixin Liu",
      "Pan Zhou",
      "Yao Wan",
      "Neil Zhenqiang Gong",
      "Lichao Sun"
    ],
    "abstract": "Large language models (LLMs) have garnered significant attention due to their impressive natural language processing (NLP) capabilities. Recently, many studies have focused on the tool utilization ability of LLMs. They primarily investigated how LLMs effectively collaborate with given specific tools. However, in scenarios where LLMs serve as intelligent agents, as seen in applications like AutoGPT and MetaGPT, LLMs are expected to engage in intricate decision-making processes that involve deciding whether to employ a tool and selecting the most suitable tool(s) from a collection of available tools to fulfill user requests. Therefore, in this paper, we introduce MetaTool, a benchmark designed to evaluate whether LLMs have tool usage awareness and can correctly choose tools. Specifically, we create a dataset called ToolE within the benchmark. This dataset contains various types of user queries in the form of prompts that trigger LLMs to use tools, including both single-tool and multi-tool scenarios. Subsequently, we set the tasks for both tool usage awareness and tool selection. We define four subtasks from different perspectives in tool selection, including tool selection with similar choices, tool selection in specific scenarios, tool selection with possible reliability issues, and multi-tool selection. We conduct experiments involving nine popular LLMs and find that the majority of them still struggle to effectively select tools, highlighting the existing gaps between LLMs and genuine intelligent agents. However, through the error analysis, we found there is still significant room for improvement. Finally, we conclude with insights for tool developers that follow ChatGPT to provide detailed descriptions that can enhance the tool selection performance of LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=R0c2qtalgG",
    "arxiv_id": "2310.03128",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18656,
    "title": "Memory-Consistent Neural Networks for Imitation Learning",
    "authors": [
      "Kaustubh Sridhar",
      "Souradeep Dutta",
      "Dinesh Jayaraman",
      "James Weimer",
      "Insup Lee"
    ],
    "abstract": "Imitation learning considerably simplifies policy synthesis compared to alternative approaches by exploiting access to expert demonstrations. For such imitation policies, errors away from the training samples are particularly critical. Even rare slip-ups in the policy action outputs can compound quickly over time, since they lead to unfamiliar future states where the policy is still more likely to err, eventually causing task failures. We revisit simple supervised \"behavior cloning\" for conveniently training the policy from nothing more than pre-recorded demonstrations, but carefully design the model class to counter the compounding error phenomenon. Our \"memory-consistent neural network\" (MCNN) outputs are hard-constrained to stay within clearly specified permissible regions anchored to prototypical \"memory\" training samples. We provide a guaranteed upper bound for the sub-optimality gap induced by MCNN policies. Using MCNNs on 9 imitation learning tasks, with MLP, Transformer, and Diffusion backbones, spanning dexterous robotic manipulation and driving, proprioceptive inputs and visual inputs, and varying sizes and types of demonstration data, we find large and consistent gains in performance, validating that MCNNs are better-suited than vanilla deep neural networks for imitation learning applications",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=R3Tf7LDdX4",
    "arxiv_id": "2310.06171",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18655,
    "title": "PAE: Reinforcement Learning from External Knowledge for Efficient Exploration",
    "authors": [
      "Zhe Wu",
      "Haofei Lu",
      "Junliang Xing",
      "You Wu",
      "Renye Yan",
      "Yaozhong Gan",
      "Yuanchun Shi"
    ],
    "abstract": "Human intelligence is adept at absorbing valuable insights from external knowledge.This capability is equally crucial for artificial intelligence. In contrast, classical reinforcement learning agents lack such capabilities and often resort to extensive trial and error to explore the environment. This paper introduces $\\textbf{PAE}$: $\\textbf{P}$lanner-$\\textbf{A}$ctor-$\\textbf{E}$valuator, a novel framework for teaching agents to $\\textit{learn to absorb external knowledge}$. PAE integrates the Planner's knowledge-state alignment mechanism, the Actor's mutual information skill control, and the Evaluator's adaptive intrinsic exploration reward to achieve 1) effective cross-modal information fusion, 2) enhanced linkage between knowledge and state, and 3) hierarchical mastery of complex tasks.Comprehensive experiments in six challenging sparse reward environments demonstrate PAE's superior exploration efficiency with good interpretability compared to existing methods. We provide the source code in the supplementary for further study and application.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=R7rZUSGOPD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18654,
    "title": "Scaling for Training Time and Post-hoc Out-of-distribution Detection Enhancement",
    "authors": [
      "Kai Xu",
      "Rongyu Chen",
      "Gianni Franchi",
      "Angela Yao"
    ],
    "abstract": "The capacity of a modern deep learning system to determine if a sample falls within its realm of knowledge is fundamental and important.In this paper, we offer insights and analyses of recent state-of-the-art out-of-distribution (OOD) detection methods - extremely simple activation shaping (ASH). We demonstrate that activation pruning has a detrimental effect on OOD detection, while activation scaling enhances it. Moreover, we propose SCALE, a simple yet effective post-hoc network enhancement method for OOD detection, which attains state-of-the-art OOD detection performance without compromising in-distribution (ID) accuracy. By integrating scaling concepts into the training process to capture a sample's ID characteristics, we propose Intermediate Tensor SHaping (ISH), a lightweight method for training time OOD detection enhancement. We achieve AUROC scores of +1.85\\% for near-OOD and +0.74\\% for far-OOD datasets on the OpenOOD v1.5 ImageNet-1K benchmark.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RDSTjtnqCg",
    "arxiv_id": "2310.00227",
    "GitHub": [
      "https://github.com/kai422/SCALE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18653,
    "title": "Demystifying Linear MDPs and Novel Dynamics Aggregation Framework",
    "authors": [
      "Joongkyu Lee",
      "Min-hwan Oh"
    ],
    "abstract": "In this paper, we first challenge the common premise that linear MDPs always induce performance guarantees independent of the state space.  We prove that, in linear MDPs, the feature dimension $d$ is lower bounded by $S/U$ in order to aptly represent transition probabilities, where $S$ is the size of the state space and $U$ is the maximum size of directly reachable states.Hence, $d$ can still scale with $S$ depending on the direct reachability of the environment.  To address this limitation of linear MDPs, we propose a novel structural aggregation framework based on dynamics, named as the *dynamics aggregation*.    For this newly proposed framework,    we design a provably efficient hierarchical reinforcement learning algorithm in linear function approximation that leverages aggregated sub-structures. Our proposed algorithm exhibits statistical efficiency, achieving a regret of $\\tilde{O} \\big( d_{\\psi}^{3/2} H^{3/2}\\sqrt{ NT} \\big)$, where $d_{\\psi}$ represents the feature dimension of *aggregated subMDPs* and $N$ signifies the number of aggregated subMDPs.     We establish that the condition $d_{\\psi}^3 N \\ll d^{3}$ is readily met in most real-world environments with hierarchical structures, enabling a substantial improvement in the regret bound compared to LSVI-UCB, which enjoys a regret of $\\tilde{O}(d^{3/2} H^{3/2} \\sqrt{ T})$.    To the best of our knowledge, this work presents the first HRL algorithm with linear function approximation that offers provable guarantees.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RDSj6S8WJe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18651,
    "title": "Don't Judge by the Look: Towards Motion Coherent Video Representation",
    "authors": [
      "Yitian Zhang",
      "Yue Bai",
      "Huan Wang",
      "Yizhou Wang",
      "Yun Fu"
    ],
    "abstract": "Current training pipelines in object recognition neglect Hue Jittering when doing data augmentation as it not only brings appearance changes that are detrimental to classification, but also the implementation is inefficient in practice. In this study, we investigate the effect of hue variance in the context of video recognition and find this variance to be beneficial since static appearances are less important in videos that contain motion information. Based on this observation, we propose a data augmentation method for video recognition, named Motion Coherent Augmentation (MCA), that introduces appearance variation in videos and implicitly encourages the model to prioritize motion patterns, rather than static appearances. Concretely, we propose an operation SwapMix to efficiently modify the appearance of video samples, and introduce Variation Alignment (VA) to resolve the distribution shift caused by SwapMix, enforcing the model to learn appearance invariant representations. Comprehensive empirical validations across various architectures and different datasets solidly demonstrate the effectiveness and generalization ability of MCA (e.g., 1.95% average performance gain at different frames on Something-Something V1 dataset over the competing method Uniformer).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RIcYTbpO38",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18652,
    "title": "Graph Generation with  $K^2$-trees",
    "authors": [
      "Yunhui Jang",
      "Dongwoo Kim",
      "Sungsoo Ahn"
    ],
    "abstract": "Generating graphs from a target distribution is a significant challenge across many domains, including drug discovery and social network analysis. In this work, we introduce a novel graph generation method leveraging $K^2$ representation, originally designed for lossless graph compression. The $K^2$ representation enables compact generation while concurrently capturing an inherent hierarchical structure of a graph. In addition, we make contributions by (1) presenting a sequential $K^2$ representation that incorporates pruning, flattening, and tokenization processes and (2) introducing a Transformer-based architecture designed to generate the sequence by incorporating a specialized tree positional encoding scheme. Finally, we extensively evaluate our algorithm on four general and two molecular graph datasets to confirm its superiority for graph generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RIEW6M9YoV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18650,
    "title": "Quantifying Language Models' Sensitivity to Spurious Features in Prompt Design or: How I learned to start worrying about prompt formatting",
    "authors": [
      "Melanie Sclar",
      "Yejin Choi",
      "Yulia Tsvetkov",
      "Alane Suhr"
    ],
    "abstract": "As large language models (LLMs) are adopted as a fundamental component of language technologies, it is crucial to accurately characterize their performance. Because choices in prompt design can strongly influence model behavior, this design process is critical in effectively using any modern pre-trained generative language model. In this work, we focus on LLM sensitivity to a quintessential class of meaning-preserving design choices: prompt formatting. We find that several widely used open-source LLMs are extremely sensitive to subtle changes in prompt formatting in few-shot settings, with performance differences of up to 76 accuracy points when evaluated using LLaMA-2-13B. Sensitivity remains even when increasing model size, the number of few-shot examples, or performing instruction tuning. Our analysis suggests that work evaluating LLMs with prompting-based methods would benefit from reporting a range of performance across plausible prompt formats, instead of the currently-standard practice of reporting performance on a single format. We also show that format performance only weakly correlates between models, which puts into question the methodological validity of comparing models with an arbitrarily chosen, fixed prompt format. To facilitate systematic analysis we propose FormatSpread, an algorithm that rapidly evaluates a sampled set of plausible prompt formats for a given task, and reports the interval of expected performance without accessing model weights. Furthermore, we present a suite of analyses that characterize the nature of this sensitivity, including exploring the influence of particular atomic perturbations and the internal representation of particular formats.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RIu5lyNXjT",
    "arxiv_id": "2310.11324",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18649,
    "title": "ConR: Contrastive Regularizer for Deep Imbalanced Regression",
    "authors": [
      "Mahsa Keramati",
      "Lili Meng",
      "R. David Evans"
    ],
    "abstract": "Imbalanced distributions are ubiquitous in real-world data. They create constraints on Deep Neural Networks to represent the minority labels and avoid bias towards majority labels. The extensive body of imbalanced approaches address categorical label spaces but fail to effectively extend to regression problems where the label space is continuous. Local and global correlations among continuous labels provide valuable insights towards effectively modelling relationships in feature space. In this work, we propose ConR, a contrastive regularizer that models global and local label similarities in feature space and prevents the features of minority samples from being collapsed into their majority neighbours. ConR discerns the disagreements between the label space and feature space, and imposesa penalty on these disagreements. ConR minds the continuous nature of label space with two main strategies in a contrastive manner: incorrect proximities are penalized proportionate to the label similarities and the correct ones are encouraged to model local similarities. ConR consolidates essential considerations into a generic, easy-to-integrate, and efficient method that effectively addresses deep imbalanced regression. Moreover, ConR is orthogonal to existing approaches and smoothly extends to uni- and multi-dimensional label spaces. Our comprehensive experiments show that ConR significantly boosts the performance of all the state-of-the-art methods on four large-scale deep imbalanced regression benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RIuevDSK5V",
    "arxiv_id": "2309.06651",
    "GitHub": [
      "https://github.com/BorealisAI/ConR"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18648,
    "title": "Weakly Supervised Virus Capsid Detection with Image-Level Annotations in Electron Microscopy Images",
    "authors": [
      "Hannah Kniesel",
      "Leon Sick",
      "Tristan Payer",
      "Tim Bergner",
      "Kavitha Shaga Devan",
      "Clarissa Read",
      "Paul Walther",
      "Timo Ropinski",
      "Pedro Hermosilla"
    ],
    "abstract": "Current state-of-the-art methods for object detection rely on annotated bounding boxes of large data sets for training. However, obtaining such annotations is expensive and can require up to hundreds of hours of manual labor. This poses a challenge, especially since such annotations can only be provided by experts, as they require knowledge about the scientific domain. To tackle this challenge, we propose a domain-specific weakly supervised object detection algorithm that only relies on image-level annotations, which are significantly easier to acquire. Our method  distills the knowledge of a pre-trained model, on the task of predicting the presence or absence of a virus in an image, to obtain a set of pseudo-labels that can be used to later train a state-of-the-art object detection model. To do so, we use an optimization approach with a shrinking receptive field to extract virus particles directly without specific network architectures. Through a set of extensive studies, we show how the proposed pseudo-labels are easier to obtain, and, more importantly, are able to outperform other existing weak labeling methods, and even ground truth labels, in cases where the time to obtain the annotation is limited.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RJDjSXNuAZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18647,
    "title": "Generalized Neural Sorting Networks with Error-Free Differentiable Swap Functions",
    "authors": [
      "Jungtaek Kim",
      "Jeongbeen Yoon",
      "Minsu Cho"
    ],
    "abstract": "Sorting is a fundamental operation of all computer systems, having been a long-standing significant research topic. Beyond the problem formulation of traditional sorting algorithms, we consider sorting problems for more abstract yet expressive inputs, e.g., multi-digit images and image fragments, through a neural sorting network. To learn a mapping from a high-dimensional input to an ordinal variable, the differentiability of sorting networks needs to be guaranteed. In this paper we define a softening error by a differentiable swap function, and develop an error-free swap function that holds non-decreasing and differentiability conditions. Furthermore, a permutation-equivariant Transformer network with multi-head attention is adopted to capture dependency between given inputs and also leverage its model capacity with self-attention. Experiments on diverse sorting benchmarks show that our methods perform better than or comparable to baseline methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RLSWbk9kPw",
    "arxiv_id": "2310.07174",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18646,
    "title": "Offline Data Enhanced On-Policy Policy Gradient with Provable Guarantees",
    "authors": [
      "Yifei Zhou",
      "Ayush Sekhari",
      "Yuda Song",
      "Wen Sun"
    ],
    "abstract": "Hybrid RL is the setting where an RL agent has access to both offline data and online data by interacting with the real-world environment. In this work, we propose a new hybrid RL algorithm that combines an on-policy actor-critic method with offline data. On-policy methods such as policy gradient and natural policy gradient (NPG) have shown to be more robust to model misspecification, though sometimes it may not be as sample efficient as methods that rely on off-policy learning. On the other hand, offline methods that depend on off-policy training often require strong assumptions in theory and are less stable to train in practice. Our new approach integrates a procedure of off-policy training on the offline data into an on-policy NPG framework. We show that our approach, in theory, can obtain a *best-of-both-worlds* type of result --- it achieves the state-of-art theoretical guarantees of offline RL when offline RL-specific assumptions hold, while at the same time maintaining the theoretical guarantees of on-policy NPG regardless of the offline RL assumptions' validity. Experimentally, in challenging rich-observation environments, we show that our approach outperforms a state-of-the-art hybrid RL baseline which only relies on off-policy policy optimization, demonstrating the empirical benefit of combining on-policy and off-policy learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RMgqvQGTwH",
    "arxiv_id": "2311.08384",
    "GitHub": [
      "https://github.com/YifeiZhou02/HNPG"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18645,
    "title": "Weaker MVI Condition: Extragradient Methods with Multi-Step Exploration",
    "authors": [
      "Yifeng Fan",
      "Yongqiang Li",
      "Bo Chen"
    ],
    "abstract": "This paper proposes a new framework of algorithms that is extended from the celebrated extragradient algorithm. Min-max problem has attracted increasing attention because of application in machine learning missions such as generative adversarial network (GAN) training. While there has been exhaustive researches on convex-concave setting, problem on nonconvex-nonconcave setting faces many challenges, such as convergence to limit cycles. Since general min-max optimization is proved intractable, recent research focus has been put on structured problems. One of these follows the weak Minty variational inequality (weak MVI), which is motivated by relaxing Minty variational inequality without compromising convergence guarantee of extragradient algorithm. Existing extragradient-type algorithms involve one exploration step and one update step per iteration. We analyze the algorithms with multiple exploration steps and show that current assumption can be further relaxed when more exploration is introduced. Furthermore, we design an adaptive algorithm that explores until the optimal improvement is achieved. This process exploit information from the whole trajectory and effectively tackle cyclic behaviors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RNGUbTYSjk",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18644,
    "title": "Efficient Continual Finite-Sum Minimization",
    "authors": [
      "Ioannis Mavrothalassitis",
      "Stratis Skoulakis",
      "Leello Tadesse Dadi",
      "Volkan Cevher"
    ],
    "abstract": "Given a sequence of functions $f_1,\\ldots,f_n$ with $f_i:\\mathcal{D}\\mapsto \\mathbb{R}$, finite-sum minimization seeks a point ${x}^\\star \\in \\mathcal{D}$ minimizing $\\sum_{j=1}^nf_j(x)/n$. In this work, we propose a key twist into the finite-sum minimization, dubbed as *instance-optimal finite-sum minimization*, that asks for a sequence of points $x_1^\\star, \\ldots, x_n^\\star \\in D$ such that each ${x}^\\star_i \\in D$ minimizes the prefix-sum $\\sum_{j=1}^if_j(x)/i$. Assuming that each prefix-sum is strongly convex, we develop a first-order stochastic instance optimal gradient method $\\mathrm{SIOPT}-\\mathrm{Grad}$ producing an $\\epsilon$-optimal sequence with $\\tilde{\\mathcal{O}}(n/\\epsilon^{1/3} + 1/\\sqrt{\\epsilon})$ overall *first-order oracles* (FO). An FO corresponds to the computation of a single gradient $\\nabla f_j(x)$ at a given $x \\in \\mathcal{D}$ for some $j \\in [n]$. Our approach significantly improves upon the $\\mathcal{O}(n/\\epsilon)$ FOs that $\\mathrm{StochasticGradientDescent}$ requires and the $\\mathcal{O}(n^2 \\log (1/\\epsilon))$ FOs that state-of-the-art variance reduction methods such as $\\mathrm{Katyusha}$ require. We also prove that there is no natural first-order method with $\\mathcal{O}\\left(n/\\epsilon^\\alpha\\right)$ gradient complexity for $\\alpha < 1/4$, establishing that the first-order complexity of our method is nearly tight.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RR70yWYenC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18642,
    "title": "TAIL: Task-specific Adapters for Imitation Learning with Large Pretrained Models",
    "authors": [
      "Zuxin Liu",
      "Jesse Zhang",
      "Kavosh Asadi",
      "Yao Liu",
      "Ding Zhao",
      "Shoham Sabach",
      "Rasool Fakoor"
    ],
    "abstract": "The full potential of large pretrained models remains largely untapped in control domains like robotics. This is mainly because of the scarcity of data and the computational challenges associated with training or fine-tuning these large models for such applications. Prior work mainly emphasizes effective \\emph{pretraining} of large models for decision-making, with little exploration into how to perform data-efficient continual \\emph{adaptation} of these models for new tasks. Recognizing these constraints, we introduce TAIL (Task-specific Adapters for Imitation Learning), a framework for efficient adaptation to new control tasks. Inspired by recent advancements in parameter-efficient fine-tuning in language domains, we explore efficient fine-tuning techniques---e.g., Bottleneck Adapters, P-Tuning, and Low-Rank Adaptation (LoRA)---in TAIL to adapt large pretrained models for new tasks with limited demonstration data. Our extensive experiments comparing prevalent parameter-efficient fine-tuning techniques and adaptation baselines suggest that TAIL with LoRA can achieve the best post-adaptation performance with only 1\\% of the trainable parameters of full fine-tuning, while avoiding catastrophic forgetting and preserving adaptation plasticity in continual learning settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RRayv1ZPN3",
    "arxiv_id": "2310.05905",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18641,
    "title": "Sufficient conditions for offline reactivation in recurrent neural networks",
    "authors": [
      "Nanda H Krishna",
      "Colin Bredenberg",
      "Daniel Levenstein",
      "Blake Aaron Richards",
      "Guillaume Lajoie"
    ],
    "abstract": "During periods of quiescence, such as sleep, neural activity in many brain circuits resembles that observed during periods of task engagement. However, the precise conditions under which task-optimized networks can autonomously reactivate the same network states responsible for online behavior is poorly understood. In this study, we develop a mathematical framework that outlines sufficient conditions for the emergence of neural reactivation in circuits that encode features of smoothly varying stimuli. We demonstrate mathematically that noisy recurrent networks optimized to track environmental state variables using change-based sensory information naturally develop denoising dynamics, which, in the absence of input, cause the network to revisit state configurations observed during periods of online activity. We validate our findings using numerical experiments on two canonical neuroscience tasks: spatial position estimation based on self-motion cues, and head direction estimation based on angular velocity cues. Overall, our work provides theoretical support for modeling offline reactivation as an emergent consequence of task optimization in noisy neural circuits.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RVrINT6MT7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18639,
    "title": "Zero-Mean Regularized Spectral Contrastive Learning: Implicitly Mitigating Wrong Connections in Positive-Pair Graphs",
    "authors": [
      "Xiong Zhou",
      "Xianming Liu",
      "Feilong Zhang",
      "Gang Wu",
      "Deming Zhai",
      "Junjun Jiang",
      "Xiangyang Ji"
    ],
    "abstract": "Contrastive learning has emerged as a popular paradigm of self-supervised learning that learns representations by encouraging representations of positive pairs to be similar while representations of negative pairs to be far apart. The spectral contrastive loss, in synergy with the notion of positive-pair graphs, offers valuable theoretical insights into the empirical successes of contrastive learning. In this paper, we propose incorporating an additive factor into the term of spectral contrastive loss involving negative pairs. This simple modification can be equivalently viewed as introducing a regularization term that enforces the mean of representations to be zero, which is referred to as *zero-mean regularization*. It intuitively relaxes the orthogonality of representations between negative pairs and implicitly alleviates the adverse effect of wrong connections in the positive-pair graph, leading to better performance and robustness. To clarify this, we thoroughly investigate the role of zero-mean regularized spectral contrastive loss in both unsupervised and supervised scenarios with respect to theoretical analysis and quantitative evaluation. These results highlight the potential of zero-mean regularized spectral contrastive learning to be a promising approach in various tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RZBy8oHTz4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18638,
    "title": "Tree Search-Based Policy Optimization under Stochastic Execution Delay",
    "authors": [
      "David Valensi",
      "Esther Derman",
      "Shie Mannor",
      "Gal Dalal"
    ],
    "abstract": "The conventional formulation of Markov decision processes (MDPs) assumes that the agent's decisions are promptly executed.However, in numerous realistic applications such as robotics or healthcare,  actions are performed with a delay which value can even be stochastic.In this work, we introduce stochastic delayed execution MDPs, a new formalism addressing random delays without resorting to state augmentation. We show that given observed delay values, it is sufficient to perform a policy search in the class of Markov policies in order to reach optimal performance, thus extending the deterministic fixed delay case. Armed with this insight, we devise Delayed EfficientZero, a model-based algorithm that optimizes over the class of Markov policies. Delayed EfficientZero leverages the Monte-Carlo tree search of its non-delayed variant EfficientZero to accurately infer future states from the action queue. Thus, it handles delayed execution while preserving the sample efficiency of EfficientZero. Through empirical analysis, we demonstrate that our algorithm surpasses all benchmark methods in Atari games when dealing with both constant and stochastic delays.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RaqZX9LSGA",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18637,
    "title": "NaturalSpeech 2: Latent Diffusion Models are Natural and Zero-Shot Speech and Singing Synthesizers",
    "authors": [
      "Kai Shen",
      "Zeqian Ju",
      "Xu Tan",
      "Eric Liu",
      "Yichong Leng",
      "Lei He",
      "Tao Qin",
      "sheng zhao",
      "Jiang Bian"
    ],
    "abstract": "Scaling text-to-speech (TTS) to large-scale, multi-speaker, and in-the-wild datasets is important to capture the diversity in human speech such as speaker identities, prosodies, and styles (e.g., singing). Current large TTS systems usually quantize speech into discrete tokens and use language models to generate these tokens one by one, which suffer from unstable prosody, word skipping/repeating issue, and poor voice quality. In this paper, we develop NaturalSpeech 2, a TTS system that leverages a neural audio codec with residual vector quantizers to get the quantized latent vectors and uses a diffusion model to generate these latent vectors conditioned on text input. To enhance the zero-shot capability that is important to achieve diverse speech synthesis, we design a speech prompting mechanism to facilitate in-context learning in the diffusion model and the duration/pitch predictor. We scale NaturalSpeech 2 to large-scale datasets with 44K hours of speech and singing data and evaluate its voice quality on unseen speakers. NaturalSpeech 2 outperforms previous TTS systems by a large margin in terms of prosody/timbre similarity, robustness, and voice quality in a zero-shot setting, and performs novel zero-shot singing synthesis with only a speech prompt. Audio samples are available at https://naturalspeech2.github.io/.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Rc7dAwVL3v",
    "arxiv_id": "2304.09116",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18636,
    "title": "RDesign: Hierarchical Data-efficient Representation Learning for Tertiary Structure-based RNA Design",
    "authors": [
      "Cheng Tan",
      "Yijie Zhang",
      "Zhangyang Gao",
      "Bozhen Hu",
      "Siyuan Li",
      "Zicheng Liu",
      "Stan Z. Li"
    ],
    "abstract": "While artificial intelligence has made remarkable strides in revealing the relationship between biological macromolecules' primary sequence and tertiary structure, designing RNA sequences based on specified tertiary structures remains challenging. Though existing approaches in protein design have thoroughly explored structure-to-sequence dependencies in proteins, RNA design still confronts difficulties due to structural complexity and data scarcity. Adding to the problem, direct transplantation of protein design methodologies into RNA design fails to achieve satisfactory outcomes although sharing similar structural components. In this study, we aim to systematically construct a data-driven RNA design pipeline. We crafted a large, well-curated benchmark dataset and designed a comprehensive structural modeling approach to represent the complex RNA tertiary structure. More importantly, we proposed a hierarchical data-efficient representation learning framework that learns structural representations through contrastive learning at both cluster-level and sample-level to fully leverage the limited data. By constraining data representations within a limited hyperspherical space, the intrinsic relationships between data points could be explicitly imposed. Moreover, we incorporated extracted secondary structures with base pairs as prior knowledge to facilitate the RNA design process. Extensive experiments demonstrate the effectiveness of our proposed method, providing a reliable baseline for future RNA design tasks. The source code and benchmark dataset will be released publicly.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RemfXx7ebP",
    "arxiv_id": "2301.10774",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18635,
    "title": "Learning to Make Adherence-aware Advice",
    "authors": [
      "Guanting Chen",
      "Xiaocheng Li",
      "Chunlin Sun",
      "Hanzhao Wang"
    ],
    "abstract": "As artificial intelligence (AI) systems play an increasingly prominent role in human decision-making, challenges surface in the realm of human-AI interactions. One challenge arises from the suboptimal AI policies due to the inadequate consideration of humans disregarding AI recommendations, as well as the need for AI to provide advice selectively when it is most pertinent. This paper presents a sequential decision-making model that (i) takes into account the human's adherence level (the probability that the human follows/rejects machine advice) and (ii) incorporates a defer option so that the machine can temporarily refrain from making advice. We provide learning algorithms that learn the optimal advice policy and make advice only at critical time stamps. Compared to problem-agnostic reinforcement learning algorithms, our specialized learning algorithms not only enjoy better theoretical convergence properties but also show strong empirical performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RgELE1dQXx",
    "arxiv_id": "2310.00817",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18634,
    "title": "Achieving Human Parity in Content-Grounded Datasets Generation",
    "authors": [
      "Asaf Yehudai",
      "Boaz Carmeli",
      "Yosi Mass",
      "Ofir Arviv",
      "Nathaniel Mills",
      "Eyal Shnarch",
      "Leshem Choshen"
    ],
    "abstract": "The lack of high-quality data for content-grounded generation tasks has been identified as a major obstacle to advancing these tasks. To address this gap, we propose a novel method for automatically generating high-quality content-grounded data. It consists of three stages: (a) Content Preparation, (b) Generation: creating task-specific examples from the content (e.g., question-answer pairs or summaries). (c) Filtering mechanism aiming to ensure the quality and faithfulness of the generated data. We showcase this methodology by generating large-scale data for synthetic Long-form question-answering (LFQA) and summarization. In a human evaluation, our generated data was found to be natural and of high quality. Furthermore, we compare models trained on our data with models trained on human-written data \u2013 ELI5 and ASQA for LFQA and CNN-DailyMail for Summarization. We show that our models are on par with or outperforming models trained on human-generated data and consistently outperforming them in faithfulness. Finally, we applied our method to create LFQA data within the medical domain and compared a model trained on it with models trained on other domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RjYKTQ0L0W",
    "arxiv_id": "2401.14367",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18631,
    "title": "A Primal-Dual Approach to Solving Variational Inequalities with General Constraints",
    "authors": [
      "Tatjana Chavdarova",
      "Tong Yang",
      "Matteo Pagliardini",
      "Michael Jordan"
    ],
    "abstract": "Yang et al. (2023) recently showed how to use first-order gradient methods to solve general variational inequalities (VIs) under a limiting assumption that analytic solutions of specific subproblems are available.  In this paper, we circumvent this assumption via a warm-starting technique where we solve subproblems approximately and initialize variables with the approximate solution found at the previous iteration. We prove the convergence of this method and show that the gap function of the last iterate of the method decreases at a rate of $\\mathcal{O}(\\frac{1}{\\sqrt{K}})$ when the operator is $L$-Lipschitz and monotone. In numerical experiments, we show that this technique can converge much faster than its exact counterpart. Furthermore, for the cases when the inequality constraints are simple, we introduce an alternative variant of ACVI and establish its convergence under the same conditions.Finally, we relax the smoothness assumptions in Yang et al., yielding, to our knowledge, the first convergence result for VIs with general constraints that does not rely on the assumption that the operator is $L$-Lipschitz.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RsztjXcvUf",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18629,
    "title": "Simplifying Transformer Blocks",
    "authors": [
      "Bobby He",
      "Thomas Hofmann"
    ],
    "abstract": "A simple design recipe for deep Transformers is to compose identical building blocks. But standard transformer blocks are far from simple, interweaving attention and MLP sub-blocks with skip connections \\& normalisation layers in precise arrangements. This complexity leads to brittle architectures, where seemingly minor changes can significantly reduce training speed, or render models untrainable.In this work, we ask to what extent the standard transformer block can be simplified? Combining signal propagation theory and empirical observations, we motivate modifications that allow many block components to be removed with no loss of training speed, including skip connections, projection or value parameters, sequential sub-blocks and normalisation layers. In experiments on both autoregressive decoder-only and BERT encoder-only models, our simplified transformers match the per-iteration training speed and performance of standard transformers, while enjoying 15\\% faster training throughput, and using 15\\% fewer parameters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RtDok9eS3s",
    "arxiv_id": "2311.01906",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18628,
    "title": "Meta-Evolve: Continuous Robot Evolution for One-to-many Policy Transfer",
    "authors": [
      "Xingyu Liu",
      "Deepak Pathak",
      "Ding Zhao"
    ],
    "abstract": "We investigate the problem of transferring an expert policy from a source robot to multiple different robots. To solve this problem, we propose a method named *Meta-Evolve* that uses continuous robot evolution to efficiently transfer the policy to each target robot through a set of tree-structured evolutionary robot sequences. The robot evolution tree allows the robot evolution paths to be shared, so our approach can significantly outperform naive one-to-one policy transfer. We present a heuristic approach to determine an optimized robot evolution tree. Experiments have shown that our method is able to improve the efficiency of one-to-three transfer of manipulation policy by up to 3.2$\\times$ and one-to-six transfer of agile locomotion policy by 2.4$\\times$ in terms of simulation cost over the baseline of launching multiple independent one-to-one policy transfers. Supplementary videos available at the project website: https://sites.google.com/view/meta-evolve.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RthOl4jHw5",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18627,
    "title": "Realistic Evaluation of Semi-supervised Learning Algorithms in Open Environments",
    "authors": [
      "Lin-Han Jia",
      "Lan-Zhe Guo",
      "Zhi Zhou",
      "Yu-Feng Li"
    ],
    "abstract": "Semi-supervised learning (SSL) has emerged as a promising paradigm to alleviate the dependency on abundant labeled data by harnessing the power of unlabeled data. Although many SSL algorithms have been proposed, their performance in practical applications is not robust because the assumption that labeled and unlabeled data are consistent does not hold. In open environments, the sources of labeled and unlabeled data may differ, leading to inconsistent data distributions and even data spaces. This paper points out that previous research on robust SSL has approached the problem from a static perspective, thereby only achieving local robustness rather than global robustness. We reshape the research framework of robust SSL by using the Robustness Analysis Curve (RAC) and the associated metrics defined based on it. Based on these metrics, we build a benchmark that encompasses three types of open environments: inconsistent data distributions, inconsistent label spaces, and inconsistent feature spaces to assess the performance of widely used statistical and deep SSL algorithms with tabular, image, and text datasets. This paper also conducted a detailed analysis, based on experimental results and theory, on how to make SSL algorithms more robust in open environments.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=RvUVMjfp8i",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18626,
    "title": "What's In My Big Data?",
    "authors": [
      "Yanai Elazar",
      "Akshita Bhagia",
      "Ian Helgi Magnusson",
      "Abhilasha Ravichander",
      "Dustin Schwenk",
      "Alane Suhr",
      "Evan Pete Walsh",
      "Dirk Groeneveld",
      "Luca Soldaini",
      "Sameer Singh",
      "Hannaneh Hajishirzi",
      "Noah A. Smith",
      "Jesse Dodge"
    ],
    "abstract": "Large text corpora are the backbone of language models.However, we have a limited understanding of the content of these corpora, including general statistics, quality, social factors, and inclusion of evaluation data (contamination).In this work, we propose What's In My Big Data? (WIMBD), a platform and a set of 16 high-level analyses that allow us to reveal and compare the contents of large text corpora. WIMBD builds on two basic capabilities---count and search---*at scale*, which allows us to analyze more than 35 terabytes on a standard compute node. We apply WIMBD to 10 different corpora used to train popular language models, including *C4*, *The Pile*, and *RedPajama*.Our analysis uncovers several surprising and previously undocumented findings about these corpora, including the high prevalence of duplicate, synthetic, and low-quality content, personally identifiable information, toxic language, and benchmark contamination. For instance, we find that about 50% of the documents in *RedPajama* and *LAION-2B-en* are duplicates. In addition, several datasets used for benchmarking models trained on such corpora are contaminated with respect to important benchmarks, including the Winograd Schema Challenge and parts of GLUE and SuperGLUE.We open-source WIMBD code and artifacts to provide a standard set of evaluations for new text-based corpora and to encourage more analyses and transparency around them.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=RvfPnOkPV4",
    "arxiv_id": "2310.20707",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18625,
    "title": "BrainLM: A foundation model for brain activity recordings",
    "authors": [
      "Josue Ortega Caro",
      "Antonio Henrique de Oliveira Fonseca",
      "Syed A Rizvi",
      "Matteo Rosati",
      "Christopher Averill",
      "James L Cross",
      "Prateek Mittal",
      "Emanuele Zappala",
      "Rahul Madhav Dhodapkar",
      "Chadi Abdallah",
      "David van Dijk"
    ],
    "abstract": "We introduce the Brain Language Model (BrainLM), a foundation model for brain activity dynamics trained on 6,700 hours of fMRI recordings. Utilizing self-supervised masked-prediction training, BrainLM demonstrates proficiency in both fine-tuning and zero-shot inference tasks. Fine-tuning allows for the accurate prediction of clinical variables like age, anxiety, and PTSD as well as forecasting of future brain states. Critically, the model generalizes well to entirely new external cohorts not seen during training. In zero-shot inference mode, BrainLM can identify intrinsic functional networks directly from raw fMRI data without any network-based supervision during training. The model also generates interpretable latent representations that reveal relationships between brain activity patterns and cognitive states. Overall, BrainLM offers a versatile and interpretable framework for elucidating the complex spatiotemporal dynamics of human brain activity. It serves as a powerful \"lens\" through which massive repositories of fMRI data can be analyzed in new ways, enabling more effective interpretation and utilization at scale. The work demonstrates the potential of foundation models to advance computational neuroscience research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RwI7ZEfR27",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18624,
    "title": "A Stable, Fast, and Fully Automatic Learning Algorithm for Predictive Coding Networks",
    "authors": [
      "Tommaso Salvatori",
      "Yuhang Song",
      "Yordan Yordanov",
      "Beren Millidge",
      "Lei Sha",
      "Cornelius Emde",
      "Zhenghua Xu",
      "Rafal Bogacz",
      "Thomas Lukasiewicz"
    ],
    "abstract": "Predictive coding networks are neuroscience-inspired models with roots in both Bayesian statistics and neuroscience. Training such models, however, is quite inefficient and unstable. In this work, we show how by simply changing the temporal scheduling of the update rule for the synaptic weights leads to an algorithm that is much more efficient and stable than the original one, and has theoretical guarantees in terms of convergence. The proposed algorithm, that we call incremental predictive coding (iPC) is also more biologically plausible than the original one, as it it fully automatic. In an extensive set of experiments, we show that iPC constantly performs better than the original formulation on a large number of benchmarks for image classification, as well as for the training of both conditional and masked language models, in terms of test accuracy, efficiency, and convergence with respect to a large set of hyperparameters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RyUvzda8GH",
    "arxiv_id": "2212.00720",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18623,
    "title": "$t^3$-Variational Autoencoder: Learning Heavy-tailed Data with Student's t and Power Divergence",
    "authors": [
      "Juno Kim",
      "Jaehyuk Kwon",
      "Mincheol Cho",
      "Hyunjong Lee",
      "Joong-Ho Won"
    ],
    "abstract": "The variational autoencoder (VAE) typically employs a standard normal prior as a regularizer for the probabilistic latent encoder. However, the Gaussian tail often decays too quickly to effectively accommodate the encoded points, failing to preserve crucial structures hidden in the data. In this paper, we explore the use of heavy-tailed models to combat over-regularization. Drawing upon insights from information geometry, we propose $t^3$VAE, a modified VAE framework that incorporates Student's t-distributions for the prior, encoder, and decoder. This results in a joint model distribution of a power form which we argue can better fit real-world datasets. We derive a new objective by reformulating the evidence lower bound as joint optimization of a KL divergence between two statistical manifolds and replacing with $\\gamma$-power divergence, a natural alternative for power families. $t^3$VAE demonstrates superior generation of low-density regions when trained on heavy-tailed synthetic data. Furthermore, we show that our model excels at capturing rare features through real-data experiments on CelebA and imbalanced CIFAR datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RzNlECeoOB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18621,
    "title": "Guiding Instruction-based Image Editing via Multimodal Large Language Models",
    "authors": [
      "Tsu-Jui Fu",
      "Wenze Hu",
      "Xianzhi Du",
      "William Yang Wang",
      "Yinfei Yang",
      "Zhe Gan"
    ],
    "abstract": "Instruction-based image editing improves the controllability and flexibility of image manipulation via natural commands without elaborate descriptions or regional masks. However, human instructions are sometimes too brief for current methods to capture and follow. Multimodal large language models (MLLMs) show promising capabilities in cross-modal understanding and visual-aware response generation via LMs. We investigate how MLLMs facilitate edit instructions and present MLLM-Guided Image Editing (MGIE). MGIE learns to derive expressive instructions and provides explicit guidance. The editing model jointly captures this visual imagination and performs manipulation through end-to-end training. We evaluate various aspects of Photoshop-style modification, global photo optimization, and local editing. Extensive experimental results demonstrate that expressive instructions are crucial to instruction-based image editing, and our MGIE can lead to a notable improvement in automatic metrics and human evaluation while maintaining competitive inference efficiency.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=S1RKWSyZ2Y",
    "arxiv_id": "2309.17102",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18619,
    "title": "A Variational Framework for Estimating Continuous Treatment Effects with Measurement Error",
    "authors": [
      "Erdun Gao",
      "Howard Bondell",
      "Wei Huang",
      "Mingming Gong"
    ],
    "abstract": "Estimating treatment effects has numerous real-world applications in various fields, such as epidemiology and political science. While much attention has been devoted to addressing the challenge using fully observational data, there has been comparatively limited exploration of this issue in cases when the treatment is not directly observed. In this paper, we tackle this problem by developing a general variational framework, which is flexible to integrate with advanced neural network-based approaches, to identify the average dose-response function (ADRF) with the continuously valued error-contaminated treatment. Our approach begins with the formulation of a probabilistic data generation model, treating the unobserved treatment as a latent variable. In this model, we leverage a learnable density estimation neural network to derive its prior distribution conditioned on covariates. This module also doubles as a generalized propensity score estimator, effectively mitigating selection bias arising from observed confounding variables. Subsequently, we calculate the posterior distribution of the treatment, taking into account the observed measurement and outcome. To mitigate the impact of treatment error, we introduce a re-parametrized treatment value, replacing the error-affected one, to make more accurate predictions regarding the outcome. To demonstrate the adaptability of our framework, we incorporate two state-of-the-art ADRF estimation methods and rigorously assess its efficacy through extensive simulations and experiments using semi-synthetic data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=S46Knicu56",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18618,
    "title": "Do Generated Data Always Help Contrastive Learning?",
    "authors": [
      "Yifei Wang",
      "Jizhe Zhang",
      "Yisen Wang"
    ],
    "abstract": "Contrastive Learning (CL) has emerged as one of the most successful paradigms for unsupervised visual representation learning, yet it often depends on intensive manual data augmentations. With the rise of generative models, especially diffusion models, the ability to generate realistic images close to the real data distribution has been well recognized. These generated high-equality images have been successfully applied to enhance contrastive representation learning, a technique termed ``data inflation''. However, we find that the generated data (even from a good diffusion model like DDPM) may sometimes even harm contrastive learning. We investigate the causes behind this failure from the perspective of both data inflation and data augmentation. For the first time, we reveal the complementary roles that stronger data inflation should be accompanied by weaker augmentations, and vice versa. We also provide rigorous theoretical explanations for these phenomena via deriving its generalization bounds under data inflation. Drawing from these insights, we propose **Adaptive Inflation (AdaInf)**, a purely data-centric strategy without introducing any extra computation cost. On benchmark datasets, AdaInf can bring significant improvements for various contrastive learning methods. Notably, without using external data, AdaInf obtains 94.70% linear accuracy on CIFAR-10 with SimCLR, setting a new record that surpasses many sophisticated methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=S5EqslEHnz",
    "arxiv_id": "2403.12448",
    "GitHub": [
      "https://github.com/PKU-ML/adainf"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18617,
    "title": "Complex priors and flexible inference in recurrent circuits with dendritic nonlinearities",
    "authors": [
      "Benjamin S. H. Lyo",
      "Cristina Savin"
    ],
    "abstract": "Despite many successful examples in which probabilistic inference can account for perception, we have little understanding of how the brain represents and uses structured priors that capture the complexity of natural input statistics. Here we construct a recurrent circuit model that can implicitly represent priors over latent variables, and combine them with sensory and contextual sources of information to encode task-specific posteriors. Inspired by the recent success of diffusion models as means of learning and using priors over images, our model uses dendritic nonlinearities optimized for denoising, and stochastic somatic integration with the degree of noise modulated by an oscillating global signal. Combining these elements into a recurrent network yields a dynamical system that samples from the prior at a rate prescribed by the period of the global oscillator. Additional inputs reflecting sensory or top-down contextual information alter these dynamics to generate samples from the corresponding posterior, with different input gating patterns selecting different inference tasks. We demonstrate that this architecture can sample from low dimensional nonlinear manifolds and multimodal posteriors. Overall, the model provides a new framework for circuit-level representation of probabilistic information, in a format that facilitates flexible inference.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=S5aUhpuyap",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18616,
    "title": "Understanding Transferable Representation Learning and Zero-shot Transfer in CLIP",
    "authors": [
      "Zixiang Chen",
      "Yihe Deng",
      "Yuanzhi Li",
      "Quanquan Gu"
    ],
    "abstract": "Multi-modal learning has become increasingly popular due to its ability to leverage information from different data sources (e.g., text and images) to improve the model performance. Recently, CLIP has emerged as an effective approach that employs vision-language contrastive pretraining to learn joint image and text representations and exhibits remarkable performance in zero-shot learning and text-guided natural image generation. Despite the substantial practical success of CLIP, its theoretical understanding remains elusive. In this paper, we formally study transferrable representation learning underlying CLIP and demonstrate how features from different modalities get aligned. We also analyze its zero-shot transfer performance on the downstream tasks. In addition, we conduct empirical evaluations on real data to backup our theory. Inspired by our analysis, we propose a new CLIP-type approach, which achieves better performance than CLIP and other state-of-the-art methods on benchmark datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=S5yOuNfSA0",
    "arxiv_id": "2310.00927",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18614,
    "title": "Demystifying Local & Global Fairness Trade-offs in Federated Learning Using Partial Information Decomposition",
    "authors": [
      "Faisal Hamman",
      "Sanghamitra Dutta"
    ],
    "abstract": "This work presents an information-theoretic perspective to group fairness trade-offs in federated learning (FL) with respect to sensitive attributes, such as gender, race, etc. Existing works often focus on either \\emph{global fairness} (overall disparity of the model across all clients) or \\emph{local fairness} (disparity of the model at each client), without always considering their trade-offs. There is a lack of understanding of the interplay between global and local fairness in FL, particularly under data heterogeneity, and if and when one implies the other. To address this gap, we leverage a body of work in information theory called partial information decomposition (PID), which first identifies three sources of unfairness in FL, namely, \\emph{Unique Disparity}, \\emph{Redundant  Disparity}, and \\emph{Masked Disparity}. We demonstrate how these three disparities contribute to global and local fairness using canonical examples. This decomposition helps us derive fundamental limits on the trade-off between global and local fairness, highlighting where they agree or disagree.  We introduce the \\emph{Accuracy \\& Global-Local Fairness Optimality Problem (AGLFOP)}, a convex optimization that defines the theoretical limits of accuracy and fairness trade-offs, identifying the best possible performance any FL strategy can attain given a dataset and client distribution. We also present experimental results on synthetic datasets and the ADULT dataset to support our theoretical findings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SBj2Qdhgew",
    "arxiv_id": "2307.11333",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18612,
    "title": "Prediction without Preclusion: Recourse Verification with Reachable Sets",
    "authors": [
      "Avni Kothari",
      "Bogdan Kulynych",
      "Tsui-Wei Weng",
      "Berk Ustun"
    ],
    "abstract": "Machine learning models are often used to decide who receives a loan, a job interview, or a public benefit. Standard methods to learn such models use features about people but overlook their actionability. As a result, models can assign predictions that are fixed \u2013 meaning that consumers who are denied loans, interviews, or benefits are precluded from access to credit, employment, or assistance. In this work, we present a task called recourse verification to flag models that assign fixed predictions under a rich class of real-world actionability constraints. We develop methods to check if a model can provide recourse using reachable sets. We demonstrate how our tools can verify recourse in real-world lending datasets. Our results highlight how models can inadvertently assign fixed predictions that permanently bar access, and underscore the need to account for actionability in model development.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=SCQfYpdoGE",
    "arxiv_id": "2308.12820",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18611,
    "title": "Mask-Based Modeling for Neural Radiance Fields",
    "authors": [
      "Ganlin Yang",
      "Guoqiang Wei",
      "Zhizheng Zhang",
      "Yan Lu",
      "Dong Liu"
    ],
    "abstract": "Most Neural Radiance Fields (NeRFs) exhibit limited generalization capabilities,which restrict their applicability in representing multiple scenes using a single model. To address this problem, existing generalizable NeRF methods simply condition the model on image features. These methods still struggle to learn precise global representations over diverse scenes since they lack an effective mechanism for interacting among different points and views. In this work, we unveil that3D implicit representation learning can be significantly improved by mask-based modeling. Specifically, we propose **m**asked **r**ay and **v**iew **m**odeling for generalizable **NeRF** (**MRVM-NeRF**), which is a self-supervised pretraining target to predict complete scene representations from partially masked features along each ray. With this pretraining target, MRVM-NeRF enables better use of correlations across different rays and views as the geometry priors, which thereby strengthens the capability of capturing intricate details within the scenes and boosts the generalization capability across different scenes. Extensive experiments demonstrate the effectiveness of our proposed MRVM-NeRF on both synthetic and real-world datasets, qualitatively and quantitatively. Besides, we also conduct experiments to show the compatibility of our proposed method with various backbones and itssuperiority under few-shot cases.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=SEiuSzlD1d",
    "arxiv_id": "2304.04962",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18610,
    "title": "Label-Agnostic Forgetting: A Supervision-Free Unlearning in Deep Models",
    "authors": [
      "Shaofei Shen",
      "Chenhao Zhang",
      "Yawen Zhao",
      "Alina Bialkowski",
      "Weitong Tony Chen",
      "Miao Xu"
    ],
    "abstract": "Machine unlearning aims to remove information derived from forgotten data while preserving that of the remaining dataset in a well-trained model. With the increasing emphasis on data privacy, several approaches to machine unlearning have emerged. However, these methods typically rely on complete supervision throughout the unlearning process. Unfortunately, obtaining such supervision, whether for the forgetting or remaining data, can be impractical due to the substantial cost associated with annotating real-world datasets. This challenge prompts us to propose a supervision-free unlearning approach that operates without the need for labels during the unlearning process. Specifically, we introduce a variational approach to approximate the distribution of representations for the remaining data. Leveraging this approximation, we adapt the original model to eliminate information from the forgotten data at the representation level. To further address the issue of lacking supervision information, which hinders alignment with ground truth, we introduce a contrastive loss to facilitate the matching of representations between the remaining data and those of the original model, thus preserving predictive performance. Experimental results across various unlearning tasks demonstrate the effectiveness of our proposed method, Label-Agnostic Forgetting (LAF) without using any labels, which achieves comparable performance to state-of-the-art methods that rely on full supervision information. Furthermore, our approach excels in semi-supervised scenarios, leveraging limited supervision information to outperform fully supervised baselines. This work not only showcases the viability of supervision-free unlearning in deep models but also opens up a new possibility for future research in unlearning at the representation level.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SIZWiya7FE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18609,
    "title": "Interventional Fairness on Partially Known Causal Graphs: A Constrained Optimization Approach",
    "authors": [
      "Aoqi Zuo",
      "Yiqing Li",
      "Susan Wei",
      "Mingming Gong"
    ],
    "abstract": "Fair machine learning aims to prevent discrimination against individuals or sub-populations based on sensitive attributes such as gender and race. In recent years, causal inference methods have been increasingly used in fair machine learning to measure unfairness by causal effects. However, current methods assume that the true causal graph is given, which is often not true in real-world applications. To address this limitation, this paper proposes a framework for achieving causal fairness based on the notion of interventions when the true causal graph is partially known. The proposed approach involves modeling fair prediction using a Partially Directed Acyclic Graph (PDAG), specifically, a class of causal DAGs that can be learned from observational data combined with domain knowledge. The PDAG is used to measure causal fairness, and a constrained optimization problem is formulated to balance between fairness and accuracy. Results on both simulated and real-world datasets demonstrate the effectiveness of this method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SKulT2VX9p",
    "arxiv_id": "2401.10632",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18608,
    "title": "Rethinking the symmetry-preserving circuits for constrained variational quantum algorithms",
    "authors": [
      "Ge Yan",
      "Hongxu Chen",
      "Kaisen Pan",
      "Junchi Yan"
    ],
    "abstract": "With the arrival of the Noisy Intermediate-Scale Quantum (NISQ) era, Variational Quantum Algorithms (VQAs) have emerged as popular approaches to obtain possible quantum advantage in the relatively near future. In particular, how to effectively incorporate the common symmetries in physical systems as hard constraints in VQAs remains a critical and open question. In this paper, we revisit the Hamming Weight (HW) preserving ansatz and establish the links from ansatz to various symmetries and constraints, which both enlarges the usage of HW preserving ansatz and provides a coherent solution for constrained VQAs. Meanwhile, we utilize the quantum optimal control theory and quantum overparameterization theory to analyze the capability and expressivity of HW preserving ansatz and verify these theoretical results on unitary approximation problem. We further conduct detailed numerical experiments on two well-studied symmetry-preserving problems, namely ground state energy estimation and feature selection in machine learning. The superior performance demonstrates the efficiency and supremacy of the proposed HW preserving ansatz on constrained VQAs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SL7djdVpde",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18607,
    "title": "Controlled Text Generation via Language Model Arithmetic",
    "authors": [
      "Jasper Dekoninck",
      "Marc Fischer",
      "Luca Beurer-Kellner",
      "Martin Vechev"
    ],
    "abstract": "As Large Language Models (LLMs) are deployed more widely, customization with respect to vocabulary, style and character becomes more important. In this work we introduce model arithmetic, a novel inference framework for composing and biasing LLMs without the need for model (re)training or highly specific datasets. In addition, the framework allows for more precise control of generated text than direct prompting and prior controlled text generation (CTG) techniques. Using model arithmetic, we can express prior CTG techniques as simple formulas and naturally extend them to new and more effective formulations. Further, we show that speculative sampling, a technique for efficient LLM sampling, extends to our setting. This enables highly efficient text generation with multiple composed models with only marginal overhead over a single model. Our empirical evaluation demonstrates that model arithmetic allows fine-grained control of generated text while outperforming state-of-the-art on the task of toxicity reduction. We release an open source easy-to-use implementation of our framework at [ANONYMIZED].",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=SLw9fp4yI6",
    "arxiv_id": "2311.14479",
    "GitHub": [
      "https://github.com/eth-sri/language-model-arithmetic"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18605,
    "title": "The Devil is in the Neurons: Interpreting and Mitigating Social Biases in Language Models",
    "authors": [
      "Yan Liu",
      "Yu Liu",
      "Xiaokang Chen",
      "Pin-Yu Chen",
      "Daoguang Zan",
      "Min-Yen Kan",
      "Tsung-Yi Ho"
    ],
    "abstract": "Pre-trained Language models (PLMs) have been acknowledged to contain harmful information, such as social biases, which may cause negative social impacts or even bring catastrophic results in application. Previous works on this problem mainly focused on using black-box methods such as probing to detect and quantify social biases in PLMs by observing model outputs. As a result, previous debiasing methods mainly finetune or even pre-train PLMs on newly constructed anti-stereotypical datasets, which are high-cost. In this work, we try to unveil the mystery of social bias inside language models by introducing the concept of {\\sc Social Bias Neurons}. Specifically, we propose {\\sc Integrated Gap Gradients (IG$^2$)} to accurately pinpoint units (i.e., neurons) in a language model that can be attributed to undesirable behavior, such as social bias.  By formalizing undesirable behavior as a distributional property of language, we employ sentiment-bearing prompts to elicit classes of sensitive words (demographics) correlated with such sentiments. Our IG$^2$ thus attributes the uneven distribution for different demographics to specific Social Bias Neurons, which track the trail of unwanted behavior inside PLM units to achieve interoperability. Moreover, derived from our interpretable technique, {\\sc Bias Neuron Suppression (BNS)} is further proposed to mitigate social biases. By studying BERT, RoBERTa, and their attributable differences from debiased FairBERTa, IG$^2$ allows us to locate and suppress identified neurons, and further mitigate undesired behaviors. As measured by prior metrics from StereoSet, our model achieves a higher degree of fairness while maintaining language modeling ability with low cost\\footnote{This work contains examples that potentially implicate stereotypes, associations, and other harms that could be offensive to individuals in certain social groups.}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SQGUDc9tC8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18604,
    "title": "Social-Transmotion: Promptable Human Trajectory Prediction",
    "authors": [
      "Saeed Saadatnejad",
      "Yang Gao",
      "Kaouther Messaoud",
      "Alexandre Alahi"
    ],
    "abstract": "Accurate human trajectory prediction is crucial for applications such as autonomous vehicles, robotics, and surveillance systems. Yet, existing models often fail to fully leverage the non-verbal social cues human subconsciously communicate when navigating the space. To address this, we introduce \\textit{Social-Transmotion}, a generic model that exploits the power of transformers to handle diverse and numerous visual cues, capturing the multi-modal nature of human behavior. We translate the idea of a prompt from Natural Language Processing (NLP) to the task of human trajectory prediction, where a prompt can be a sequence of x-y coordinates on the ground, bounding boxes or body poses. This, in turn, augments trajectory data, leading to enhanced human trajectory prediction.Our model exhibits flexibility and adaptability by capturing spatiotemporal interactions between pedestrians based on the available visual cues, whether they are poses, bounding boxes, or a combination thereof.By the masking technique, we ensure our model's effectiveness even when certain visual cues are unavailable, although performance is further boosted with the presence of comprehensive visual data.We delve into the merits of using 2d versus 3d poses, and a limited set of poses. Additionally, we investigate the spatial and temporal attention map to identify which keypoints and frames of poses are vital for optimizing human trajectory prediction.Our approach is validated on multiple datasets, including JTA, JRDB, Pedestrians and Cyclists in Road Traffic, and ETH-UCY.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SQpnEfv9WH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18603,
    "title": "CABINET: Content Relevance-based Noise Reduction for Table Question Answering",
    "authors": [
      "Sohan Patnaik",
      "Heril Changwal",
      "Milan Aggarwal",
      "Sumit Bhatia",
      "Yaman Kumar",
      "Balaji Krishnamurthy"
    ],
    "abstract": "Table understanding capability of Large Language Models (LLMs) has been extensively studied through the task of question-answering (QA) over tables. Typically, only a small part of the whole table is relevant to derive the answer for a given question. The irrelevant parts act as noise and are distracting information, resulting in sub-optimal performance due to the vulnerability of LLMs to noise. To mitigate this, we propose CABINET (Content RelevAnce-Based NoIse ReductioN for TablE QuesTion-Answering) \u2013 a framework to enable LLMs to focus on relevant tabular data by suppressing extraneous information. CABINET comprises an Unsupervised Relevance Scorer (URS), trained differentially with the QA LLM, that weighs the table content based on its relevance to the input question before feeding it to the question answering LLM (QA LLM). To further aid the relevance scorer, CABINET employs a weakly supervised module that generates a parsing statement describing the criteria of rows and columns relevant to the question and highlights the content of corresponding table cells. CABINET significantly outperforms various tabular LLM baselines, as well as GPT3-based in-context learning methods, is more robust to noise, maintains outperformance on tables of varying sizes, and establishes new SoTA performance on WikiTQ, FeTaQA, and WikiSQL datasets. We release our code and datasets here.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=SQrHpTllXa",
    "arxiv_id": "2402.01155",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18601,
    "title": "VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections",
    "authors": [
      "Dongqi Fu",
      "Zhigang Hua",
      "Yan Xie",
      "Jin Fang",
      "Si Zhang",
      "Kaan Sancak",
      "Hao Wu",
      "Andrey Malevich",
      "Jingrui He",
      "Bo Long"
    ],
    "abstract": "Graph transformer has been proven as an effective graph learning method for its adoption of attention mechanism that is capable of capturing expressive representations from complex topological and feature information of graphs. Graph transformer conventionally performs dense attention (or global attention) for every pair of nodes to learn node representation vectors, resulting in quadratic computational costs that are unaffordable for large-scale graph data. Therefore, mini-batch training for graph transformers is a promising direction, but limited samples in each mini-batch can not support effective dense attention to encode informative representations.Facing this bottleneck, (1) we start by assigning each node a token list that is sampled by personalized PageRank (PPR) and then apply standard multi-head self-attention only on this list to compute its node representations. This PPR tokenization method decouples model training from complex graph topological information and makes heavy feature engineering offline and independent, such that mini-batch training of graph transformers is possible by loading each node's token list in batches. We further prove this PPR tokenization is viable as a graph convolution network with a fixed polynomial filter and jumping knowledge. However, only using personalized PageRank may limit information carried by a token list, which could not support different graph inductive biases for model training. To this end, (2) we rewire graphs by introducing multiple types of virtual connections through structure- and content-based super nodes that enable PPR tokenization to encode local and global contexts, long-range interaction, and heterophilous information into each node's token list, and then formalize our Virtual Connection Ranking based Graph Transformer (VCR-Graphormer). Overall, VCR-Graphormer only needs $O(m+klogk)$ complexity for graph tokenization as compared to $O(n^{3})$ of previous works. We also show that VCR-Graphormer outperforms the state-of-the-arts on node classification in 12 datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SUUrkC3STJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18600,
    "title": "When Semantic Segmentation Meets Frequency Aliasing",
    "authors": [
      "Linwei Chen",
      "Lin Gu",
      "Ying Fu"
    ],
    "abstract": "Despite recent advancements in semantic segmentation, where and what pixels are hard to segment remains largely unexplored.Existing research only separates an image into easy and hard regions and empirically observes the latter are associated with object boundaries.In this paper, we conduct a comprehensive analysis of hard pixel errors, categorizing them into three types: false responses, merging mistakes, and displacements. Our findings reveal a quantitative association between hard pixels and aliasing, which is distortion caused by the overlapping of frequency components in the Fourier domain during downsampling.To identify the frequencies responsible for aliasing, we propose using the equivalent sampling rate to calculate the Nyquist frequency, which marks the threshold for aliasing. Then, we introduce the aliasing score as a metric to quantify the extent of aliasing.While positively correlated with the proposed aliasing score, three types of hard pixels exhibit different patterns.Here, we propose two novel de-aliasing filter (DAF) and frequency mixing (FreqMix) modules to alleviate aliasing degradation by accurately removing or adjusting frequencies higher than the Nyquist frequency.The DAF precisely removes the frequencies responsible for aliasing before downsampling, while the FreqMix dynamically selects high-frequency components within the encoder block.Experimental results demonstrate consistent improvements in semantic segmentation and low-light instance segmentation tasks.The code will be released upon publication.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SYBdkHcXXK",
    "arxiv_id": "2403.09065",
    "GitHub": [
      "https://github.com/Linwei-Chen/Seg-Aliasing"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18586,
    "title": "CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing",
    "authors": [
      "Zhibin Gou",
      "Zhihong Shao",
      "Yeyun Gong",
      "yelong shen",
      "Yujiu Yang",
      "Nan Duan",
      "Weizhu Chen"
    ],
    "abstract": "Recent developments in large language models (LLMs) have been impressive. However, these models sometimes show inconsistencies and problematic behavior, such as hallucinating facts, generating flawed code, or creating offensive and toxic content. Unlike these models, humans typically utilize external tools to cross-check and refine their initial content, like using a search engine for fact-checking, or a code interpreter for debugging. Inspired by this observation, we introduce a framework called CRITIC that allows LLMs, which are essentially \u201cblack boxes\u201d to validate and progressively amend their own outputs in a manner similar to human interaction with tools. More specifically, starting with an initial output, CRITIC interacts with appropriate tools to evaluate certain aspects of the text, and then revises the output based on the feedback obtained during this validation process. Comprehensive evaluations involving free-form question answering, mathematical program synthesis, and toxicity reduction demonstrate that CRITIC consistently enhances the performance of LLMs. Meanwhile, our research highlights the crucial importance of external feedback in promoting the ongoing self-improvement of LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Sx038qxjek",
    "arxiv_id": "2305.11738",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18585,
    "title": "Variational Bayesian Last Layers",
    "authors": [
      "James Harrison",
      "John Willes",
      "Jasper Snoek"
    ],
    "abstract": "We introduce a deterministic variational formulation for training Bayesian last layer neural networks. This yields a sampling-free, single-pass model and loss that effectively improves uncertainty estimation. Our variational Bayesian last layer (VBLL) can be trained and evaluated with only quadratic complexity in last layer width, and is thus (nearly) computationally free to add to standard architectures. We experimentally investigate VBLLs, and show that they improve predictive accuracy, calibration, and out of distribution detection over baselines across both regression and classification. Finally, we investigate combining VBLL layers with variational Bayesian feature learning, yielding a lower variance collapsed variational inference method for Bayesian neural networks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Sx7BIiPzys",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18583,
    "title": "Neur2RO: Neural Two-Stage Robust Optimization",
    "authors": [
      "Justin Dumouchelle",
      "Esther Julien",
      "Jannis Kurtz",
      "Elias Boutros Khalil"
    ],
    "abstract": "Robust optimization provides a mathematical framework for modeling and solving decision-making problems under worst-case uncertainty.  This work addresses two-stage robust optimization (2RO) problems (also called adjustable robust optimization), wherein first-stage and second-stage decisions are made before and after uncertainty is realized, respectively.  This results in a nested min-max-min optimization problem which is extremely challenging computationally, especially when the decisions are discrete.  We propose Neur2RO, an efficient machine learning-driven instantiation of column-and-constraint generation (CCG), a classical iterative algorithm for 2RO.  Specifically, we learn to estimate the value function of the second-stage problem via a novel neural network architecture that is easy to optimize over by design. Embedding our neural network into CCG yields high-quality solutions quickly as evidenced by experiments on two 2RO benchmarks, knapsack and capital budgeting. On small or easy instances, Neur2RO recovers solutions of nearly the same quality as state-of-the-art methods but is most advantageous on large-scale instances, where it finds better solutions on average.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=T5Xb0iGCCv",
    "arxiv_id": "2310.04345",
    "GitHub": [
      "https://github.com/khalil-research/Neur2RO"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18581,
    "title": "Proximal Policy Gradient Arborescence for Quality Diversity Reinforcement Learning",
    "authors": [
      "Sumeet Batra",
      "Bryon Tjanaka",
      "Matthew Christopher Fontaine",
      "Aleksei Petrenko",
      "Stefanos Nikolaidis",
      "Gaurav S. Sukhatme"
    ],
    "abstract": "Training generally capable agents that thoroughly explore their environment andlearn new and diverse skills is a long-term goal of robot learning. Quality DiversityReinforcement Learning (QD-RL) is an emerging research area that blends thebest aspects of both fields \u2013 Quality Diversity (QD) provides a principled formof exploration and produces collections of behaviorally diverse agents, whileReinforcement Learning (RL) provides a powerful performance improvementoperator enabling generalization across tasks and dynamic environments. ExistingQD-RL approaches have been constrained to sample efficient, deterministic off-policy RL algorithms and/or evolution strategies and struggle with highly stochasticenvironments. In this work, we, for the first time, adapt on-policy RL, specificallyProximal Policy Optimization (PPO), to the Differentiable Quality Diversity (DQD)framework and propose several changes that enable efficient optimization anddiscovery of novel skills on high-dimensional, stochastic robotics tasks. Our newalgorithm, Proximal Policy Gradient Arborescence (PPGA), achieves state-of-the-art results, including a 4x improvement in best reward over baselines on thechallenging humanoid domain.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TFKIfhvdmZ",
    "arxiv_id": "2305.13795",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18580,
    "title": "Harnessing Density Ratios for Online Reinforcement Learning",
    "authors": [
      "Philip Amortila",
      "Dylan J Foster",
      "Nan Jiang",
      "Ayush Sekhari",
      "Tengyang Xie"
    ],
    "abstract": "The theories of offline and online reinforcement learning, despite having evolved in parallel, have recently started to see unification, and algorithms/concepts in one setting often have natural counterparts in the other. However, the notion of density ratio modeling, an emerging topic in offline RL, has been largely absent from online RL, perhaps for good reason: the very existence and boundedness of density ratios relies on a dataset with good coverage, but the core challenge in online RL is to collect such an exploratory dataset without having one to start.In this work we show\u2014perhaps surprisingly\u2014that density ratio-based algorithms have online counterparts. Assuming the mere existence of an exploratory distribution with good coverage, a structural condition known as coverability (Xie et al., 2023), we give an algorithm (GLOW) which performs sample-efficient online exploration under value-function and density-ratio realizability. GLOW addressesunbounded density ratios via careful use of truncation, and combines this with optimism to guide exploration. GLOW is computationally inefficient; we complement it with a more efficient counterpart, HYGLOW, for the Hybrid RL setting (Song et al., 2023) in which online RL is augmented with additional offline data. HYGLOW is derived as a special case of a novel meta-algorithm, H2O, which provides a provable black-box reduction from hybrid RL to offline RL.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=THJEa8adBn",
    "arxiv_id": "2401.09681",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18579,
    "title": "Querying Easily Flip-flopped Samples for Deep Active Learning",
    "authors": [
      "Seong Jin Cho",
      "Gwangsu Kim",
      "Junghyun Lee",
      "Jinwoo Shin",
      "Chang D. Yoo"
    ],
    "abstract": "Active learning is a machine learning paradigm that aims to improve the performance of a model by strategically selecting and querying unlabeled data. One effective selection strategy is to base it on the model's predictive uncertainty, which can be interpreted as a measure of how informative a sample is. The sample's distance to the decision boundary is a natural measure of predictive uncertainty, but it is often intractable to compute, especially for complex decision boundaries formed in multiclass classification tasks.To address this issue, this paper proposes the *least disagree metric* (LDM), defined as the smallest probability of disagreement of the predicted label, and an estimator for LDM proven to be asymptotically consistent under mild assumptions. The estimator is computationally efficient and can be easily implemented for deep learning models using parameter perturbation. The LDM-based active learning is performed by querying unlabeled data with the smallest LDM. Experimental results show that our LDM-based active learning algorithm obtains state-of-the-art *overall* performance on all considered datasets and deep architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=THUBTfSAS2",
    "arxiv_id": "2401.09787",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18578,
    "title": "Structural Inference with Dynamics Encoding and Partial Correlation Coefficients",
    "authors": [
      "Aoran Wang",
      "Jun Pang"
    ],
    "abstract": "This paper introduces a novel approach to structural inference, combining a variational dynamics encoder with partial correlation coefficients. In contrast to prior methods, our approach leverages variational inference to encode node dynamics within latent variables, and structural reconstruction relies on the calculation of partial correlation coefficients derived from these latent variables.This unique design endows our method with scalability and extends its applicability to both one-dimensional and multi-dimensional feature spaces.Furthermore, by reorganizing latent variables according to temporal steps, our approach can effectively reconstruct directed graph structures. We validate our method through extensive experimentation on twenty datasets from a benchmark dataset and biological networks. Our results showcase the superior scalability, accuracy, and versatility of our proposed approach compared to existing methods.Moreover, experiments conducted on noisy data affirm the robustness of our method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TKnzPdyeJu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18577,
    "title": "Modulate Your Spectrum in Self-Supervised Learning",
    "authors": [
      "Xi Weng",
      "Yunhao Ni",
      "Tengwei Song",
      "Jie Luo",
      "Rao Muhammad Anwer",
      "Salman Khan",
      "Fahad Khan",
      "Lei Huang"
    ],
    "abstract": "Whitening loss offers a theoretical guarantee against feature collapse in self-supervised learning (SSL) with joint embedding architectures. Typically, it involves a hard whitening approach, transforming the embedding and applying loss to the whitened output. In this work, we introduce Spectral Transformation (ST), a framework to modulate the spectrum of embedding and to seek for functions beyond whitening that can avoid dimensional collapse. We show that whitening is a special instance of ST by definition, and our empirical investigations unveil other ST instances capable of preventing collapse. Additionally, we propose a novel ST instance named IterNorm with trace loss (INTL). Theoretical analysis confirms INTL's efficacy in preventing collapse and modulating the spectrum of embedding toward equal-eigenvalues during optimization. Our experiments on ImageNet classification and COCO object detection demonstrate INTL's potential in learning superior representations. The code is available at https://github.com/winci-ai/INTL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TKqMmKlmA7",
    "arxiv_id": "2305.16789",
    "GitHub": [
      "https://github.com/winci-ai/INTL"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18575,
    "title": "Discovering Failure Modes of Text-guided Diffusion Models via Adversarial Search",
    "authors": [
      "Qihao Liu",
      "Adam Kortylewski",
      "Yutong Bai",
      "Song Bai",
      "Alan Yuille"
    ],
    "abstract": "Text-guided diffusion models (TDMs) are widely applied but can fail unexpectedly. Common failures include: _(i)_ natural-looking text prompts generating images with the wrong content, or _(ii)_ different random samples of the latent variables that generate vastly different, and even unrelated, outputs despite being conditioned on the same text prompt. In this work, we aim to study and understand the failure modes of TDMs in more detail. To achieve this, we propose SAGE, the first adversarial search method on TDMs that systematically explores the discrete prompt space and the high-dimensional latent space, to automatically discover undesirable behaviors and failure cases in image generation. We use image classifiers as surrogate loss functions during searching, and employ human inspections to validate the identified failures. For the first time, our method enables efficient exploration of both the discrete and intricate human language space and the challenging latent space, overcoming the gradient vanishing problem. Then, we demonstrate the effectiveness of SAGE on five widely used generative models and reveal four typical failure modes that have not been systematically studied before: (1) We find a variety of natural text prompts that generate images failing to capture the semantics of input texts. We further discuss the underlying causes and potential solutions based on the results. (2) We find regions in the latent space that lead to distorted images independent of the text prompt, suggesting that parts of the latent space are not well-structured. (3) We also find latent samples that result in natural-looking images unrelated to the text prompt, implying a possible misalignment between the latent and prompt spaces. (4) By appending a single adversarial token embedding to any input prompts, we can generate a variety of specified target objects, with minimal impact on CLIP scores, demonstrating the fragility of language representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TOWdQQgMJY",
    "arxiv_id": "2306.00974",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18573,
    "title": "Feature-aligned N-BEATS with Sinkhorn divergence",
    "authors": [
      "Joonhun Lee",
      "Myeongho Jeon",
      "Myungjoo Kang",
      "Kyunghyun Park"
    ],
    "abstract": "We propose Feature-aligned N-BEATS as a domain-generalized time series forecasting model. It is a nontrivial extension of N-BEATS with doubly residual stacking principle (Oreshkin et al. [45]) into a representation learning framework. In particular, it revolves around marginal feature probability measures induced by the intricate composition of residual and feature extracting operators of N-BEATS in each stack and aligns them stack-wise via an approximate of an optimal transport distance referred to as the Sinkhorn divergence. The training loss consists of an empirical risk minimization from multiple source domains, i.e., forecasting loss, and an alignment loss calculated with the Sinkhorn divergence, which allows the model to learn invariant features stack-wise across multiple source data sequences while retaining N-BEATS\u2019s interpretable design and forecasting power. Comprehensive experimental evaluations with ablation studies are provided and the corresponding results demonstrate the proposed model\u2019s forecasting and generalization capabilities.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TS8HoIWAPQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18571,
    "title": "Distributionally Robust Optimization with Bias and Variance Reduction",
    "authors": [
      "Ronak Mehta",
      "Vincent Roulet",
      "Krishna Pillutla",
      "Zaid Harchaoui"
    ],
    "abstract": "We consider the distributionally robust (DR) optimization problem with spectral risk-based uncertainty set and $f$-divergence penalty. This formulation includes common risk-sensitive learning objectives such as regularized condition value-at-risk (CVaR) and average top-$k$ loss. We present Prospect, a stochastic gradient-based algorithm that only requires tuning a single learning rate hyperparameter, and prove that it enjoys linear convergence for smooth regularized losses. This contrasts with previous algorithms that either require tuning multiple hyperparameters or potentially fail to converge due to biased gradient estimates or inadequate regularization. Empirically, we show that Prospect can converge 2-3x faster than baselines such as SGD and stochastic saddle-point methods on distribution shift and fairness benchmarks spanning tabular, vision, and language domains.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TTrzgEZt9s",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18570,
    "title": "Zeroth-Order Optimization Meets Human Feedback: Provable Learning via Ranking Oracles",
    "authors": [
      "Zhiwei Tang",
      "Dmitry Rybin",
      "Tsung-Hui Chang"
    ],
    "abstract": "In this study, we delve into an emerging optimization challenge involving a black-box objective function that can only be gauged via a ranking oracle\u2014a situation frequently encountered in real-world scenarios, especially when the function is evaluated by human judges. A prominent instance of such a situation is Reinforcement Learning with Human Feedback (RLHF), an approach recently employed to enhance the performance of Large Language Models (LLMs) using human guidance [Ouyang et al. 2022, Liu et al. 2023, OpenAI et al. 2022, Bai et al. 2022]. We introduce ZO-RankSGD, an innovative zeroth-order optimization algorithm designed to tackle this optimization problem, accompanied by theoretical assurances. Our algorithm utilizes a novel rank-based random estimator to determine the descent direction and guarantees convergence to a stationary point. Moreover, ZO-RankSGD is readily applicable to policy optimization problems in Reinforcement Learning (RL), particularly when only ranking oracles for the episode reward are available. Last but not least, we demonstrate the effectiveness of ZO-RankSGD in a novel application: improving the quality of images generated by a diffusion generative model with human ranking feedback. Throughout experiments, we found that ZO-RankSGD can significantly enhance the detail of generated images with only a few rounds of human feedback. Overall, our work advances the field of zeroth-order optimization by addressing the problem of optimizing functions with only ranking feedback, and offers a new and effective approach for aligning Artificial Intelligence (AI) with human intentions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TVDUVpgu9s",
    "arxiv_id": "2303.03751",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18569,
    "title": "Towards Seamless Adaptation of Pre-trained Models for Visual Place Recognition",
    "authors": [
      "Feng Lu",
      "Lijun Zhang",
      "Xiangyuan Lan",
      "Shuting Dong",
      "Yaowei Wang",
      "Chun Yuan"
    ],
    "abstract": "Recent studies show that vision models pre-trained in generic visual learning tasks with large-scale data can provide useful feature representations for a wide range of visual perception problems. However, few attempts have been made to exploit pre-trained foundation models in visual place recognition (VPR). Due to the inherent difference in training objectives and data between the tasks of model pre-training and VPR, how to bridge the gap and fully unleash the capability of pre-trained models for VPR is still a key issue to address. To this end, we propose a novel method to realize seamless adaptation of pre-trained models for VPR. Specifically, to obtain both global and local features that focus on salient landmarks for discriminating places, we design a hybrid adaptation method to achieve both global and local adaptation efficiently, in which only lightweight adapters are tuned without adjusting the pre-trained model. Besides, to guide effective adaptation, we propose a mutual nearest neighbor local feature loss, which ensures proper dense local features are produced for local matching and avoids time-consuming spatial verification in re-ranking. Experimental results show that our method outperforms the state-of-the-art methods with less training data and training time. Our method ranks 1st on the leaderboard of MSLS place recognition challenge, and uses about only 3% retrieval runtime of the two-stage VPR method with RANSAC-based spatial verification. The code will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TVg6hlfsKa",
    "arxiv_id": "2402.14505",
    "GitHub": [
      "https://github.com/Lu-Feng/SelaVPR"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18568,
    "title": "Enhancing Human-AI Collaboration Through Logic-Guided Reasoning",
    "authors": [
      "Chengzhi Cao",
      "Yinghao Fu",
      "Sheng Xu",
      "Ruimao Zhang",
      "Shuang Li"
    ],
    "abstract": "We present a systematic framework designed to enhance human-robot perception and collaboration through the integration of logical rules and Theory of Mind (ToM). Logical rules provide interpretable predictions and generalize well across diverse tasks, making them valuable for learning and decision-making. Leveraging the ToM for understanding others' mental states, our approach facilitates effective collaboration. In this paper, we employ logic rules derived from observational data to infer human goals and guide human-like agents. These rules are treated as latent variables, and a rule encoder is trained alongside a multi-agent system in the robot's mind. We assess the posterior distribution of latent rules using learned embeddings, representing entities and relations. Confidence scores for each rule indicate their consistency with observed data. Then, we employ a hierarchical reinforcement learning model with ToM to plan robot actions for assisting humans. Extensive experiments validate each component of our framework, and results on multiple benchmarks demonstrate that our model outperforms the majority of existing approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TWC4gLoAxY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18567,
    "title": "Learning Semantic Proxies from Visual Prompts for Parameter-Efficient Fine-Tuning in Deep Metric Learning",
    "authors": [
      "Li Ren",
      "Chen Chen",
      "Liqiang Wang",
      "Kien A. Hua"
    ],
    "abstract": "Deep Metric Learning (DML) has long attracted the attention of the machine learning community as a key objective. Existing solutions concentrate on fine-tuning the pre-trained models on conventional image datasets. As a result of the success of recent pre-trained models derived from larger-scale datasets, it is challenging to adapt the model to the DML tasks in the local data domain while retaining the previously gained knowledge. In this paper, we investigate parameter-efficient methods for fine-tuning the pre-trained model for DML tasks. In particular, we propose a novel and effective framework based on learning Visual Prompts (VPT) in the pre-trained Vision Transformers (ViT). Based on the conventional proxy-based DML paradigm, we augment the proxy by incorporating the semantic information from the input image and the ViT, in which we optimize the visual prompts for each class. We demonstrate that our new approximations with semantic information are superior to representative capabilities, thereby improving metric learning performance. We conduct extensive experiments to demonstrate that our proposed framework is superior and efficient by evaluating popular DML benchmarks. In particular, we demonstrate that our fine-tuning method achieves comparable or even better performance than recent state-of-the-art full fine-tuning works of DML while tuning only a small percentage of total parameters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TWVMVPx2wO",
    "arxiv_id": "2402.02340",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18566,
    "title": "Towards Transparent Time Series Forecasting",
    "authors": [
      "Krzysztof Kacprzyk",
      "Tennison Liu",
      "Mihaela van der Schaar"
    ],
    "abstract": "Transparent machine learning (ML) models are essential for ensuring interpretability and trustworthiness in decision-making systems, particularly in high-stakes domains such as healthcare, finance, and criminal justice. While transparent machine learning models have been proposed for classification and regression, time series forecasting presents some unique challenges for ensuring transparency. In particular, currently used bottom-up approaches that focus on the values of the time series at specific time points (usually regularly spaced) do not provide a holistic understanding of the entire time series. This limits the applicability of ML in many critical areas. To open up these domains for ML, we propose a top-down framework of bi-level transparency, which involves understanding the higher-level trends and the lower-level properties of the predicted time series. Applying this framework, we develop TIMEVIEW, a transparent ML model for time series forecasting based on static features, complemented with an interactive visualization tool. Through a series of experiments, we demonstrate the efficacy and interpretability of our approach, paving the way for more transparent and reliable applications of ML in various domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TYXtXLYHpR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18565,
    "title": "Momentum Benefits Non-iid Federated Learning Simply and Provably",
    "authors": [
      "Ziheng Cheng",
      "Xinmeng Huang",
      "Pengfei Wu",
      "Kun Yuan"
    ],
    "abstract": "Federated learning is a powerful paradigm for large-scale machine learning, but itfaces significant challenges due to unreliable network connections, slow commu-nication, and substantial data heterogeneity across clients. FedAvg and SCAFFOLD are two prominent algorithms to address these challenges. In particular,FedAvg employs multiple local updates before communicating with a centralserver, while SCAFFOLD maintains a control variable on each client to compen-sate for \u201cclient drift\u201d in its local updates. Various methods have been proposedto enhance the convergence of these two algorithms, but they either make imprac-tical adjustments to algorithmic structure, or rely on the assumption of boundeddata heterogeneity. This paper explores the utilization of momentum to enhancethe performance of FedAvg and SCAFFOLD. When all clients participate in thetraining process, we demonstrate that incorporating momentum allows FedAvgto converge without relying on the assumption of bounded data heterogeneity evenusing a constant local learning rate. This is novel and fairly suprising as existinganalyses for FedAvg require bounded data heterogeneity even with diminishinglocal learning rates. In partial client participation, we show that momentum en-ables SCAFFOLD to converge provably faster without imposing any additionalassumptions. Furthermore, we use momentum to develop new variance-reducedextensions of FedAvg and SCAFFOLD, which exhibit state-of-the-art conver-gence rates. Our experimental results support all theoretical findings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TdhkAcXkRi",
    "arxiv_id": "2306.16504",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18564,
    "title": "Patched Denoising Diffusion Models For High-Resolution Image Synthesis",
    "authors": [
      "Zheng Ding",
      "Mengqi Zhang",
      "Jiajun Wu",
      "Zhuowen Tu"
    ],
    "abstract": "We propose an effective denoising diffusion model for generating high-resolution images (e.g., 1024$\\times$512), trained on small-size image patches (e.g., 64$\\times$64). We name our algorithm Patch-DM, in which a new feature collage strategy is designed to avoid the boundary artifact when synthesizing large-size images. Feature collage systematically crops and combines partial features of the neighboring patches to predict the features of a shifted image patch, allowing the seamless generation of the entire image due to the overlap in the patch feature space. Patch-DM produces high-quality image synthesis results on our newly collected dataset of nature images (1024$\\times$512), as well as on standard benchmarks of LHQ(1024$\\times$ 1024), FFHQ(1024$\\times$ 1024) and on other datasets with smaller sizes (256$\\times$256), including LSUN-Bedroom, LSUN-Church, and FFHQ. We compare our method with previous patch-based generation methods and achieve state-of-the-art FID scores on all six datasets. Further, Patch-DM also reduces memory complexity compared to the classic diffusion models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TgSRPRz8cI",
    "arxiv_id": "2308.01316",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18563,
    "title": "DoLa: Decoding by Contrasting Layers Improves Factuality in Large Language Models",
    "authors": [
      "Yung-Sung Chuang",
      "Yujia Xie",
      "Hongyin Luo",
      "Yoon Kim",
      "James R. Glass",
      "Pengcheng He"
    ],
    "abstract": "Despite their impressive capabilities, large language models (LLMs) are prone to hallucinations, i.e., generating content that deviates from facts seen during pretraining. We propose a simple decoding strategy for reducing hallucinations with pretrained LLMs that does not require conditioning on retrieved external knowledge nor additional fine-tuning. Our approach obtains the next-token distribution by contrasting the differences in logits obtained from projecting the later layers versus earlier layers to the vocabulary space, exploiting the fact that factual knowledge in an LLMs has generally been shown to be localized to particular transformer layers. We find that this **D**ecoding by C**o**ntrasting **La**yers (DoLa) approach is able to better surface factual knowledge and reduce the generation of incorrect facts. DoLa consistently improves the truthfulness across multiple choices tasks and open-ended generation tasks, for example improving the performance of LLaMA family models on TruthfulQA by 12-17% absolute points, demonstrating its potential in making LLMs reliably generate truthful facts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Th6NyL07na",
    "arxiv_id": "2309.03883",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18562,
    "title": "Overthinking the Truth: Understanding how Language Models Process False Demonstrations",
    "authors": [
      "Danny Halawi",
      "Jean-Stanislas Denain",
      "Jacob Steinhardt"
    ],
    "abstract": "Modern language models can imitate complex patterns through few-shot learning, enabling them to complete challenging tasks without fine-tuning. However, imitation can also lead models to reproduce inaccuracies or harmful content if present in the context. We study harmful imitation through the lens of a model\u2019s internal representations, and identify two related phenomena: overthinking and false induction heads. The first phenomenon, overthinking, appears when we decode predictions from intermediate layers, given correct vs. incorrect few-shot demonstrations. At early layers, both demonstrations induce similar model behavior, but the behavior diverges sharply at some \u201ccritical layer\u201d, after which the accuracy given incorrect demonstrations progressively decreases. The second phenomenon, false induction heads, are a possible mechanistic cause of overthinking: these are heads in late layers that attend to and copy false information from previous demonstrations, and whose ablation reduces overthinking. Beyond scientific understanding, our results suggest that studying intermediate model computations could be a promising avenue for understanding and guarding against harmful model behaviors.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Tigr1kMDZy",
    "arxiv_id": "2307.09476",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18561,
    "title": "Waxing-and-Waning: a Generic Similarity-based Framework for Efficient Self-Supervised Learning",
    "authors": [
      "Sheng Li",
      "Chao Wu",
      "Ao Li",
      "Yanzhi Wang",
      "Xulong Tang",
      "Geng Yuan"
    ],
    "abstract": "Deep Neural Networks (DNNs), essential for diverse applications such as visual recognition and eldercare, often require a large amount of labeled data for training, making widespread deployment of DNNs a challenging task. Self-supervised learning (SSL) emerges as a promising approach, which leverages inherent patterns within data through diverse augmentations to train models without explicit labels. However, while SSL has shown notable advancements in accuracy, its high computation costs remain a daunting impediment, particularly for resource-constrained platforms. To address this problem, we introduce SimWnW, a similarity-based efficient self-supervised learning framework. By strategically removing less important regions in augmented images and feature maps, SimWnW not only reduces computation costs but also eliminates irrelevant features that might slow down the learning process, thereby accelerating model convergence. The experimental results show that SimWnW effectively reduces the amount of computation costs in self-supervised model training without compromising accuracy. Specifically, SimWnW yields up to 54\\% and 51\\% computation savings in training from scratch and transfer learning tasks, respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TilcG5C8bN",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18559,
    "title": "Probabilistically Rewired Message-Passing Neural Networks",
    "authors": [
      "Chendi Qian",
      "Andrei Manolache",
      "Kareem Ahmed",
      "Zhe Zeng",
      "Guy Van den Broeck",
      "Mathias Niepert",
      "Christopher Morris"
    ],
    "abstract": "Message-passing graph neural networks (MPNNs) emerged as powerful tools for processing graph-structured input. However, they operate on a fixed input graph structure, ignoring potential noise and missing information. Furthermore, their local aggregation mechanism can lead to problems such as over-squashing and limited expressive power in capturing relevant graph structures. Existing solutions to these challenges have primarily relied on heuristic methods, often disregarding the underlying data distribution. Hence, devising principled approaches for learning to infer graph structures relevant to the given prediction task remains an open challenge. In this work, leveraging recent progress in exact and differentiable k-subset sampling, we devise probabilistically rewired MPNNs (PR-MPNNs), which learn to add relevant edges while omitting less beneficial ones. For the first time, our theoretical analysis explores how PR-MPNNs enhance expressive power, and we identify precise conditions under which they outperform purely randomized approaches. Empirically, we demonstrate that our approach effectively mitigates issues like over-squashing and under-reaching. In addition, on established real-world datasets, our method exhibits competitive or superior predictive performance compared to traditional MPNN models and recent graph transformer architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Tj6Wcx7gVk",
    "arxiv_id": "2310.02156",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18558,
    "title": "Learning Hierarchical World Models with Adaptive Temporal Abstractions from Discrete Latent Dynamics",
    "authors": [
      "Christian Gumbsch",
      "Noor Sajid",
      "Georg Martius",
      "Martin V. Butz"
    ],
    "abstract": "Hierarchical world models can significantly improve model-based reinforcement learning (MBRL) and planning by enabling reasoning across multiple time scales. Nonetheless, the majority of state-of-the-art MBRL methods still employ flat, non-hierarchical models. We propose Temporal Hierarchies from Invariant Context Kernels (THICK), an algorithm that learns a world model hierarchy via discrete latent dynamics. The lower level of THICK updates parts of its latent state sparsely in time, forming invariant contexts. The higher level exclusively predicts situations involving context state changes. Our experiments demonstrate that THICK learns categorical, interpretable, temporal abstractions on the high level, while maintaining precise low-level predictions. Furthermore, we show that the emergent hierarchical predictive model seamlessly enhances the abilities of MBRL or planning methods. We believe that THICK contributes to the further development of hierarchical, context-conditioned, event-predictive world models that can enhance planning and reasoning abilities and produce more human-like behavior.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TjCDNssXKU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18557,
    "title": "Doubly Robust Proximal Causal Learning for Continuous Treatments",
    "authors": [
      "Yong Wu",
      "Yanwei Fu",
      "Shouyan Wang",
      "Xinwei Sun"
    ],
    "abstract": "Proximal causal learning is a powerful framework for identifying the causal effect under the existence of unmeasured confounders. Within this framework, the doubly robust (DR) estimator was derived and has shown its effectiveness in estimation, especially when the model assumption is violated. However, the current form of the DR estimator is restricted to binary treatments, while the treatments can be continuous in many real-world applications. The primary obstacle to continuous treatments resides in the delta function present in the original DR estimator, making it infeasible in causal effect estimation and introducing a heavy computational burden in nuisance function estimation. To address these challenges, we propose a kernel-based DR estimator that can well handle continuous treatments for proximal causal learning. Equipped with its smoothness, we show that its oracle form is a consistent approximation of the influence function. Further, we propose a new approach to efficiently solve the nuisance functions. We then provide a comprehensive convergence analysis in terms of the mean square error. We demonstrate the utility of our estimator on synthetic datasets and real-world applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TjGJFkU3xL",
    "arxiv_id": "2309.12819",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18553,
    "title": "Generative Adversarial Equilibrium Solvers",
    "authors": [
      "Denizalp Goktas",
      "David C. Parkes",
      "Ian Gemp",
      "Luke Marris",
      "Georgios Piliouras",
      "Romuald Elie",
      "Guy Lever",
      "Andrea Tacchetti"
    ],
    "abstract": "We introduce the use of generative adversarial learning to compute equilibria in general game-theoretic settings, specifically the generalized Nash equilibrium (GNE) in pseudo-games, and its specific instantiation as the competitive equilibrium (CE) in Arrow-Debreu competitive economies. Pseudo-games are a generalization of games in which players' actions affect not only the payoffs of other players but also their feasible action spaces. Although the computation of GNE and CE is intractable in the worst-case, i.e., PPAD-hard, in practice, many applications only require solutions with high accuracy in expectation over a distribution of problem instances. We introduce Generative Adversarial Equilibrium Solvers (GAES): a family of generative adversarial neural networks that can learn GNE and CE from only a sample of problem instances. We provide computational and sample complexity bounds for Lipschitz-smooth function approximators in a large class of concave pseudo-games, and apply the framework to finding Nash equilibria in normal-form games, CE in Arrow-Debreu competitive economies, and GNE in an environmental economic model of the Kyoto mechanism.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TlyiaPXaVN",
    "arxiv_id": "2302.06607",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18549,
    "title": "Plug-and-Play: An Efficient Post-training Pruning Method for Large Language Models",
    "authors": [
      "Yingtao Zhang",
      "Haoli Bai",
      "Haokun Lin",
      "Jialin Zhao",
      "Lu Hou",
      "Carlo Vittorio Cannistraci"
    ],
    "abstract": "With the rapid growth of large language models (LLMs), there is increasing demand for memory and computation for LLMs. Recent efforts on post-training pruning of LLMs aim to reduce the model size and computation, yet the performance is still sub-optimal. In this paper, we present a plug-and-play solution for post-training pruning of LLMs.The proposed solution has two innovative components: 1) **Relative Importance and Activations** (RIA), a new pruning metric that jointly considers the weight and activations efficiently on LLMs; and 2) **Channel Permutation**, a new approach to maximally preserve important weights under N:M sparsity.The proposed two components can be readily combined to further enhance the N:M structuredly pruned LLMs.Our empirical experiments show that RIA alone can already surpass all existing post-training pruning methods on prevalent LLMs, e.g., LLaMA ranging from 7B to 65B. Furthermore, N:M structured pruning with channel permutation can even outperform the original LLaMA2 70B on zero-shot tasks, together with practical speed-up on specific hardware.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Tr0lPx9woF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18547,
    "title": "Large Content And Behavior Models To Understand, Simulate, And Optimize Content And Behavior",
    "authors": [
      "Ashmit Khandelwal",
      "Aditya Agrawal",
      "Aanisha Bhattacharyya",
      "Yaman Kumar",
      "Somesh Singh",
      "Uttaran Bhattacharya",
      "Ishita Dasgupta",
      "Stefano Petrangeli",
      "Rajiv Ratn Shah",
      "Changyou Chen",
      "Balaji Krishnamurthy"
    ],
    "abstract": "Shannon, in his seminal paper introducing information theory, divided the communication into three levels: technical, semantic, and effectivenss. While the technical level is concerned with accurate reconstruction of transmitted symbols, the semantic and effectiveness levels deal with the inferred meaning and its effect on the receiver. Thanks to telecommunications, the first level problem has produced great advances like the internet. Large Language Models (LLMs) make some progress towards the second goal, but the third level still remains largely untouched. The third problem deals with predicting and optimizing communication for desired receiver behavior. LLMs, while showing wide generalization capabilities across a wide range of tasks, are unable to solve for this. One reason for the underperformance could be a lack of ``behavior tokens'' in LLMs' training corpora. Behavior tokens define receiver behavior over a communication, such as shares, likes, clicks, purchases, retweets, \\textit{etc}. While preprocessing data for LLM training, behavior tokens are often removed from the corpora as noise. Therefore, in this paper, we make some initial progress towards reintroducing behavior tokens in LLM training. The trained models, other than showing similar performance to LLMs on content understanding tasks, show generalization capabilities on behavior simulation, content simulation, behavior understanding, and behavior domain adaptation. Using a wide range of tasks on two corpora, we show results on all these capabilities. We call these models Large Content and Behavior Models (LCBMs). Further, to spur more research on LCBMs, we release our new Content Behavior Corpus (CBC), a repository containing communicator, message, and corresponding receiver behavior.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TrKq4Wlwcz",
    "arxiv_id": "2309.00359",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18545,
    "title": "Training Bayesian Neural Networks with Sparse Subspace Variational Inference",
    "authors": [
      "Junbo Li",
      "Zichen Miao",
      "Qiang Qiu",
      "Ruqi Zhang"
    ],
    "abstract": "Bayesian neural networks (BNNs) offer uncertainty quantification but come with the downside of substantially increased training and inference costs. Sparse BNNs have been investigated for efficient inference, typically by either slowly introducing sparsity throughout the training or by post-training compression of dense BNNs. The dilemma of how to cut down massive training costs remains, particularly given the requirement to learn about the uncertainty. To solve this challenge, we introduce Sparse Subspace Variational Inference (SSVI), the first fully sparse BNN framework that maintains a consistently sparse Bayesian model throughout the training and inference phases. Starting from a randomly initialized low-dimensional sparse subspace, our approach alternately optimizes the sparse subspace basis selection and its associated parameters. While basis selection is characterized as a non-differentiable problem, we approximate the optimal solution with a removal-and-addition strategy, guided by novel criteria based on weight distribution statistics. Our extensive experiments show that SSVI sets new benchmarks in crafting sparse BNNs, achieving, for instance, a 10-20\u00d7 compression in model size with under 3\\% performance drop, and up to 20\u00d7 FLOPs reduction during training. Remarkably, SSVI also demonstrates enhanced robustness to hyperparameters, reducing the need for intricate tuning in VI and occasionally even surpassing VI-trained dense BNNs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TskzCtpMEO",
    "arxiv_id": "2402.11025",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18544,
    "title": "TEST: Text Prototype Aligned Embedding to Activate LLM's Ability for Time Series",
    "authors": [
      "Chenxi Sun",
      "Hongyan Li",
      "Yaliang Li",
      "Shenda Hong"
    ],
    "abstract": "This work summarizes two ways to accomplish Time-Series (TS) tasks in today's Large Language Model (LLM) context: LLM-for-TS (model-centric) designs and trains a fundamental large model, or fine-tunes a pre-trained LLM for TS data; TS-for-LLM (data-centric) converts TS into a model-friendly representation to enable the pre-trained LLM to handle TS data. Given the lack of data, limited resources, semantic context requirements, and so on, this work focuses on TS-for-LLM, where we aim to activate LLM's ability for TS data by designing a TS embedding method suitable for LLM. The proposed method is named TEST. It first tokenizes TS, builds an encoder to embed TS via instance-wise, feature-wise, and text-prototype-aligned contrast, where the TS embedding space is aligned to LLM\u2019s embedding layer space, then creates soft prompts to make LLM more open to that embeddings, and finally implements TS tasks using the frozen LLM. We also demonstrate the feasibility of TS-for-LLM through theory and experiments. Experiments are carried out on TS classification, forecasting, and representation tasks using eight frozen LLMs with various structures and sizes. The results show that the pre-trained LLM with TEST strategy can achieve better or comparable performance than today's SOTA TS models, and offers benefits for few-shot and generalization. By treating LLM as the pattern machine, TEST can endow LLM's ability to process TS data without compromising language ability. We hope that this study will serve as a foundation for future work to support TS+LLM progress.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Tuh4nZVb0g",
    "arxiv_id": "2308.08241",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18543,
    "title": "PubDef: Defending Against Transfer Attacks From Public Models",
    "authors": [
      "Chawin Sitawarin",
      "Jaewon Chang",
      "David Huang",
      "Wesson Altoyan",
      "David Wagner"
    ],
    "abstract": "Adversarial attacks have been a looming and unaddressed threat in the industry. However, through a decade-long history of the robustness evaluation literature, we have learned that mounting a strong or optimal attack is challenging. It requires both machine learning and domain expertise. In other words, the white-box threat model, religiously assumed by a large majority of the past literature, is unrealistic. In this paper, we propose a new practical threat model where the adversary relies on transfer attacks through publicly available surrogate models. We argue that this setting will become the most prevalent for security-sensitive applications in the future. We evaluate the transfer attacks in this setting and propose a specialized defense method based on a game-theoretic perspective. The defenses are evaluated under 24 public models and 11 attack algorithms across three datasets (CIFAR-10, CIFAR-100, and ImageNet). Under this threat model, our defense, PubDef, outperforms the state-of-the-art white-box adversarial training by a large margin with almost no loss in the normal accuracy. For instance, on ImageNet, our defense achieves 62% accuracy under the strongest transfer attack vs only 36% of the best adversarially trained model. Its accuracy when not under attack is only 2% lower than that of an undefended model (78% vs 80%).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Tvwf4Vsi5F",
    "arxiv_id": "2310.17645",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18542,
    "title": "Towards Reliable and Efficient Backdoor Trigger Inversion via Decoupling Benign Features",
    "authors": [
      "Xiong Xu",
      "Kunzhe Huang",
      "Yiming Li",
      "Zhan Qin",
      "Kui Ren"
    ],
    "abstract": "Recent studies revealed that using third-party models may lead to backdoor threats, where adversaries can maliciously manipulate model predictions based on backdoors implanted during model training. Arguably, backdoor trigger inversion (BTI), which generates trigger patterns of given benign samples for a backdoored model, is the most critical module for backdoor defenses used in these scenarios. With BTI, defenders can remove backdoors by fine-tuning based on generated poisoned samples with ground-truth labels or deactivate backdoors by removing trigger patterns during the inference process. However, we find that existing BTI methods suffer from relatively poor performance, $i.e.$, their generated triggers are significantly different from the ones used by the adversaries even in the feature space. We argue that it is mostly because existing methods require to 'extract' backdoor features at first, while this task is very difficult since defenders have no information ($e.g.$, trigger pattern or target label) about poisoned samples. In this paper, we explore BTI from another perspective where we decouple benign features instead of decoupling backdoor features directly. Specifically, our method consists of two main steps, including \\textbf{(1)} decoupling benign features and \\textbf{(2)} trigger inversion by minimizing the differences between benign samples and their generated poisoned version in decoupled benign features while maximizing the differences in remaining backdoor features. In particular, our method is more efficient since it doesn't need to `scan' all classes to speculate the target label, as required by existing BTI. We also exploit our BTI module to further design backdoor-removal and pre-processing-based defenses. Extensive experiments on benchmark datasets demonstrate that our defenses can reach state-of-the-art performances.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Tw9wemV6cb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18541,
    "title": "Multi-task Learning with 3D-Aware Regularization",
    "authors": [
      "Wei-Hong Li",
      "Steven McDonagh",
      "Ales Leonardis",
      "Hakan Bilen"
    ],
    "abstract": "Deep neural networks have become a standard building block for designing models that can perform multiple dense computer vision tasks such as depth estimation and semantic segmentation thanks to their ability to capture complex correlations in high dimensional feature space across tasks. However, the cross-task correlations that are learned in the unstructured feature space can be extremely noisy and susceptible to overfitting, consequently hurting performance. We propose to address this problem by introducing a structured 3D-aware regularizer which interfaces multiple tasks through the projection of features extracted from an image encoder to a shared 3D feature space and decodes them into their task output space through differentiable rendering. We show that the proposed method is architecture agnostic and can be plugged into various prior multi-task backbones to improve their performance; as we evidence using standard benchmarks NYUv2 and PASCAL-Context.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TwBY17Hgiy",
    "arxiv_id": "2310.00986",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18540,
    "title": "Safe RLHF: Safe Reinforcement Learning from Human Feedback",
    "authors": [
      "Josef Dai",
      "Xuehai Pan",
      "Ruiyang Sun",
      "Jiaming Ji",
      "Xinbo Xu",
      "Mickel Liu",
      "Yizhou Wang",
      "Yaodong Yang"
    ],
    "abstract": "With the development of large language models (LLMs), striking a balance between the performance and safety of AI systems has never been more critical. However, the inherent tension between the objectives of helpfulness and harmlessness presents a significant challenge during LLM training. To address this issue, we propose Safe Reinforcement Learning from Human Feedback (Safe RLHF), a novel algorithm for human value alignment. Safe RLHF explicitly decouples human preferences regarding helpfulness and harmlessness, effectively avoiding the crowd workers' confusion about the tension and allowing us to train separate reward and cost models. We formalize the safety concern of LLMs as an optimization task of maximizing the reward function while satisfying specified cost constraints. Leveraging the Lagrangian method to solve this constrained problem, Safe RLHF dynamically adjusts the balance between the two objectives during fine-tuning. Through a three-round fine-tuning using Safe RLHF, we demonstrate a superior ability to mitigate harmful responses while enhancing model performance compared to existing value-aligned algorithms. Experimentally, we fine-tuned the Alpaca-7B using Safe RLHF and aligned it with collected human preferences, significantly improving its helpfulness and harmlessness according to human evaluations.Warning: This paper contains example data that may be offensive or harmful.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TyFrPOKYXw",
    "arxiv_id": "2310.12773",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18538,
    "title": "Scaling Laws for Associative Memories",
    "authors": [
      "Vivien Cabannes",
      "Elvis Dohmatob",
      "Alberto Bietti"
    ],
    "abstract": "Learning arguably involves the discovery and memorization of abstract rules. The aim of this paper is to study associative memory mechanisms. Our model is based on high-dimensional matrices consisting of outer products of embeddings, which relates to the inner layers of transformer language models. We derive precise scaling laws with respect to sample size and parameter size, and discuss the statistical efficiency of different estimators, including optimization-based algorithms. We provide extensive numerical experiments to validate and interpret theoretical results, including fine-grained visualizations of the stored memory associations.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Tzh6xAJSll",
    "arxiv_id": "2310.02984",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18535,
    "title": "Provable Benefits of Multi-task RL under Non-Markovian Decision Making Processes",
    "authors": [
      "Ruiquan Huang",
      "Yuan Cheng",
      "Jing Yang",
      "Vincent Tan",
      "Yingbin Liang"
    ],
    "abstract": "In multi-task reinforcement learning (RL) under Markov decision processes (MDPs), the presence of shared latent structures among multiple MDPs has been shown to yield significant benefits to the sample efficiency compared to single-task RL. In this paper, we investigate whether such a benefit can extend to more general sequential decision making problems, such as partially observable MDPs (POMDPs) and more general predictive state representations (PSRs). The main challenge here is that the large and complex model space makes it hard to identify what types of common latent structure of multi-task PSRs can reduce the model complexity and improve sample efficiency. To this end, we posit a {\\em joint model class} for tasks and use the notion of $\\eta$-bracketing number to quantify its complexity; this number also serves as a general metric  to capture the similarity of tasks and thus determines the benefit of multi-task over single-task RL. We first study  upstream multi-task learning over PSRs, in which all tasks share the same observation and action spaces. We propose a provably efficient algorithm  UMT-PSR for finding near-optimal policies for all PSRs, and demonstrate that the advantage of multi-task learning manifests if the joint model class of PSRs has a smaller $\\eta$-bracketing number compared to that of individual single-task learning. We also provide several example multi-task PSRs with small $\\eta$-bracketing numbers, which reap the benefits of multi-task learning. We further investigate downstream learning, in which the agent needs to learn a new target task that shares some commonalities with the upstream tasks via a similarity constraint. By exploiting the learned PSRs from the upstream, we develop a sample-efficient algorithm that provably finds a near-optimal policy. Upon specialization to the examples used to elucidate the $\\eta$-bracketing numbers, our downstream results further highlight the benefit compared to directly learning the target PSR without upstream information. Ours is the first theoretical study that quantifies the benefits of multi-task RL with PSRs over its single-task counterpart.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=U6Qulbv2qT",
    "arxiv_id": "2310.13550",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18534,
    "title": "3D-Aware Hypothesis & Verification for Generalizable Relative Object Pose Estimation",
    "authors": [
      "Chen Zhao",
      "Tong Zhang",
      "Mathieu Salzmann"
    ],
    "abstract": "Prior methods that tackle the problem of generalizable object pose estimation highly rely on having dense views of the unseen object. By contrast, we address the scenario where only a single reference view of the object is available. Our goal then is to estimate the relative object pose between this reference view and a query image that depicts the object in a different pose. In this scenario, robust generalization is imperative due to the presence of unseen objects during testing and the large-scale object pose variation between the reference and the query. To this end, we present a new hypothesis-and-verification framework, in which we generate and evaluate multiple pose hypotheses, ultimately selecting the most reliable one as the relative object pose. To measure reliability, we introduce a 3D-aware verification that explicitly applies 3D transformations to the 3D object representations learned from the two input images. Our comprehensive experiments on the Objaverse, LINEMOD, and CO3D datasets evidence the superior accuracy of our approach in relative pose estimation and its robustness in large-scale pose variations, when dealing with unseen objects.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=U6hEOZlDf5",
    "arxiv_id": "2310.03534",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18532,
    "title": "CALICO: Self-Supervised Camera-LiDAR Contrastive Pre-training for BEV Perception",
    "authors": [
      "Jiachen Sun",
      "Haizhong Zheng",
      "Qingzhao Zhang",
      "Atul Prakash",
      "Zhuoqing Mao",
      "Chaowei Xiao"
    ],
    "abstract": "Perception is crucial in the realm of autonomous driving systems, where bird's eye view (BEV)-based architectures have recently reached state-of-the-art performance. The desirability of self-supervised representation learning stems from the expensive and laborious process of annotating 2D and 3D data.  Although previous research has investigated pretraining methods for both LiDAR and camera-based 3D object detection, a unified pretraining framework for multimodal BEV perception is missing. In this study, we introduce CALICO, a novel framework that applies contrastive objectives to both LiDAR and camera backbones. Specifically, CALICO incorporates two stages: point-region contrast (PRC) and region-aware distillation (RAD). PRC better balances the region- and scene-level representation learning on the LiDAR modality and offers significant performance improvement compared to existing methods. RAD effectively achieves contrastive distillation on our self-trained teacher model. CALICO's efficacy is substantiated by extensive evaluations on 3D object detection and BEV map segmentation tasks, where it delivers significant performance improvements. Notably, CALICO outperforms the baseline method by 10.5\\% and 8.6\\% on NDS and mAP. Moreover, CALICO boosts the robustness of multimodal 3D object detection against adversarial attacks and corruption. Additionally, our framework can be tailored to different backbones and heads, positioning it as a promising approach for multimodal BEV perception.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=U7iiF79kI3",
    "arxiv_id": "2306.00349",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18531,
    "title": "CivRealm: A Learning and Reasoning Odyssey in Civilization for Decision-Making Agents",
    "authors": [
      "Siyuan Qi",
      "Shuo Chen",
      "Yexin Li",
      "Xiangyu Kong",
      "Junqi Wang",
      "Bangcheng Yang",
      "Pring Wong",
      "Yifan Zhong",
      "Xiaoyuan Zhang",
      "Zhaowei Zhang",
      "Nian Liu",
      "Yaodong Yang",
      "Song-Chun Zhu"
    ],
    "abstract": "The generalization of decision-making agents encompasses two fundamental elements: learning from past experiences and reasoning in novel contexts. However, the predominant emphasis in most interactive environments is on learning, often at the expense of complexity in reasoning. In this paper, we introduce CivRealm, an environment inspired by the Civilization game. Civilization's profound alignment with human history and society necessitates sophisticated learning, while its ever-changing situations demand strong reasoning to generalize. Particularly, CivRealm sets up an imperfect-information general-sum game with a changing number of players; it presents a plethora of complex features, challenging the agent to deal with open-ended stochastic environments that require diplomacy and negotiation skills. Within CivRealm, we provide interfaces for two typical agent types: tensor-based agents that focus on learning, and language-based agents that emphasize reasoning. To catalyze further research, we present initial results for both paradigms. The canonical RL-based agents exhibit reasonable performance in mini-games, whereas both RL- and LLM-based agents struggle to make substantial progress in the full game. Overall, CivRealm stands as a unique learning and reasoning challenge for decision-making agents. The code is available at https://github.com/bigai-ai/civrealm.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=UBVNwD3hPN",
    "arxiv_id": "2401.10568",
    "GitHub": [
      "https://github.com/bigai-ai/civrealm"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18530,
    "title": "CrossLoco: Human Motion Driven Control of Legged Robots via Guided Unsupervised Reinforcement Learning",
    "authors": [
      "Tianyu Li",
      "Hyunyoung Jung",
      "Matthew Gombolay",
      "Yong Cho",
      "Sehoon Ha"
    ],
    "abstract": "Human motion driven control (HMDC) is an effective approach for generating natural and compelling robot motions while preserving high-level semantics. However, establishing the correspondence between humans and robots with different body structures is not straightforward due to the mismatches in kinematics and dynamics properties, which causes intrinsic ambiguity to the problem. Many previous algorithms approach this motion retargeting problem with unsupervised learning, which requires the prerequisite skill sets. However, it will be extremely costly to learn all the skills without understanding the given human motions, particularly for high-dimensional robots. In this work, we introduce CrossLoco, a guided unsupervised reinforcement learning framework that simultaneously learns robot skills and their correspondence to human motions. Our key innovation is to introduce a cycle-consistency-based reward term designed to maximize the mutual information between human motions and robot states. We demonstrate that the proposed framework can generate compelling robot motions by translating diverse human motions, such as running, hopping, and dancing. We quantitatively compare our CrossLoco  against the manually engineered and unsupervised baseline algorithms along with the ablated versions of our framework and demonstrate that our method translates human motions with better accuracy, diversity, and user preference. We also showcase its utility in other applications, such as synthesizing robot movements from",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UCfz492fM8",
    "arxiv_id": "2309.17046",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18529,
    "title": "To Grok or not to Grok: Disentangling Generalization and Memorization on Corrupted Algorithmic Datasets",
    "authors": [
      "Darshil Doshi",
      "Aritra Das",
      "Tianyu He",
      "Andrey Gromov"
    ],
    "abstract": "Robust generalization is a major challenge in deep learning, particularly when the number of trainable parameters is very large. In general, it is very difficult to know if the network has memorized a particular set of examples or understood the underlying rule (or both). Motivated by this challenge, we study an interpretable model where generalizing representations are understood analytically, and are easily distinguishable from the memorizing ones. Namely, we consider two-layer neural networks trained on modular arithmetic tasks where ($\\\\xi \\\\cdot 100\\\\%$) of labels are corrupted (*i.e.* some results of the modular operations in the training set are incorrect). We show that (i) it is possible for the network to memorize the corrupted labels *and* achieve $100\\\\%$ generalization at the same time; (ii) the memorizing neurons can be identified and pruned, lowering the accuracy on corrupted data and improving the accuracy on uncorrupted data; (iii) regularization methods such as weight decay, dropout and BatchNorm force the network to ignore the corrupted data during optimization, and achieve $100\\\\%$ accuracy on the uncorrupted dataset; and (iv) the effect of these regularization methods is (\"mechanistically\") interpretable: weight decay and dropout force all the neurons to learn generalizing representations, while BatchNorm de-amplifies the output of memorizing neurons and amplifies the output of the generalizing ones. Finally, we show that in the presence of regularization, the training dynamics involves two consecutive stages: first, the network undergoes the *grokking* dynamics reaching high train *and* test accuracy; second, it unlearns the memorizing representations, where train accuracy suddenly jumps from $100\\\\%$ to $100 (1-\\\\xi)\\\\%$.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UHjE5v5MB7",
    "arxiv_id": "2310.13061",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18527,
    "title": "Faithful Explanations of Black-box NLP Models Using LLM-generated Counterfactuals",
    "authors": [
      "Yair Ori Gat",
      "Nitay Calderon",
      "Amir Feder",
      "Alexander Chapanin",
      "Amit Sharma",
      "Roi Reichart"
    ],
    "abstract": "Causal explanations of the predictions of NLP systems are essential to ensure safety and establish trust. Yet, existing methods often fall short of explaining model predictions effectively or efficiently and are often model-specific. In this paper, we address model-agnostic explanations, proposing two approaches for counterfactual (CF) approximation. The first approach is CF generation, where a large language model (LLM) is prompted to change a specific text concept while keeping confounding concepts unchanged. While this approach is demonstrated to be very effective, applying LLM at inference-time is costly. We hence present a second approach based on matching, and propose a method that is guided by an LLM at training-time and learns a dedicated embedding space. This space is faithful to a given causal graph and effectively serves to identify matches that approximate CFs. After showing theoretically that approximating CFs is required in order to construct faithful explanations, we benchmark our approaches and explain several models, including LLMs with billions of parameters. Our empirical results demonstrate the excellent performance of CF generation models as model-agnostic explainers. Moreover, our matching approach, which requires far less test-time resources, also provides effective explanations, surpassing many baselines. We also find that Top-K techniques universally improve every tested method. Finally, we showcase the potential of LLMs in constructing new benchmarks for model explanation and subsequently validate our conclusions. Our work illuminates new pathways for efficient and accurate approaches to interpreting NLP systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UMfcdRIotC",
    "arxiv_id": "2310.00603",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18526,
    "title": "Source-Free and Image-Only Unsupervised Domain Adaptation for Category Level Object Pose Estimation",
    "authors": [
      "Prakhar Kaushik",
      "Aayush Mishra",
      "Adam Kortylewski",
      "Alan Yuille"
    ],
    "abstract": "We consider the problem of source-free unsupervised category-level 3D pose estimation from only RGB images to an non-annotated and unlabelled target domain without any access to source domain data or annotations during adaptation. Collecting and annotating real world 3D data and corresponding images is laborious, expensive yet unavoidable process since even 3D pose domain adaptation methods require 3D data in the target domain. We introduce a method which is capable of adapting to a nuisance ridden target domain without any 3D data or annotations. We represent object categories as simple cuboid meshes, and harness a generative model of neural feature activations modeled as a von Mises Fisher distribution at each mesh vertex learnt using differential rendering. We focus on individual mesh vertex features and iteratively update them based on their proximity to corresponding features in the target domain. Our key insight stems from the observation that specific object subparts remain stable across out-of-domain (OOD) scenarios, enabling strategic utilization of these invariant subcomponents for effective model updates. Our model is then trained in an EM fashion alternating between updating the vertex features and feature extractor. We show that our method simulates fine-tuning on a global-pseudo labelled dataset under mild assumptions which converges to the target domain asymptotically. Through extensive empirical validation, we demonstrate the potency of our simple approach in addressing the domain shift challenge and significantly enhancing pose estimation accuracy. By accentuating robust and less changed object subcomponents, our framework contributes to the evolution of UDA techniques in the context of 3D pose estimation using only images from the target domain.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UPvufoBAIs",
    "arxiv_id": "2401.10848",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18524,
    "title": "Decoupling regularization from the action space",
    "authors": [
      "Sobhan Mohammadpour",
      "Emma Frejinger",
      "Pierre-Luc Bacon"
    ],
    "abstract": "Regularized reinforcement learning (RL), particularly the entropy-regularized kind, has gained traction in optimal control and inverse RL. While standard unregularized RL methods remain unaffected by changes in the number of actions, we show that it can severely impact their regularized counterparts. This paper demonstrates the importance of decoupling the regularizer from the action space: that is, to maintain a consistent level of regularization regardless of how many actions are involved to avoid over-regularization. Whereas the problem can be avoided by introducing a task-specific temperature parameter, it is often undesirable and cannot solve the problem when action spaces are state-dependent. In the state-dependent action context, different states with varying action spaces are regularized inconsistently. We introduce two solutions: a static temperature selection approach and a dynamic counterpart, universally applicable where this problem arises. Implementing these changes improves performance on the DeepMind control suite in static and dynamic temperature regimes and a biological design task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UaMgmoKEBj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18523,
    "title": "Let 2D Diffusion Model Know 3D-Consistency for Robust Text-to-3D Generation",
    "authors": [
      "Junyoung Seo",
      "Wooseok Jang",
      "Min-Seop Kwak",
      "Hyeonsu Kim",
      "Jaehoon Ko",
      "Junho Kim",
      "Jin-Hwa Kim",
      "Jiyoung Lee",
      "Seungryong Kim"
    ],
    "abstract": "Text-to-3D generation has shown rapid progress in recent days with the advent of score distillation sampling (SDS), a methodology of using pretrained text-to-2D diffusion models to optimize a neural radiance field (NeRF) in a zero-shot setting. However, the lack of 3D awareness in the 2D diffusion model often destabilizes previous methods from generating a plausible 3D scene. To address this issue, we propose 3DFuse, a novel framework that incorporates 3D awareness into the pretrained 2D diffusion model, enhancing the robustness and 3D consistency of score distillation-based methods. Specifically, we introduce a consistency injection module which constructs a 3D point cloud from the text prompt and utilizes its projected depth map at given view as a condition for the diffusion model. The 2D diffusion model, through its generative capability, robustly infers dense structure from the sparse point cloud depth map and generates a geometrically consistent and coherent 3D scene. We also introduce a new technique called semantic coding that reduces semantic ambiguity of the text prompt for improved results. Our method can be easily adapted to various text-to-3D baselines, and we experimentally demonstrate how our method notably enhances the 3D consistency of generated scenes in comparison to previous baselines, achieving state-of-the-art performance in geometric robustness and fidelity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UbxWjq0UO2",
    "arxiv_id": "2303.07937",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18522,
    "title": "Deep Confident Steps to New Pockets: Strategies for Docking Generalization",
    "authors": [
      "Gabriele Corso",
      "Arthur Deng",
      "Nicholas Polizzi",
      "Regina Barzilay",
      "Tommi S. Jaakkola"
    ],
    "abstract": "Accurate blind docking has the potential to lead to new biological breakthroughs, but for this promise to be realized, it is critical that docking methods generalize well across the proteome. However, existing benchmarks fail to rigorously assess generalizability. Therefore, we develop DockGen, a new benchmark based on the ligand-binding domains of proteins, and we show that machine learning-based docking models have very weak generalization abilities even when combined with various data augmentation strategies. Instead, we propose Confidence Bootstrapping, a new training paradigm that solely relies on the interaction between a diffusion and a confidence model. Unlike previous self-training methods from other domains, we directly exploit the multi-resolution generation process of diffusion models using rollouts and confidence scores to reduce the generalization gap. We demonstrate that Confidence Bootstrapping significantly improves the ability of ML-based docking methods to dock to unseen protein classes, edging closer to accurate and generalizable blind docking methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UfBIxpTK10",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18521,
    "title": "EfficientDM: Efficient Quantization-Aware Fine-Tuning of Low-Bit Diffusion Models",
    "authors": [
      "Yefei He",
      "Jing Liu",
      "Weijia Wu",
      "Hong Zhou",
      "Bohan Zhuang"
    ],
    "abstract": "Diffusion models have demonstrated remarkable capabilities in image synthesis and related generative tasks. Nevertheless, their practicality for low-latency real-world applications is constrained by substantial computational costs and latency issues. Quantization is a dominant way to compress and accelerate diffusion models, where post-training quantization (PTQ) and quantization-aware training (QAT) are two main approaches, each bearing its own properties. While PTQ exhibits efficiency in terms of both time and data usage, it may lead to diminished performance in low bit-width settings. On the other hand, QAT can help alleviate performance degradation but comes with substantial demands on computational and data resources. To capitalize on the advantages while avoiding their respective drawbacks, we introduce a data-free, quantization-aware and parameter-efficient fine-tuning framework for low-bit diffusion models, dubbed EfficientDM, to achieve QAT-level performance with PTQ-like efficiency. Specifically, we propose a quantization-aware variant of the low-rank adapter (QALoRA) that can be merged with model weights and jointly quantized to low bit-width. The fine-tuning process distills the denoising capabilities of the full-precision model into its quantized counterpart, eliminating the requirement for training data. To further enhance performance, we introduce scale-aware optimization to address ineffective learning of QALoRA due to variations in weight quantization scales across different layers. We also employ temporal learned step-size quantization to handle notable variations in activation distributions across denoising steps. Extensive experimental results demonstrate that our method significantly outperforms previous PTQ-based diffusion models while maintaining similar time and data efficiency. Specifically, there is only a marginal $0.05$ sFID increase when quantizing both weights and activations of LDM-4 to 4-bit on ImageNet $256\\times256$. Compared to QAT-based methods, our EfficientDM also boasts a $16.2\\times$ faster quantization speed with comparable generation quality, rendering it a compelling choice for practical applications.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=UmMa3UNDAz",
    "arxiv_id": "2310.03270",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18520,
    "title": "VDT: General-purpose Video Diffusion Transformers via Mask Modeling",
    "authors": [
      "Haoyu Lu",
      "Guoxing Yang",
      "Nanyi Fei",
      "Yuqi Huo",
      "Zhiwu Lu",
      "Ping Luo",
      "Mingyu Ding"
    ],
    "abstract": "This work introduces Video Diffusion Transformer (VDT), which pioneers the use of transformers in diffusion-based video generation.It features transformer blocks with modularized temporal and spatial attention modules to leverage the rich spatial-temporal representation inherited in transformers.Additionally, we propose a unified spatial-temporal mask modeling mechanism, seamlessly integrated with the model, to cater to diverse video generation scenarios.VDT offers several appealing benefits.**(1)** It excels at capturing temporal dependencies to produce temporally consistent video frames and even simulate the physics and dynamics of 3D objects over time.**(2)** It facilitates flexible conditioning information, \\eg, simple concatenation in the token space, effectively unifying different token lengths and modalities.**(3)** Pairing with our proposed spatial-temporal mask modeling mechanism, it becomes a general-purpose video diffuser for harnessing a range of tasks, including unconditional generation, video prediction, interpolation, animation, and completion, etc.%Extensive experiments on these tasks spanning various scenarios, including autonomous driving, natural weather, human action, and physics-based simulation, demonstrate the effectiveness of VDT.% Moreover, we provide a comprehensive study on the capabilities of VDT in capturing accurate temporal dependencies, handling conditioning information, and the spatial-temporal mask modeling mechanism.Additionally, we present comprehensive studies on how VDT handles conditioning information with the mask modeling mechanism, which we believe will benefit future research and advance the field. Codes and models are available at the https://VDT-2023.github.io.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Un0rgm9f04",
    "arxiv_id": "2305.13311",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18519,
    "title": "WizardCoder: Empowering Code Large Language Models with Evol-Instruct",
    "authors": [
      "Ziyang Luo",
      "Can Xu",
      "Pu Zhao",
      "Qingfeng Sun",
      "Xiubo Geng",
      "Wenxiang Hu",
      "Chongyang Tao",
      "Jing Ma",
      "Qingwei Lin",
      "Daxin Jiang"
    ],
    "abstract": "Code Large Language Models (Code LLMs), such as StarCoder, have demonstrated remarkable performance in various code-related tasks. However, different from their counterparts in the general language modeling field, the technique of instruction fine-tuning remains relatively under-researched in this domain. In this paper, we present Code Evol-Instruct, a novel approach that adapts the Evol-Instruct method to the realm of code, enhancing Code LLMs to create novel models WizardCoder. Through comprehensive experiments on five prominent code generation benchmarks, namely HumanEval, HumanEval+, MBPP, DS-1000, and MultiPL-E, our models showcase outstanding performance. They consistently outperform all other open-source Code LLMs by a significant margin. Remarkably, WizardCoder 15B even surpasses the largest closed-source LLMs, including Anthropic\u2019s Claude and Google\u2019s Bard, on the HumanEval and HumanEval+ benchmarks. Additionally, WizardCoder 34B not only achieves a HumanEval score comparable to GPT3.5 (ChatGPT) but also surpasses it on the HumanEval+ benchmark. Furthermore, our preliminary exploration highlights the pivotal role of instruction complexity in achieving exceptional coding performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UnUwSIgK5W",
    "arxiv_id": "2306.08568",
    "GitHub": [
      "https://github.com/nlpxucan/WizardLM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17636,
    "title": "How connectivity structure shapes rich and lazy learning in neural circuits",
    "authors": [
      "Yuhan Helena Liu",
      "Aristide Baratin",
      "Jonathan Cornford",
      "Stefan Mihalas",
      "Eric Todd SheaBrown",
      "Guillaume Lajoie"
    ],
    "abstract": "In theoretical neuroscience, recent work leverages deep learning tools to explore how some network attributes critically influence its learning dynamics. Notably, initial weight distributions with small (resp. large) variance may yield a rich (resp. lazy) regime, where significant (resp. minor) changes to network states and representation are observed over the course of learning. However, in biology, neural circuit connectivity generally has a low-rank structure and therefore differs markedly from the random initializations generally used for these studies. As such, here we investigate how the structure of the initial weights \u2014 in particular their effective rank \u2014 influences the network learning regime. Through both empirical and theoretical analyses, we discover that high-rank initializations typically yield smaller network changes indicative of lazier learning, a finding we also confirm with experimentally-driven initial connectivity in recurrent neural networks. Conversely, low-rank initialization biases learning towards richer learning. Importantly, however, as an exception to this rule, we find lazier learning can still occur with a low-rank initialization that aligns with task and data statistics. Our research highlights the pivotal role of initial weight structures in shaping learning regimes, with implications for metabolic costs of plasticity and risks of catastrophic forgetting.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=slSmYGc8ee",
    "arxiv_id": "2310.08513",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17634,
    "title": "Energy-conserving equivariant GNN for elasticity of lattice architected metamaterials",
    "authors": [
      "Ivan Grega",
      "Ilyes Batatia",
      "Gabor Csanyi",
      "Sri Karlapati",
      "Vikram Deshpande"
    ],
    "abstract": "Lattices are architected metamaterials whose properties strongly depend on their geometrical design.The analogy between lattices and graphs enables the use of graph neural networks (GNNs) as a faster surrogate model compared to traditional methods such as finite element modelling.In this work we present a higher-order GNN model trained to predict the fourth-order stiffness tensor of periodic strut-based lattices.The key features of the model are (i) SE(3) equivariance, and (ii) consistency with the thermodynamic law of conservation of energy.We compare the model to non-equivariant models based on a number of error metrics and demonstrate the benefits of the encoded equivariance and energy conservation in terms of predictive performance and reduced training requirements.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=smy4DsUbBo",
    "arxiv_id": "2401.16914",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17633,
    "title": "Whole-Song Hierarchical Generation of Symbolic Music Using Cascaded Diffusion Models",
    "authors": [
      "Ziyu Wang",
      "Lejun Min",
      "Gus Xia"
    ],
    "abstract": "Recent deep music generation studies have put much emphasis on \\textit{music structure} and \\textit{long-term} generation. However, we are yet to see high-quality, well-structured whole-song generation. In this paper, we make the first attempt to model a full music piece under the realization of \\textit{compositional hierarchy}. With a focus on symbolic representations of pop songs, we define a hierarchical language, in which each level of hierarchy focuses on the context dependency at a certain music scope. The high-level languages reveal whole-song form, phrase, and cadence, whereas the low-level languages focus on notes, chords, and their local patterns. A cascaded diffusion model is trained to model the hierarchical language, where each level is conditioned on its upper levels. Experiments and analysis show that our model is capable of generating full-piece music with recognizable global verse-chorus structure and cadences, and the music quality is higher than the baselines. Additionally, we show that the proposed model is \\textit{controllable} in a flexible way. By sampling from the interpretable hierarchical languages or adjusting external model controls, users can control the music flow via various features such as phrase harmonic structures, rhythmic patterns, and accompaniment texture.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=sn7CYWyavh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17632,
    "title": "Likelihood Training of Cascaded Diffusion Models via Hierarchical Volume-preserving Maps",
    "authors": [
      "Henry Li",
      "Ronen Basri",
      "Yuval Kluger"
    ],
    "abstract": "Cascaded models are multi-scale generative models with a marked capacity for producing perceptually impressive samples at high resolutions. In this work, we show that they can also be excellent likelihood models, so long as we overcome a fundamental difficulty with probabilistic multi-scale models: the intractability of the likelihood function. Chiefly, in cascaded models each intermediary scale introduces extraneous variables that cannot be tractably marginalized out for likelihood evaluation. This issue vanishes by modeling the diffusion process on latent spaces induced by a class of transformations we call hierarchical volume-preserving maps, which decompose spatially structured data in a hierarchical fashion without introducing local distortions in the latent space. We demonstrate that two such maps are well-known in the literature for multiscale modeling: Laplacian pyramids and wavelet transforms. Not only do such reparameterizations allow the likelihood function to be directly expressed as a joint likelihood over the scales, we show that the Laplacian pyramid and wavelet transform also produces significant improvements to the state-of-the-art on a selection of benchmarks in likelihood modeling, including density estimation, lossless compression, and out-of-distribution detection. Investigating the theoretical basis of our empirical gains we uncover deep connections to score matching under the Earth Mover's Distance (EMD), which is a well-known surrogate for perceptual similarity.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=sojpn00o8z",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17631,
    "title": "Measuring Vision-Language STEM Skills of Neural Models",
    "authors": [
      "Jianhao Shen",
      "Ye Yuan",
      "Srbuhi Mirzoyan",
      "Ming Zhang",
      "Chenguang Wang"
    ],
    "abstract": "We introduce a new challenge to test the STEM skills of neural models. Unlike existing datasets, our dataset requires the understanding of multimodal vision-language information. Our dataset features one of the largest and most comprehensive datasets for the challenge. It includes 448 skills and 1,073,146 questions spanning all STEM (science, technology, engineering, math) subjects. Compared to existing datasets that often focus on examining expert-level ability, our dataset includes fundamental skills and questions designed based on the K-12 curriculum. We also add state-of-the-art foundation models such as CLIP and ChatGPT to our dataset. Results show that the recent model advances only help master a very limited number of lower grade-level skills (2.5% in the third grade) in our dataset. In fact, these models are still well below (averaging 54.7%) the performance of elementary students, not to mention near expert-level performance. To understand and increase the performance on our dataset, we teach the models on a training split of our dataset. Even though we observe improved performance, the model performance remains relatively low compared to average elementary students. To solve STEM problems, we will need novel algorithmic innovations from the community. The code and dataset are available at https://anonymous.4open.science/r/STEM-Dataset-ICLR-2024 and will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=spvaV5LELF",
    "arxiv_id": "2402.17205",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17630,
    "title": "VFLAIR: A Research Library and Benchmark for Vertical Federated Learning",
    "authors": [
      "Tianyuan Zou",
      "Zixuan GU",
      "Yu He",
      "Hideaki Takahashi",
      "Yang Liu",
      "Ya-Qin Zhang"
    ],
    "abstract": "Vertical Federated Learning (VFL) has emerged as a collaborative training paradigm that allows participants with different features of the same group of users to accomplish cooperative training without exposing their raw data or model parameters. VFL has gained significant attention for its research potential and real-world applications in recent years, but still faces substantial challenges, such as in defending various kinds of data inference and backdoor attacks. Moreover, most of existing VFL projects are industry-facing and not easily used for keeping track of the current research progress. To address this need, we present an extensible and lightweight VFL framework VFLAIR (available at https://github.com/FLAIR-THU/VFLAIR), which supports VFL training with a variety of models, datasets and protocols, along with standardized modules for comprehensive evaluations of attacks and defense strategies. We also benchmark $11$ attacks and $8$ defenses performance under different communication and model partition settings and draw concrete insights and recommendations on the choice of defense strategies for different practical VFL deployment scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sqRgz88TM3",
    "arxiv_id": "2310.09827",
    "GitHub": [
      "https://github.com/FLAIR-THU/VFLAIR"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17628,
    "title": "BatteryML: An Open-source Platform for Machine Learning on Battery Degradation",
    "authors": [
      "Han Zhang",
      "Xiaofan Gui",
      "Shun Zheng",
      "Ziheng Lu",
      "Yuqi Li",
      "Jiang Bian"
    ],
    "abstract": "Battery life prediction has been a critical subject for energy storage field, and the incorporation of machine learning in recent years has substantially accelerated its advancements. However, Battery life prediction presents a high technical barrier as a multidisciplinary issue, posing challenges for researchers in both battery and machine learning fields. Machine learning researchers often lack essential knowledge about batteries, and understanding various battery types and related information requires significant time and effort. For battery researchers, unique models are implemented on specific datasets, and the complexity of these models obstructs their adaptation to individual battery data. To address these challenges, we introduce BatteryML, a one-stop open-source platform that streamlines the process, covering data preprocessing, feature extraction, and the application of both classical and cutting-edge models. This efficient approach enables practical applications for researchers. Currently, unified standards for battery life prediction are lacking, encompassing data format and evaluation criteria for predictions. Through BatteryML, we aim to establish these standards, allowing researchers from diverse fields to contribute to battery research and cultivating a collaborative platform for experts across both disciplines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=sxGugrYhP9",
    "arxiv_id": "2310.14714",
    "GitHub": [
      "https://github.com/microsoft/BatteryML"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18518,
    "title": "Time-LLM: Time Series Forecasting by Reprogramming Large Language Models",
    "authors": [
      "Ming Jin",
      "Shiyu Wang",
      "Lintao Ma",
      "Zhixuan Chu",
      "James Y. Zhang",
      "Xiaoming Shi",
      "Pin-Yu Chen",
      "Yuxuan Liang",
      "Yuan-Fang Li",
      "Shirui Pan",
      "Qingsong Wen"
    ],
    "abstract": "Time series forecasting holds significant importance in many real-world dynamic systems and has been extensively studied. Unlike natural language process (NLP) and computer vision (CV), where a single large model can tackle multiple tasks, models for time series forecasting are often specialized, necessitating distinct designs for different tasks and applications. While pre-trained foundation models have made impressive strides in NLP and CV, their development in time series domains has been constrained by data sparsity. Recent studies have revealed that large language models (LLMs) possess robust pattern recognition and reasoning abilities over complex sequences of tokens. However, the challenge remains in effectively aligning the modalities of time series data and natural language to leverage these capabilities. In this work, we present Time-LLM, a reprogramming framework to repurpose LLMs for general time series forecasting with the backbone language models kept intact. We begin by reprogramming the input time series with text prototypes before feeding it into the frozen LLM to align the two modalities. To augment the LLM's ability to reason with time series data, we propose Prompt-as-Prefix (PaP), which enriches the input context and directs the transformation of reprogrammed input patches. The transformed time series patches from the LLM are finally projected to obtain the forecasts. Our comprehensive evaluations demonstrate that \\method is a powerful time series learner that outperforms state-of-the-art, specialized forecasting models. Moreover, Time-LLM excels in both few-shot and zero-shot learning scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Unb5CVPtae",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18515,
    "title": "Fourier Transporter: Bi-Equivariant Robotic Manipulation in 3D",
    "authors": [
      "Haojie Huang",
      "Owen Lewis Howell",
      "Dian Wang",
      "Xupeng Zhu",
      "Robert Platt",
      "Robin Walters"
    ],
    "abstract": "Many complex robotic manipulation tasks can be decomposed as a sequence of pick and place actions. Training a robotic agent to learn this sequence over many different starting conditions typically requires many iterations or demonstrations, especially in 3D environments. In this work, we propose Fourier Transporter ($\\text{FourTran}$) which leverages the two-fold $\\mathrm{SE}(d)\\times\\\\mathrm{SE}(d)$  symmetry in the pick-place problem to achieve much higher sample efficiency. $\\text{FourTran}$ is an open-loop behavior cloning method trained using expert demonstrations to predict pick-place actions on new environments. $\\text{FourTran}$ is constrained to incorporate symmetries of the pick and place actions independently. Our method utilizes a fiber space Fourier transformation that allows for memory-efficient construction. We test our proposed network on the RLbench benchmark and achieve state-of-the-art results across various tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UulwvAU1W0",
    "arxiv_id": "2401.12046",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19495,
    "title": "Where We Have Arrived in Proving the Emergence of Sparse Interaction Primitives in DNNs",
    "authors": [
      "Qihan Ren",
      "Jiayang Gao",
      "Wen Shen",
      "Quanshi Zhang"
    ],
    "abstract": "This study aims to prove the emergence of symbolic concepts (or more precisely, sparse primitive inference patterns) in well-trained AI models. Specifically, we prove the following three conditions for the emergence. (i) The high-order derivatives of the model output with respect to the input variables are all zero. (ii) The model can be used on occluded samples, and when the input sample is less occluded, the model will yield higher confidence. (iii) The confidence of the model does not significantly degrade on occluded samples. These conditions are quite common, and we prove that under these conditions, the model will only encode a relatively small number of sparse interactions between input variables. Moreover, we can consider such interactions as symbolic primitive inference patterns encoded by an AI model, because we show that inference scores of the model on an exponentially large number of randomly masked samples can always be well mimicked by numerical effects of just a few interactions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3pWSL8My6B",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18513,
    "title": "Meaning Representations from Trajectories in Autoregressive Models",
    "authors": [
      "Tian Yu Liu",
      "Matthew Trager",
      "Alessandro Achille",
      "Pramuditha Perera",
      "Luca Zancato",
      "Stefano Soatto"
    ],
    "abstract": "We propose to extract meaning representations from autoregressive language models by considering the distribution of all possible trajectories extending an input text. This strategy is prompt-free, does not require fine-tuning, and is applicable to any pre-trained autoregressive model. Moreover, unlike vector-based representations,  distribution-based representations can also model asymmetric relations (e.g., direction of logical entailment, hypernym/hyponym relations) by using algebraic operations between likelihood functions. These ideas are grounded in distributional perspectives on semantics and are connected to standard constructions in automata theory, but to our knowledge they have not been applied to modern language models. We empirically show that the representations obtained from large models align well with human annotations, outperform other zero-shot and prompt-free methods on semantic similarity tasks, and can be used to solve more complex entailment and containment tasks that standard embeddings cannot handle. Finally, we extend our method  to represent data from different modalities (e.g., image and text) using multimodal autoregressive models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UyGWafcopT",
    "arxiv_id": "2310.18348",
    "GitHub": [
      "https://github.com/tianyu139/meaning-as-trajectories"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18511,
    "title": "Neural structure learning with stochastic differential equations",
    "authors": [
      "Benjie Wang",
      "Joel Jennings",
      "Wenbo Gong"
    ],
    "abstract": "Discovering the underlying relationships among variables from temporal observations has been a longstanding challenge in numerous scientific disciplines, including biology, finance, and climate science. The dynamics of such systems are often best described using continuous-time stochastic processes. Unfortunately, most existing structure learning approaches assume that the underlying process evolves in discrete-time and/or observations occur at regular time intervals. These mismatched assumptions can often lead to incorrect learned structures and models. In this work, we introduce a novel structure learning method, SCOTCH, which combines neural stochastic differential equations (SDE) with variational inference to infer a posterior distribution over possible structures. This continuous-time approach can naturally handle both learning from and predicting observations at arbitrary time points. Theoretically, we establish sufficient conditions for an SDE and SCOTCH to be structurally identifiable, and prove its consistency under infinite data limits. Empirically, we demonstrate that our approach leads to improved structure learning performance on both synthetic and real-world datasets compared to relevant baselines under regular and irregular sampling intervals.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=V1GM9xDvIY",
    "arxiv_id": "2311.03309",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18510,
    "title": "Exploring the Promise and Limits of Real-Time Recurrent Learning",
    "authors": [
      "Kazuki Irie",
      "Anand Gopalakrishnan",
      "J\u00fcrgen Schmidhuber"
    ],
    "abstract": "Real-time recurrent learning (RTRL) for sequence-processing recurrent neural networks (RNNs) offers certain conceptual advantages over backpropagation through time (BPTT). RTRL requires neither caching past activations nor truncating context, and enables online learning. However, RTRL's time and space complexity make it impractical. To overcome this problem, most recent work on RTRL focuses on approximation theories, while experiments are often limited to diagnostic settings. Here we explore the practical promise of RTRL in more realistic settings. We study actor-critic methods that combine RTRL and policy gradients, and test them in several subsets of DMLab-30, ProcGen, and Atari-2600 environments. On DMLab memory tasks, our system trained on fewer than 1.2B environmental frames is competitive with or outperforms well-known IMPALA and R2D2 baselines trained on 10B frames. To scale to such challenging tasks, we focus on certain well-known neural architectures with element-wise recurrence, allowing for tractable RTRL without approximation. Importantly, we also discuss rarely addressed limitations of RTRL in real-world applications, such as its complexity in the multi-layer case.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=V2cBKtdC3a",
    "arxiv_id": "2305.19044",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19461,
    "title": "Unveiling the Unseen: Identifiable Clusters in Trained Depthwise Convolutional Kernels",
    "authors": [
      "Zahra Babaiee",
      "Peyman Kiasari",
      "Daniela Rus",
      "Radu Grosu"
    ],
    "abstract": "Recent advances in depthwise-separable convolutional neural networks (DS-CNNs) have led to novel architectures, that surpass the performance of classical CNNs, by a considerable scalability and accuracy margin. This paper reveals another striking property of DS-CNN architectures: discernible and explainable patterns emerge in their trained depthwise convolutional kernels in all layers. Through an extensive analysis of millions of trained filters, with different sizes and from various models, we employed unsupervised clustering with autoencoders, to categorize these filters. Astonishingly, the patterns converged into a few main clusters, each resembling the difference of Gaussian (DoG) functions, and their first and second-order derivatives. Notably, we classify over 95\\% and 90\\% of the filters from state-of-the-art ConvNeXtV2 and ConvNeXt models, respectively. This finding is not merely a technological curiosity; it echoes the foundational models neuroscientists have long proposed for the vision systems of mammals. Our results thus deepen our understanding of the emergent properties of trained DS-CNNs and provide a bridge between artificial and biological visual processing systems. More broadly, they pave the way for more interpretable and biologically-inspired neural network designs in the future.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4VgBjsOC8k",
    "arxiv_id": "2401.14469",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18509,
    "title": "FedLoGe: Joint Local and Generic Federated Learning under Long-tailed Data",
    "authors": [
      "Zikai Xiao",
      "Zihan Chen",
      "Liyinglan Liu",
      "YANG FENG",
      "Joey Tianyi Zhou",
      "Jian Wu",
      "Wanlu Liu",
      "Howard Hao Yang",
      "Zuozhu Liu"
    ],
    "abstract": "Federated Long-Tailed Learning (Fed-LT), a paradigm wherein data collected from decentralized local clients manifests a globally prevalent long-tailed distribution, has garnered considerable attention in recent times. In the context of Fed-LT, existing works have predominantly centered on addressing the data imbalance issue to enhance the efficacy of the generic global model while neglecting the performance at the local level. In contrast, conventional Personalized Federated Learning (pFL) techniques are primarily devised to optimize personalized local models under the presumption of a balanced global data distribution. This paper introduces an approach termed Federated Local and Generic Model Training in Fed-LT (FedLoGe), which enhances both local and generic model performance through the integration of representation learning and classifier alignment within a neural collapse framework. Our investigation reveals the feasibility of employing a shared backbone as a foundational framework for capturing overarching global trends, while concurrently employing individualized classifiers to encapsulate distinct refinements stemming from each client\u2019s local features. Building upon this discovery, we establish the Static Sparse Equiangular Tight Frame Classifier (SSE-C), inspired by neural collapse principles that naturally prune extraneous noisy features and foster the acquisition of potent data representations. Furthermore, leveraging insights from imbalance neural collapse's classifier norm patterns, we develop Global and Local Adaptive Feature Realignment (GLA-FR) via an auxiliary global classifier and personalized Euclidean norm transfer to align global features with client preferences. Extensive experimental results on CIFAR-10/100-LT, ImageNet, and iNaturalist demonstrate the advantage of our method over state-of-the-art pFL and Fed-LT approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=V3j5d0GQgH",
    "arxiv_id": "2401.08977",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19454,
    "title": "Going Beyond Neural Network Feature Similarity: The Network Feature Complexity and Its Interpretation Using Category Theory",
    "authors": [
      "Yiting Chen",
      "Zhanpeng Zhou",
      "Junchi Yan"
    ],
    "abstract": "The behavior of neural networks still remains opaque, and a recently widely noted phenomenon is that networks often achieve similar performance when initialized with different random parameters. This phenomenon has attracted significant attention in measuring the similarity between features learned by distinct networks. However, feature similarity could be vague in describing the same feature since equivalent features hardly exist. In this paper, we expand the concept of equivalent feature and provide the definition of what we call *functionally equivalent features*. These features produce equivalent output under certain transformations. Using this definition, we aim to derive a more intrinsic metric for the so-called *feature complexity* regarding the redundancy of features learned by a neural network at each layer. We offer a formal interpretation of our approach through the lens of category theory, a well-developed area in mathematics. To quantify the feature complexity, we further propose an efficient algorithm named Iterative Feature Merging. Our experimental results validate our ideas and theories from various perspectives. We empirically demonstrate that the functionally equivalence widely exists among different features learned by the same neural network and we could reduce the number of parameters of the network without affecting the performance. We have also drawn several interesting empirical findings, including: 1) the larger the network, the more redundant features it learns; 2) in particular, we show how to prune the networks based on our finding using direct equivalent feature merging, without fine-tuning which is often needed in peer network pruning methods; 3) same structured networks with higher feature complexity achieve better performance; 4) through the layers of a neural network, the feature complexity first increase then decrease; 5) for the image classification task, a group of functionally equivalent features may correspond to a specific semantic meaning. Source code will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4bSQ3lsfEV",
    "arxiv_id": "2310.06756",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19445,
    "title": "PAC Prediction Sets Under Label Shift",
    "authors": [
      "Wenwen Si",
      "Sangdon Park",
      "Insup Lee",
      "Edgar Dobriban",
      "Osbert Bastani"
    ],
    "abstract": "Prediction sets capture uncertainty by predicting sets of labels rather than individual labels, enabling downstream decisions to conservatively account for all plausible outcomes. Conformal inference algorithms construct prediction sets guaranteed to contain the true label with high probability. These guarantees fail to hold in the face of distribution shift, which is precisely when reliable uncertainty quantification can be most useful. We propose a novel algorithm for constructing prediction sets with PAC guarantees in the label shift setting. It estimates importance weights, then propagates uncertainty in these estimates through a Gaussian elimination algorithm to compute confidence intervals that contain the importance weights, and finally uses these intervals to construct prediction sets. We evaluate our approach on four datasets: the CIFAR-10 and ChestX-Ray image datasets, the tabular CDC Heart Dataset, and the AGNews text dataset. Our algorithm satisfies the PAC guarantee while producing smaller prediction set sizes compared to several baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4vPVBh3fhz",
    "arxiv_id": "2310.12964",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18508,
    "title": "Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalization",
    "authors": [
      "Jin Peng Zhou",
      "Charles E Staats",
      "Wenda Li",
      "Christian Szegedy",
      "Kilian Q Weinberger",
      "Yuhuai Wu"
    ],
    "abstract": "Large language models (LLM), such as Google's Minerva and OpenAI's GPT families, are becoming increasingly capable of solving mathematical quantitative reasoning problems. However, they still make unjustified logical and computational errors in their reasoning steps and answers. In this paper, we leverage the fact that if the training corpus of LLMs contained sufficiently many examples of formal mathematics (e.g. in Isabelle, a formal theorem proving environment), they can be prompted to translate i.e. autoformalize informal mathematical statements into formal Isabelle code --- which can be verified automatically for internal consistency. This provides a mechanism to automatically reject solutions whose formalized versions are inconsistent within themselves or with the formalized problem statement. We evaluate our method on GSM8K, MATH and MultiArith datasets and demonstrate that our approach provides a consistently better heuristic than vanilla majority voting --- the previously best method to identify correct answers, by more than 12\\% on GSM8K. In our experiments it improves results consistently across all datasets and LLM model sizes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=V5tdi14ple",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18507,
    "title": "GNNX-BENCH: Unravelling the Utility of Perturbation-based GNN Explainers through In-depth Benchmarking",
    "authors": [
      "Mert Kosan",
      "Samidha Verma",
      "Burouj Armgaan",
      "Khushbu Pahwa",
      "Ambuj Singh",
      "Sourav Medya",
      "Sayan Ranu"
    ],
    "abstract": "Numerous explainability methods have been proposed to shed light on the inner workings of GNNs. Despite the inclusion of empirical evaluations in all the proposed algorithms, the interrogative aspects of these evaluations lack diversity. As a result, various facets of explainability pertaining to GNNs, such as a comparative analysis of counterfactual reasoners, their stability to variational factors such as different GNN architectures, noise, stochasticity in non-convex loss surfaces, feasibility amidst domain constraints, and so forth, have yet to be formally investigated. Motivated by this need, we present a benchmarking study on perturbation-based explainability methods for GNNs, aiming to systematically evaluate and compare a wide range of explainability techniques. Among the key findings of our study, we identify the Pareto-optimal methods that exhibit superior efficacy and stability in the presence of noise. Nonetheless, our study reveals thatall algorithms are affected by stability issues when faced with noisy data. Furthermore, we have established that the current generation of counterfactual explainers often fails to provide feasible recourses due to violations of topological constraints encoded by domain-specific considerations. Overall, this benchmarking study empowers stakeholders in the field of GNNs with a comprehensive understanding of the state-of-the-art explainability methods, potential research problems for further enhancement, and the implications of their application in real-world scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VJvbOSXRUq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18506,
    "title": "Tangent Transformers for Composition,Privacy and Removal",
    "authors": [
      "Tian Yu Liu",
      "Aditya Golatkar",
      "Stefano Soatto"
    ],
    "abstract": "We introduce Tangent Attention Fine-Tuning (TAFT), a method for fine-tuning linearized transformers obtained by computing a First-order Taylor Expansion around a pre-trained initialization. We show that the Jacobian-Vector Product resulting from linearization can be computed efficiently in a single forward pass, reducing training and inference cost to the same order of magnitude as its original non-linear counterpart, while using the same number of parameters. Furthermore, we show that, when applied to various downstream visual classification tasks, the resulting Tangent Transformer fine-tuned with TAFT can perform comparably with fine-tuning the original non-linear network. Since Tangent Transformers are linear with respect to the new set of weights, and the resulting fine-tuning loss is convex, we show that TAFT enjoys several advantages compared to non-linear fine-tuning when it comes to model composition, parallel training, machine unlearning, and differential privacy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VLFhbOCz5D",
    "arxiv_id": "2307.08122",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18504,
    "title": "ImageNet-OOD: Deciphering Modern Out-of-Distribution Detection Algorithms",
    "authors": [
      "William Yang",
      "Byron Zhang",
      "Olga Russakovsky"
    ],
    "abstract": "The task of out-of-distribution (OOD) detection is notoriously ill-defined. Earlier works focused on new-class detection, aiming to identify label-altering data distribution shifts, also known as \"semantic shift.\" However, recent works argue for a focus on failure detection, expanding the OOD evaluation framework to account for label-preserving data distribution shifts, also known as \"covariate shift.\u201d Intriguingly, under this new framework, complex OOD detectors that were previously considered state-of-the-art now perform similarly to, or even worse than the simple maximum softmax probability baseline. This raises the question: what are the latest OOD detectors actually detecting? Deciphering the behavior of OOD detection algorithms requires evaluation datasets that decouples semantic shift and covariate shift. To aid our investigations, we present ImageNet-OOD, a clean semantic shift dataset that minimizes the interference of covariate shift. Through comprehensive experiments, we show that OOD detectors are more sensitive to covariate shift than to semantic shift, and the benefits of recent OOD detection algorithms on semantic shift detection is minimal. Our dataset and analyses provide important insights for guiding the design of future OOD detectors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VTYg5ykEGS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18503,
    "title": "An LLM can Fool Itself: A Prompt-Based Adversarial Attack",
    "authors": [
      "Xilie Xu",
      "Keyi Kong",
      "Ning Liu",
      "Lizhen Cui",
      "Di Wang",
      "Jingfeng Zhang",
      "Mohan Kankanhalli"
    ],
    "abstract": "The wide-ranging applications of large language models (LLMs), especially in safety-critical domains, necessitate the proper evaluation of the LLM\u2019s adversarial robustness. This paper proposes an efficient tool to audit the LLM\u2019s adversarial robustness via a prompt-based adversarial attack (PromptAttack). PromptAttack converts adversarial textual attacks into an attack prompt that can cause the victim LLM to output the adversarial sample to fool itself. The attack prompt is composed of three important components: (1) original input (OI) including the original sample and its ground-truth label, (2) attack objective (AO) illustrating a task description of generating a new sample that can fool itself without changing the semantic meaning, and (3) attack guidance (AG) containing the perturbation instructions to guide the LLM on how to complete the task by perturbing the original sample at character, word, and sentence levels, respectively. Besides, we use a fidelity filter to ensure that PromptAttack maintains the original semantic meanings of the adversarial examples. Further, we enhance the attack power of PromptAttack by ensembling adversarial examples at different perturbation levels. Comprehensive empirical results using Llama2 and GPT-3.5 validate that PromptAttack consistently yields a much higher attack success rate compared to AdvGLUE and AdvGLUE++. Interesting findings include that a simple emoji can easily mislead GPT-3.5 to make wrong predictions. Our source code is available at Anonymous GitHub.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VVgGbB9TNV",
    "arxiv_id": "2310.13345",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18500,
    "title": "Generative Sliced MMD Flows with Riesz Kernels",
    "authors": [
      "Johannes Hertrich",
      "Christian Wald",
      "Fabian Altekr\u00fcger",
      "Paul Hagemann"
    ],
    "abstract": "Maximum mean discrepancy (MMD) flows suffer from high computational costs in large scale computations.In this paper, we show that MMD flows with Riesz kernels $K(x,y) = - \\|x-y\\|^r$, $r \\in (0,2)$have exceptional properties which allow their efficient computation.We prove that the MMD of Riesz kernels, which is also known as energy distance, coincides with the MMD of their sliced version.As a consequence, the computation of gradients of MMDs can be performed in the one-dimensional setting.Here, for $r=1$, a simple sorting algorithm can be applied to reduce the complexityfrom $O(MN+N^2)$ to $O((M+N)\\log(M+N))$ for two  measures with $M$ and $N$ support points.As another interesting follow-up result, the MMD of compactly supported measurescan be estimated from above and below by the Wasserstein-1 distance.For the implementations we approximate the gradient of the sliced MMD by using only a finite number $P$ of slices. We show that the resulting error has complexity \\smash{$O(\\sqrt{d/P})$}, where $d$ is the data dimension. These results enable us to train generative models by approximating MMD gradient flows by neural networks evenfor image applications. We demonstrate the efficiency of our model by image generation on MNIST, FashionMNIST and CIFAR10.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VdkGRV1vcf",
    "arxiv_id": "2305.11463",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19422,
    "title": "Structured Video-Language Modeling with Temporal Grouping and Spatial Grounding",
    "authors": [
      "Yuanhao Xiong",
      "Long Zhao",
      "Boqing Gong",
      "Ming-Hsuan Yang",
      "Florian Schroff",
      "Ting Liu",
      "Cho-Jui Hsieh",
      "Liangzhe Yuan"
    ],
    "abstract": "Existing video-language pre-training methods primarily focus on instance-level alignment between video clips and captions via global contrastive learning but neglect rich fine-grained local information in both videos and text, which is of importance to downstream tasks requiring temporal localization and semantic reasoning. A powerful model is expected to be capable of capturing region-object correspondences and recognizing scene changes in a video clip, reflecting spatial and temporal granularity respectively. To strengthen model's understanding of such fine-grained information, we propose a simple yet effective video-language modeling framework, S-ViLM, based on intrinsic structures of these two modalities. It includes two novel designs, inter-clip spatial grounding and intra-clip temporal grouping, to promote learning region-object alignment and temporal-aware features simultaneously. Comprehensive evaluations demonstrate that S-ViLM performs favorably against existing approaches in learning more expressive representations.Specifically, S-ViLM surpasses the state-of-the-art methods substantially on four representative downstream tasks, covering text-video retrieval, video question answering, video action recognition and temporal action localization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5dlfiJIXoh",
    "arxiv_id": "2303.16341",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18499,
    "title": "WildFusion: Learning 3D-Aware Latent Diffusion Models in View Space",
    "authors": [
      "Katja Schwarz",
      "Seung Wook Kim",
      "Jun Gao",
      "Sanja Fidler",
      "Andreas Geiger",
      "Karsten Kreis"
    ],
    "abstract": "Modern learning-based approaches to 3D-aware image synthesis achieve high photorealism and 3D-consistent viewpoint changes for the generated images. Existing approaches represent instances in a shared canonical space. However, for in-the-wild datasets a shared canonical system can be difficult to define or might not even exist. In this work, we instead model instances in view space, alleviating the need for posed images and learned camera distributions. We find that in this setting, existing GAN-based methods are prone to generating flat geometry and struggle with distribution coverage. We hence propose WildFusion, a new approach to 3D-aware image synthesis based on latent diffusion models (LDMs). We first train an autoencoder that infers a compressed latent representation, which additionallycaptures the images\u2019 underlying 3D structure and enables not only reconstruction but also novel view synthesis. To learn a faithful 3D representation, we leverage cues from monocular depth prediction. Then, we train a diffusion model in the 3D-aware latent space, thereby enabling synthesis of high-quality 3D-consistent image samples, outperforming recent state-of-the-art GAN-based methods. Importantly,our 3D-aware LDM is trained without any direct supervision from multiview images or 3D geometry and does not require posed images or learned pose or camera distributions. It directly learns a 3D representation without relying on canonical camera coordinates. This opens up promising research avenues for scalable 3D-aware image synthesis and 3D content creation from in-the-wild image data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VdwVOREDZM",
    "arxiv_id": "2311.13570",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18498,
    "title": "Deep Temporal Graph Clustering",
    "authors": [
      "Meng Liu",
      "Yue Liu",
      "KE LIANG",
      "Wenxuan Tu",
      "Siwei Wang",
      "sihang zhou",
      "Xinwang Liu"
    ],
    "abstract": "Deep graph clustering has recently received significant attention due to its ability to enhance the representation learning capabilities of models in unsupervised scenarios. Nevertheless, deep clustering for temporal graphs, which could capture crucial dynamic interaction information, has not been fully explored. It means that in many clustering-oriented real-world scenarios, temporal graphs can only be processed as static graphs. This not only causes the loss of dynamic information but also triggers huge computational consumption. To solve the problem, we propose a general framework for deep Temporal Graph Clustering called TGC, which adjusts deep clustering techniques (clustering assignment distribution and adjacency matrix reconstruction) to suit the interaction sequence-based batch-processing pattern of temporal graphs. In addition, we discuss differences between temporal graph clustering and existing static graph clustering from several levels. To verify the superiority of the proposed framework TGC, we conduct extensive experiments. The experimental results show that temporal graph clustering enables more flexibility in finding a balance between time and space requirements, and our framework can effectively improve the performance of existing temporal graph learning methods. Our code is included in the supplementary material and will be released after publication.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ViNe1fjGME",
    "arxiv_id": "2305.10738",
    "GitHub": [
      "https://github.com/MGitHubL/Deep-Temporal-Graph-Clustering"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18497,
    "title": "T-MARS: Improving Visual Representations by Circumventing Text Feature Learning",
    "authors": [
      "Pratyush Maini",
      "Sachin Goyal",
      "Zachary Chase Lipton",
      "J Zico Kolter",
      "Aditi Raghunathan"
    ],
    "abstract": "Large web-crawled multimodal datasets have powered a slew of new methods for learning general-purpose visual representations, advancing the state of the art in computer vision and revolutionizing zero- and few-shot recognition. One crucial decision facing practitioners is how, if at all, to curate these ever-larger datasets. For example, the creators of the LAION-5B dataset chose to retain only image-caption pairs whose CLIP similarity score exceeded a designated threshold. In this paper, we propose a new state-of-the-art data filtering approach motivated by our observation that nearly $40\\%$ of LAION's images contain text that overlaps significantly with the caption. Intuitively, such data could be wasteful as it incentivizes models to perform optical character recognition rather than learning visual features. However, naively removing all such data could also be wasteful, as it throws away images that contain visual features (in addition to overlapping text). Our simple and scalable approach, T-MARS (Text Masking and Re-Scoring), filters out only those pairs where the text dominates the remaining visual features---by first masking out the text and then filtering out those with a low CLIP similarity score of the masked image with original captions. Experimentally, T-MARS is the top ranked approach on Imagenet at ``medium scale'' of DataComp (a data filtering benchmark), and outperforms CLIP filtering by a margin of $6.5\\%$ on ImageNet and $4.7\\%$ on VTAB. Additionally, we show that the accuracy gains enjoyed by T-MARS linearly increase as data and compute are scaled exponentially.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ViPtjIVzUw",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18496,
    "title": "Towards Green AI in Fine-tuning Large Language Models via Adaptive Backpropagation",
    "authors": [
      "Kai Huang",
      "Hanyun Yin",
      "Heng Huang",
      "Wei Gao"
    ],
    "abstract": "Fine-tuning is essential to adapting pre-trained large language models to downstream applications. With the increasing popularity of LLM-enabled applications, fine-tuning has been performed intensively worldwide, incurring a tremendous amount of computing costs that correspond to big carbon footprint and environmental impact. Mitigating such environmental impact directly correlates to reducing the fine-tuning FLOPs. Existing fine-tuning schemes focus on either saving memory or reducing the overhead of computing weight updates, but cannot achieve sufficient FLOPs reduction due to their ignorance of the training cost in backpropagation. To address this limitation, in this paper we present GreenTrainer, a new technique that minimizes the FLOPs of LLM fine-tuning via adaptive backpropagation, which adaptively selects the most appropriate set of LLM tensors for fine-tuning based on their importance and backpropagation cost in training. Experiment results show that GreenTrainer can save up to 64\\% training FLOPs compared to full fine-tuning, without any noticeable accuracy loss. Compared to the existing schemes such as Prefix Tuning and LoRA, GreenTrainer can achieve up to 4\\% improvement of model accuracy, with on-par FLOPs reduction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Vja3ecieXY",
    "arxiv_id": "2309.13192",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18495,
    "title": "RECOMBINER: Robust and Enhanced Compression with Bayesian Implicit Neural Representations",
    "authors": [
      "Jiajun He",
      "Gergely Flamich",
      "Zongyu Guo",
      "Jos\u00e9 Miguel Hern\u00e1ndez-Lobato"
    ],
    "abstract": "COMpression with Bayesian Implicit NEural Representations (COMBINER) is a recent data compression method that addresses a key inefficiency of previous Implicit Neural Representation (INR)-based approaches: it avoids quantization and enables direct optimization of the rate-distortion performance. However, COMBINER still has significant limitations: 1) it uses factorized priors and posterior approximations that lack flexibility; 2) it cannot effectively adapt to local deviations from global patterns in the data; and 3) its performance can be susceptible to modeling choices and the variational parameters' initializations. Our proposed method, Robust and Enhanced COMBINER (RECOMBINER), addresses these issues by 1) enriching the variational approximation while maintaining its computational cost via a linear reparameterization of the INR weights, 2) augmenting our INRs with learnable positional encodings that enable them to adapt to local details and 3) splitting high-resolution data into patches to increase robustness and utilizing expressive hierarchical priors to capture dependency across patches. We conduct extensive experiments across several data modalities, showcasing that RECOMBINER achieves competitive results with the best INR-based methods and even outperforms autoencoder-based codecs on low-resolution images at low bitrates.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VkWbxFrCC8",
    "arxiv_id": "2309.17182",
    "GitHub": [
      "https://github.com/cambridge-mlg/RECOMBINER"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19409,
    "title": "Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances",
    "authors": [
      "Mikhail Khodak",
      "Edmond Chow",
      "Maria Florina Balcan",
      "Ameet Talwalkar"
    ],
    "abstract": "Solving a linear system ${\\bf Ax}={\\bf b}$ is a fundamental scientific computing primitive, and numerous solvers and preconditioners have been developed. These come with parameters whose optimal values depend on the system being solved but are often impossible or too expensive to identify; thus in practice sub-optimal heuristics are used instead. We consider the common setting in which many related linear systems are  solved, e.g. during a single numerical simulation. In this scenario, can we sequentially choose parameters that attain a near-optimal overall number of iterations, without extra matrix computations? We answer in the affirmative for Successive Over-Relaxation~(SOR), a standard solver whose parameter $\\omega$ has a strong impact on its runtime. For this method, we prove that a bandit algorithm\u2014using only the number of iterations as feedback\u2014can select parameters for a sequence of instances such that the overall cost is almost as good as that the best fixed $\\omega$ would have obtained. Furthermore, when given additional structural information, we show that a {\\em contextual} bandit method approaches the performance of the {\\em instance-optimal} policy, which selects the best $\\omega$ for each instance. Our work provides the first learning-theoretic treatment of high-precision linear system solvers and the first end-to-end guarantees for data-driven scientific computing, demonstrating theoretically the potential to speed up numerical methods using well-understood learning algorithms.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=5t57omGVMw",
    "arxiv_id": "2310.02246",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18494,
    "title": "Influencer Backdoor Attack on Semantic Segmentation",
    "authors": [
      "Haoheng Lan",
      "Jindong Gu",
      "Philip Torr",
      "Hengshuang Zhao"
    ],
    "abstract": "When a small number of poisoned samples are injected into the training dataset of a deep neural network, the network can be induced to exhibit malicious behavior during inferences, which poses potential threats to real-world applications. While they have been intensively studied in classification, backdoor attacks on semantic segmentation have been largely overlooked. Unlike classification, semantic segmentation aims to classify every pixel within a given image. In this work, we explore backdoor attacks on segmentation models to misclassify all pixels of a victim class by injecting a specific trigger on non-victim pixels during inferences, which is dubbed Influencer Backdoor Attack (IBA). IBA is expected to maintain the classification accuracy of non-victim pixels and mislead classifications of all victim pixels in every single inference and could be easily applied to real-world scenes. Based on the context aggregation ability of segmentation models, we proposed a simple, yet effective, Nearest-Neighbor trigger injection strategy. We also introduce an innovative Pixel Random Labeling strategy which maintains optimal performance even when the trigger is placed far from the victim pixels. Our extensive experiments reveal that current segmentation models do suffer from backdoor attacks, demonstrate IBA real-world applicability, and show that our proposed techniques can further increase attack performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=VmGRoNDQgJ",
    "arxiv_id": "2303.12054",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18493,
    "title": "Understanding Reconstruction Attacks with the Neural Tangent Kernel and Dataset Distillation",
    "authors": [
      "Noel Loo",
      "Ramin Hasani",
      "Mathias Lechner",
      "Alexander Amini",
      "Daniela Rus"
    ],
    "abstract": "Modern deep learning requires large volumes of data, which could contain sensitive or private information that cannot be leaked. Recent work has shown for homogeneous neural networks a large portion of this training data could be reconstructed with only access to the trained network parameters. While the attack was shown to work empirically, there exists little formal understanding of its effective regime which datapoints are susceptible to reconstruction. In this work, we first build a stronger version of the dataset reconstruction attack and show how it can provably recover the \\emph{entire training set} in the infinite width regime. We then empirically study the characteristics of this attack on two-layer networks and reveal that its success heavily depends on deviations from the frozen infinite-width Neural Tangent Kernel limit. Next, we study the nature of easily-reconstructed images. We show that both theoretically and empirically, reconstructed images tend to ``outliers'' in the dataset, and that these reconstruction attacks can be used for \\textit{dataset distillation}, that is, we can retrain on reconstructed images and obtain high predictive accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VoLDkQ6yR3",
    "arxiv_id": "2302.01428",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18490,
    "title": "Tree Cross Attention",
    "authors": [
      "Leo Feng",
      "Frederick Tung",
      "Hossein Hajimirsadeghi",
      "Yoshua Bengio",
      "Mohamed Osama Ahmed"
    ],
    "abstract": "Cross Attention is a popular method for retrieving information from a set of context tokens for making predictions. At inference time, for each prediction, Cross Attention scans the full set of $\\mathcal{O}(N)$ tokens. In practice, however, often only a small subset of tokens are required for good performance. Methods such as Perceiver IO are cheap at inference as they distill the information to a smaller-sized set of latent tokens $L < N$ on which cross attention is then applied, resulting in only $\\mathcal{O}(L)$ complexity. However, in practice, as the number of input tokens and the amount of information to distill increases, the number of latent tokens needed also increases significantly. In this work, we propose Tree Cross Attention (TCA) - a module based on Cross Attention that only retrieves information from a logarithmic $\\mathcal{O}(\\log(N))$ number of tokens for performing inference. TCA organizes the data in a tree structure and performs a tree search at inference time to retrieve the relevant tokens for prediction. Leveraging TCA, we introduce ReTreever, a flexible architecture for token-efficient inference. We show empirically that Tree Cross Attention (TCA) performs comparable to Cross Attention across various classification and uncertainty regression tasks while being significantly more token-efficient. Furthermore, we compare ReTreever against Perceiver IO, showing significant gains while using the same number of tokens for inference.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Vw24wtSddM",
    "arxiv_id": "2309.17388",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18488,
    "title": "A Flexible Generative Model for Heterogeneous Tabular EHR with Missing Modality",
    "authors": [
      "Huan He",
      "William hao",
      "Yuanzhe Xi",
      "Yong Chen",
      "Bradley Malin",
      "Joyce Ho"
    ],
    "abstract": "Realistic synthetic electronic health records (EHRs) can be leveraged to acceler- ate methodological developments for research purposes while mitigating privacy concerns associated with data sharing. However, the training of Generative Ad- versarial Networks remains challenging, often resulting in issues like mode col- lapse. While diffusion models have demonstrated progress in generating qual- ity synthetic samples for tabular EHRs given ample denoising steps, their perfor- mance wanes when confronted with missing modalities in heterogeneous tabular EHRs data. For example, some EHRs contain solely static measurements, and some contain only contain temporal measurements, or a blend of both data types. To bridge this gap, we introduce FLEXGEN-EHR\u2013 a versatile diffusion model tai- lored for heterogeneous tabular EHRs, equipped with the capability of handling missing modalities in an integrative learning framework. We define an optimal transport module to align and accentuate the common feature space of hetero- geneity of EHRs. We empirically show that our model consistently outperforms existing state-of-the-art synthetic EHR generation methods both in fidelity by up to 3.10% and utility by up to 7.16%. Additionally, we show that our method can be successfully used in privacy-sensitive settings, where the original patient-level data cannot be shared.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=W2tCmRrj7H",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19394,
    "title": "SaProt: Protein Language Modeling with Structure-aware Vocabulary",
    "authors": [
      "Jin Su",
      "Chenchen Han",
      "Yuyang Zhou",
      "Junjie Shan",
      "Xibin Zhou",
      "Fajie Yuan"
    ],
    "abstract": "Large-scale protein language models (PLMs), such as the ESM family, have achieved remarkable performance in various downstream tasks related to protein structure and function by undergoing unsupervised training on residue sequences. They have become essential tools for researchers and practitioners in biology.  However, a limitation of vanilla PLMs is their lack of explicit consideration for protein structure information, which suggests the potential for further improvement. Motivated by this, we introduce the concept of a ``structure-aware vocabulary\" that  integrates residue tokens with structure tokens.    The structure tokens are  derived  by encoding the 3D structure of proteins using Foldseek. We then propose SaProt, a large-scale general-purpose PLM trained on an extensive dataset comprising approximately 40 million protein sequences and structures. Through extensive evaluation, our SaProt model surpasses well-established and renowned baselines across 10 significant downstream tasks, demonstrating its exceptional capacity and broad applicability. We have made the code, pre-trained model, and all relevant materials available at https://github.com/SaProt/SaProt.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=6MRm3G4NiU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18486,
    "title": "Neuroformer: Multimodal and Multitask Generative Pretraining for Brain Data",
    "authors": [
      "Antonis Antoniades",
      "Yiyi Yu",
      "Joe S Canzano",
      "William Yang Wang",
      "Spencer Smith"
    ],
    "abstract": "State-of-the-art systems neuroscience experiments yield large-scale multimodal data, and these data sets require new tools for analysis. Inspired by the success of large pretrained models in vision and language domains, we reframe the analysis of large-scale, cellular-resolution neuronal spiking data into an auto-regressive spatiotemporal generation problem. Neuroformer is a multimodal, multitask generative pre-trained transformer (GPT) model that is specifically designed to handle the intricacies of data in systems neuroscience. It scales linearly with feature size, can process an arbitrary number of modalities, and is adaptable to downstream tasks, such as predicting behavior. We first trained Neuroformer on simulated datasets, and found that it both accurately predicted simulated neuronal circuit activity, and also intrinsically inferred the underlying neural circuit connectivity, including direction. When pretrained to decode neural responses, the model predicted the behavior of a mouse with only few-shot fine-tuning, suggesting that the model begins learning how to do so directly from the neural representations themselves, without any explicit supervision. We used an ablation study to show that joint training on neuronal responses and behavior boosted performance, highlighting the model's ability to associate behavioral and neural representations in an unsupervised manner. These findings show that Neuroformer can analyze neural datasets and their emergent properties, informing the development of models and hypotheses associated with the brain.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=W8S8SxS9Ng",
    "arxiv_id": "2311.00136",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18483,
    "title": "Learning Optimal Contracts: How to Exploit Small Action Spaces",
    "authors": [
      "Francesco Bacchiocchi",
      "Matteo Castiglioni",
      "Alberto Marchesi",
      "Nicola Gatti"
    ],
    "abstract": "We study principal-agent problems in which a principal commits to an outcome-dependent payment scheme---called contract---in order to induce an agent to take a costly, unobservable action leading to favorable outcomes. We consider a generalization of the classical (single-round) version of the problem in which the principal interacts with the agent by committing to contracts over multiple rounds. The principal has no information about the agent, and they have to learn an optimal contract by only observing the outcome realized at each round. We focus on settings in which the size of the agent's action space is small. We design an algorithm that learns an approximately-optimal contract with high probability in a number of rounds polynomial in the size of the outcome space, when the number of actions is constant. Our algorithm solves an open problem by Zhu et al. [2022]. Moreover, it can also be employed to provide a $\\widetilde{\\mathcal{O}}(T^{4/5})$ regret bound in the related online learning setting in which the principal aims at maximizing their cumulative utility, thus considerably improving previously-known regret bounds.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WKuimaBj4I",
    "arxiv_id": "2309.09801",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18481,
    "title": "AUGCAL: Improving Sim2Real Adaptation by Uncertainty Calibration on Augmented Synthetic Images",
    "authors": [
      "Prithvijit Chattopadhyay",
      "Bharat Goyal",
      "Boglarka Ecsedi",
      "Viraj Uday Prabhu",
      "Judy Hoffman"
    ],
    "abstract": "Synthetic data (Sim) drawn from simulators have emerged as a popular alternative for training models where acquiring annotated real-world images is difficult. However, transferring models trained on synthetic images to real-world applications can be challenging due to appearance disparities. A commonly employed solution to counter this Sim2Real gap is unsupervised domain adaptation, where models are trained using labeled Sim data and unlabeled Real data. Mispredictions made by such Sim2Real adapted models are often associated with miscalibration \u2013 stemming from overconfident predictions on real data. In this paper, we introduce AUGCAL, a simple training-time patch for unsupervised adaptation that improves Sim2Real adapted models by \u2013 (1) reducing overall miscalibration, (2) reducing overconfidence in incorrect predictions and (3) improving confidence score reliability by better guiding misclassification detection \u2013 all while retaining or improving Sim2Real performance. Given a base Sim2Real adaptation algorithm, at training time, AUGCAL involves replacing vanilla Sim images with strongly augmented views (AUG intervention) and additionally optimizing for a training time calibration loss on augmented Sim predictions (CAL intervention). We motivate AUGCAL using a brief analytical justification of how to reduce miscalibration on unlabeled Real data. Through our experiments, we empirically show the efficacy of AUGCAL across multiple adaptation methods, backbones, tasks and shifts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WNQjN5HzXt",
    "arxiv_id": "2312.06106",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19388,
    "title": "Unmasking and Improving Data Credibility: A Study with Datasets for Training Harmless Language Models",
    "authors": [
      "Zhaowei Zhu",
      "Jialu Wang",
      "Hao Cheng",
      "Yang Liu"
    ],
    "abstract": "Language models have shown promise in various tasks but can be affected by undesired data during training, fine-tuning, or alignment. For example, if some unsafe conversations are wrongly annotated as safe ones, the model fine-tuned on these samples may be harmful. Therefore, the correctness of annotations, i.e., the credibility of the dataset, is important. This study focuses on the credibility of real-world datasets, including the popular benchmarks Jigsaw Civil Comments, Anthropic Harmless & Red Team, PKU BeaverTails & SafeRLHF, that can be used for training a harmless language model. Given the cost and difficulty of cleaning these datasets by humans, we introduce a systematic framework for evaluating the credibility of datasets, identifying label errors, and evaluating the influence of noisy labels in the curated language data, specifically focusing on unsafe comments and conversation classification. With the framework, we find and fix an average of **6.16\\%** label errors in **11** datasets constructed from the above benchmarks. The data credibility and downstream learning performance can be remarkably improved by directly fixing label errors, indicating the significance of cleaning existing real-world datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6bcAD6g688",
    "arxiv_id": "2311.11202",
    "GitHub": [
      "https://github.com/Docta-ai/docta"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18478,
    "title": "TextField3D: Towards Enhancing Open-Vocabulary 3D Generation with Noisy Text Fields",
    "authors": [
      "Tianyu Huang",
      "Yihan Zeng",
      "Bowen Dong",
      "Hang Xu",
      "Songcen Xu",
      "Rynson W. H. Lau",
      "Wangmeng Zuo"
    ],
    "abstract": "Recent works learn 3D representation explicitly under text-3D guidance. However, limited text-3D data restricts the vocabulary scale and text control of generations. Generators may easily fall into a stereotype concept for certain text prompts, thus losing open-vocabulary generation ability. To tackle this issue, we introduce a conditional 3D generative model, namely TextField3D. Specifically, rather than using the text prompts as input directly, we suggest to inject dynamic noise into the latent space of given text prompts, i.e., Noisy Text Fields (NTFs). In this way, limited 3D data can be mapped to the appropriate range of textual latent space that is expanded by NTFs. To this end, an NTFGen module is proposed to model general text latent code in noisy fields. Meanwhile, an NTFBind module is proposed to align view-invariant image latent code to noisy fields, further supporting image-conditional 3D generation. To guide the conditional generation in both geometry and texture, multi-modal discrimination is constructed with a text-3D discriminator and a text-2.5D discriminator. Compared to previous methods, TextField3D includes three merits: 1) large vocabulary, 2) text consistency, and 3) low latency. Extensive experiments demonstrate that our method achieves a potential open-vocabulary 3D generation capability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WOiOzHG2zD",
    "arxiv_id": "2309.17175",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18477,
    "title": "Fine-Tuning Language Models for Factuality",
    "authors": [
      "Katherine Tian",
      "Eric Mitchell",
      "Huaxiu Yao",
      "Christopher D Manning",
      "Chelsea Finn"
    ],
    "abstract": "The fluency and creativity of large pre-trained language models (LLMs) have led to their widespread use, sometimes even as a replacement for traditional search engines. However, language models are prone to making convincing but factually inaccurate claims, often referred to as 'hallucinations', which can harmfully perpetuate myths and misconceptions. Further, manual fact-checking of model responses is a time-consuming process, making human factuality labels expensive to acquire. In this work, we leverage two key recent innovations in NLP to fine-tune language models to be more factual without human labeling, targeting more open-ended generation settings than past work. First, several recent works have proposed methods for scoring the factuality of open-ended text derived from consistency with an external knowledge base or simply a large model's confidence scores. Second, the Direct Preference Optimization algorithm enables straightforward fine-tuning of language models on objectives other than supervised imitation, using a preference ranking over possible model responses. We show that learning from preference rankings generated by either automated criterion significantly improves the factuality of Llama-2 on held-out topics (percent of generated claims that are correct) compared with existing RLHF procedures or decoding strategies targeted at factuality, showing over 50% and 20-30% error reduction for biographies and medical questions respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WPZ2yPag4K",
    "arxiv_id": "2311.08401",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18475,
    "title": "Modeling state-dependent communication between brain regions with switching nonlinear dynamical systems",
    "authors": [
      "Orren Karniol-Tambour",
      "David M. Zoltowski",
      "E. Mika Diamanti",
      "Lucas Pinto",
      "Carlos D Brody",
      "David W. Tank",
      "Jonathan W. Pillow"
    ],
    "abstract": "Understanding how multiple brain regions interact to produce behavior is a major challenge in systems neuroscience, with many regions causally implicated in common tasks such as sensory processing and decision making. A precise description of interactions between regions remains an open problem. Moreover, neural dynamics are nonlinear and non-stationary. Here, we propose MR-SDS, a multiregion, switching nonlinear state space model that decomposes global dynamics into local and cross-communication components in the latent space. MR-SDS includes directed interactions between brain regions, allowing for estimation of state-dependent communication signals, and accounts for sensory inputs effects, history effects, and heterogeneity across days and animals. We show that our model accurately recovers latent trajectories, vector fields underlying switching nonlinear dynamics, and cross-region communication profiles in three simulations. We then apply our method to two large-scale, multi-region neural datasets involving mouse decision making. The first includes hundreds of neurons per region, recorded simultaneously at single-cell-resolution across 3 distant cortical regions. The second is a mesoscale widefield dataset of 8 adjacent cortical regions imaged across both hemispheres. On these multi-region datasets, our model outperforms existing piece-wise linear multi-region models and reveals multiple distinct dynamical states and a rich set of cross-region communication profiles.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WQwV7Y8qwa",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18474,
    "title": "Learning to Embed Time Series Patches Independently",
    "authors": [
      "Seunghan Lee",
      "Taeyoung Park",
      "Kibok Lee"
    ],
    "abstract": "Masked time series modeling has recently gained much attention as a self-supervised representation learning strategy for time series.Inspired by masked image modeling in computer vision, recent works first patchify and partially mask out time series, and then train Transformers to capture the dependencies between patches by predicting masked patches from unmasked patches.However, we argue that capturing such patch dependencies might not be an optimal strategy for time series representation learning;rather, learning to embed patches independently results in better time series representations.Specifically, we propose to use 1) the simple patch reconstruction task, which autoencode each patch without looking at other patches, and 2) the simple patch-wise MLP that embeds each patch independently.In addition, we introduce complementary contrastive learning to hierarchically capture adjacent time series information efficiently.Our proposed method improves time series forecasting and classification performance compared to state-of-the-art Transformer-based models, while it is more efficient in terms of the number of parameters and training time.The code will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WS7GuBDFa2",
    "arxiv_id": "2312.16427",
    "GitHub": [
      "https://github.com/seunghan96/pits"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19385,
    "title": "STanHop: Sparse Tandem Hopfield Model for Memory-Enhanced Time Series Prediction",
    "authors": [
      "Dennis Wu",
      "Jerry Yao-Chieh Hu",
      "Weijian Li",
      "Bo-Yu Chen",
      "Han Liu"
    ],
    "abstract": "We present STanHop-Net (Sparse Tandem Hopfield Network) for multivariate time series prediction with memory-enhanced capabilities. At the heart of our approach is STanHop, a novel Hopfield-based neural network block, which sparsely learns and stores both temporal and cross-series representations in a data-dependent fashion. In essence, STanHop sequentially learn temporal representation and cross-series representation using two tandem sparse Hopfield layers. In addition, StanHop incorporates two additional external memory modules: a Plug-and-Play module and a Tune-and-Play module for train-less and task-aware  memory-enhancements, respectively. They allow StanHop-Net to fastly respond to certain sudden events. Methodologically, we construct the StanHop-Net by stacking STanHop blocks in a hierarchical fashion, enabling multi-resolution feature extraction with resolution-specific sparsity. Theoretically, we introduce a sparse extension of the modern Hopfield model and show that it endows a tighter memory retrieval error compared to the dense counterpart without sacrificing memory capacity. Empirically, we validate the efficacy of our framework on both synthetic and real-world settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6iwg437CZs",
    "arxiv_id": "2312.17346",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18473,
    "title": "An operator preconditioning perspective on training in physics-informed machine learning",
    "authors": [
      "Tim De Ryck",
      "Florent Bonnet",
      "Siddhartha Mishra",
      "Emmanuel de Bezenac"
    ],
    "abstract": "In this paper, we investigate the behavior of gradient descent algorithms in physics-informed machine learning methods like PINNs, which minimize residuals connected to partial differential equations (PDEs). Our key result is that the difficulty in training these models is closely related to the conditioning of a specific differential operator. This operator, in turn, is associated to the Hermitian square of the differential operator of the underlying PDE. If this operator is ill-conditioned, it results in slow or infeasible training. Therefore, preconditioning this operator is crucial. We employ both rigorous mathematical analysis and empirical evaluations to investigate various strategies, explaining how they better condition this critical operator, and consequently improve training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WWlxFtR5sV",
    "arxiv_id": "2310.05801",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18472,
    "title": "Latent Intuitive Physics: Learning to Transfer Hidden Physics from A 3D Video",
    "authors": [
      "Xiangming Zhu",
      "Huayu Deng",
      "Haochen Yuan",
      "Yunbo Wang",
      "Xiaokang Yang"
    ],
    "abstract": "We introduce latent intuitive physics, a transfer learning framework for physics simulation that can infer hidden properties of fluids from a single 3D video and simulate the observed fluid in novel scenes. Our key insight is to use latent features drawn from a learnable prior distribution conditioned on the underlying particle states to capture the invisible and complex physical properties. To achieve this, we train a parametrized prior learner given visual observations to approximate the visual posterior of inverse graphics, and both the particle states and the visual posterior are obtained from a learned neural renderer. The converged prior learner is embedded in our probabilistic physics engine, allowing us to perform novel simulations on unseen geometries, boundaries, and dynamics without knowledge of the true physical parameters. We validate our model in three ways: (i) novel scene simulation with the learned visual-world physics, (ii) future prediction of the observed fluid dynamics, and (iii) supervised particle simulation. Our model demonstrates strong performance in all three tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WZu4gUGN13",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18470,
    "title": "Guiding Masked Representation Learning to Capture Spatio-Temporal Relationship of Electrocardiogram",
    "authors": [
      "Yeongyeon Na",
      "Minje Park",
      "Yunwon Tae",
      "Sunghoon Joo"
    ],
    "abstract": "Electrocardiograms (ECG) are widely employed as a diagnostic tool for monitoring electrical signals originating from a heart. Recent machine learning research efforts have focused on the application of screening various diseases using ECG signals. However, adapting to the application of screening disease is challenging in that labeled ECG data are limited. Achieving general representation through self-supervised learning (SSL) is a well-known approach to overcome the scarcity of labeled data; however, a naive application of SSL to ECG data, without considering the spatial-temporal relationships inherent in ECG signals, may yield suboptimal results. In this paper, we introduce ST-MEM (Spatio-Temporal Masked Electrocardiogram Modeling), designed to learn spatio-temporal features by reconstructing masked 12-lead ECG data. ST-MEM outperforms other SSL baseline methods in various experimental settings for arrhythmia classification tasks. Moreover, we demonstrate that ST-MEM is adaptable to various lead combinations. Through quantitative and qualitative analysis, we show a spatio-temporal relationship within ECG data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WcOohbsF4H",
    "arxiv_id": "2402.09450",
    "GitHub": [
      "https://github.com/bakqui/ST-MEM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19494,
    "title": "Rethinking the Uniformity Metric in Self-Supervised Learning",
    "authors": [
      "Xianghong Fang",
      "Jian Li",
      "Qiang Sun",
      "Benyou Wang"
    ],
    "abstract": "Uniformity plays a crucial role in the assessment of learned representations, contributing to a deeper comprehension of self-supervised learning.  The seminal work by \\citet{Wang2020UnderstandingCR} introduced a uniformity metric that quantitatively measures the collapse degree of learned representations. Directly optimizing this metric together with alignment proves to be effective in preventing constant collapse. However, we present both theoretical and empirical evidence revealing that this metric lacks sensitivity to dimensional collapse, highlighting its limitations. To address this limitation and design a more effective uniformity metric, this paper identifies five fundamental properties, some of which the existing uniformity metric fails to meet. We subsequently introduce a novel uniformity metric that satisfies all of these desiderata and exhibits sensitivity to dimensional collapse. When applied as an auxiliary loss in various established self-supervised methods, our proposed uniformity metric consistently enhances their performance in downstream tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3pf2hEdu8B",
    "arxiv_id": "2403.00642",
    "GitHub": [
      "https://github.com/sunset-clouds/WassersteinUniformityMetric"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18469,
    "title": "Quasi-Monte Carlo for 3D Sliced Wasserstein",
    "authors": [
      "Khai Nguyen",
      "Nicola Bariletto",
      "Nhat Ho"
    ],
    "abstract": "Monte Carlo (MC) integration has been employed as the standard approximation method for the Sliced Wasserstein (SW) distance, whose analytical expression involves an intractable expectation. However, MC integration is not optimal in terms of absolute approximation error. To provide a better class of empirical SW, we propose quasi-sliced Wasserstein (QSW) approximations that rely on Quasi-Monte Carlo (QMC) methods. For a comprehensive investigation of QMC for SW, we focus on the 3D setting, specifically computing the SW between probability measures in three dimensions. In greater detail, we empirically evaluate various methods to construct QMC point sets on the 3D unit-hypersphere, including the Gaussian-based and equal area mappings, generalized spiral points, and optimizing discrepancy energies. Furthermore, to obtain an unbiased estimator for stochastic optimization, we extend QSW to Randomized Quasi-Sliced Wasserstein (RQSW) by introducing randomness in the discussed point sets. Theoretically, we prove the asymptotic convergence of QSW and the unbiasedness of RQSW. Finally, we conduct experiments on various 3D tasks, such as point-cloud comparison, point-cloud interpolation, image style transfer, and training deep point-cloud autoencoders, to demonstrate the favorable performance of the proposed QSW and RQSW variants.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Wd47f7HEXg",
    "arxiv_id": "2309.11713",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18468,
    "title": "Uni-RLHF: Universal Platform and Benchmark Suite for Reinforcement Learning with Diverse Human Feedback",
    "authors": [
      "Yifu Yuan",
      "Jianye HAO",
      "Yi Ma",
      "Zibin Dong",
      "Hebin Liang",
      "Jinyi Liu",
      "Zhixin Feng",
      "Kai Zhao",
      "YAN ZHENG"
    ],
    "abstract": "Reinforcement Learning with Human Feedback (RLHF) has received significant attention for performing tasks without the need for costly manual reward design by aligning human preferences. It is crucial to consider diverse human feedback types and various learning methods in different environments. However, quantifying progress in RLHF with diverse feedback is challenging due to the lack of standardized annotation platforms and widely used unified benchmarks. To bridge this gap, we introduce **Uni-RLHF**, a comprehensive system implementation tailored for RLHF. It aims to provide a complete workflow from *real human feedback*, fostering progress in the development of practical problems. Uni-RLHF contains three packages: 1) a universal multi-feedback annotation platform, 2) large-scale crowdsourced feedback datasets, and 3) modular offline RLHF baseline implementations. Uni-RLHF develops a user-friendly annotation interface tailored to various feedback types, compatible with a wide range of mainstream RL environments. We then establish a systematic pipeline of crowdsourced annotations, resulting in large-scale annotated datasets comprising more than 15 million steps across 30 popular tasks. Through extensive experiments, the results in the collected datasets demonstrate competitive performance compared to those from well-designed manual rewards. We evaluate various design choices and offer insights into their strengths and potential areas of improvement. We wish to build valuable open-source platforms, datasets, and baselines to facilitate the development of more robust and reliable RLHF solutions based on realistic human feedback. The website is available at https://uni-rlhf.github.io/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WesY0H9ghM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18465,
    "title": "Adaptive Self-training Framework for Fine-grained Scene Graph Generation",
    "authors": [
      "Kibum Kim",
      "Kanghoon Yoon",
      "Yeonjun In",
      "Jinyoung Moon",
      "Donghyun Kim",
      "Chanyoung Park"
    ],
    "abstract": "Scene graph generation (SGG) models have suffered from inherent problems regarding the benchmark datasets such as the long-tailed predicate distribution and missing annotation problems. In this work, we aim to alleviate the long-tailed problem of SGG by utilizing unannotated triplets. To this end, we introduce a **S**elf-**T**raining framework for **SGG** **(ST-SGG)** that assigns pseudo-labels for unannotated triplets based on which the SGG models are trained. While there has been significant progress in self-training for image recognition, designing a self-training framework for the SGG task is more challenging due to its inherent nature such as the semantic ambiguity and the long-tailed distribution of predicate classes. Hence, we propose a novel pseudo-labeling technique for SGG, called **C**lass-specific **A**daptive **T**hresholding with **M**omentum **(CATM)**, which is a model-agnostic framework that can be applied to any existing SGG models. Furthermore, we devise a graph structure learner (GSL) that is beneficial when adopting our proposed self-training framework to the state-of-the-art message-passing neural network (MPNN)-based SGG models. Our extensive experiments verify the effectiveness of ST-SGG on various SGG models, particularly in enhancing the performance on fine-grained predicate classes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WipsLtH77t",
    "arxiv_id": "2401.09786",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18462,
    "title": "QA-LoRA: Quantization-Aware Low-Rank Adaptation of Large Language Models",
    "authors": [
      "Yuhui Xu",
      "Lingxi Xie",
      "Xiaotao Gu",
      "Xin Chen",
      "Heng Chang",
      "Hengheng Zhang",
      "Zhengsu Chen",
      "XIAOPENG ZHANG",
      "Qi Tian"
    ],
    "abstract": "Recently years have witnessed a rapid development of large language models (LLMs). Despite the strong ability in many language-understanding tasks, the heavy computational burden largely restricts the application of LLMs especially when one needs to deploy them onto edge devices. In this paper, we propose a quantization-aware low-rank adaptation (QA-LoRA) algorithm. The motivation lies in the imbalanced degrees of freedom of quantization and adaptation, and the solution is to use group-wise operators which increase the degree of freedom of quantization meanwhile decreasing that of adaptation. QA-LoRA is easily implemented with a few lines of code, and it equips the original LoRA with two-fold abilities: (i) during fine-tuning, the LLM's weights are quantized (e.g., into INT4) to reduce time and memory usage; (ii) after fine-tuning, the LLM and auxiliary weights are naturally integrated into a quantized model without loss of accuracy. We apply QA-LoRA to the LLaMA and LLaMA2 model families and validate its effectiveness in different fine-tuning datasets and downstream scenarios. The code is submitted and will be made publically available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WvFoJccpo8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18461,
    "title": "Theoretical Understanding of Learning from Adversarial Perturbations",
    "authors": [
      "Soichiro Kumano",
      "Hiroshi Kera",
      "Toshihiko Yamasaki"
    ],
    "abstract": "It is not fully understood why adversarial examples can deceive neural networks and transfer between different networks. To elucidate this, several studies have hypothesized that adversarial perturbations, while appearing as noises, contain class features. This is supported by empirical evidence showing that networks trained on mislabeled adversarial examples can still generalize well to correctly labeled test samples. However, a theoretical understanding of how perturbations include class features and contribute to generalization is limited. In this study, we provide a theoretical framework for understanding learning from perturbations using a one-hidden-layer network trained on mutually orthogonal samples. Our results highlight that various adversarial perturbations, even perturbations of a few pixels, contain sufficient class features for generalization. Moreover, we reveal that the decision boundary when learning from perturbations matches that from standard samples except for specific regions under mild conditions. The code is available at https://github.com/s-kumano/learning-from-adversarial-perturbations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ww9rWUAcdo",
    "arxiv_id": "2402.10470",
    "GitHub": [
      "https://github.com/s-kumano/learning-from-adversarial-perturbations"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19380,
    "title": "Towards Establishing Guaranteed Error for Learned Database Operations",
    "authors": [
      "Sepanta Zeighami",
      "Cyrus Shahabi"
    ],
    "abstract": "Machine learning models have demonstrated substantial performance enhancements over non-learned alternatives in various fundamental data management operations, including indexing (locating items in an array), cardinality estimation (estimating the number of matching records in a database), and range-sum estimation (estimating aggregate attribute values for query-matched records). However, real-world systems frequently favor less efficient non-learned methods due to their ability to offer (worst-case) error guarantees \u2014 an aspect where learned approaches often fall short. The primary objective of these guarantees is to ensure system reliability, ensuring that the chosen approach consistently delivers the desired level of accuracy across all databases. In this paper, we embark on the first theoretical study of such guarantees for learned methods, presenting the necessary conditions for such guarantees to hold when using machine learning to perform indexing, cardinality estimation and range-sum estimation. Specifically, we present the first known lower bounds on the model size required to achieve the desired accuracy for these three key database operations. Our results bound the required model size for given average and worst-case errors in performing database operations, serving as the first theoretical guidelines governing how model size must change based on data size to be able to guarantee an accuracy level. More broadly, our established guarantees pave the way for the broader adoption and integration of learned models into real-world systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6tqgL8VluV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19378,
    "title": "Chain of Hindsight aligns Language Models with Feedback",
    "authors": [
      "Hao Liu",
      "Carmelo Sferrazza",
      "Pieter Abbeel"
    ],
    "abstract": "Learning from human preferences is important for language models to match human needs and to align with human and social values. Prior works have achieved remarkable successes by learning from human feedback to understand and follow instructions. Nonetheless, these methods are either founded on hand-picked model generations that are favored by human annotators, rendering them inefficient in terms of data utilization and challenging to apply in general, or they depend on reinforcement learning, which often suffers from imperfect reward functions and relies on extremely challenging optimizations. In this work, we propose a novel technique, Chain of Hindsight, that is easy to optimize and can learn from any form of feedback, regardless of its polarity. Our idea is inspired by how humans learn from extensive feedback presented in the form of languages. We convert all types of feedback into sequences of sentences, which are then used to fine-tune the model, allowing us to take advantage of the language comprehension capabilities of language models.We condition the model on a sequence of model generations paired with feedback. By doing so, the model is trained to generate outputs based on feedback, while learning to identify and correct negative attributes or errors.  Applying our method to large language models, we observed that Chain of Hindsight significantly surpasses previous methods in aligning language models with human preferences. We report significant improvements on summarization and dialogue benchmarks, with our approach markedly preferred in human evaluations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=6xfe4IVcOu",
    "arxiv_id": "2302.02676",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18460,
    "title": "Visual Data-Type Understanding does not emerge from scaling Vision-Language Models",
    "authors": [
      "Vishaal Udandarao",
      "Max F Burg",
      "Samuel Albanie",
      "Matthias Bethge"
    ],
    "abstract": "Recent advances in the development of vision-language models (VLMs) are yielding remarkable success in recognizing visual semantic content, including impressive instances of compositional image understanding. Here, we introduce the novel task of Visual Data-Type Identification, a basic perceptual skill with implications for data curation (e.g., noisy data-removal from large datasets, domains pecific retrieval) and autonomous vision (e.g., distinguishing changing weather conditions from camera lens staining). We develop two datasets consisting of animal images altered across a diverse set of 27 visual data-types, spanning four broad categories. An extensive zero-shot evaluation of 39 VLMs, ranging from 100M to 80B parameters, shows a nuanced performance landscape. While VLMs are reasonably good at identifying certain stylistic data-types, such as cartoons and sketches, they struggle with simpler data-types arising from basic manipulations like image rotations or additive noise. Our findings reveal that (i) model scaling alone yields marginal gains for contrastively-trained models like CLIP, and (ii) there is a pronounced drop in performance for the largest auto-regressively trained VLMs like OpenFlamingo. This finding points to a blind spot in current frontier VLMs: they excel in recognizing semantic content but fail to acquire anunderstanding of visual data-types through scaling. By analyzing the pre-training distributions of these models and incorporating data-type information into the captions during fine-tuning, we achieve a significant enhancement in performance. By exploring this previously uncharted task, we aim to set the stage for further advancing VLMs to equip them with visual data-type understanding. We will makeour code available online upon publication.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WyEdX2R4er",
    "arxiv_id": "2310.08577",
    "GitHub": [
      "https://github.com/bethgelab/DataTypeIdentification"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18459,
    "title": "Training-free Multi-objective Diffusion Model for 3D Molecule Generation",
    "authors": [
      "Xu Han",
      "Caihua Shan",
      "Yifei Shen",
      "Can Xu",
      "Han Yang",
      "Xiang Li",
      "Dongsheng Li"
    ],
    "abstract": "Searching for novel and diverse molecular candidates is a critical undertaking in drug and material discovery. Existing approaches have successfully adapted the diffusion model, the most effective generative model in image generation, to create 1D SMILES strings, 2D chemical graphs, or 3D molecular conformers. However, these methods are not efficient and flexible enough to generate 3D molecules with multiple desired properties, as they require additional training for the models for each new property or even a new combination of existing properties. Moreover, some properties may potentially conflict, making it impossible to find a molecule that satisfies all of them simultaneously. To address these challenges, we present a training-free conditional 3D molecular generation algorithm based on off-the-shelf unconditional diffusion models and property prediction models. The key techniques include modeling the loss of property prediction models as energy functions, considering the property relation between multiple conditions as a probabilistic graph, and developing a stable posterior estimation for computing the conditional score function. We conducted experiments on both single-objective and multi-objective 3D molecule generation, focusing on quantum properties, and compared our approach with the trained or fine-tuned diffusion models. Our proposed model achieves superior performance in generating molecules that meet the conditions, without any additional training cost.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=X41c4uB4k0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18458,
    "title": "Interpretable Diffusion via Information Decomposition",
    "authors": [
      "Xianghao Kong",
      "Ollie Liu",
      "Han Li",
      "Dani Yogatama",
      "Greg Ver Steeg"
    ],
    "abstract": "Denoising diffusion models enable conditional generation and density modeling of complex relationships like images and text. However, the nature of the learned relationships is opaque making it difficult to understand precisely what relationships between words and parts of an image are captured, or to predict the effect of an intervention. We illuminate the fine-grained relationships learned by diffusion models by noticing a precise relationship between diffusion and information decomposition. Exact expressions for mutual information and conditional mutual information can be written in terms of the denoising model. Furthermore, ${pointwise}$ estimates can be easily estimated as well, allowing us to ask questions about the relationships between specific images and captions. Decomposing information even further to understand which variables in a high-dimensional space carry information is a long-standing problem. For diffusion models, we show that a natural non-negative decomposition of mutual information emerges, allowing us to quantify informative relationships between words and pixels in an image. We exploit these new relations to measure the compositional understanding of diffusion models, to do unsupervised localization of objects in images, and to measure effects when selectively editing images through prompt interventions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=X6tNkN6ate",
    "arxiv_id": "2310.07972",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18455,
    "title": "Idempotent Generative Network",
    "authors": [
      "Assaf Shocher",
      "Amil V Dravid",
      "Yossi Gandelsman",
      "Inbar Mosseri",
      "Michael Rubinstein",
      "Alexei A Efros"
    ],
    "abstract": "We propose a new approach for generative modeling based on training a neural network to be idempotent. An idempotent operator is one that can be applied sequentially without changing the result beyond the initial application, namely $f(f(z))=f(z)$. The proposed model $f$ is trained to map a source distribution (e.g, Gaussian noise) to a target distribution (e.g. realistic images) using the following objectives: (1) Instances from the target distribution should map to themselves, namely $f(x)=x$. We define the target manifold as the set of all instances that $f$ maps to themselves.(2) Instances that form the source distribution should map onto the defined target manifold. This is achieved by optimizing the idempotence term, $f(f(z))=f(z)$ which encourages the range of $f(z)$ to be on the target manifold. Under ideal assumptions such a process provably converges to the target distribution. This strategy results in a model capable of generating an output in one step, maintaining a consistent latent space, while also allowing sequential applications for refinement. Additionally, we find that by processing inputs from both target and source distributions, the model adeptly projects corrupted or modified data back to the target manifold. This work is a first step towards a ``global projector'' that enables projecting any input into a target data distribution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XIaS66XkNA",
    "arxiv_id": "2311.01462",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18454,
    "title": "InstructPix2NeRF: Instructed 3D Portrait Editing from a Single Image",
    "authors": [
      "Jianhui Li",
      "Shilong Liu",
      "Zidong Liu",
      "Yikai Wang",
      "Kaiwen Zheng",
      "Jinghui Xu",
      "Jianmin Li",
      "Jun Zhu"
    ],
    "abstract": "With the success of Neural Radiance Field (NeRF) in 3D-aware portrait editing, a variety of works have achieved promising results regarding both quality and 3D consistency. However, these methods heavily rely on per-prompt optimization when handling natural language as editing instructions. Due to the lack of labeled human face 3D datasets and effective architectures, the area of human-instructed 3D-aware editing for open-world portraits in an end-to-end manner remains under-explored. To solve this problem, we propose an end-to-end diffusion-based framework termed $\\textbf{InstructPix2NeRF}$, which enables instructed 3D-aware portrait editing from a single open-world image with human instructions.  At its core lies a conditional latent 3D diffusion process that lifts 2D editing to 3D space by learning the correlation between the paired images' difference and the instructions via triplet data. With the help of our proposed token position randomization strategy, we could even achieve multi-semantic editing through one single pass with the portrait identity well-preserved. Besides, we further propose an identity consistency module that directly modulates the extracted identity signals into our diffusion process, which increases the multi-view 3D identity consistency. Extensive experiments verify the effectiveness of our method and show its superiority against strong baselines quantitatively and qualitatively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XIxhINXtQk",
    "arxiv_id": "2311.02826",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18453,
    "title": "Adversarial Training Should Be Cast as a Non-Zero-Sum Game",
    "authors": [
      "Alexander Robey",
      "Fabian Latorre",
      "George J. Pappas",
      "Hamed Hassani",
      "Volkan Cevher"
    ],
    "abstract": "One prominent approach toward resolving the adversarial vulnerability of deep neural networks is the two-player zero-sum paradigm of adversarial training, in which predictors are trained against adversarially chosen perturbations of data. Despite the promise of this approach, algorithms based on this paradigm have not engendered sufficient levels of robustness, and suffer from pathological behavior like robust overfitting. To understand this shortcoming, we first show that the commonly used surrogate-based relaxation used in adversarial training algorithms voids all guarantees on the robustness of trained classifiers.  The identification of this pitfall informs a novel non-zero-sum bilevel formulation of adversarial training, wherein each player optimizes a different objective function. Our formulation naturally yields a simple algorithmic framework that matches and in some cases outperforms state-of-the-art attacks, attains comparable levels of robustness to standard adversarial training algorithms, and does not suffer from robust overfitting.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XJ9vjEAqbx",
    "arxiv_id": "2306.11035",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18452,
    "title": "COLEP: Certifiably Robust Learning-Reasoning Conformal Prediction via Probabilistic Circuits",
    "authors": [
      "Mintong Kang",
      "Nezihe Merve G\u00fcrel",
      "Linyi Li",
      "Bo Li"
    ],
    "abstract": "Conformal prediction has shown spurring performance in constructing statistically rigorous prediction sets for arbitrary black-box machine learning models, assuming the data is exchangeable. However, even small adversarial perturbations during the inference can violate the exchangeability assumption, challenge the coverage guarantees, and result in a subsequent decline in empirical coverage. In this work, we propose a certifiably robust learning-reasoning conformal prediction framework (COLEP) via probabilistic circuits, which comprise a data-driven learning component that trains statistical models to learn different semantic concepts, and a reasoning component that encodes knowledge and characterizes the relationships among the trained models for logic reasoning. To achieve exact and efficient reasoning, we employ probabilistic circuits (PCs) within the reasoning component. Theoretically, we provide end-to-end certification of prediction coverage for COLEP in the presence of $\\ell_2$ bounded adversarial perturbations. We also provide certified coverage considering the finite size of the calibration set. Furthermore, we prove that COLEP achieves higher prediction coverage and accuracy over a single model as long as the utilities of knowledge models are non-trivial. Empirically, we show the validity and tightness of our certified coverage, demonstrating the robust conformal prediction of COLEP on various datasets, including GTSRB, CIFAR10, and AwA2. We show that COLEP achieves up to 12% improvement in certified coverage on GTSRB, 9% on CIFAR-10, and 14% on AwA2.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XN6ZPINdSg",
    "arxiv_id": "2403.11348",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18451,
    "title": "Abstractors and relational cross-attention: An inductive bias for explicit relational reasoning in Transformers",
    "authors": [
      "Awni Altabaa",
      "Taylor Whittington Webb",
      "Jonathan D. Cohen",
      "John Lafferty"
    ],
    "abstract": "An extension of Transformers is proposed that enables explicit relational reasoning through a novel module called the *Abstractor*. At the core of the Abstractor is a variant of attention called *relational cross-attention*. The approach is motivated by an architectural inductive bias for relational learning that disentangles relational information from extraneous features about individual objects. This enables explicit relational reasoning, supporting abstraction and generalization from limited data. The Abstractor is first evaluated on simple discriminative relational tasks and compared to existing relational architectures. Next, the Abstractor is evaluated on purely relational sequence-to-sequence tasks, where dramatic improvements are seen in sample efficiency compared to standard Transformers. Finally, Abstractors are evaluated on a collection of tasks based on mathematical problem solving, where modest but consistent improvements in performance and sample efficiency are observed.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XNa6r6ZjoB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18450,
    "title": "Consistent algorithms for multi-label classification with macro-at-$k$ metrics",
    "authors": [
      "Erik Schultheis",
      "Wojciech Kotlowski",
      "Marek Wydmuch",
      "Rohit Babbar",
      "Strom Borman",
      "Krzysztof Dembczynski"
    ],
    "abstract": "We consider the optimization of complex performance metrics in multi-label classification under the population utility framework. We mainly focus on metrics linearly decomposable into a sum of binary classification utilities applied separately to each label with an additional requirement of exactly $k$ labels predicted for each instance. These ``macro-at-$k$'' metrics possess desired properties for extreme classification problems with long tail labels. Unfortunately, the at-$k$ constraint couples the otherwise independent binary classification tasks, leading to a much more challenging optimization problem than standard macro-averages. We provide a statistical framework to study this problem, prove the existence and the form of the optimal classifier, and propose a statistically consistent and practical learning algorithm based on the Frank-Wolfe method. Interestingly, our main results concern even more general metrics being non-linear functions of label-wise confusion matrices. Empirical results provide evidence for the competitive performance of the proposed approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XOnya9gSdF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19370,
    "title": "Elastic Feature Consolidation For Cold Start Exemplar-Free Incremental Learning",
    "authors": [
      "Simone Magistri",
      "Tomaso Trinci",
      "Albin Soutif",
      "Joost van de Weijer",
      "Andrew D. Bagdanov"
    ],
    "abstract": "Exemplar-Free Class Incremental Learning (EFCIL) aims to learn from a sequence of tasks without having access to previous task data. In this paper, we consider the challenging Cold Start scenario in which insufficient data is available in the first task to learn a high-quality backbone. This is especially challenging for EFCIL since it requires high plasticity, which results in feature drift which is difficult to compensate for in the exemplar-free setting.  To address this problem, we propose a simple and effective approach that consolidates feature representations by regularizing drift in directions highly relevant to previous tasks and employs prototypes to reduce task-recency bias. Our method, called Elastic Feature Consolidation (EFC), exploits a tractable second-order approximation of feature drift based on an Empirical Feature Matrix (EFM). The EFM induces a pseudo-metric in feature space which we use to regularize feature drift in important directions and to update Gaussian prototypes used in a novel asymmetric cross entropy loss which effectively balances prototype rehearsal with data from new tasks. Experimental results on CIFAR-100, Tiny-ImageNet, ImageNet-Subset and ImageNet-1K demonstrate that Elastic Feature Consolidation is better able to learn new tasks by maintaining model plasticity and significantly outperform the state-of-the-art.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7D9X2cFnt1",
    "arxiv_id": "2402.03917",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18449,
    "title": "Quantifying the Plausibility of Context Reliance in Neural Machine Translation",
    "authors": [
      "Gabriele Sarti",
      "Grzegorz Chrupa\u0142a",
      "Malvina Nissim",
      "Arianna Bisazza"
    ],
    "abstract": "Establishing whether language models can use contextual information in a human-plausible way is important to ensure their safe adoption in real-world settings. However, the questions of $\\textit{when}$ and $\\textit{which parts}$ of the context affect model generations are typically tackled separately, and current plausibility evaluations are practically limited to a handful of artificial benchmarks. To address this, we introduce $\\textbf{P}$lausibility $\\textbf{E}$valuation of $\\textbf{Co}$ntext $\\textbf{Re}$liance (PECoRe), an end-to-end interpretability framework designed to quantify context usage in language models' generations. Our approach leverages model internals to (i) contrastively identify context-sensitive target tokens in generated texts and (ii) link them to contextual cues justifying their prediction. We use PECoRe to quantify the plausibility of context-aware machine translation models, comparing model rationales with human annotations across several discourse-level phenomena. Finally, we apply our method to unannotated generations to identify context-mediated predictions and highlight instances of (im)plausible context usage in model translations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XTHfNGI3zT",
    "arxiv_id": "2310.01188",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18447,
    "title": "MogaNet: Multi-order Gated Aggregation Network",
    "authors": [
      "Siyuan Li",
      "Zedong Wang",
      "Zicheng Liu",
      "Cheng Tan",
      "Haitao Lin",
      "Di Wu",
      "Zhiyuan Chen",
      "Jiangbin Zheng",
      "Stan Z. Li"
    ],
    "abstract": "By contextualizing the kernel as globally as possible, Modern ConvNets have shown great potential in computer vision tasks. However, recent progress of \\textit{multi-order game-theoretic interaction} in deep neural networks (DNNs) shows that the representation capacity of modern ConvNets has not been well unleashed, where the most expressive interactions have not been effectively encoded with the increased kernel size. To address this challenge, we propose a new family of modern ConvNets, dubbed MogaNet, for discriminative visual representation learning in pure ConvNet-based models, with preferable complexity-performance trade-offs. MogaNet encapsulates conceptually simple yet effective convolutions and gated aggregation into a compact module, where discriminative features are efficiently gathered and contextualized in an adaptive manner. Extensive experiments show that MogaNet exhibits great scalability, impressive efficiency of model parameters, and competitive performance compared to state-of-the-art ViTs and ConvNets on ImageNet and various downstream vision benchmarks, including COCO object detection, ADE20K semantic segmentation, 2D\\&3D human pose estimation, and video prediction. Notably, MogaNet hits 80.0\\% and 87.8\\% accuracy with 5.2M and 181M parameters on ImageNet-1K, outperforming ParC-Net and ConvNeXt-L, while saving 59\\% FLOPs and 17M parameters, respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XhYWgjqCrV",
    "arxiv_id": "2211.03295",
    "GitHub": [
      "https://github.com/Westlake-AI/MogaNet"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18446,
    "title": "Stabilizing Contrastive RL: Techniques for Robotic Goal Reaching from Offline Data",
    "authors": [
      "Chongyi Zheng",
      "Benjamin Eysenbach",
      "Homer Rich Walke",
      "Patrick Yin",
      "Kuan Fang",
      "Ruslan Salakhutdinov",
      "Sergey Levine"
    ],
    "abstract": "Robotic systems that rely primarily on self-supervised learning have the potential to decrease the amount of human annotation and engineering effort required to learn control strategies. In the same way that prior robotic systems have leveraged self-supervised techniques from computer vision (CV) and natural language processing (NLP), our work builds on prior work showing that the reinforcement learning (RL) itself can be cast as a self-supervised problem: learning to reach any goal without human-specified rewards or labels. Despite the seeming appeal, little (if any) prior work has demonstrated how self-supervised RL methods can be practically deployed on robotic systems. By first studying a challenging simulated version of this task, we discover design decisions about architectures and hyperparameters that increase the success rate by $2 \\times$. These findings lay the groundwork for our main result: we demonstrate that a self-supervised RL algorithm based on contrastive learning can solve real-world, image-based robotic manipulation tasks, with tasks being specified by a single goal image provided after training.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Xkf2EBj4w3",
    "arxiv_id": "2306.03346",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18445,
    "title": "The importance of feature preprocessing for differentially private linear optimization",
    "authors": [
      "Ziteng Sun",
      "Ananda Theertha Suresh",
      "Aditya Krishna Menon"
    ],
    "abstract": "Training machine learning models with differential privacy (DP) has received increasing interest in recent years. One of the most popular algorithms for training differentially private models is differentially private stochastic gradient descent (DPSGD) and its variants, where at each step gradients are clipped and combined with some noise. Given the increasing usage of DPSGD, we ask the question: is DPSGD alone sufficient to find a good minimizer for every dataset under privacy constraints? As a first step towards answering this question, we show that even for the simple case of linear classification, unlike non-private optimization, (private) feature preprocessing is vital for differentially private optimization.  In detail, we first show theoretically that there exists an example where without feature preprocessing, DPSGD incurs a privacy error proportional to the maximum norm of features over all samples. We then propose an algorithm called *DPSGD-F*, which combines DPSGD with feature preprocessing and prove that for classification tasks, it incurs a privacy error proportional to the diameter of the features $\\max_{x, x' \\in D} \\|x - x'\\|_2$. We then demonstrate the practicality of our algorithm on image classification benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XlTDBZFXWp",
    "arxiv_id": "2307.11106",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18444,
    "title": "DNA-GPT: Divergent N-Gram Analysis for Training-Free Detection of GPT-Generated Text",
    "authors": [
      "Xianjun Yang",
      "Wei Cheng",
      "Yue Wu",
      "Linda Ruth Petzold",
      "William Yang Wang",
      "Haifeng Chen"
    ],
    "abstract": "Large language models (LLMs) have notably enhanced the fluency and diversity of machine-generated text. However, this progress also presents a significant challenge in detecting the origin of a given text, and current research on detection methods lags behind the rapid evolution of LLMs. Conventional training-based methods have limitations in flexibility, particularly when adapting to new domains, and they often lack explanatory power. To address this gap, we propose a novel training-free detection strategy called Divergent N-Gram Analysis (DNA-GPT). Given a text, we first truncate it in the middle and then use only the preceding portion as input to the LLMs to regenerate the new remaining parts. By analyzing the differences between the original and new remaining parts through N-gram analysis in black-box or probability divergence in white-box, we can clearly illustrate significant discrepancies between machine-generated and human-written text. We conducted extensive experiments on the most advanced LLMs from OpenAI, including text-davinci-003, GPT-3.5-turbo, and GPT-4, as well as open-source models such as GPT-NeoX-20B and LLaMa-13B. Results show that our zero-shot approach exhibits state-of-the-art performance in distinguishing between human and GPT-generated text on four English and one German dataset, outperforming OpenAI's own classifier, which is trained on millions of text. Additionally, our methods provide reasonable explanations and evidence to support our claim, which is a unique feature of explainable detection. Our method is also robust under the revised text attack and can additionally solve model sourcing.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Xlayxj2fWp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18443,
    "title": "Generating Images with 3D Annotations Using Diffusion Models",
    "authors": [
      "Wufei Ma",
      "Qihao Liu",
      "Jiahao Wang",
      "Angtian Wang",
      "Xiaoding Yuan",
      "Yi Zhang",
      "Zihao Xiao",
      "Guofeng Zhang",
      "Beijia Lu",
      "Ruxiao Duan",
      "Yongrui Qi",
      "Adam Kortylewski",
      "Yaoyao Liu",
      "Alan Yuille"
    ],
    "abstract": "Diffusion models have emerged as a powerful method of generative modeling across a range of fields, capable of producing stunning photo-realistic images from natural language descriptions. However, these models lack explicit control over the 3D structure in the generated images. Consequently, this hinders our ability to obtain detailed 3D annotations for the generated images or to craft instances with specific poses and distances. In this paper, we propose a simple yet effective method that incorporates 3D geometry control into diffusion models. Our method exploits ControlNet, which extends diffusion models by using visual prompts in addition to text prompts. We generate images of the 3D objects taken from 3D shape repositories (e.g., ShapeNet and Objaverse), render them from a variety of poses and viewing directions, compute the edge maps of the rendered images, and use these edge maps as visual prompts to generate realistic images. With explicit 3D geometry control, we can easily change the 3D structures of the objects in the generated images and obtain ground-truth 3D annotations automatically. This allows us to improve a wide range of vision tasks, e.g., classification and 3D pose estimation, in both in-distribution (ID) and out-of-distribution (OOD) settings. We demonstrate the effectiveness of our method through extensive experiments on ImageNet-100, ImageNet-R, PASCAL3D+, ObjectNet3D, and OOD-CV. The results show that our method significantly outperforms existing methods across multiple benchmarks, e.g., 3.8 percentage points on ImageNet-100 using DeiT-B and 3.5 percentage points on PASCAL3D+ & ObjectNet3D using NeMo.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=XlkN11Xj6J",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18441,
    "title": "Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking",
    "authors": [
      "Kaifeng Lyu",
      "Jikai Jin",
      "Zhiyuan Li",
      "Simon Shaolei Du",
      "Jason D. Lee",
      "Wei Hu"
    ],
    "abstract": "Recent work by Power et al. (2022) highlighted a surprising \"grokking\" phenomenon in learning arithmetic tasks: a neural net first \"memorizes\" the training set, resulting in perfect training accuracy but near-random test accuracy, and after training for sufficiently longer, it suddenly transitions to perfect test accuracy. This paper studies the grokking phenomenon in theoretical setups and shows that it can be induced by a dichotomy of early and late phase implicit biases. Specifically, when training homogeneous neural nets with large initialization and small weight decay on both classification and regression tasks, we prove that the training process gets trapped at a solution corresponding to a kernel predictor for a long time, and then a very sharp transition to min-norm/max-margin predictors occurs, leading to a dramatic change in test accuracy. Even in the absence of weight decay, we show that grokking can still happen when the late phase implicit bias is driven by other regularization mechanisms, such as implicit margin maximization or sharpness reduction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XsHqr9dEGH",
    "arxiv_id": "2311.18817",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18440,
    "title": "Continual Learning on a Diet:  Learning from Sparsely Labeled Streams Under Constrained Computation",
    "authors": [
      "Wenxuan Zhang",
      "Youssef Mohamed",
      "Bernard Ghanem",
      "Philip Torr",
      "Adel Bibi",
      "Mohamed Elhoseiny"
    ],
    "abstract": "We propose and study a realistic Continual Learning (CL) setting where learning algorithms are granted a restricted computational budget per time step while training. We apply this setting to large-scale semi-supervised Continual Learning scenarios with sparse label rate.  Previous proficient CL methods perform very poorly in this challenging setting. Overfitting to the sparse labeled data and insufficient computational budget are the two main culprits for such a poor performance. Our new setting encourages learning methods to effectively and efficiently utilize the unlabeled data during training. To that end, we propose a simple but highly effective baseline, DietCL, which utilizes both unlabeled and labeled data jointly. DietCL meticulously allocates computational budget for both types of data. We validate our baseline, at scale, on several datasets, e.g., CLOC, ImageNet10K, and CGLM, under constraint budget setup. DietCL outperforms, by a large margin, all existing supervised CL algorithms as well as more recent continual semi-supervised methods. Our extensive analysis and ablations demonstrate that DietCL is stable under a full spectrum of label sparsity, computational budget and various other ablations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Xvfz8NHmCj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18439,
    "title": "Smooth ECE: Principled Reliability Diagrams via Kernel Smoothing",
    "authors": [
      "Jaroslaw Blasiok",
      "Preetum Nakkiran"
    ],
    "abstract": "Calibration measures and reliability diagrams are two fundamental tools for measuring and interpreting the calibration of probabilistic predictors. Calibration measures quantify the degree of miscalibration, and reliability diagrams visualize the structure of this miscalibration. However, the most common constructions of reliability diagrams and calibration measures --- binning and ECE --- both suffer from well-known flaws (e.g. discontinuity). We show that a simple modification fixes both constructions: first smooth the observations using an RBF kernel, then compute the Expected Calibration Error (ECE) of this smoothed function. We prove that with a careful choice of bandwidth, this method yields a calibration measure that is well-behaved in the sense of (Blasiok, Gopalan, Hu, and Nakkiran 2023) --- a consistent calibration measure. We call this measure the SmoothECE. Moreover, the reliability diagram obtained from this smoothed function visually encodes the SmoothECE, just as binned reliability diagrams encode the BinnedECE.   We also provide a Python package with simple, hyperparameter-free methods for measuring and plotting calibration (not linked to preserve anonymity).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XwiA1nDahv",
    "arxiv_id": "2309.12236",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18436,
    "title": "DecompOpt: Controllable and Decomposed Diffusion Models for Structure-based Molecular Optimization",
    "authors": [
      "Xiangxin Zhou",
      "Xiwei Cheng",
      "Yuwei Yang",
      "Yu Bao",
      "Liang Wang",
      "Quanquan Gu"
    ],
    "abstract": "Recently, 3D generative models have shown promising performances in structure-based drug design by learning to generate ligands given target binding sites. However, only modeling the target-ligand distribution can hardly fulfill one of the main goals in drug discovery -- designing novel ligands with desired properties, e.g., high binding affinity, easily synthesizable, etc. This challenge becomes particularly pronounced when the target-ligand pairs used for training do not align with these desired properties. Moreover, most existing methods aim at solving de novo design task, while many generative scenarios requiring flexible controllability, such as R-group optimization and scaffold hopping, have received little attention. In this work, we propose DecompOpt, a structure-based molecular optimization method based on a controllable and decomposed diffusion model. DecompOpt presents a new generation paradigm which combines optimization with conditional diffusion models to achieve desired properties while adhering to the molecular grammar. Additionally, DecompOpt offers a unified framework covering both de novo design and controllable generation. To achieve so, ligands are decomposed into substructures which allows fine-grained control and local optimization. Experiments show that DecompOpt can efficiently generate molecules with improved properties than strong de novo baselines, and demonstrate great potential in controllable generation tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Y3BbxvAQS9",
    "arxiv_id": "2403.13829",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18435,
    "title": "GoLLIE: Annotation Guidelines improve Zero-Shot Information-Extraction",
    "authors": [
      "Oscar Sainz",
      "Iker Garc\u00eda-Ferrero",
      "Rodrigo Agerri",
      "Oier Lopez de Lacalle",
      "German Rigau",
      "Eneko Agirre"
    ],
    "abstract": "Large Language Models (LLMs) combined with instruction tuning have made significant progress when generalizing to unseen tasks. However, they have been less successful in Information Extraction (IE), lagging behind task-specific models. Typically, IE tasks are characterized by complex annotation guidelines which describe the task and give examples to humans. Previous attempts to leverage such information have failed, even with the largest models, as they are not able to follow the guidelines out-of-the-box. In this paper we propose GoLLIE (Guideline-following Large Language Model for IE), a model able to improve zero-shot results on unseen IE tasks by virtue of being fine-tuned to comply with annotation guidelines. Comprehensive evaluation empirically demonstrates that GoLLIE is able to generalize to and follow unseen guidelines, outperforming previous attempts at zero-shot information extraction. The ablation study shows that detailed guidelines is key for good results. Code, data and models will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Y3wpuxd7u9",
    "arxiv_id": "2310.03668",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19369,
    "title": "Real3D-Portrait: One-shot Realistic 3D Talking Portrait Synthesis",
    "authors": [
      "Zhenhui Ye",
      "Tianyun Zhong",
      "Yi Ren",
      "Jiaqi Yang",
      "Weichuang Li",
      "Jiawei Huang",
      "Ziyue Jiang",
      "Jinzheng He",
      "Rongjie Huang",
      "Jinglin Liu",
      "Chen Zhang",
      "Xiang Yin",
      "Zejun MA",
      "Zhou Zhao"
    ],
    "abstract": "One-shot 3D talking portrait generation aims to reconstruct a 3D avatar from an unseen image, and then animate it with a reference video or audio to generate a talking portrait video. The existing methods fail to simultaneously achieve the goals of accurate 3D avatar reconstruction and stable talking face animation. Besides, while the existing works mainly focus on synthesizing the head part, it is also vital to generate natural torso and background segments to obtain a realistic talking portrait video. To address these limitations, we present Real3D-Potrait, a framework that (1) improves the one-shot 3D reconstruction power with a large image-to-plane model that distills 3D prior knowledge from a 3D face generative model; (2) facilitates accurate motion-conditioned animation with an efficient motion adapter; (3) synthesizes realistic video with natural torso movement and switchable background using a head-torso-background super-resolution model; and (4) supports one-shot audio-driven talking face generation with a generalizable audio-to-motion model. Extensive experiments show that Real3D-Portrait generalizes well to unseen identities and generates more realistic talking portrait videos compared to previous methods. Video samples are available at https://real3dportrait.github.io.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=7ERQPyR2eb",
    "arxiv_id": "2401.08503",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19366,
    "title": "AutoDAN: Generating Stealthy Jailbreak Prompts on Aligned Large Language Models",
    "authors": [
      "Xiaogeng Liu",
      "Nan Xu",
      "Muhao Chen",
      "Chaowei Xiao"
    ],
    "abstract": "The aligned Large Language Models (LLMs) are powerful language understanding and decision-making tools that are created through extensive alignment with human feedback. However, these large models remain susceptible to jailbreak attacks, where adversaries manipulate prompts to elicit malicious outputs that should not be given by aligned LLMs. Investigating jailbreak prompts can lead us to delve into the limitations of LLMs and further guide us to secure them. Unfortunately, existing jailbreak techniques suffer from either (1) scalability issues, where attacks heavily rely on manual crafting of prompts, or (2) stealthiness problems, as attacks depend on token-based algorithms to generate prompts that are often semantically meaningless, making them susceptible to detection through basic perplexity testing. In light of these challenges, we intend to answer this question: Can we develop an approach that can automatically generate stealthy jailbreak prompts? In this paper, we introduce AutoDAN, a novel jailbreak attack against aligned LLMs. AutoDAN can automatically generate stealthy jailbreak prompts by the carefully designed hierarchical genetic algorithm. Extensive evaluations demonstrate that AutoDAN not only automates the process while preserving semantic meaningfulness, but also demonstrates superior attack strength in cross-model transferability, and cross-sample universality compared with the baseline. Moreover, we also compare AutoDAN with perplexity-based defense methods and show that AutoDAN can bypass them effectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7Jwpw4qKkb",
    "arxiv_id": "2310.04451",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18434,
    "title": "Sparse Weight Averaging with Multiple Particles for Iterative Magnitude Pruning",
    "authors": [
      "Moonseok Choi",
      "Hyungi Lee",
      "Giung Nam",
      "Juho Lee"
    ],
    "abstract": "Given the ever-increasing size of modern neural networks, the significance of sparse architectures has surged due to their accelerated inference speeds and minimal memory demands. When it comes to global pruning techniques, Iterative Magnitude Pruning (IMP) still stands as a state-of-the-art algorithm despite its simple nature, particularly in extremely sparse regimes. In light of the recent finding that the two successive matching IMP solutions are linearly connected without a loss barrier, we propose Sparse Weight Averaging with Multiple Particles (SWAMP), a straightforward modification of IMP that achieves performance comparable to an ensemble of two IMP solutions. For every iteration, we concurrently train multiple sparse models, referred to as particles, using different batch orders yet the same matching ticket, and then weight average such models to produce a single mask. We demonstrate that our method consistently outperforms existing baselines across different sparsities through extensive experiments on various neural network structures and data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Y9t7MqZtCR",
    "arxiv_id": "2305.14852",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19363,
    "title": "Parameter-Efficient Orthogonal Finetuning via Butterfly Factorization",
    "authors": [
      "Weiyang Liu",
      "Zeju Qiu",
      "Yao Feng",
      "Yuliang Xiu",
      "Yuxuan Xue",
      "Longhui Yu",
      "Haiwen Feng",
      "Zhen Liu",
      "Juyeon Heo",
      "Songyou Peng",
      "Yandong Wen",
      "Michael J. Black",
      "Adrian Weller",
      "Bernhard Sch\u00f6lkopf"
    ],
    "abstract": "Large foundation models are becoming ubiquitous, but training them from scratch is prohibitively expensive. Thus, efficiently adapting these powerful models to downstream tasks is increasingly important. In this paper, we study a principled finetuning paradigm -- Orthogonal Finetuning (OFT) -- for downstream task adaptation. Despite demonstrating good generalizability, OFT still uses a fairly large number of trainable parameters due to the high dimensionality of orthogonal matrices. To address this, we start by examining OFT from an information transmission perspective, and then identify a few key desiderata that enable better parameter-efficiency. Inspired by how the Cooley-Tukey fast Fourier transform algorithm enables efficient information transmission, we propose an efficient orthogonal parameterization using  butterfly structures. We apply this parameterization to OFT, creating  a novel parameter-efficient finetuning method, called Orthogonal Butterfly (BOFT). By subsuming OFT as a special case, BOFT introduces a generalized orthogonal finetuning framework. Finally, we conduct an extensive empirical study of adapting large vision transformers, large language models, and text-to-image diffusion models to various downstream tasks in computer vision and natural language. The results validate the effectiveness of BOFT as a generic finetuning method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7NzgkEdGyr",
    "arxiv_id": "2311.06243",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19356,
    "title": "Human Feedback is not Gold Standard",
    "authors": [
      "Tom Hosking",
      "Phil Blunsom",
      "Max Bartolo"
    ],
    "abstract": "Human feedback has become the de facto standard for evaluating the performance of Large Language Models, and is increasingly being used as a training objective. However, it is not clear which properties of a generated output this single `preference' score captures. We hypothesise that preference scores are subjective and open to undesirable biases. We critically analyse the use of human feedback for both training and evaluation, to verify whether it fully captures a range of crucial error criteria. We find that while preference scores have fairly good coverage, they under-represent important aspects like factuality. We further hypothesise that both preference scores and error annotation may be affected by confounders, and leverage instruction-tuned models to generate outputs that vary along two possible confounding dimensions: assertiveness and complexity. We find that the assertiveness of an output skews the perceived rate of factuality errors, indicating that human annotations are not a fully reliable evaluation metric or training objective. Finally, we offer preliminary evidence that using human feedback as a training objective disproportionately increases the assertiveness of model outputs. We encourage future work to carefully consider whether preference scores are well aligned with the desired objective.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7W3GLNImfS",
    "arxiv_id": "2309.16349",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18973,
    "title": "Domain-Inspired Sharpness-Aware Minimization Under Domain Shifts",
    "authors": [
      "Ruipeng Zhang",
      "Ziqing Fan",
      "Jiangchao Yao",
      "Ya Zhang",
      "Yanfeng Wang"
    ],
    "abstract": "This paper presents a Domain-Inspired Sharpness Aware Minimization (DISAM) algorithm for optimization under domain shifts. It is motivated by the inconsistent convergence degree of SAM across different domains, which induces optimization bias towards certain domains and thus impairs the overall convergence. To address this issue, we consider the domain-level convergence consistency in the sharpness estimation to prevent the overwhelming (deficient) perturbations for less (well) optimized domains. Specifically, DISAM introduces the constraint of minimizing variance in the domain loss, which allows the elastic gradient calibration in perturbation generation: when one domain is optimized above the averaging level \\textit{w.r.t.} loss, the gradient perturbation towards that domain will be weakened automatically, and vice versa. Under this mechanism, we theoretically show that DISAM can achieve faster overall convergence and improved generalization in principle when inconsistent convergence emerges. Extensive experiments on various domain generalization benchmarks show the superiority of DISAM over a range of state-of-the-art methods. Furthermore, we show the superior efficiency of DISAM in parameter-efficient fine-tuning combined with the pretraining models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=I4wB3HA3dJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19348,
    "title": "Continuous-Multiple Image Outpainting in One-Step via Positional Query and A Diffusion-based Approach",
    "authors": [
      "Shaofeng Zhang",
      "Jinfa Huang",
      "Qiang Zhou",
      "zhibin wang",
      "Fan Wang",
      "Jiebo Luo",
      "Junchi Yan"
    ],
    "abstract": "Image outpainting aims to generate the content of an input sub-image beyond its original boundaries. It is an important task in content generation yet remains an open problem for generative models. This paper pushes the technical frontier of image outpainting in two directions that have not been resolved in literature: 1) outpainting with arbitrary and continuous multiples (without restriction), and 2) outpainting in a single step (even for large expansion multiples). Moreover, we develop a method that does not depend on a pre-trained backbone network, which is in contrast commonly required by the previous SOTA outpainting methods. The arbitrary multiple outpainting is achieved by utilizing randomly cropped views from the same image during training to capture arbitrary relative positional information. Specifically, by feeding one view and positional embeddings as queries, we can reconstruct another view. At inference, we generate images with arbitrary expansion multiples by inputting an anchor image and its corresponding positional embeddings. The one-step outpainting ability here is particularly noteworthy in contrast to previous methods that need to be performed for $N$ times to obtain a final multiple which is $N$ times of its basic and fixed multiple. We evaluate the proposed approach (called PQDiff as we adopt a diffusion-based generator as our embodiment, under our proposed \\textbf{P}ositional \\textbf{Q}uery scheme) on public benchmarks, demonstrating its superior performance over state-of-the-art approaches. Specifically, PQDiff achieves state-of-the-art FID scores on the Scenery (\\textbf{21.512}), Building Facades (\\textbf{25.310}), and WikiArts (\\textbf{36.212}) datasets. Furthermore, under the 2.25x, 5x and 11.7x outpainting settings, PQDiff only takes \\textbf{40.6\\%}, \\textbf{20.3\\%} and \\textbf{10.2\\%} of the time of the benchmark state-of-the-art (SOTA) method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7hxoYxKDTV",
    "arxiv_id": "2401.15652",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19345,
    "title": "Rethinking and Extending the Probabilistic Inference Capacity of GNNs",
    "authors": [
      "Tuo Xu",
      "Lei Zou"
    ],
    "abstract": "Designing expressive Graph Neural Networks (GNNs) is an important topic in graph machine learning fields. Despite the existence of numerous approaches proposed to enhance GNNs based on Weisfeiler-Lehman (WL) tests, what GNNs \\emph{can and cannot} learn still lacks a deeper understanding. This paper adopts a fundamentally different approach to examine the expressive power of GNNs from a probabilistic perspective. By establishing connections between GNNs' predictions and the central inference problems of probabilistic graphical models (PGMs), we can analyze previous GNN variants with a novel hierarchical framework and gain new insights into their node-level and link-level behaviors. Additionally, we introduce novel methods that can provably enhance GNNs' ability to capture complex dependencies and make complex predictions. Experiments on both synthetic and real-world datasets demonstrate the effectiveness of our approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7vVWiCrFnd",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18433,
    "title": "Leveraging augmented-Lagrangian techniques for differentiating over infeasible quadratic programs in machine learning",
    "authors": [
      "Antoine Bambade",
      "Fabian Schramm",
      "Adrien Taylor",
      "Justin Carpentier"
    ],
    "abstract": "Optimization layers within neural network architectures have become increasingly popular for their ability to solve a wide range of machine learning tasks and to model domain-specific knowledge. However, designing optimization layers requires careful consideration as the underlying optimization problems might be infeasible during training. Motivated by applications in learning, control and robotics, this work focuses on convex quadratic programming (QP) layers. The specific structure of this type of optimization layer can be efficiently exploited for faster computations while still allowing rich modeling capabilities. We leverage primal-dual augmented Lagrangian techniques for computing derivatives of both feasible and infeasible QP solutions. More precisely, we propose a unified approach which tackles the differentiability of the closest feasible QP solutions in a classical $\\ell_2$ sense. The obtained Jacobian covers for feasible QPs the traditional implicit differentiation when it is valid and a weaker notion (i.e., conservative Jacobian) when it is infeasible. We then harness this approach to enrich the expressive capabilities of existing QP layers. More precisely, we show how differentiating through infeasible QPs during training enables to drive towards feasibility at test time a new range of QP layers. These layers notably demonstrate superior predictive performance in some conventional learning tasks. Additionally, we present alternative formulations that enhance numerical robustness, speed, and accuracy for training such layers. Along with these contributions, we provide an open-source C++ software package called QPLayer for differentiating feasible and infeasible convex QPs and which can be interfaced with modern learning frameworks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=YCPDFfmkFr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18432,
    "title": "Training Diffusion Models with Reinforcement Learning",
    "authors": [
      "Kevin Black",
      "Michael Janner",
      "Yilun Du",
      "Ilya Kostrikov",
      "Sergey Levine"
    ],
    "abstract": "Diffusion models are a class of flexible generative models trained with an approximation to the log-likelihood objective. However, most use cases of diffusion models are not concerned with likelihoods, but instead with downstream objectives such as human-perceived image quality or drug effectiveness. In this paper, we investigate reinforcement learning methods for directly optimizing diffusion models for such objectives. We describe how posing denoising as a multi-step decision-making problem enables a class of policy gradient algorithms, which we refer to as denoising diffusion policy optimization (DDPO), that are more effective than alternative reward-weighted likelihood approaches. Empirically, DDPO is able to adapt text-to-image diffusion models to objectives that are difficult to express via prompting, such as image compressibility, and those derived from human feedback, such as aesthetic quality. Finally, we show that DDPO can improve prompt-image alignment using feedback from a vision-language model without the need for additional data collection or human annotation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YCWjhGrJFD",
    "arxiv_id": "2305.13301",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18431,
    "title": "Implicit Gaussian process representation of vector fields over arbitrary latent manifolds",
    "authors": [
      "Robert Peach",
      "Matteo Vinao-Carl",
      "Nir Grossman",
      "Michael David",
      "Emma Mallas",
      "David J. Sharp",
      "Paresh A. Malhotra",
      "Pierre Vandergheynst",
      "Adam Gosztolai"
    ],
    "abstract": "Gaussian processes (GPs) are popular nonparametric statistical models for learning unknown functions and quantifying the spatiotemporal uncertainty in data. Recent works have extended GPs to model scalar and vector quantities distributed over non-Euclidean domains, including smooth manifolds, appearing in numerous fields such as computer vision, dynamical systems, and neuroscience. However, these approaches assume that the manifold underlying the data is known, limiting their practical utility. We introduce RVGP, a generalisation of GPs for learning vector signals over latent Riemannian manifolds. Our method uses positional encoding with eigenfunctions of the connection Laplacian, associated with the tangent bundle, readily derived from common graph-based approximation of data. We demonstrate that RVGP possesses global regularity over the manifold, which allows it to super-resolve and inpaint vector fields while preserving singularities. Furthermore, we use RVGP to reconstruct high-density neural dynamics derived from low-density EEG recordings in healthy individuals and Alzheimer's patients. We show that vector field singularities are important disease markers and that their reconstruction leads to a comparable classification accuracy of disease states to high-density recordings. Thus, our method overcomes a significant practical limitation in experimental and clinical applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YEPlTU5mZC",
    "arxiv_id": "2309.16746",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19332,
    "title": "Learning with a Mole: Transferable latent spatial representations for navigation without reconstruction",
    "authors": [
      "Guillaume Bono",
      "Leonid Antsfeld",
      "Assem Sadek",
      "Gianluca Monaci",
      "Christian Wolf"
    ],
    "abstract": "Agents navigating in 3D environments require some form of memory, which should hold a compact and actionable representation of the history of observations useful for decision taking and planning. In most end-to-end learning approaches the representation is latent and usually does not have a clearly defined interpretation, whereas classical robotics addresses this with scene reconstruction resulting in some form of map, usually estimated with geometry and sensor models and/or learning. In this work we propose to learn an actionable representation of the scene independently of the targeted downstream task and without explicitly optimizing reconstruction. The learned representation is optimized by a blind auxiliary agent trained to navigate with it on multiple short sub episodes branching out from a waypoint and, most importantly, without any direct visual observation. We argue and show that the blindness property is important and forces the (trained) latent representation to be the only means for planning. With probing experiments we show that the learned representation optimizes navigability and not reconstruction. On downstream tasks we show that it is robust to changes in distribution, in particular the sim2real gap, which we evaluate with a real physical robot in a real office building, significantly improving performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8HCARN2hhw",
    "arxiv_id": "2306.03857",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18430,
    "title": "Differentially Private Synthetic Data via Foundation Model APIs 1: Images",
    "authors": [
      "Zinan Lin",
      "Sivakanth Gopi",
      "Janardhan Kulkarni",
      "Harsha Nori",
      "Sergey Yekhanin"
    ],
    "abstract": "Generating differentially private (DP) synthetic data that closely resembles the original private data is a scalable way to mitigate privacy concerns in the current data-driven world. In contrast to current practices that train customized models for this task, we aim to generate DP Synthetic Data via APIs (DPSDA), where we treat foundation models as blackboxes and only utilize their inference APIs. Such API-based, training-free approaches are easier to deploy as exemplified by the recent surge in the number of API-based apps. These approaches can also leverage the power of large foundation models which are only accessible via their inference APIs. However, this comes with greater challenges due to strictly more restrictive model access and the need to protect privacy from the API provider.In this paper, we present a new framework called Private Evolution (PE) to solve this problem and show its initial promise on synthetic images. Surprisingly, PE can match or even outperform state-of-the-art (SOTA) methods without any model training. For example, on CIFAR10 (with ImageNet as the public data), we achieve FID\u22647.9 with privacy cost \u03b5 = 0.67, significantly improving the previous SOTA from \u03b5 = 32. We further demonstrate the promise of applying PE on large foundation models such as Stable Diffusion to tackle challenging private datasets with a small number of high-resolution images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YEhQs8POIo",
    "arxiv_id": "2305.15560",
    "GitHub": [
      "https://github.com/microsoft/DPSDA"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18427,
    "title": "Parsing neural dynamics with infinite recurrent switching linear dynamical systems",
    "authors": [
      "Victor Geadah",
      "International Brain Laboratory",
      "Jonathan W. Pillow"
    ],
    "abstract": "Unsupervised methods for dimensionality reduction of neural activity and behavior have provided unprecedented insights into the underpinnings of neural information processing. One popular approach involves the recurrent switching linear dynamical system (rSLDS) model, which describes the latent dynamics of neural spike train data using discrete switches between a finite number of low-dimensional linear dynamical systems. However, a few properties of rSLDS model limit its deployability on trial-varying data, such as a fixed number of states over trials, and no latent structure or organization of states. Here we overcome these limitations by endowing the rSLDS model with a semi-Markov discrete state process, with latent geometry, that captures key properties of stochastic processes over partitions with flexible state cardinality. We leverage partial differential equations (PDE) theory to derive an efficient, semi-parametric formulation for dynamical sufficient statistics to the discrete states. This process, combined with switching dynamics, defines our infinite recurrent switching linear dynamical system (irSLDS) model class. We first validate and demonstrate the capabilities of our model on synthetic data. Next, we turn to the analysis of mice electrophysiological data during decision-making, and uncover strong non-stationary processes underlying both within-trial and trial-averaged neural activity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YIls9HEa52",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18426,
    "title": "Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems",
    "authors": [
      "Juno Kim",
      "Kakei Yamamoto",
      "Kazusato Oko",
      "Zhuoran Yang",
      "Taiji Suzuki"
    ],
    "abstract": "In this paper, we extend mean-field Langevin dynamics to minimax optimization over probability distributions for the first time with symmetric and provably convergent updates. We propose \\emph{mean-field Langevin averaged gradient} (MFL-AG), a single-loop algorithm that implements gradient descent ascent in the distribution spaces with a novel weighted averaging, and establish average-iterate convergence to the mixed Nash equilibrium. We also study both time and particle discretization regimes and prove a new uniform-in-time propagation of chaos result which accounts for the dependency of the particle interactions on all previous distributions. Furthermore, we propose \\emph{mean-field Langevin anchored best response} (MFL-ABR), a symmetric double-loop algorithm based on best response dynamics with linear last-iterate convergence. Finally, we study applications to zero-sum Markov games and conduct simulations demonstrating long-term optimality.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=YItWKZci78",
    "arxiv_id": "2312.01127",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18425,
    "title": "Towards Poisoning Fair Representations",
    "authors": [
      "Tianci Liu",
      "Haoyu Wang",
      "Feijie Wu",
      "Hengtong Zhang",
      "Pan Li",
      "Lu Su",
      "Jing Gao"
    ],
    "abstract": "Fair machine learning seeks to mitigate model prediction bias against certain demographic subgroups such as elder and female. Recently, fair representation learning (FRL) trained by deep neural networks has demonstrated superior performance, whereby representations containing no demographic information are inferred from the data and then used as the input to classification or other downstream tasks. Despite the development of FRL methods, their vulnerability under data poisoning attack, a popular protocol to benchmark model robustness under adversarial scenarios, is under-explored. Data poisoning attacks have been developed for classical fair machine learning methods which incorporate fairness constraints into shallow-model classifiers.Nonetheless, these attacks fall short in FRL due to notably different fairness goals and model architectures. This work proposes the first data poisoning framework attacking FRL. We induce the model to output unfair representations that contain as much demographic information as possible by injecting carefully crafted poisoning samples into the training data.This attack entails a prohibitive bilevel optimization, wherefore an effective approximated solution is proposed. A theoretical analysis on the needed number of poisoning samples is derived and sheds light on defending against the attack. Experiments on benchmark fairness datasets and state-of-the-art fair representation learning models demonstrate the superiority of our attack.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YLJs4mKJCF",
    "arxiv_id": "2309.16487",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18424,
    "title": "Conditional Variational Diffusion Models",
    "authors": [
      "Gabriel Della Maggiora",
      "Luis Alberto Croquevielle",
      "Nikita Deshpande",
      "Harry Horsley",
      "Thomas Heinis",
      "Artur Yakimovich"
    ],
    "abstract": "Inverse problems aim to determine causal factors from observations, a crucial task in engineering and science. Lately, generative models, especially diffusion models, have gained popularity in this area for their ability to produce realistic solutions and their good mathematical properties. Despite their success, an important drawback of diffusion models is their sensitivity to the choice of variance schedule, which controls the dynamics of the diffusion process. Fine-tuning this schedule for specific applications is crucial but time-costly, and does not guarantee an optimal result. We propose a novel approach for learning the schedule as part of the training process. Our method supports probabilistic conditioning on data, provides high-quality solutions, and is flexible, proving able to adapt to different applications with minimum overhead. This approach is tested in two unrelated inverse problems: super-resolution microscopy and quantitative phase imaging, yielding comparable or superior results to previous methods and fine-tuned diffusion models. We conclude that fine-tuning the schedule by experimentation should be avoided because it can be learned during training in a stable way that yields better results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YOKnEkIuoi",
    "arxiv_id": "2312.02246",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18423,
    "title": "In-Context Learning Learns Label Relationships but Is Not Conventional Learning",
    "authors": [
      "Jannik Kossen",
      "Yarin Gal",
      "Tom Rainforth"
    ],
    "abstract": "The predictions of Large Language Models (LLMs) on downstream tasks often improve significantly when including examples of the input\u2013label relationship in the context. However, there is currently no consensus about how this in-context learning (ICL) ability of LLMs works. For example, while Xie et al. (2022) liken ICL to a general-purpose learning algorithm, Min et al. (2022b) argue ICL does not even learn label relationships from in-context examples. In this paper, we provide novel insights into how ICL leverages label information, revealing both capabilities and limitations. To ensure we obtain a comprehensive picture of ICL behavior, we study probabilistic aspects of ICL predictions and thoroughly examine the dynamics of ICL as more examples are provided. Our experiments show that ICL predictions almost always depend on in-context labels, and that ICL can learn truly novel tasks in-context. However, we also find that ICL struggles to fully overcome prediction preferences acquired from pre-training data, and, further, that ICL does not consider all in-context information equally.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YPIA7bgd5y",
    "arxiv_id": "2307.12375",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18421,
    "title": "Sample Efficient Myopic Exploration Through Multitask Reinforcement Learning with Diverse Tasks",
    "authors": [
      "Ziping Xu",
      "Zifan Xu",
      "Runxuan Jiang",
      "Peter Stone",
      "Ambuj Tewari"
    ],
    "abstract": "Multitask Reinforcement Learning (MTRL) approaches have gained increasing attention for its wide applications in many important Reinforcement Learning (RL) tasks. However, while recent advancements in MTRL theory have focused on the improved statistical efficiency by assuming a shared structure across tasks, exploration--a crucial aspect of RL--has been largely overlooked. This paper addresses this gap by showing that when an agent is trained on a sufficiently diverse set of tasks, a generic  policy-sharing algorithm with myopic exploration design like $\\epsilon$-greedy that are inefficient in general can be sample-efficient for MTRL. To the best of our knowledge, this is the first theoretical demonstration of the \"exploration benefits\" of MTRL. It may also shed light on the enigmatic success of the wide applications of myopic exploration in practice. To validate the role of diversity, we conduct experiments on synthetic robotic control environments, where the diverse task set aligns with the task selection by automatic curriculum learning, which is empirically shown to improve sample-efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YZrg56G0JV",
    "arxiv_id": "2403.01636",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18422,
    "title": "Tuning LayerNorm in Attention: Towards Efficient Multi-Modal LLM Finetuning",
    "authors": [
      "Bingchen Zhao",
      "Haoqin Tu",
      "Chen Wei",
      "Jieru Mei",
      "Cihang Xie"
    ],
    "abstract": "This paper introduces an efficient strategy to transform Large Language Models(LLMs) into Multi-Modal Large Language Models (MLLMs). By conceptualizingthis transformation as a domain adaptation process, i.e., transitioning from textunderstanding to embracing multiple modalities, we intriguingly note that, withineach attention block, tuning LayerNorm suffices to yield strong performance.Moreover, when benchmarked against other tuning approaches like full parameterfinetuning or LoRA, its benefits on efficiency are substantial. For example, whencompared to LoRA on a 13B model scale, performance can be enhanced by anaverage of over 20% across five multi-modal tasks, and meanwhile, results in asignificant reduction of trainable parameters by 41.9% and a decrease in GPUmemory usage by 17.6%. On top of this LayerNorm strategy, we showcase thatselectively tuning only with conversational data can improve efficiency further.Beyond these empirical outcomes, we provide a comprehensive analysis to explorethe role of LayerNorm in adapting LLMs to the multi-modal domain and improvingthe expressive power of the model.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=YR3ETaElNK",
    "arxiv_id": "2312.11420",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19311,
    "title": "What does automatic differentiation compute for neural networks?",
    "authors": [
      "Sejun Park",
      "Sanghyuk Chun",
      "Wonyeol Lee"
    ],
    "abstract": "Forward- or reverse-mode automatic differentiation (AD) is a popular algorithm for computing the derivative of a function expressed by a program. AD always outputs the correct derivative if a program does not use any non-differentiable functions and control flows; however, it may return an arbitrary value otherwise. In this work, we investigate what AD computes for neural networks that may contain non-differentiable functions such as ReLU and maxpools. We first prove that AD always returns a generalized derivative called a Clarke subderivative for networks with pointwise activation functions, if the minibatch size is one and all non-differentiable neurons have distinct bias parameters. We show that the same conclusion does not hold otherwise, but does hold under some mild sufficient conditions. We also prove similar results for more general networks that can use maxpools and bias parameters shared across different neurons. We empirically check our sufficient conditions over popular network architectures and observe that AD almost always computes a Clarke subderivative in practical learning setups.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=8vKknbgXxf",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18418,
    "title": "BayesDiff: Estimating Pixel-wise Uncertainty in Diffusion via Bayesian Inference",
    "authors": [
      "Siqi Kou",
      "Lei Gan",
      "Dequan Wang",
      "Chongxuan Li",
      "Zhijie Deng"
    ],
    "abstract": "Diffusion models have impressive image generation capability, but low-quality generations still exist, and their identification remains challenging due to the lack of a proper sample-wise metric. To address this, we propose BayesDiff, a pixel-wise uncertainty estimator for generations from diffusion models based on Bayesian inference. In particular, we derive a novel uncertainty iteration principle to characterize the uncertainty dynamics in diffusion, and leverage the last-layer Laplace approximation for efficient Bayesian inference. The estimated pixel-wise uncertainty can not only be aggregated into a sample-wise metric to filter out low-fidelity images but also aids in augmenting successful generations and rectifying artifacts in failed generations in text-to-image tasks. Extensive experiments demonstrate the efficacy of BayesDiff and its promise for practical applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YcM6ofShwY",
    "arxiv_id": "2310.11142",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18415,
    "title": "AUC-CL: A Batchsize-Robust Framework for Self-Supervised Contrastive Representation Learning",
    "authors": [
      "Rohan Sharma",
      "Kaiyi Ji",
      "zhiqiang xu",
      "Changyou Chen"
    ],
    "abstract": "Self-supervised learning through contrastive representations is an emergent and promising avenue, aiming at alleviating the availability of labeled data. Recent research in the field also demonstrates its viability for several downstream tasks, henceforth leading to works that implement the contrastive principle through innovative loss functions and methods. However, despite achieving impressive progress, most methods depend on prohibitively large batch sizes and compute requirements for good performance. In this work, we propose the $\\textbf{AUC}$-$\\textbf{C}$ontrastive $\\textbf{L}$earning, a new approach to contrastive learning that demonstrates robust and competitive performance in compute-limited regimes. We propose to incorporate the contrastive objective within the AUC-maximization framework, by noting that the AUC metric is maximized upon enhancing the probability of the network's binary prediction difference between positive and negative samples which inspires adequate embedding space arrangements in representation learning. Unlike standard contrastive methods, when performing stochastic optimization, our method maintains unbiased stochastic gradients and thus is more robust to batchsizes as opposed to standard stochastic optimization problems.Remarkably, our method with a batch size of 256, outperforms several state-of-the-art methods that may need much larger batch sizes (e.g., 4096), on ImageNet and other standard datasets. Experiments on transfer learning, few-shot learning, and other downstream tasks also demonstrate the viability of our method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YgMdDQB09U",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18414,
    "title": "EmerDiff: Emerging Pixel-level Semantic Knowledge in Diffusion Models",
    "authors": [
      "Koichi Namekata",
      "Amirmojtaba Sabour",
      "Sanja Fidler",
      "Seung Wook Kim"
    ],
    "abstract": "Diffusion models have recently received increasing research attention for their impressive transfer abilities to semantic segmentation tasks. However, previous works rely on additional supervision to produce fine-grained segmentation maps, leaving it unclear how much diffusion models alone understand the semantic relations of their generated images. To help answer this question, we exploit the semantic knowledge extracted from Stable Diffusion (SD) and build an image segmentor that can generate fine-grained segmentation maps without any additional training. The major issue that makes this task challenging for previous works is that semantically meaningful feature maps usually exist only in the spatially lower-dimensional layers, which makes it infeasible to extract pixel-level semantic relations directly from the feature maps. To overcome this challenge, our framework identifies semantic correspondences between image pixels and spatial locations of low-dimensional feature maps by analyzing SD\u2019s generation process and utilizes them to construct image-resolution segmentation maps. In extensive experiments, the produced segmentation maps are shown to be well delineated and capture detailed parts of the images, indicating the existence of highly accurate pixel-level semantic knowledge in the diffusion models",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YqyTXmF8Y2",
    "arxiv_id": "2401.11739",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19310,
    "title": "MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data",
    "authors": [
      "Yinya Huang",
      "Xiaohan Lin",
      "Zhengying Liu",
      "Qingxing Cao",
      "Huajian Xin",
      "Haiming Wang",
      "Zhenguo Li",
      "Linqi Song",
      "Xiaodan Liang"
    ],
    "abstract": "Recent large language models (LLMs) have witnessed significant advancement in various tasks, including mathematical reasoning and theorem proving. As these two tasks require strict and formal multi-step inference, they are appealing domains for exploring the reasoning ability of LLMs but still face important challenges. Previous studies such as Chain-of-Thought (CoT) have revealed the effectiveness of intermediate steps guidance. However, such step-wise annotation requires heavy labor, leading to insufficient training steps for current benchmarks. To fill this gap, this work introduces MUSTARD, a data generation framework that masters uniform synthesis of theorem and proof data of high quality and diversity. MUSTARD synthesizes data in three stages: (1) It samples a few mathematical concept seeds as the problem category. (2) Then, it prompts a generative language model with the sampled concepts to obtain both the problems and their step-wise formal solutions. (3) Lastly, the framework utilizes a proof assistant (e.g., Lean Prover) to filter the valid proofs. With the proposed MUSTARD, we present a theorem-and-proof benchmark MUSTARDSAUCE with 5,866 valid data points. Each data point contains an informal statement, an informal proof, and a translated formal proof that passes the prover validation. We perform extensive analysis and demonstrate that MUSTARD generates validated high-quality step-by-step data. We further apply the MUSTARDSAUCE for fine-tuning smaller language models. The fine-tuned Llama 2-7B achieves a 15.41% average relative performance gain in automated theorem proving, and 8.18% in math word problems. Codes and data are available at https://github.com/Eleanor-H/MUSTARD.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=8xliOUg9EW",
    "arxiv_id": "2402.08957",
    "GitHub": [
      "https://github.com/Eleanor-H/MUSTARD"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18413,
    "title": "An Agnostic View on the Cost of Overfitting in (Kernel) Ridge Regression",
    "authors": [
      "Lijia Zhou",
      "James B Simon",
      "Gal Vardi",
      "Nathan Srebro"
    ],
    "abstract": "We study the cost of overfitting in noisy kernel ridge regression (KRR), which we define as the ratio between the test error of the interpolating ridgeless model and the test error of the optimally-tuned model. We take an ``agnostic'' view in the following sense: we consider the cost as a function of sample size for any target function, even if the sample size is not large enough for consistency or the target is outside the RKHS. We analyze the cost of overfitting under a Gaussian universality ansatz using recently derived (non-rigorous) risk estimates in terms of the task eigenstructure. Our analysis provides a more refined characterization of benign, tempered and catastrophic overfitting (cf. Mallinar et al. 2022).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YrTI2Zu0dd",
    "arxiv_id": "2306.13185",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18412,
    "title": "Posterior Sampling Based on Gradient Flows of the MMD with Negative Distance Kernel",
    "authors": [
      "Paul Hagemann",
      "Johannes Hertrich",
      "Fabian Altekr\u00fcger",
      "Robert Beinert",
      "Jannis Chemseddine",
      "Gabriele Steidl"
    ],
    "abstract": "We propose conditional flows of the maximum mean discrepancy (MMD) with the negative distance kernel for posterior sampling and conditional generative modelling. This MMD, which is also known as energy distance, has several advantageous properties like efficient computation via slicing and sorting. We approximate the joint distribution of the ground truth and the observations using discrete Wasserstein gradient flows and establish an error bound for the posterior distributions. Further, we prove that our particle flow is indeed a Wasserstein gradient flow of an appropriate functional. The power of our method is demonstrated by numerical examples including conditional image generation and inverse problems like superresolution, inpainting and computed tomography in low-dose and limited-angle settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YrXHEb2qMb",
    "arxiv_id": "2310.03054",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18410,
    "title": "Addressing Signal Delay in Deep Reinforcement Learning",
    "authors": [
      "Wei Wang",
      "Dongqi Han",
      "Xufang Luo",
      "Dongsheng Li"
    ],
    "abstract": "Despite the notable advancements in deep reinforcement learning (DRL) in recent years, a prevalent issue that is often overlooked is the impact of signal delay. Signal delay occurs when there is a lag between an agent's perception of the environment and its corresponding actions. In this paper, we first formalize delayed-observation Markov decision processes (DOMDP) by extending the standard MDP framework to incorporate signal delays. Next, we elucidate the challenges posed by the presence of signal delay in DRL, showing that trivial DRL algorithms and generic methods for partially observable tasks suffer greatly from delays. Lastly, we propose effective strategies to overcome these challenges. Our methods achieve remarkable performance in continuous robotic control tasks with large delays, yielding results comparable to those in non-delayed cases. Overall, our work contributes to a deeper understanding of DRL in the presence of signal delays and introduces novel approaches to address the associated challenges.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Z8UfDs4J46",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18409,
    "title": "Neuro-Inspired Information-Theoretic Hierarchical Perception for Multimodal Learning",
    "authors": [
      "Xiongye Xiao",
      "Gengshuo Liu",
      "Gaurav Gupta",
      "Defu Cao",
      "Shixuan Li",
      "Yaxing Li",
      "Tianqing Fang",
      "Mingxi Cheng",
      "Paul Bogdan"
    ],
    "abstract": "Integrating and processing information from various sources or modalities are critical for obtaining a comprehensive and accurate perception of the real world. Drawing inspiration from neuroscience, we develop the Information-Theoretic Hierarchical Perception (ITHP) model, which utilizes the concept of information bottleneck. Different from most traditional fusion models that incorporate all modalities identically in neural networks, our model designates a prime modality and regards the remaining modalities as detectors in the information pathway, serving to distill the flow of information. Our proposed perception model focuses on constructing an effective and compact information flow by achieving a balance between the minimization of mutual information between the latent state and the input modal state, and the maximization of mutual information between the latent states and the remaining modal states. This approach leads to compact latent state representations that retain relevant information while minimizing redundancy, thereby substantially enhancing the performance of multimodal representation learning. Experimental evaluations on the MUStARD, CMU-MOSI, and CMU-MOSEI datasets demonstrate that our model consistently distills crucial information in multimodal learning scenarios, outperforming state-of-the-art benchmarks. Remarkably, on the CMU-MOSI dataset, ITHP-DeBERTa surpasses human-level performance in the multimodal sentiment binary classification task across all evaluation metrics (i.e., Binary Accuracy, F1 Score, Mean Absolute Error, and Pearson Correlation).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Z9AZsU1Tju",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18407,
    "title": "Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization",
    "authors": [
      "Hanmin Li",
      "Avetik Karagulyan",
      "Peter Richt\u00e1rik"
    ],
    "abstract": "This paper introduces a new method for minimizing matrix-smooth non-convex objectives through the use of novel Compressed Gradient Descent (CGD) algorithms enhanced with a matrix-valued stepsize. The proposed algorithms are theoretically analyzed first in the single-node and subsequently in the distributed settings. Our theoretical results reveal that the matrix stepsize in CGD can capture the objective\u2019s structure and lead to faster convergence compared to a scalar stepsize. As a byproduct of our general results, we emphasize the importance of selecting the compression mechanism and the matrix stepsize in a layer-wise manner, taking advantage of model structure. Moreover, we provide theoretical guarantees for free compression, by designing specific layer-wise compressors for the non-convex matrix smooth objectives. Our findings are supported with empirical evidence.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZEZ0CPmoSI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18406,
    "title": "Skill or Luck? Return Decomposition via Advantage Functions",
    "authors": [
      "Hsiao-Ru Pan",
      "Bernhard Sch\u00f6lkopf"
    ],
    "abstract": "Learning from off-policy data is essential for sample-efficient reinforcement learning. In the present work, we build on the insight that the advantage function can be understood as the causal effect of an action on the return, and show that this allows us to decompose the return of a trajectory into parts caused by the agent\u2019s actions (skill) and parts outside of the agent\u2019s control (luck). Furthermore, this decomposition enables us to naturally extend Direct Advantage Estimation (DAE) to off-policy settings (Off-policy DAE). The resulting method can learnfrom off-policy trajectories without relying on importance sampling techniques or truncating off-policy actions. We draw connections between Off-policy DAE and previous methods to demonstrate how it can speed up learning and when the proposed off-policy corrections are important. Finally, we use the MinAtar environments to illustrate how ignoring off-policy corrections can lead to suboptimal policy optimization performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZFMiHfZwIf",
    "arxiv_id": "2402.12874",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19293,
    "title": "Most discriminative stimuli for functional cell type clustering",
    "authors": [
      "Max F Burg",
      "Thomas Zenkel",
      "Michaela Vystr\u010dilov\u00e1",
      "Jonathan Oesterle",
      "Larissa H\u00f6fling",
      "Konstantin Friedrich Willeke",
      "Jan Lause",
      "Sarah M\u00fcller",
      "Paul G. Fahey",
      "Zhiwei Ding",
      "Kelli Restivo",
      "Shashwat Sridhar",
      "Tim Gollisch",
      "Philipp Berens",
      "Andreas S. Tolias",
      "Thomas Euler",
      "Matthias Bethge",
      "Alexander S Ecker"
    ],
    "abstract": "Identifying cell types and understanding their functional properties is crucial for unraveling the mechanisms underlying perception and cognition. For example in the retina, functional types can be identified by a carefully selected and manually curated battery of stimuli. However, this requires expert domain knowledge and biases the procedure towards previously known cell types. In the visual cortex, it is still unknown what functional types exist and how to identify them. Thus, for unbiased identification of the functional cell types in retina and visual cortex, new approaches are needed. Here we propose an optimization-based clustering approach using deep predictive models to obtain functional clusters of neurons using Maximally Discriminative Stimuli (MDS). Our approach alternates between stimulus optimization with cluster reassignment akin to an expectation-maximization algorithm. The algorithm recovers functional clusters in mouse retina, marmoset retina and macaque visual area V4. This demonstrates that our approach can successfully find discriminative stimuli across species, stages of the visual system and recording techniques. Presenting maximally discriminative stimuli during data acquisition allows for on-the-fly assignment to functional cell types, and paves the way for experiments that were previously limited by experimental time. Crucially, MDS are interpretable: they visualize the distinctive stimulus patterns that most unambiguously identify a specific type of neuron. We will make our code avail- able online upon publication.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9W6KaAcYlr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18405,
    "title": "Connecting Large Language Models with Evolutionary Algorithms Yields Powerful Prompt Optimizers",
    "authors": [
      "Qingyan Guo",
      "Rui Wang",
      "Junliang Guo",
      "Bei Li",
      "Kaitao Song",
      "Xu Tan",
      "Guoqing Liu",
      "Jiang Bian",
      "Yujiu Yang"
    ],
    "abstract": "Large Language Models (LLMs) excel in various tasks, but they rely on carefully crafted prompts that often demand substantial human effort. To automate this process, in this paper, we propose a novel framework for discrete prompt optimization, called EvoPrompt, which borrows the idea of evolutionary algorithms (EAs) as they exhibit good performance and fast convergence. To enable EAs to work on discrete prompts, which are natural language expressions that need to be coherent and human-readable, we connect LLMs with EAs. This approach allows us to simultaneously leverage the powerful language processing capabilities of LLMs and the efficient optimization performance of EAs. Specifically, abstaining from any gradients or parameters, EvoPrompt starts from a population of prompts and iteratively generates new prompts with LLMs based on the evolutionary operators, improving the population based on the development set. We optimize prompts for both closed- and open-source LLMs including GPT-3.5 and Alpaca, on 31 datasets covering language understanding, generation tasks, as well as BIG-Bench Hard (BBH) tasks. EvoPrompt significantly outperforms human-engineered prompts and existing methods for automatic prompt generation (e.g., up to 25% on BBH). Furthermore, EvoPrompt demonstrates that connecting LLMs with EAs creates synergies, which could inspire further research on the combination of LLMs and conventional algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZG3RaNIsO8",
    "arxiv_id": "2309.08532",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18404,
    "title": "Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning",
    "authors": [
      "LINHAO LUO",
      "Yuan-Fang Li",
      "Reza Haf",
      "Shirui Pan"
    ],
    "abstract": "Large language models (LLMs) have demonstrated impressive reasoning abilities in complex tasks. However, they lack up-to-date knowledge and experience hallucinations during reasoning, which can lead to incorrect reasoning processes and diminish their performance and trustworthiness. Knowledge graphs (KGs), which capture vast amounts of facts in a structured format, offer a reliable source of knowledge for reasoning. Nevertheless, existing KG-based LLM reasoning methods only treat KGs as factual knowledge bases and overlook the importance of their structural information for reasoning. In this paper, we propose a novel method called reasoning on graphs (RoG) that synergizes LLMs with KGs to enable faithful and interpretable reasoning. Specifically, we present a planning-retrieval-reasoning framework, where RoG first generates relation paths grounded by KGs as faithful plans. These plans are then used to retrieve valid reasoning paths from the KGs for LLMs to conduct faithful reasoning. Furthermore, RoG not only distills knowledge from KGs to improve the reasoning ability of LLMs through training but also allows seamless integration with any arbitrary LLMs during inference. Extensive experiments on two benchmark KGQA datasets demonstrate that RoG achieves state-of-the-art performance on KG reasoning tasks and generates faithful and interpretable reasoning results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZGNWW7xZ6Q",
    "arxiv_id": "2310.01061",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18403,
    "title": "A Lightweight Method for Tackling Unknown Participation Statistics in Federated Averaging",
    "authors": [
      "Shiqiang Wang",
      "Mingyue Ji"
    ],
    "abstract": "In federated learning (FL), clients usually have diverse participation statistics that are unknown a priori, which can significantly harm the performance of FL if not handled properly. Existing works aiming at addressing this problem are usually based on global variance reduction, which requires a substantial amount of additional memory in a multiplicative factor equal to the total number of clients. An important open problem is to find a lightweight method for FL in the presence of clients with unknown participation rates. In this paper, we address this problem by adapting the aggregation weights in federated averaging (FedAvg) based on the participation history of each client. We first show that, with heterogeneous participation statistics, FedAvg with non-optimal aggregation weights can diverge from the optimal solution of the original FL objective, indicating the need of finding optimal aggregation weights. However, it is difficult to compute the optimal weights when the participation statistics are unknown. To address this problem, we present a new algorithm called FedAU, which improves FedAvg by adaptively weighting the client updates based on online estimates of the optimal weights without knowing the statistics of client participation. We provide a theoretical convergence analysis of FedAU using a novel methodology to connect the estimation error and convergence. Our theoretical results reveal important and interesting insights, while showing that FedAU converges to an optimal solution of the original objective and has desirable properties such as linear speedup. Our experimental results also verify the advantage of FedAU over baseline methods with various participation patterns.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ZKEuFKfCKA",
    "arxiv_id": "2306.03401",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18402,
    "title": "Accurate and Scalable Estimation of Epistemic Uncertainty for Graph Neural Networks",
    "authors": [
      "Puja Trivedi",
      "Mark Heimann",
      "Rushil Anirudh",
      "Danai Koutra",
      "Jayaraman J. Thiagarajan"
    ],
    "abstract": "While graph neural networks (GNNs) are widely used for node and graph representation learning tasks, the reliability of GNN uncertainty estimates under distribution shifts remains relatively under-explored. Indeed, while \\textit{post-hoc} calibration strategies can be used to improve in-distribution calibration, they need not also improve calibration under distribution shift. However, techniques which produce GNNs with better \\textit{intrinsic} uncertainty estimates are particularly valuable, as whey can always be combined with post-hoc strategies later. Therefore, in this work, we propose G-$\\Delta$UQ, a novel training framework designed to improve intrinsic GNN uncertainty estimates. Our framework adapts the principle of stochastic data centering to graph data through novel graph anchoring strategies, and is able to support partially stochastic GNNs. While, the prevalent wisdom is that fully stochastic networks are necessary to obtain reliable estimates, we find that the structure induced by our anchoring strategies renders this unnecessary and allows us to support \\gduq~ on pretrained models. Indeed, through extensive evaluation under covariate, concept and graph size shifts, we show that G-$\\Delta$UQ leads to better calibrated GNNs for node and graph classification. Further, it also improves performance on other uncertainty-based tasks like out-of-distribution detection and generalization gap estimation. Overall, our work provides insights into uncertainty estimation for GNNs, and demonstrates the utility of G-$\\Delta$UQ in obtaining reliable estimates.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZL6yd6N1S2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18401,
    "title": "Learning semilinear neural operators: A unified recursive framework for prediction and data assimilation.",
    "authors": [
      "Ashutosh Singh",
      "Ricardo Augusto Borsoi",
      "Deniz Erdogmus",
      "Tales Imbiriba"
    ],
    "abstract": "Recent advances in the theory of Neural Operators (NOs) have enabled fast and accurate computation of the solutions to complex systems described by partial differential equations (PDEs). Despite their great success, current NO-based solutions face important challenges when dealing with spatio-temporal PDEs over long time scales. Specifically, the current theory of NOs does not present a systematic framework to perform data assimilation and efficiently correct the evolution of PDE solutions over time based on sparsely sampled noisy measurements. In this paper, we propose a learning-based state-space approach to compute the solution operators to infinite-dimensional semilinear PDEs. Exploiting the structure of semilinear PDEs and the theory of nonlinear observers in function spaces, we develop a flexible recursive method that allows for both prediction and data assimilation by combining prediction and correction operations. The proposed framework is capable of producing fast and accurate predictions over long time horizons, dealing with irregularly sampled noisy measurements to correct the solution, and benefits from the decoupling between the spatial and temporal dynamics of this class of PDEs. We show through experiments on the Kuramoto-Sivashinsky, Navier-Stokes and Korteweg-de Vries equations that the proposed model is robust to noise and can leverage arbitrary amounts of measurements to correct its prediction over a long time horizon with little computational overhead.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZMv6zKYYUs",
    "arxiv_id": "2402.15656",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18400,
    "title": "PanoDiffusion: 360-degree Panorama Outpainting via Diffusion",
    "authors": [
      "Tianhao Wu",
      "Chuanxia Zheng",
      "Tat-Jen Cham"
    ],
    "abstract": "Generating complete 360\\textdegree{} panoramas from narrow field of view images is ongoing research as omnidirectional RGB data is not readily available. Existing GAN-based approaches face some barriers to achieving higher quality output, and have poor generalization performance over different mask types. In this paper, we present our 360\\textdegree{} indoor RGB panorama outpainting model using latent diffusion models (LDM), called PanoDiffusion. We introduce a new bi-modal latent diffusion structure that utilizes both RGB and depth panoramic data during training, which works surprisingly well to outpaint depth-free RGB images during inference. We further propose a novel technique of introducing progressive camera rotations during each diffusion denoising step, which leads to substantial improvement in achieving panorama wraparound consistency. Results show that our PanoDiffusion not only significantly outperforms state-of-the-art methods on RGB panorama outpainting by producing diverse well-structured results for different types of masks, but can also synthesize high-quality depth panoramas to provide realistic 3D indoor models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZNzDXDFZ0B",
    "arxiv_id": "2307.03177",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19284,
    "title": "DataInf: Efficiently Estimating Data Influence in LoRA-tuned LLMs and Diffusion Models",
    "authors": [
      "Yongchan Kwon",
      "Eric Wu",
      "Kevin Wu",
      "James Zou"
    ],
    "abstract": "Quantifying the impact of training data points is crucial for understanding the outputs of machine learning models and for improving the transparency of the AI pipeline. The influence function is a principled and popular data attribution method, but its computational cost often makes it challenging to use. This issue becomes more pronounced in the setting of large language models and text-to-image models. In this work, we propose DataInf, an efficient influence approximation method that is practical for large-scale generative AI models. Leveraging an easy-to-compute closed-form expression, DataInf outperforms existing influence computation algorithms in terms of computational and memory efficiency. Our theoretical analysis shows that DataInf is particularly well-suited for parameter-efficient fine-tuning techniques such as LoRA. Through systematic empirical evaluations, we show that DataInf accurately approximates influence scores and is orders of magnitude faster than existing methods. In applications to RoBERTa-large, Llama-2-13B-chat, and stable-diffusion-v1.5 models, DataInf effectively identifies the most influential fine-tuning examples better than other approximate influence scores. Moreover, it can help to identify which data points are mislabeled.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9m02ib92Wz",
    "arxiv_id": "2310.00902",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18399,
    "title": "CO2: Efficient Distributed Training with Full Communication-Computation Overlap",
    "authors": [
      "Weigao Sun",
      "Zhen Qin",
      "Weixuan Sun",
      "Shidi Li",
      "Dong Li",
      "Xuyang Shen",
      "Yu Qiao",
      "Yiran Zhong"
    ],
    "abstract": "The fundamental success of large language models hinges upon the efficacious implementation of large-scale distributed training techniques. Nevertheless, building a vast, high-performance cluster featuring high-speed communication interconnectivity is prohibitively costly, and accessible only to prominent entities. In this work, we aim to lower this barrier and democratize large-scale training with limited bandwidth clusters. We propose a new approach called CO2 that introduces local-updating and asynchronous communication to the distributed data-parallel training, thereby facilitating the full overlap of COmunication with COmputation. CO2 is able to attain a remarkable 100\\% scalability even on extensive multi-node clusters constrained by very limited communication bandwidth. We further propose the staleness gap penalty and outer momentum clipping techniques together with CO2 to bolster its convergence and training stability. Besides, CO2 exhibits seamless integration with well-established ZeRO-series optimizers which mitigate memory consumption of model states with large model training. We also provide a mathematical proof of convergence, accompanied by the establishment of a stringent upper bound. Furthermore, we validate our findings through an extensive set of practical experiments encompassing a wide range of tasks in the fields of computer vision and natural language processing. These experiments serve to demonstrate the capabilities of CO2 in terms of convergence, generalization, and scalability when deployed across configurations comprising up to 128 A100 GPUs. The outcomes emphasize the outstanding capacity of CO2 to achieve perfect 100\\% scalability, no matter on clusters with 800Gbps RDMA or 80Gbps TCP/IP inter-node connections.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ZO5cn4IfaN",
    "arxiv_id": "2401.16265",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18397,
    "title": "Making Retrieval-Augmented Language Models Robust to Irrelevant Context",
    "authors": [
      "Ori Yoran",
      "Tomer Wolfson",
      "Ori Ram",
      "Jonathan Berant"
    ],
    "abstract": "Retrieval-augmented language models (RALMs) hold promise to produce language understanding systems that are are factual, efficient, and up-to-date. An important desideratum of RALMs, is that retrieved information helps model performance when it is relevant, and does not harm performance when it is not. This is particularly important in multi-hop reasoning scenarios, where misuse of irrelevant evidence can lead to cascading errors. However, recent work has shown that retrieval augmentation can sometimes have a negative effect on performance. In this work, we present a thorough analysis on five open-domain question answering benchmarks, characterizing cases when retrieval reduces accuracy. We then propose two methods to mitigate this issue. First, a simple baseline that filters out retrieved passages that do not entail question-answer pairs according to a natural language inference (NLI) model. This is effective in preventing performance reduction, but at a cost of also discarding relevant passages. Thus, we propose a method for automatically generating data to fine-tune the language model to properly leverage retrieved passages, using a mix of relevant and irrelevant contexts at training time. We empirically show that even 1,000 examples suffice to train the model to be robust to irrelevant contexts while maintaining high performance on examples with relevant ones.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZS4m74kZpH",
    "arxiv_id": "2310.01558",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18394,
    "title": "DMBP: Diffusion model-based predictor for robust offline reinforcement learning against state observation perturbations",
    "authors": [
      "Zhihe YANG",
      "Yunjian Xu"
    ],
    "abstract": "Offline reinforcement learning (RL), which aims to fully explore offline datasets for training without interaction with environments, has attracted growing recent attention. A major challenge for the real-world application of offline RL stems from the robustness against state observation perturbations, e.g., as a result of sensor errors or adversarial attacks. Unlike online robust RL, agents cannot be adversarially trained in the offline setting. In this work, we propose Diffusion Model-Based Predictor (DMBP) in a new framework that recovers the actual states with conditional diffusion models for state-based RL tasks. To mitigate the error accumulation issue in model-based estimation resulting from the classical training of conventional diffusion models, we propose a non-Markovian training objective to minimize the sum entropy of denoised states in RL trajectory. Experiments on standard benchmark problems demonstrate that DMBP can significantly enhance the robustness of existing offline RL algorithms against different scales of ran- dom noises and adversarial attacks on state observations. Further, the proposed framework can effectively deal with incomplete state observations with random combinations of multiple unobserved dimensions in the test. Our implementation is available at https://github.com/zhyang2226/DMBP.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZULjcYLWKe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18393,
    "title": "Functional Bayesian Tucker Decomposition for Continuous-indexed Tensor Data",
    "authors": [
      "Shikai Fang",
      "Xin Yu",
      "Zheng Wang",
      "Shibo Li",
      "Mike Kirby",
      "Shandian Zhe"
    ],
    "abstract": "Tucker decomposition is a powerful tensor model to handle multi-aspect data. It demonstrates the low-rank property by decomposing the grid-structured data as interactions between a core tensor and a set of object representations (factors).  A fundamental assumption of such decomposition is that there were finite objects in each aspect or mode, corresponding to discrete indexes of data entries. However, many real-world data are not naturally posed in the setting. For example, geographic data is represented as continuous indexes of latitude and longitude coordinates, and cannot fit tensor models directly. To generalize Tucker decomposition to such scenarios, we propose FunBaT: Functional Bayesian Tucker Decomposition. We treat the continuous-indexed data as the interaction between the Tucker core and a group of latent functions. We use Gaussian processes (GP)  as functional priors to model the latent functions, and then convert the GPs into state-space priors by constructing equivalent stochastic differential equations (SDE)  to reduce computational cost. An efficient inference algorithm is further developed for scalable posterior approximation based on advanced message-passing techniques. The advantage of our method is shown in both synthetic data and several real-world applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZWyZeqE928",
    "arxiv_id": "2311.04829",
    "GitHub": [
      "https://github.com/xuangu-fang/Functional-Bayesian-Tucker-Decomposition"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18390,
    "title": "LipVoicer: Generating Speech from Silent Videos Guided by Lip Reading",
    "authors": [
      "Yochai Yemini",
      "Aviv Shamsian",
      "Lior Bracha",
      "Sharon Gannot",
      "Ethan Fetaya"
    ],
    "abstract": "Lip-to-speech involves generating a natural-sounding speech synchronized with a soundless video of a person talking. Despite recent advances, current methods still cannot produce high-quality speech with high levels of intelligibility for challenging and realistic datasets such as LRS3. In this work, we present LipVoicer, a novel method that generates high-quality speech, even for in-the-wild and rich datasets, by incorporating the text modality. Given a silent video, we first predict the spoken text using a pre-trained lip-reading network. We then condition a diffusion model on the video and use the extracted text through a classifier-guidance mechanism where a pre-trained automatic speech recognition (ASR ) serves as the classifier. LipVoicer outperforms multiple lip-to-speech baselines on LRS2 and LRS3, which are in-the-wild datasets with hundreds of unique speakers in their test set and an unrestricted vocabulary. Moreover, our experiments show that the inclusion of the text modality plays a major role in the intelligibility of the produced speech, readily perceptible while listening, and is empirically reflected in the substantial reduction of the word error rate ( WER ) metric. We demonstrate the effectiveness of LipVoicer through human evaluation, which shows that it produces more natural and synchronized speech signals compared to competing methods. Finally, we created a demo showcasing LipVoicer\u2019s superiority in producing natural, synchronized, and intelligible speech, providing additional evidence of its effectiveness. Project page: https://lipvoicer.github.io",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZZCPSC5OgD",
    "arxiv_id": "2306.03258",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18389,
    "title": "BENO: Boundary-embedded Neural Operators for Elliptic PDEs",
    "authors": [
      "Haixin Wang",
      "Jiaxin LI",
      "Anubhav Dwivedi",
      "Kentaro Hara",
      "Tailin Wu"
    ],
    "abstract": "Elliptic partial differential equations (PDEs) are a major class of time-independent PDEs that play a key role in many scientific and engineering domains such as fluid dynamics, plasma physics, and solid mechanics. Recently, neural operators have emerged as a promising technique to solve elliptic PDEs more efficiently by directly mapping the input to solutions. However, existing networks typically neglect complex geometries and inhomogeneous boundary values  present in the real world. Here we introduce Boundary-Embedded Neural Operators (BENO), a novel neural operator architecture that embeds the complex geometries and inhomogeneous boundary values into the solving of elliptic PDEs. Inspired by classical Green's function, BENO consists of two Graph Neural Networks (GNNs) for interior source term and boundary values, respectively. Furthermore, a Transformer encoder maps the global boundary geometry into a latent vector which influences each message passing layer of the GNNs. We test our model and strong baselines extensively in elliptic PDEs with complex boundary conditions. We show that all existing baseline methods fail to learn the solution operator. In contrast, our model, endowed with boundary-embedded architecture, outperforms state-of-the-art neural operators and strong baselines by an average of 60.96%.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZZTkLDRmkg",
    "arxiv_id": "2401.09323",
    "GitHub": [
      "https://github.com/AI4Science-WestlakeU/beno.git"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18386,
    "title": "From Zero to Turbulence: Generative Modeling for 3D Flow Simulation",
    "authors": [
      "Marten Lienen",
      "David L\u00fcdke",
      "Jan Hansen-Palmus",
      "Stephan G\u00fcnnemann"
    ],
    "abstract": "Simulations of turbulent flows in 3D are one of the most expensive simulations in computational fluid dynamics (CFD). Many works have been written on surrogate models to replace numerical solvers for fluid flows with faster, learned, autoregressive models. However, the intricacies of turbulence in three dimensions necessitate training these models with very small time steps, while generating realistic flow states requires either long roll-outs with many steps and significant error accumulation or starting from a known, realistic flow state\u2014something we aimed to avoid in the first place. Instead, we propose to approach turbulent flow simulation as a generative task directly learning the manifold of all possible turbulent flow states without relying on any initial flow state. For our experiments, we introduce a challenging 3D turbulence dataset of high-resolution flows and detailed vortex structures caused by various objects and derive two novel sample evaluation metrics for turbulent flows. On this dataset, we show that our generative model captures the distribution of turbulent flows caused by unseen objects and generates high-quality, realistic samples amenable for downstream applications without access to any initial state.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZhlwoC1XaN",
    "arxiv_id": "2306.01776",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18388,
    "title": "Towards Foundational Models for Molecular Learning on Large-Scale Multi-Task Datasets",
    "authors": [
      "Dominique Beaini",
      "Shenyang Huang",
      "Joao Alex Cunha",
      "Zhiyi Li",
      "Gabriela Moisescu-Pareja",
      "Oleksandr Dymov",
      "Samuel Maddrell-Mander",
      "Callum McLean",
      "Frederik Wenkel",
      "Luis M\u00fcller",
      "Jama Hussein Mohamud",
      "Ali Parviz",
      "Michael Craig",
      "Micha\u0142 Koziarski",
      "Jiarui Lu",
      "Zhaocheng Zhu",
      "Cristian Gabellini",
      "Kerstin Klaser",
      "Josef Dean",
      "Cas Wognum",
      "Maciej Sypetkowski",
      "Guillaume Rabusseau",
      "Reihaneh Rabbany",
      "Jian Tang",
      "Christopher Morris",
      "Mirco Ravanelli",
      "Guy Wolf",
      "Prudencio Tossou",
      "Hadrien Mary",
      "Therence Bois",
      "Andrew William Fitzgibbon",
      "Blazej Banaszewski",
      "Chad Martin",
      "Dominic Masters"
    ],
    "abstract": "Recently, pre-trained foundation models have enabled significant advancements in multiple fields. In molecular machine learning, however, where datasets are often hand-curated, and hence typically small, the lack of datasets with labeled features, and codebases to manage those datasets, has hindered the development of foundation models.In this work, we present seven novel datasets categorized by size into three distinct categories: ToyMix, LargeMix and UltraLarge. These datasets push the boundaries in both the scale and the diversity of supervised labels for molecular learning. They cover nearly 100 million molecules and over 3000 sparsely defined tasks, totaling more than 13 billion individual labels of both quantum and biological nature. In comparison, our datasets contain 300 times more data points than the widely used OGB-LSC PCQM4Mv2 dataset, and 13 times more than the quantum-only QM1B dataset.In addition, to support the development of foundational models based on our proposed datasets, we present the Graphium graph machine learning library which simplifies the process of building and training molecular machine learning models for multi-task and multi-level molecular datasets. Finally, we present a range of baseline results as a starting point of multi-task and multi-level training on these datasets. Empirically, we observe that performance on low-resource biological datasets show improvement by also training on large amounts of quantum data. This indicates that there may be potential in multi-task and multi-level training of a foundation model and fine-tuning it to resource-constrained downstream tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Zc2aIcucwc",
    "arxiv_id": "2310.04292",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18385,
    "title": "INSIDE: LLMs' Internal States Retain the Power of Hallucination Detection",
    "authors": [
      "Chao Chen",
      "Kai Liu",
      "Ze Chen",
      "Yi Gu",
      "Yue Wu",
      "Mingyuan Tao",
      "Zhihang Fu",
      "Jieping Ye"
    ],
    "abstract": "Knowledge hallucination have raised widespread concerns for the security and reliability of deployed LLMs. Previous efforts in detecting hallucinations have been employed at logit-level uncertainty estimation or language-level self-consistency evaluation, where the semantic information is inevitably lost during the token-decoding procedure. Thus, we propose to explore the dense semantic information retained within LLMs' \\textbf{IN}ternal \\textbf{S}tates for halluc\\textbf{I}nation \\textbf{DE}tection (\\textbf{INSIDE}). In particular, a simple yet effective \\textbf{EigenScore} metric is proposed to better evaluate responses' self-consistency, which exploits the eigenvalues of responses' covariance matrix to measure the semantic consistency/diversity in the dense embedding space. Furthermore, from the perspective of self-consistent hallucination detection, a test time feature clipping approach is explored to truncate extreme activations in the internal states, which reduces overconfident generations and potentially benefits the detection of overconfident hallucinations. Extensive experiments and ablation studies are performed on several popular LLMs and question-answering (QA) benchmarks, showing the effectiveness of our proposal.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Zj12nzlQbz",
    "arxiv_id": "2402.03744",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18384,
    "title": "Retrieval-based Disentangled Representation Learning with Natural Language Supervision",
    "authors": [
      "Jiawei Zhou",
      "Xiaoguang Li",
      "Lifeng Shang",
      "Xin Jiang",
      "Qun Liu",
      "Lei Chen"
    ],
    "abstract": "Disentangled representation learning remains challenging as the underlying factors of variation in the data do not naturally exist. The inherent complexity of real-world data makes it unfeasible to exhaustively enumerate and encapsulate all its variations within a finite set of factors. However, it is worth noting that most real-world data have linguistic equivalents, typically in the form of textual descriptions. These linguistic counterparts can represent the data and effortlessly decomposed into distinct tokens. In light of this, we present Vocabulary Disentangled Retrieval (VDR), a retrieval-based framework that harnesses natural language as proxies of the underlying data variation to drive disentangled representation learning. Our approach employ a bi-encoder model to represent both data and natural language in a vocabulary space, enabling the model to distinguish dimensions that capture intrinsic characteristics within data through its natural language counterpart, thus facilitating disentanglement. We extensively assess the performance of VDR across 15 retrieval benchmark datasets, covering text-to-text and cross-modal retrieval scenarios, as well as human evaluation. Our experimental results compellingly demonstrate the superiority of VDR over previous bi-encoder retrievers with comparable model size and training costs, achieving an impressive 8.7% improvement in NDCG@10 on the BEIR benchmark, a 5.3\\% increase on MS COCO, and a 6.0% increase on Flickr30k in terms of mean recall in the zero-shot setting. Moreover, The results from human evaluation indicate that interpretability of our method is on par with SOTA captioning models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ZlQRiFmq7Y",
    "arxiv_id": "2212.07699",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18382,
    "title": "Learning dynamic representations of the functional connectome in neurobiological networks",
    "authors": [
      "Luciano Dyballa",
      "Samuel Lang",
      "Alexandra Haslund-Gourley",
      "Eviatar Yemini",
      "Steven W. Zucker"
    ],
    "abstract": "The static synaptic connectivity of neuronal circuits stands in direct contrast to the dynamics of their function. As in changing community interactions, different neurons can participate actively in various combinations to effect behaviors at different times. We introduce an unsupervised approach to learn the dynamic affinities between neurons in live, behaving animals, and to reveal which communities form among neurons at different times. The inference occurs in two major steps. First, pairwise non-linear affinities between  neuronal traces from brain-wide calcium activity are organized by non-negative tensor factorization (NTF). Each factor specifies which groups of neurons are most likely interacting for an inferred interval in time, and for which animals. Finally, a generative model that allows for weighted community detection is applied to the functional motifs produced by NTF to reveal a dynamic functional connectome. Since time codes the different experimental variables (e.g., application of chemical stimuli), this provides an atlas of neural motifs active during separate stages of an experiment (e.g., stimulus application or spontaneous behaviors). Results from our analysis are experimentally validated, confirming that our method is able to robustly predict causal interactions between neurons to generate behavior.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZwhHSOHMTM",
    "arxiv_id": "2402.14102",
    "GitHub": [
      "https://github.com/dyballa/dynamic-connectomes"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18378,
    "title": "StructComp: Substituting propagation with Structural Compression in Training Graph Contrastive Learning",
    "authors": [
      "Shengzhong Zhang",
      "Wenjie Yang",
      "Xinyuan Cao",
      "Hongwei Zhang",
      "Zengfeng Huang"
    ],
    "abstract": "Graph contrastive learning (GCL) has become a powerful tool for learning graph data, but its scalability remains a significant challenge. In this work, we propose a simple yet effective training framework called Structural Compression (StructComp) to address this issue. Inspired by a sparse low-rank approximation on the diffusion matrix, StructComp trains the encoder with the compressed nodes. This allows the encoder not to perform any message passing during the training stage, and significantly reduces the number of sample pairs in the contrastive loss. We theoretically prove that the original GCL loss can be approximated with the contrastive loss computed by StructComp. Moreover, StructComp can be regarded as an additional regularization term for GCL models, resulting in a more robust encoder. Empirical studies on seven benchmark datasets show that StructComp greatly reduces the time and memory consumption while improving model performance compared to the vanilla GCL models and scalable training methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=a4DBEeGfQq",
    "arxiv_id": "2312.04865",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18377,
    "title": "Understanding prompt engineering may not require rethinking generalization",
    "authors": [
      "Victor Akinwande",
      "Yiding Jiang",
      "Dylan Sam",
      "J Zico Kolter"
    ],
    "abstract": "Zero-shot learning in prompted vision-language models, the practice of crafting prompts to build classifiers without an explicit training process, has achieved impressive performance in many settings. This success presents a seemingly surprising observation: these methods suffer relatively little from overfitting, i.e., when a prompt is manually engineered to achieve low error on a given training set (thus rendering the method no longer actually zero-shot), the approach still performs well on held-out test data. In this paper, we show that we can explain such performance well via recourse to classical PAC-Bayes bounds.  Specifically, we show that the discrete nature of prompts, combined with a PAC-Bayes prior given by a language model, results in generalization bounds that are remarkably tight by the standards of the literature: for instance, the generalization bound of an ImageNet classifier is often within a few percentage points of the true test error. We demonstrate empirically that this holds for existing handcrafted prompts and prompts generated through simple greedy search. Furthermore, the resulting bound is well-suited for model selection: the models with the best bound typically also have the best test performance. This work thus provides a possible justification for the widespread practice of \"prompt engineering,\" even if it seems that such methods could potentially overfit the training data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=a745RnSFLT",
    "arxiv_id": "2310.03957",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18374,
    "title": "Object-Centric Learning with Slot Mixture Module",
    "authors": [
      "Daniil Kirilenko",
      "Vitaliy Vorobyov",
      "Alexey Kovalev",
      "Aleksandr Panov"
    ],
    "abstract": "Object-centric architectures usually apply a differentiable module to the entire feature map to decompose it into sets of entity representations called slots. Some of these methods structurally resemble clustering algorithms, where the cluster's center in latent space serves as a slot representation. Slot Attention is an example of such a method, acting as a learnable analog of the soft k-means algorithm. Our work employs a learnable clustering method based on the Gaussian Mixture Model. Unlike other approaches, we represent slots not only as centers of clusters but also incorporate information about the distance between clusters and assigned vectors, leading to more expressive slot representations. Our experiments demonstrate that using this approach instead of Slot Attention improves performance in object-centric scenarios, achieving state-of-the-art results in the set property prediction task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aBUidW4Nkd",
    "arxiv_id": "2311.04640",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19279,
    "title": "Provably Efficient CVaR RL in Low-rank MDPs",
    "authors": [
      "Yulai Zhao",
      "Wenhao Zhan",
      "Xiaoyan Hu",
      "Ho-fung Leung",
      "Farzan Farnia",
      "Wen Sun",
      "Jason D. Lee"
    ],
    "abstract": "We study risk-sensitive Reinforcement Learning (RL), where we aim to maximizethe Conditional Value at Risk (CVaR) with a fixed risk tolerance $\\tau$. Prior theoretical work studying risk-sensitive RL focuses on the tabular Markov Decision Processes (MDPs) setting.  To extend CVaR RL to settings where state space is large, function approximation must be deployed. We study CVaR RL in low-rank MDPs with nonlinear function approximation.  Low-rank MDPs assume the underlying transition kernel admits a low-rank decomposition, but unlike prior linear models, low-rank MDPs do not assume the feature or state-action representation is known. We propose a novel Upper Confidence Bound (UCB) bonus-driven algorithm to carefully balance the interplay between exploration, exploitation, and representation learning in CVaR RL. We prove that our algorithm achieves a sample complexity of $\\tilde{O}\\left(\\frac{H^7 A^2 d^4}{\\tau^2 \\epsilon^2}\\right)$ to yield an $\\epsilon$-optimal CVaR, where $H$ is the length of each episode, $A$ is the capacity of action space, and $d$ is the dimension of representations.Computational-wise, we design a novel discretized Least-Squares Value Iteration (LSVI) algorithm for the CVaR objective as the planning oracle and show that we can find the near-optimal policy in a polynomial running time with a Maximum Likelihood Estimation oracle. To our knowledge, this is the first provably efficient CVaR RL algorithm in low-rank MDPs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9x6yrFAPnx",
    "arxiv_id": "2311.11965",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18373,
    "title": "Interpretable Sparse System Identification: Beyond Recent Deep Learning Techniques on Time-Series Prediction",
    "authors": [
      "Xiaoyi Liu",
      "Duxin Chen",
      "Wenjia Wei",
      "Xia Zhu",
      "Wenwu Yu"
    ],
    "abstract": "With the continuous advancement of neural network methodologies, time series prediction has attracted substantial interest over the past decades. Nonetheless, the interpretability of neural networks is insufficient and the utilization of deep learning techniques for prediction necessitates significant computational expenditures, rendering its application arduous in numerous scenarios. In order to tackle this challenge, an interpretable sparse system identification method which does not require a time-consuming training through back-propagation is proposed in this study. This method integrates advantages from both knowledge-based and data-driven approaches, and constructs dictionary functions by leveraging Fourier basis and taking into account both the long-term trends and the short-term fluctuations behind data. By using the $l_1$ norm for sparse optimization, prediction results can be gained with an explicit sparse expression function and an extremely high accuracy. The performance evaluation of the proposed method is conducted on comprehensive benchmark datasets, including ETT, Exchange, and ILI. Results reveal that our proposed method attains a significant overall improvement of more than 20\\% in accordance with the most recent state-of-the-art deep learning methodologies. Additionally, our method demonstrates the efficient training capability on only CPUs. Therefore, this study may shed some light onto the realm of time series reconstruction and prediction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aFWUY3E7ws",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18372,
    "title": "Multi-modal Gaussian Process Variational Autoencoders for Neural and Behavioral Data",
    "authors": [
      "Rabia Gondur",
      "Usama Bin Sikandar",
      "Evan Schaffer",
      "Mikio Christian Aoi",
      "Stephen L Keeley"
    ],
    "abstract": "Characterizing the relationship between neural population activity and behavioral data is a central goal of neuroscience. While latent variable models (LVMs) are successful in describing high-dimensional data, they are typically only designed for a single type of data, making it difficult to identify structure shared across different experimental data modalities. Here, we address this shortcoming by proposing an unsupervised LVM which extracts shared and independent latents for distinct, simultaneously recorded experimental modalities. We do this by combining Gaussian Process Factor Analysis (GPFA), an interpretable LVM for neural spiking data with temporally smooth latent space, with Gaussian Process Variational Autoencoders (GP-VAEs), which similarly use a GP prior to characterize correlations in a latent space, but admit rich expressivity due to a deep neural network mapping to observations. We achieve interpretability in our model by partitioning latent variability into components that are either shared between or independent to each modality. We parameterize the latents of our model in the Fourier domain, and show improved latent identification using this approach over standard GP-VAE methods. We validate our model on simulated multi-modal data consisting of Poisson spike counts and MNIST images that scale and rotate smoothly over time. We show that the multi-modal GP-VAE (MM-GPVAE) is able to not only identify the shared and independent latent structure across modalities accurately, but provides good reconstructions of both images and neural rates on held-out trials. Finally, we demonstrate our framework on two real world multi-modal experimental settings: Drosophila whole-brain calcium imaging alongside tracked limb positions, and Manduca sexta spike train measurements from ten wing muscles as the animal tracks a visual stimulus.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aGH43rjoe4",
    "arxiv_id": "2310.03111",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19277,
    "title": "Mechanistically analyzing the effects of fine-tuning on procedurally defined tasks",
    "authors": [
      "Samyak Jain",
      "Robert Kirk",
      "Ekdeep Singh Lubana",
      "Robert P. Dick",
      "Hidenori Tanaka",
      "Tim Rockt\u00e4schel",
      "Edward Grefenstette",
      "David Krueger"
    ],
    "abstract": "Fine-tuning large pre-trained models has become the de facto strategy for developing both task-specific and general-purpose machine learning systems, including developing models that are safe to deploy. Despite its clear importance, there has been little work that explains how fine-tuning alters the underlying capabilities learnt by a model during pretraining: does fine-tuning yield entirely novel capabilities or does it just inhibit existing ones? An answer to this question would improve our ability to trust fine-tuning protocols meant to improve the safety of pre-trained models and delete unsafe capabilities. We aim to make progress on this question by answering it in controlled settings where we can use mechanistic interpretability tools (e.g.~ network pruning and probing) to understand how the model's underlying capabilities are changing. We perform an exhaustive analysis of the effects of fine-tuning in these settings, and show: (i) the ubiquitous protocol of fine-tuning with a small learning rate rarely alters the underlying model capabilities; (ii) often a minimal transformation, which we call a wrapper, is learned on top of the underlying model capability, yielding the impression that a new capability has been learned or a prior capability has been deleted; and (iii) continuing the fine-tuning process on a task where the pretraining capabilities are relevant leads to sample-efficient ``revival'' of the capability, i.e., the model starts to accurately reuse that capability in just a few gradient steps. \\textit{This potentially indicates a practitioner could unintentionally render a safe model to be unsafe by merely fine-tuning on a downstream task.} We additionally perform analysis on language models trained on the TinyStories dataset to support our claims in a realistic setting.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=A0HKeKl4Nl",
    "arxiv_id": "2311.12786",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18371,
    "title": "InsertNeRF: Instilling Generalizability into NeRF with HyperNet Modules",
    "authors": [
      "Yanqi Bao",
      "Tianyu Ding",
      "Jing Huo",
      "Wenbin Li",
      "Yuxin Li",
      "Yang Gao"
    ],
    "abstract": "Generalizing Neural Radiance Fields (NeRF) to new scenes is a significant challenge that existing approaches struggle to address without extensive modifications to vanilla NeRF framework. We introduce **InsertNeRF**, a method for **INS**tilling g**E**ne**R**alizabili**T**y into **NeRF**. By utilizing multiple plug-and-play HyperNet modules, InsertNeRF dynamically tailors NeRF's weights to specific reference scenes, transforming multi-scale sampling-aware features into scene-specific representations. This novel design allows for more accurate and efficient representations of complex appearances and geometries. Experiments show that this method not only achieves superior generalization performance but also provides a flexible pathway for integration with other NeRF-like systems, even in sparse input settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aHmNpLlUlb",
    "arxiv_id": "2308.13897",
    "GitHub": [
      "https://github.com/bbbbby-99/InsertNeRF"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18369,
    "title": "Approximately Piecewise E(3) Equivariant Point Networks",
    "authors": [
      "Matan Atzmon",
      "Francis Williams",
      "Jiahui Huang",
      "Or Litany"
    ],
    "abstract": "Integrating a notion of symmetry into point cloud neural networks is a provably effective way to improve their generalization capability. Of particular interest are $E(3)$ equivariant point cloud networks where Euclidean transformations applied to the inputs are preserved in the outputs. Recent efforts aim to extend networks that are equivariant with respect to a single global $E(3)$ transformation, to accommodate inputs made of multiple parts, each of which exhibits local $E(3)$ symmetry.In practical settings, however, the partitioning into individually transforming regions is unknown a priori.Errors in the partition prediction would unavoidably map to errors in respecting the true input symmetry. Past works have proposed different ways to predict the partition, which may exhibit uncontrolled errors in their ability to maintain equivariance to the actual partition. To this end, we introduce APEN: a general framework for constructing approximate piecewise-$E(3)$ equivariant point networks. Our framework offers an adaptable design to guaranteed bounds on the resulting piecewise $E(3)$ equivariance approximation errors.Our primary insight is that functions which are equivariant with respect to a finer partition (compared to the unknown true partition) will also maintain equivariance in relation to the true partition. Leveraging this observation, we propose a compositional design for a partition prediction model. It initiates with a fine partition and incrementally transitions towards a coarser subpartition of the true one, consistently maintaining piecewise equivariance in relation to the current partition.As a result, the equivariance approximation error can be bounded solely in terms of (i) uncertainty quantification of the partition prediction, and (ii) bounds on the probability of failing to suggest a proper subpartition of the ground truth one.We demonstrate the practical effectiveness of APEN using two data types exemplifying part-based symmetry: (i) real-world scans of room scenes containing multiple furniture-type objects; and, (ii) human motions, characterized by articulated parts exhibiting rigid movement. Our empirical results demonstrate the advantage of integrating piecewise $E(3)$ symmetry into network design, showing a distinct improvement in generalization over prior works in terms of generalization accuracy for both classification and segmentation tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aKJEHWmBEf",
    "arxiv_id": "2402.08529",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18366,
    "title": "Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs",
    "authors": [
      "Kaixuan Ji",
      "Qingyue Zhao",
      "Jiafan He",
      "Weitong Zhang",
      "Quanquan Gu"
    ],
    "abstract": "Recent studies have shown that the regret of reinforcement learning (RL) can be polylogarithmic in the planning horizon $H$. However, it remains an open question whether such a result holds for adversarial RL. In this paper, we answer this question affirmatively by proposing the first horizon-free policy search algorithm. To tackle the challenges caused by exploration and adversarially chosen reward over episodes, our algorithm employs (1) a variance-uncertainty-aware weighted least square estimator for the transition kernel; and (2) an occupancy measure-based technique for the online search of a stochastic policy. We show that our algorithm achieves an $\\tilde{O}\\big((d+\\log |\\mathcal{S}|)\\sqrt{K} + d^2\\big)$ regret with full-information feedback, where $d$ is the dimension of a known feature mapping linearly parametrizing the unknown transition kernel of the MDP, $K$ is the number of episodes, $|\\mathcal{S}|$ is the cardinality of the state space. We also provide hardness results to justify the near optimality of our algorithm and the inevitability of $\\log|\\mathcal{S}|$ in the regret bound.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aPNwsJgnZJ",
    "arxiv_id": "2305.08359",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18367,
    "title": "Symbol as Points: Panoptic Symbol Spotting via Point-based Representation",
    "authors": [
      "WENLONG LIU",
      "Tianyu Yang",
      "Yuhan Wang",
      "Qizhi Yu",
      "Lei Zhang"
    ],
    "abstract": "This work studies the problem of panoptic symbol spotting, which is to spot and parse both countable object instances (windows, doors, tables, etc.) and uncountable stuff (wall, railing, etc.) from computer-aided design (CAD) drawings. Existing methods typically involve either rasterizing the vector graphics into images and using image-based methods for symbol spotting, or directly building graphs and using graph neural networks for symbol recognition. In this paper, we take a different approach, which treats graphic primitives as a set of 2D points that are locally connected and use point cloud segmentation methods to tackle it. Specifically, we utilize a point transformer to extract the primitive features and append a mask2former-like spotting head to predict the final output. To better use the local connection information of primitives and enhance their discriminability, we further propose the attention with connection module (ACM) and contrastive connection learning scheme (CCL). Finally, we propose a KNN interpolation mechanism for the mask attention module of the spotting head to better handle primitive mask downsampling, which is primitive-level in contrast to pixel-level for the image. Our approach, named SymPoint, is simple yet effective, outperforming recent state-of-the-art method GAT-CADNet by an absolute increase of 9.6% PQ and 10.4% RQ on the FloorPlanCAD dataset. The source code and models will be available at \\url{https://github.com/nicehuster/SymPoint}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aOnUe8ah7j",
    "arxiv_id": "2401.10556",
    "GitHub": [
      "https://github.com/nicehuster/SymPoint"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18363,
    "title": "SCHEMA: State CHangEs MAtter for Procedure Planning in Instructional Videos",
    "authors": [
      "Yulei Niu",
      "Wenliang Guo",
      "Long Chen",
      "Xudong Lin",
      "Shih-Fu Chang"
    ],
    "abstract": "We study the problem of procedure planning in instructional videos, which aims to make a goal-oriented sequence of action steps given partial visual state observations. The motivation of this problem is to learn a structured and plannable state and action space. Recent works succeeded in sequence modeling of steps with only sequence-level annotations accessible during training, which overlooked the roles of states in the procedures. In this work, we point out that State CHangEs MAtter (SCHEMA) for procedure planning in instructional videos. We aim to establish a more structured state space by investigating the causal relations between steps and states in procedures. Specifically, we explicitly represent each step as state changes and track the state changes in procedures. For step representation, we leveraged the commonsense knowledge in large language models (LLMs) to describe the state changes of steps via our designed chain-of-thought prompting. For state changes tracking, we align visual state observations with language state descriptions via cross-modal contrastive learning, and explicitly model the intermediate states of the procedure using LLM-generated state descriptions. Experiments on CrossTask, COIN, and NIV benchmark datasets demonstrate that our proposed SCHEMA model achieves state-of-the-art performance and obtains explainable visualizations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=abL5LJNZ49",
    "arxiv_id": "2403.01599",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18361,
    "title": "Decision ConvFormer: Local Filtering in MetaFormer is Sufficient for Decision Making",
    "authors": [
      "Jeonghye Kim",
      "Suyoung Lee",
      "Woojun Kim",
      "Youngchul Sung"
    ],
    "abstract": "The recent success of Transformer in natural language processing has sparked its use in various domains. In offline reinforcement learning (RL), Decision Transformer (DT) is emerging as a promising model based on Transformer. However, we discovered that the attention module of DT is not appropriate to capture the inherent local dependence pattern in trajectories of RL modeled as a Markov decision process. To overcome the limitations of DT, we propose a novel action sequence predictor, named Decision ConvFormer (DC), based on the architecture of MetaFormer, which is a general structure to process multiple entities in parallel and understand the interrelationship among the multiple entities. DC employs local convolution filtering as the token mixer and can effectively capture the inherent local associations of the RL dataset. In extensive experiments, DC achieved state-of-the-art performance across various standard RL benchmarks while requiring fewer resources. Furthermore, we show that DC better understands the underlying meaning in data and exhibits enhanced generalization capability.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=af2c8EaKl8",
    "arxiv_id": "2310.03022",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18359,
    "title": "Circumventing Concept Erasure Methods For Text-To-Image Generative Models",
    "authors": [
      "Minh Pham",
      "Kelly O. Marshall",
      "Niv Cohen",
      "Govind Mittal",
      "Chinmay Hegde"
    ],
    "abstract": "Text-to-image generative models can produce photo-realistic images for an extremely broad range of concepts, and their usage has proliferated widely among the general public. On the flip side, these models have numerous drawbacks, including their potential to generate images featuring sexually explicit content, mirror artistic styles without permission, or even hallucinate (or deepfake) the likenesses of celebrities. Consequently, various methods have been proposed in order to \"erase\" sensitive concepts from text-to-image models. In this work, we examine seven recently proposed concept erasure methods, and show that targeted concepts are not fully excised from any of these methods. Specifically, we leverage the existence of special learned word embeddings that can retrieve \"erased\" concepts from the sanitized models with no alterations to their weights. Our results highlight the brittleness of post hoc concept erasure methods, and call into question their use in the algorithmic toolkit for AI safety.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ag3o2T51Ht",
    "arxiv_id": "2308.01508",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18360,
    "title": "Entropy Coding of Unordered Data Structures",
    "authors": [
      "Julius Kunze",
      "Daniel Severo",
      "Giulio Zani",
      "Jan-Willem van de Meent",
      "James Townsend"
    ],
    "abstract": "We present shuffle coding, a general method for optimal compression of sequences of unordered objects using bits-back coding. Data structures that can be compressed using shuffle coding include multisets, graphs, hypergraphs, and others. We release an implementation that can easily be adapted to different data types and statistical models, and demonstrate that our implementation achieves state-of-the-art compression rates on a range of graph datasets including molecular data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=afQuNt3Ruh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19272,
    "title": "Manipulating dropout reveals an optimal balance of efficiency and robustness in biological and machine visual systems",
    "authors": [
      "Jacob S. Prince",
      "Gabriel Fajardo",
      "George A. Alvarez",
      "Talia Konkle"
    ],
    "abstract": "According to the efficient coding hypothesis, neural populations encode information optimally when representations are high-dimensional and uncorrelated. However, such codes may carry a cost in terms of generalization and robustness. Past empirical studies of early visual cortex (V1) in rodents have suggested that this tradeoff indeed constrains sensory representations. However, it remains unclear whether these insights generalize across the hierarchy of the human visual system, and particularly to object representations in high-level occipitotemporal cortex (OTC). To gain new empirical clarity, here we develop a family of object recognition models with parametrically varying dropout proportion $p$, which induces systematically varying dimensionality of internal responses (while controlling all other inductive biases). We find that increasing dropout produces an increasingly smooth, low-dimensional representational space. Optimal robustness to lesioning is observed at around 70% dropout, after which both accuracy and robustness decline. Representational comparison to large-scale 7T fMRI data from occipitotemporal cortex in the Natural Scenes Dataset reveals that this optimal degree of dropout is also associated with maximal emergent neural predictivity. Finally, using new techniques for achieving denoised estimates of the eigenspectrum of human fMRI responses, we compare the rate of eigenspectrum decay between model and brain feature spaces. We observe that the match between model and brain representations is associated with a common balance between efficiency and robustness in the representational space. These results suggest that varying dropout may reveal an optimal point of balance between the efficiency of high-dimensional codes and the robustness of low dimensional codes in hierarchical vision systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ADDCErFzev",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19271,
    "title": "LoTa-Bench: Benchmarking Language-oriented Task Planners for Embodied Agents",
    "authors": [
      "Jae-Woo Choi",
      "Youngwoo Yoon",
      "Hyobin Ong",
      "Jaehong Kim",
      "Minsu Jang"
    ],
    "abstract": "Large language models (LLMs) have recently received considerable attention as alternative solutions for task planning. However, comparing the performance of language-oriented task planners becomes difficult, and there exists a dearth of detailed exploration regarding the effects of various factors such as pre-trained model selection and prompt construction. To address this, we propose a benchmark system for automatically quantifying performance of task planning for home-service embodied agents. Task planners are tested on two pairs of datasets and simulators: 1) ALFRED and AI2-THOR, 2) an extension of Watch-And-Help and VirtualHome. Using the proposed benchmark system, we perform extensive experiments with LLMs and prompts, and explore several enhancements of the baseline planner. We expect that the proposed benchmark tool would accelerate the development of language-oriented task planners.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ADSxCpCu9s",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18357,
    "title": "Self-Supervised Speech Quality Estimation and Enhancement Using Only Clean Speech",
    "authors": [
      "Szu-Wei Fu",
      "Kuo-Hsuan Hung",
      "Yu Tsao",
      "Yu-Chiang Frank Wang"
    ],
    "abstract": "Speech quality estimation has recently undergone a paradigm shift from human-hearing expert designs to machine-learning models. However, current models rely mainly on supervised learning, which is time-consuming and expensive for label collection. To solve this problem, we propose VQScore, a self-supervised metric for evaluating speech based on the quantization error of a vector-quantized-variational autoencoder (VQ-VAE). The training of VQ-VAE relies on clean speech; hence, large quantization errors can be expected when the speech is distorted. To further improve correlation with real quality scores, domain knowledge of speech processing is incorporated into the model design. We found that the vector quantization mechanism could also be used for self-supervised speech enhancement (SE) model training. To improve the robustness of the encoder for SE, a novel self-distillation mechanism combined with adversarial training is introduced. In summary, the proposed speech quality estimation method and enhancement models require only clean speech for training without any label requirements. Experimental results show that the proposed VQScore and enhancement model are competitive with supervised baselines. The code will be released after publication.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ale56Ya59q",
    "arxiv_id": "2402.16321",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18356,
    "title": "Making Pre-trained Language Models Great on Tabular Prediction",
    "authors": [
      "Jiahuan Yan",
      "Bo Zheng",
      "Hongxia Xu",
      "Yiheng Zhu",
      "Danny Chen",
      "Jimeng Sun",
      "Jian Wu",
      "Jintai Chen"
    ],
    "abstract": "The transferability of deep neural networks (DNNs) has made significant progress in image and language processing. However, due to the heterogeneity among tables, such DNN bonus is still far from being well exploited on tabular data prediction (e.g., regression or classification tasks). Condensing knowledge from diverse domains, language models (LMs) possess the capability to comprehend feature names from various tables, potentially serving as versatile learners in transferring knowledge across distinct tables and diverse prediction tasks, but their discrete text representation space is inherently incompatible with numerical feature values in tables. In this paper, we present TP-BERTa, a specifically pre-trained LM model for tabular data prediction. Concretely, a novel relative magnitude tokenization converts scalar numerical feature values to finely discrete, high-dimensional tokens, and an intra-feature attention approach integrates feature values with the corresponding feature names. Comprehensive experiments demonstrate that our pre-trained TP-BERTa leads the performance among tabular DNNs and is competitive with Gradient Boosted Decision Tree models in typical tabular data regime. Our pre-trained model will be publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=anzIzGZuLi",
    "arxiv_id": "2403.01841",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18354,
    "title": "A Topological Perspective on Demystifying GNN-Based Link Prediction Performance",
    "authors": [
      "Yu Wang",
      "Tong Zhao",
      "Yuying Zhao",
      "Yunchao Liu",
      "Xueqi Cheng",
      "Neil Shah",
      "Tyler Derr"
    ],
    "abstract": "Graph Neural Networks (GNNs) have shown great promise in learning node embeddings for link prediction (LP). While numerous studies aim to improve the overall LP performance of GNNs, none have explored its varying performance across different nodes and its underlying reasons. To this end, we aim to demystify which nodes will perform better from the perspective of their local topology. Despite the widespread belief that low-degree nodes exhibit poorer LP performance, our empirical findings provide nuances to this viewpoint and prompt us to propose a better metric, Topological Concentration (TC), based on the intersection of the local subgraph of each node with the ones of its neighbors. We empirically demonstrate that TC has a higher correlation with LP performance than other node-level topological metrics like degree and subgraph density, offering a better way to identify low-performing nodes than using cold-start. With TC, we discover a novel topological distribution shift issue in which newly joined neighbors of a node tend to become less interactive with that node's existing neighbors, compromising the generalizability of node embeddings for LP at testing time. To make the computation of TC scalable, We further propose Approximated Topological Concentration (ATC) and theoretically/empirically justify its efficacy in approximating TC and reducing the computation complexity. Given the positive correlation between node TC and its LP performance, we explore the potential of boosting LP performance via enhancing TC by re-weighting edges in the message-passing and discuss its effectiveness with limitations.  Our code is publicly available at https://github.com/submission2024/Topo_Concentration",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=apA6SSXx2e",
    "arxiv_id": "2310.04612",
    "GitHub": [
      "https://github.com/YuWVandy/Topo_LP_GNN"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18355,
    "title": "Unveiling and Manipulating Prompt Influence in Large Language Models",
    "authors": [
      "Zijian Feng",
      "Hanzhang Zhou",
      "ZIXIAO ZHU",
      "Junlang Qian",
      "Kezhi Mao"
    ],
    "abstract": "Prompts play a crucial role in guiding the responses of Large Language Models (LLMs). However, the intricate role of individual tokens in prompts, known as input saliency, in shaping the responses remains largely underexplored. Existing saliency methods either misalign with LLM generation objectives or rely heavily on linearity assumptions, leading to potential inaccuracies. To address this, we propose Token Distribution Dynamics (TDD), an elegantly simple yet remarkably effective approach to unveil and manipulate the role of prompts in generating LLM outputs. TDD leverages the robust interpreting capabilities of the language model head (LM head) to assess input saliency. It projects input tokens into the embedding space and then estimates their significance based on distribution dynamics over the vocabulary. We introduce three TDD variants: forward, backward, and bidirectional, each offering unique insights into token relevance. Extensive experiments reveal that the TDD surpasses state-of-the-art baselines with a big margin in elucidating the causal relationships between prompts and LLM outputs. Beyond mere interpretation, we apply TDD to two prompt manipulation tasks for controlled text generation: zero-shot toxic language suppression and sentiment steering. Empirical results underscore TDD's proficiency in identifying both toxic and sentimental cues in prompts, subsequently mitigating toxicity or modulating sentiment in the generated content.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ap1ByuwQrX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18353,
    "title": "Adaptive Regularization of Representation Rank as an Implicit Constraint of Bellman Equation",
    "authors": [
      "Qiang He",
      "Tianyi Zhou",
      "Meng Fang",
      "Setareh Maghsudi"
    ],
    "abstract": "Representation rank is an important concept for understanding the role of Neural Networks (NNs) in Deep Reinforcement learning (DRL), which measures the expressive capacity of value networks. Existing studies focus on unboundedly maximizing this rank; nevertheless, that approach would introduce overly complex models in the learning, thus undermining performance. Hence, fine-tuning representation rank presents a challenging and crucial optimization problem. To address this issue, we find a guiding principle for adaptive control of the representation rank. We employ the Bellman equation as a theoretical foundation and derive an upper bound on the cosine similarity of consecutive state-action pairs representations of value networks. We then leverage this upper bound to propose a novel regularizer, namely BEllman Equation-based automatic rank Regularizer (BEER). This regularizer adaptively regularizes the representation rank, thus improving the DRL agent's performance. We first validate the effectiveness of automatic control of rank on illustrative experiments. Then, we scale up BEER to complex continuous control tasks by combining it with the deterministic policy gradient method. Among 12 challenging DeepMind control tasks, BEER outperforms the baselines by a large margin. Besides, BEER demonstrates significant advantages in Q-value approximation. Our anonymous code is available at https://anonymous.4open.science/r/BEER-3C4B.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=apXtolxDaJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18352,
    "title": "Adaptive Chameleon  or Stubborn Sloth: Revealing the Behavior of Large Language Models in Knowledge Conflicts",
    "authors": [
      "Jian Xie",
      "Kai Zhang",
      "Jiangjie Chen",
      "Renze Lou",
      "Yu Su"
    ],
    "abstract": "By providing external information to large language models (LLMs), tool augmentation (including retrieval augmentation) has emerged as a promising solution for addressing the limitations of LLMs' static parametric memory.However, how receptive are LLMs to such external evidence, especially when the evidence conflicts with their parametric memory? We present the first comprehensive and controlled investigation into the behavior of LLMs when encountering knowledge conflicts.We propose a systematic framework to elicit high-quality parametric memory from LLMs and construct the corresponding counter-memory, which enables us to conduct a series of controlled experiments.Our investigation reveals seemingly contradicting behaviors of LLMs.On the one hand, different from prior wisdom, we find that LLMs can be highly receptive to external evidence even when that conflicts with their parametric memory, given that the external evidence is coherent and convincing.On the other hand, LLMs also demonstrate a strong confirmation bias when the external evidence contains some information that is consistent with their parametric memory, despite being presented with conflicting evidence at the same time.These results pose important implications that are worth careful consideration for the further development and deployment of tool- and retrieval-augmented LLMs.Resources are available at https://github.com/OSU-NLP-Group/LLM-Knowledge-Conflict.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=auKAUJZMO6",
    "arxiv_id": "2305.13300",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18351,
    "title": "Implicit Maximum a Posteriori Filtering via Adaptive Optimization",
    "authors": [
      "Gianluca Bencomo",
      "Jake Snell",
      "Thomas L. Griffiths"
    ],
    "abstract": "Bayesian filtering approximates the true underlying behavior of a time-varying system by inverting an explicit generative model to convert noisy measurements into state estimates. This process typically requires matrix storage, inversion, and multiplication or Monte Carlo estimation, none of which are practical in high-dimensional state spaces such as the weight spaces of artificial neural networks. Here, we consider the standard Bayesian filtering problem as optimization over a time-varying objective. Instead of maintaining matrices for the filtering equations or simulating particles, we specify an optimizer that defines the Bayesian filter implicitly. In the linear-Gaussian setting, we show that every Kalman filter has an equivalent formulation using K steps of gradient descent. In the nonlinear setting, our experiments demonstrate that our framework results in filters that are effective, robust, and scalable to high-dimensional systems, comparing well against the standard toolbox of Bayesian filtering solutions. We suggest that it is easier to fine-tune an optimizer than it is to specify the correct filtering equations, making our framework an attractive option for high-dimensional filtering problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=auUngos7eR",
    "arxiv_id": "2311.10580",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18350,
    "title": "Expressivity of ReLU-Networks under Convex Relaxations",
    "authors": [
      "Maximilian Baader",
      "Mark Niklas Mueller",
      "Yuhao Mao",
      "Martin Vechev"
    ],
    "abstract": "Convex relaxations are a key component of training and certifying provably safe neural networks. However, despite substantial progress, a wide and poorly understood accuracy gap to standard networks remains, raising the question of whether this is due to fundamental limitations of convex relaxations. Initial work investigating this question focused on the simple and widely used IBP relaxation. It revealed that some univariate, convex, continuous piecewise linear (CPWL) functions cannot be encoded by any ReLU network such that its IBP-analysis is precise.To explore whether this limitation is shared by more advanced convex relaxations, we conduct the first in-depth study on the expressive power of ReLU networks across all commonly used convex relaxations. We show that: (i) more advanced relaxations allow a larger class of univariate functions to be expressed as precisely analyzable ReLU networks, (ii) more precise relaxations can allow exponentially larger solution spaces of ReLU networks encoding the same functions, and (iii) even using the most precise single-neuron relaxations, it is impossible to construct precisely analyzable ReLU networks that express multivariate, convex, monotone CPWL functions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=awHTL3Hpto",
    "arxiv_id": "2311.04015",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18349,
    "title": "The Hidden Language of Diffusion Models",
    "authors": [
      "Hila Chefer",
      "Oran Lang",
      "Mor Geva",
      "Volodymyr Polosukhin",
      "Assaf Shocher",
      "michal Irani",
      "Inbar Mosseri",
      "Lior Wolf"
    ],
    "abstract": "Text-to-image diffusion models have demonstrated an unparalleled ability to generate high-quality, diverse images from a textual prompt. However, the internal representations learned by these models remain an enigma. In this work, we present Conceptor, a novel method to interpret the internal representation of a textual concept by a diffusion model. This interpretation is obtained by decomposing the concept into a small set of human-interpretable textual elements. Applied over the state-of-the-art Stable Diffusion model, Conceptor reveals non-trivial structures in the representations of concepts. For example, we find surprising visual connections between concepts, that transcend their textual semantics. We additionally discover concepts that rely on mixtures of exemplars, biases, renowned artistic styles, or a simultaneous fusion of multiple meanings of the concept.Through a large battery of experiments, we demonstrate Conceptor's ability to provide meaningful, robust, and faithful decompositions for a wide variety of abstract, concrete, and complex textual concepts, while allowing to naturally connect each decomposition element to its corresponding visual impact on the generated images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=awWpHnEJDw",
    "arxiv_id": "2306.00966",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18347,
    "title": "Meta-Learning Priors Using Unrolled Proximal Networks",
    "authors": [
      "Yilang Zhang",
      "Georgios B. Giannakis"
    ],
    "abstract": "Relying on prior knowledge accumulated from related tasks, meta-learning offers a powerful approach to learning a novel task from a limited number of training data. Recent approaches use a family of prior probability density functions or recurrent neural network models, whose parameters can be optimized by utilizing labeled data from the observed tasks. While these approaches have appealing empirical performance, expressiveness of their prior is relatively low, which limits generalization and interpretation of meta-learning. Aiming at expressive yet meaningful priors, this contribution puts forth a novel prior representation model that leverages the notion of algorithm unrolling.  The key idea is to unroll the proximal gradient descent steps, where learnable piecewise linear functions are developed to approximate the desired proximal operators within *tight* theoretical error bounds established for both smooth and non-smooth proximal functions. The resultant multi-block neural network not only broadens the scope of learnable priors, but also enhances interpretability from an optimization viewpoint. Numerical tests conducted on few-shot learning datasets demonstrate markedly improved performance with flexible, visualizable, and understandable priors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=b3Cu426njo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18344,
    "title": "Pareto Deep Long-Tailed Recognition: A Conflict-Averse Solution",
    "authors": [
      "Zhipeng Zhou",
      "Liu Liu",
      "Peilin Zhao",
      "Wei Gong"
    ],
    "abstract": "Deep long-tailed recognition (DTLR) has attracted much attention due to its close touch with realistic scenarios. Recent advances have focused on re-balancing across various aspects, e.g., sampling strategy, loss re-weighting, logit adjustment, and input/parameter perturbation, to name a few. However, few studies have considered dynamic re-balancing to address intrinsic optimization conflicts. In this paper, we first empirically argue that the optimizations of mainstream DLTR methods are still dominated by some categories (e.g., major) due to a fixed re-balancing strategy. Thus, they fail to deal with gradient conflicts among categories, which naturally deduces the motivation for reaching Pareto optimal solutions. Unfortunately, a naive integration of multi-objective optimization (MOO) with DLTR methods is not applicable due to the gap between multi-task learning (MTL) and DLTR, and can in turn lead to class-specific feature degradation. Thus, we provide effective alternatives by decoupling MOO-based MTL from the temporal rather than structure perspective, and enhancing it via optimizing variability collapse loss motivated by the derived MOO-based DLTR generalization bound. Moreover, we resort to anticipating worst-case optimization with theoretical insights to further ensure convergence. We build a Pareto deep long-tailed recognition method termed PLOT upon the proposed MOO framework. Extensive evaluations demonstrate that our method not only generally improves mainstream pipelines, but also achieves an augmented version to realize state-of-the-art performance across multiple benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=b66P1u0k15",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18343,
    "title": "Supervised Knowledge Makes Large Language Models Better In-context Learners",
    "authors": [
      "Linyi Yang",
      "Shuibai Zhang",
      "Zhuohao Yu",
      "Guangsheng Bao",
      "Yidong Wang",
      "Jindong Wang",
      "Ruochen Xu",
      "Wei Ye",
      "Xing Xie",
      "Weizhu Chen",
      "Yue Zhang"
    ],
    "abstract": "Large Language Models (LLMs) exhibit emerging in-context learning abilities through prompt engineering. The recent progress in large-scale generative models has further expanded their use in real-world language applications. However, the critical challenge of improving the generalizability and factuality of LLMs in natural language understanding and question answering remains under-explored. While previous in-context learning research has focused on enhancing models to adhere to users' specific instructions and quality expectations, and to avoid undesired outputs, little to no work has explored the use of task-specific fine-tuned Language Models (SLMs) to improve LLMs' in-context learning during the inference stage. Our primary contribution is the establishment of a simple yet effective framework that enhances the reliability of LLMs as it: 1) generalizes out-of-distribution data, 2) elucidates how LLMs benefit from discriminative models, and 3) minimizes hallucinations in generative tasks. Using our proposed plug-in method, enhanced versions of Llama 2 and ChatGPT surpass their original versions regarding generalizability and factuality. We offer a comprehensive suite of resources, including 16 curated datasets, prompts, model checkpoints, and LLM outputs across 9 distinct tasks. Our empirical analysis sheds light on the advantages of incorporating discriminative models into LLMs and highlights the potential of our methodology in fostering more reliable LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bAMPOUF227",
    "arxiv_id": "2312.15918",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18341,
    "title": "COSA: Concatenated Sample Pretrained Vision-Language Foundation Model",
    "authors": [
      "Sihan Chen",
      "Xingjian He",
      "Handong Li",
      "Xiaojie Jin",
      "Jiashi Feng",
      "Jing Liu"
    ],
    "abstract": "Due to the limited scale and quality of video-text training corpus, most  vision-language  foundation  models employ  image-text datasets for pretraining and primarily focus on modeling visually semantic representations while disregarding temporal semantic representations and correlations. To address this issue, we propose COSA, a COncatenated SAmple pretrained vision-language foundation model. COSA can jointly model visual contents and event-level temporal cues using only image-text corpora.  We achieve this by sequentially concatenating multiple image-text pairs as inputs for pretraining. This transformation effectively converts existing image-text corpora into a pseudo  video-paragraph corpus, enabling richer scene transformations and explicit event-description correspondence. Extensive experiments demonstrate that COSA consistently improves performance across a broad range of semantic vision-language downstream tasks, including paragraph-to-video retrieval, text-to-video/image retrieval, video/image captioning and video QA. Notably, COSA achieves state-of-the-art results on various competitive benchmarks. Models and codes will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bDkisS75zy",
    "arxiv_id": "2306.09085",
    "GitHub": [
      "https://github.com/TXH-mercury/COSA"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18340,
    "title": "Understanding In-Context Learning from Repetitions",
    "authors": [
      "Jianhao Yan",
      "Jin Xu",
      "Chiyu Song",
      "Chenming Wu",
      "Yafu Li",
      "Yue Zhang"
    ],
    "abstract": "This paper explores the elusive mechanism underpinning in-context learning in Large Language Models (LLMs). Our work provides a novel perspective by examining in-context learning via the lens of surface repetitions. We quantitatively investigate the role of surface features in text generation, and empirically establish the existence of token co-occurrence reinforcement, a principle that strengthens the relationship between two tokens based on their contextual co-occurrences. By investigating the dual impacts of these features, our research illuminates the internal workings of in-context learning and expounds on the reasons for its failures. This paper provides an essential contribution to the understanding of in-context learning and its potential limitations, providing a fresh perspective on this exciting capability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bGGYcvw8mp",
    "arxiv_id": "2310.00297",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18339,
    "title": "Latent Representation and Simulation of Markov Processes via Time-Lagged Information Bottleneck",
    "authors": [
      "Marco Federici",
      "Patrick Forr\u00e9",
      "Ryota Tomioka",
      "Bastiaan S. Veeling"
    ],
    "abstract": "Markov processes are widely used mathematical models for describing dynamic systems in various fields. However, accurately simulating large-scale systems at long time scales is computationally expensive due to the short time steps required for accurate integration. In this paper, we introduce an inference process that maps complex systems into a simplified representational space and models large jumps in time. To achieve this, we propose Time-lagged Information Bottleneck (T-IB), a principled objective rooted in information theory, which aims to capture relevant temporal features while discarding high-frequency information to simplify the simulation task and minimize the inference error. Our experiments demonstrate that T-IB learns information-optimal representations for accurately modeling the statistical properties and dynamics of the original process at a selected time lag, outperforming existing time-lagged dimensionality reduction methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bH6T0Jjw5y",
    "arxiv_id": "2309.07200",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18338,
    "title": "Meta Inverse Constrained Reinforcement Learning: Convergence Guarantee and Generalization Analysis",
    "authors": [
      "Shicheng Liu",
      "Minghui Zhu"
    ],
    "abstract": "This paper considers the problem of learning the reward function and constraints of an expert from few demonstrations. This problem can be considered as a meta-learning problem where we first learn meta-priors over reward functions and constraints from other distinct but related tasks and then adapt the learned meta-priors to new tasks from only few expert demonstrations. We formulate a bi-level optimization problem where the upper level aims to learn a meta-prior over reward functions and the lower level is to learn a meta-prior over constraints. We propose a novel algorithm to solve this problem and formally guarantee that the algorithm reaches the set of $\\epsilon$-stationary points at the iteration complexity $O(\\frac{1}{\\epsilon^2})$. We also quantify the generalization error to an arbitrary new task. Experiments are used to validate that the learned meta-priors can adapt to new tasks with good performance from only few demonstrations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bJ3gFiwRgi",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18337,
    "title": "Facing the Elephant in the Room: Visual Prompt Tuning or Full finetuning?",
    "authors": [
      "Cheng Han",
      "Qifan Wang",
      "Yiming Cui",
      "Wenguan Wang",
      "Lifu Huang",
      "Siyuan Qi",
      "Dongfang Liu"
    ],
    "abstract": "As the scale of vision models continues to grow, the emergence of Visual Prompt Tuning (VPT) as a parameter-efficient transfer learning technique has gained attention due to its superior performance compared to traditional full-finetuning. However, the conditions favoring VPT (the \"when\") and the underlying rationale (the \"why\") remain unclear. In this paper, we conduct a comprehensive analysis across 19 distinct datasets and tasks. To understand the \"when\" aspect, we identify the scenarios where VPT proves favorable by two dimensions: task objectives and data distributions. We find that VPT is preferrable when there is 1) a substantial disparity between the original and the downstream task objectives ($e.g.$, transitioning from classification to counting), or 2) a notable similarity in data distributions between the two tasks ($e.g.$, both involve natural images). In exploring the \"why\" dimension, our results indicate VPT's success cannot be attributed solely to overfitting and optimization considerations. The unique way VPT preserves original features and adds parameters appears to be a pivotal factor. Our study provides insights into VPT's mechanisms, and offers guidance for its optimal utilization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bJx4iOIOxn",
    "arxiv_id": "2401.12902",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18335,
    "title": "Boundary Denoising for Video Activity Localization",
    "authors": [
      "Mengmeng Xu",
      "Mattia Soldan",
      "Jialin Gao",
      "Shuming Liu",
      "Juan-Manuel Perez-Rua",
      "Bernard Ghanem"
    ],
    "abstract": "Video activity localization aims at understanding the semantic content in long, untrimmed videos and retrieving actions of interest. The retrieved action with its start and end locations can be used for highlight generation, temporal action detection, etc. Unfortunately, learning the exact boundary location of activities is highly challenging because temporal activities are continuous in time, and there are often no clear-cut transitions between actions. Moreover, the definition of the start and end of events is subjective, which may confuse the model. To alleviate the boundary ambiguity, we propose to study the video activity localization problem from a denoising perspective. Specifically, we propose an encoder-decoder model named DenosieLoc. During training, a set of action spans is randomly generated from the ground truth with a controlled noise scale. Then, we attempt to reverse this process by boundary denoising, allowing the localizer to predict activities with precise boundaries and resulting in faster convergence speed. Experiments show that DenosieLoc advances several video activity understanding tasks. For example, we observe a gain of +12.36% average mAP on the QV-Highlights dataset.Moreover, DenosieLoc achieves state-of-the-art performance on the MAD dataset but with much fewer predictions than others.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bLpUtGyf9g",
    "arxiv_id": "2304.02934",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18336,
    "title": "UC-NERF: Neural Radiance Field for Under-Calibrated Multi-View Cameras in Autonomous Driving",
    "authors": [
      "Kai Cheng",
      "Xiaoxiao Long",
      "Wei Yin",
      "Jin Wang",
      "Zhiqiang Wu",
      "Yuexin Ma",
      "Kaixuan Wang",
      "Xiaozhi Chen",
      "Xuejin Chen"
    ],
    "abstract": "Multi-camera setups find widespread use across various applications, such as autonomous driving, as they greatly expand sensing capabilities. Despite the fast development of Neural radiance field (NeRF) techniques and their wide applications in both indoor and outdoor scenes, applying NeRF to multi-camera systems remains very challenging. This is primarily due to the inherent under-calibration issues in multi-camera setup, including inconsistent imaging effects stemming from separately calibrated image signal processing units in diverse cameras, and system errors arising from mechanical vibrations during driving that affect relative camera poses.In this paper, we present UC-NeRF, a novel method tailored for novel view synthesis in under-calibrated multi-view camera systems.Firstly, we propose a layer-based color correction to rectify the color inconsistency in different image regions. Second, we propose virtual warping to generate more viewpoint-diverse but color-consistent virtual views for color correction and 3D recovery. Finally, a spatiotemporally constrained pose refinement is designed for more robust and accurate pose calibration in multi-camera systems.Our method not only achieves state-of-the-art performance of novel view synthesis in multi-camera setups, but also effectively facilitates depth estimation in large-scale outdoor scenes with the synthesized novel views.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bLKcCe7hYh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18333,
    "title": "Raidar: geneRative AI Detection viA Rewriting",
    "authors": [
      "Chengzhi Mao",
      "Carl Vondrick",
      "Hao Wang",
      "Junfeng Yang"
    ],
    "abstract": "We find that large language models (LLMs) are more likely to modify human-written text than AI-generated text when tasked with rewriting. This tendency arises because LLMs often perceive AI-generated text as high-quality, leading to fewer modifications. We introduce a method to detect AI-generated content by prompting LLMs to rewrite text and calculating the editing distance of the output. We dubbed our geneRative AI Detection viA Rewriting method Raidar.  Raidar significantly improves the F1 detection scores of existing AI content detection models -- both academic and commercial -- across various domains, including News, creative writing, student essays, code, Yelp reviews, and arXiv papers, with gains of up to 29 points. Operating solely on word symbols without high-dimensional features, our method is compatible with black box LLMs, and is inherently robust on new content. Our results illustrate the unique imprint of machine-generated text through the lens of the machines themselves.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bQWE2UqXmf",
    "arxiv_id": "2401.12970",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18330,
    "title": "Transferring Learning Trajectories of Neural Networks",
    "authors": [
      "Daiki Chijiwa"
    ],
    "abstract": "Training deep neural networks (DNNs) is computationally expensive, which is problematic especially when performing duplicated or similar training runs in model ensemble or fine-tuning pre-trained models, for example. Once we have trained one DNN on some dataset, we have its learning trajectory (i.e., a sequence of intermediate parameters during training) which may potentially contain useful information for learning the dataset. However, there has been no attempt to utilize such information of a given learning trajectory for another training. In this paper, we formulate the problem of \"transferring\" a given learning trajectory from one initial parameter to another one (named *learning transfer problem*) and derive the first algorithm to approximately solve it by matching gradients successively along the trajectory via permutation symmetry. We empirically show that the transferred parameters achieve non-trivial accuracy before any direct training, and can be trained significantly faster than training from scratch.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bWNJFD1l8M",
    "arxiv_id": "2305.14122",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19263,
    "title": "OpenChat: Advancing Open-source Language Models with Mixed-Quality Data",
    "authors": [
      "Guan Wang",
      "Sijie Cheng",
      "Xianyuan Zhan",
      "Xiangang Li",
      "Sen Song",
      "Yang Liu"
    ],
    "abstract": "Nowadays, open-source large language models like LLaMA have emerged. Recent developments have incorporated supervised fine-tuning (SFT) and reinforcement learning fine-tuning (RLFT) to align these models with human goals. However, SFT methods treat all training data with mixed quality equally, while RLFT methods require high-quality pairwise or ranking-based preference data. In this study, we present a novel framework, named OpenChat, to advance open-source language models with mixed-quality data. Specifically, we consider the general SFT training data, consisting of a small amount of expert data mixed with a large proportion of sub-optimal data, without any preference labels. We propose the C(onditioned)-RLFT, which regards different data sources as coarse-grained reward labels and learns a class-conditioned policy to leverage complementary data quality information. Interestingly, the optimal policy in C-RLFT can be easily solved through single-stage, RL-free supervised learning, which is lightweight and avoids costly human preference labeling. Through extensive experiments on three standard benchmarks, our openchat-13b fine-tuned with C-RLFT achieves the highest average performance among all 13b open-source language models. Moreover, we use AGIEval to validate the model generalization performance, in which only openchat-13b surpasses the base model. Finally, we conduct a series of analyses to shed light on the effectiveness and robustness of OpenChat. Our code, data, and models will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AOJyfhWYHf",
    "arxiv_id": "2309.11235",
    "GitHub": [
      "https://github.com/imoneoi/openchat"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19261,
    "title": "GAIA: Zero-shot Talking Avatar Generation",
    "authors": [
      "Tianyu He",
      "Junliang Guo",
      "Runyi Yu",
      "Yuchi Wang",
      "jialiang zhu",
      "Kaikai An",
      "Leyi Li",
      "Xu Tan",
      "Chunyu Wang",
      "Han Hu",
      "HsiangTao Wu",
      "sheng zhao",
      "Jiang Bian"
    ],
    "abstract": "Zero-shot talking avatar generation aims at synthesizing natural talking videos from speech and a single portrait image. Previous methods have relied on domain-specific heuristics such as warping-based motion representation and 3D Morphable Models, which limit the naturalness and diversity of the generated avatars. In this work, we introduce GAIA (Generative AI for Avatar), which eliminates the domain priors in talking avatar generation. In light of the observation that the speech only drives the motion of the avatar while the appearance of the avatar and the background typically remain the same throughout the entire video, we divide our approach into two stages: 1) disentangling each frame into motion and appearance representations; 2) generating motion sequences conditioned on the speech and reference portrait image. We collect a large-scale high-quality talking avatar dataset and train the model on it with different scales (up to 2B parameters). Experimental results verify the superiority, scalability, and flexibility of GAIA as 1) the resulting model beats previous baseline models in terms of naturalness, diversity, lip-sync quality, and visual quality; 2) the framework is scalable since larger models yield better results; 3) it is general and enables different applications like controllable talking avatar generation and text-instructed avatar generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ATEawsFUj4",
    "arxiv_id": "2311.15230",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18329,
    "title": "FITS: Modeling Time Series with $10k$ Parameters",
    "authors": [
      "Zhijian Xu",
      "Ailing Zeng",
      "Qiang Xu"
    ],
    "abstract": "In this paper, we introduce FITS, a lightweight yet powerful model for time series analysis. Unlike existing models that directly process raw time-domain data, FITS operates on the principle that time series can be manipulated through interpolation in the complex frequency domain, achieving performance comparable to state-of-the-art models for time series forecasting and anomaly detection tasks. Notably, FITS accomplishes this with a svelte profile of just about $10k$ parameters, making it ideally suited for edge devices and paving the way for a wide range of applications. The code is available for review at: \\url{https://anonymous.4open.science/r/FITS}.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=bWcnvZ3qMb",
    "arxiv_id": "2307.03756",
    "GitHub": [
      "https://github.com/VEWOXIC/FITS"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18328,
    "title": "Exploring Diffusion Time-steps for Unsupervised Representation Learning",
    "authors": [
      "Zhongqi Yue",
      "Jiankun Wang",
      "Qianru Sun",
      "Lei Ji",
      "Eric I-Chao Chang",
      "Hanwang Zhang"
    ],
    "abstract": "Representation learning is all about discovering the hidden modular attributes that generate the data faithfully. We explore the potential of Denoising Diffusion Probabilistic Model (DM) in unsupervised learning of the modular attributes. We build a theoretical framework that connects the diffusion time-steps and the hidden attributes, which serves as an effective inductive bias for unsupervised learning. Specifically, the forward diffusion process incrementally adds Gaussian noise to samples at each time-step, which essentially collapses different samples into similar ones by losing attributes, e.g., fine-grained attributes such as texture are lost with less noise added (i.e., early time-steps), while coarse-grained ones such as shape are lost by adding more noise (i.e., late time-steps). To disentangle the modular attributes, at each time-step t, we learn a t-specific feature to compensate for the newly lost attribute, and the set of all {1,...,t}-specific features, corresponding to the cumulative set of lost attributes, are trained to make up for the reconstruction error of a pre-trained DM at time-step t. On CelebA, FFHQ, and Bedroom datasets, the learned feature significantly improves attribute classification and enables faithful counterfactual generation, e.g., interpolating only one specified attribute between two images, validating the disentanglement quality. Codes are in Appendix.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bWzxhtl1HP",
    "arxiv_id": "2401.11430",
    "GitHub": [
      "https://github.com/yue-zhongqi/diti"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18326,
    "title": "Multilinear Operator Networks",
    "authors": [
      "Yixin Cheng",
      "Grigorios Chrysos",
      "Markos Georgopoulos",
      "Volkan Cevher"
    ],
    "abstract": "Despite the remarkable capabilities of deep neural networks in image recognition, the dependence on activation functions remains a largely unexplored area and has yet to be eliminated. On the other hand, Polynomial Networks is a class of models that does not require activation functions, but have yet to perform on par with modern architectures. In this work, we aim close this gap and propose MONet, which relies *solely* on multilinear operators. The core layer of MONet, called Mu-Layer, captures multiplicative interactions of the elements of the input token. MONet captures high-degree interactions of the input elements and we demonstrate the efficacy of our approach on a series of image recognition and scientific computing benchmarks. The proposed model outperforms prior polynomial networks and performs on par with modern architectures. We believe that MONet can inspire further research on models that use entirely multilinear operations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bbCL5aRjUx",
    "arxiv_id": "2401.17992",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19253,
    "title": "Implicit regularization of deep residual networks towards neural ODEs",
    "authors": [
      "Pierre Marion",
      "Yu-Han Wu",
      "Michael Eli Sander",
      "G\u00e9rard Biau"
    ],
    "abstract": "Residual neural networks are state-of-the-art deep learning models. Their continuous-depth analog, neural ordinary differential equations (ODEs), are also widely used. Despite their success, the link between the discrete and continuous models still lacks a solid mathematical foundation. In this article, we take a step in this direction by establishing an implicit regularization of deep residual networks towards neural ODEs, for nonlinear networks trained with gradient flow. We prove that if the network is initialized as a discretization of a neural ODE, then such a discretization holds throughout training. Our results are valid for a finite training time, and also as the training time tends to infinity provided that the network satisfies a Polyak-\u0141ojasiewicz condition. Importantly, this condition holds for a family of residual networks where the residuals are two-layer perceptrons with an overparameterization in width that is only linear, and implies the convergence of gradient flow to a global minimum. Numerical experiments illustrate our results.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=AbXGwqb5Ht",
    "arxiv_id": "2309.01213",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18325,
    "title": "MBR and QE Finetuning: Training-time Distillation of the Best and Most Expensive Decoding Methods",
    "authors": [
      "Mara Finkelstein",
      "Markus Freitag"
    ],
    "abstract": "Recent research in decoding methods for Natural Language Generation (NLG) tasks has shown that MAP decoding is not optimal, because model probabilities do not always align with human preferences. Stronger decoding methods, including Quality Estimation (QE) reranking and Minimum Bayes' Risk (MBR) decoding, have since been proposed to mitigate the model-perplexity-vs-quality mismatch. While these decoding methods achieve state-of-the-art performance, they are prohibitively expensive to compute. In this work, we propose MBR finetuning and QE finetuning, which distill the quality gains from these decoding methods at training time, while using an efficient decoding algorithm at inference time. Using the canonical NLG task of Neural Machine Translation (NMT), we show that even with self-training, these finetuning methods significantly outperform the base model. Moreover, when using an external LLM as a teacher model, these finetuning methods outperform finetuning on human-generated references. These findings suggest new ways to leverage monolingual data to achieve improvements in model quality that are on par with, or even exceed, improvements from human-curated data, while maintaining maximum efficiency during decoding.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bkNx3O0sND",
    "arxiv_id": "2309.10966",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18324,
    "title": "A Simple Interpretable Transformer for Fine-Grained Image Classification and Analysis",
    "authors": [
      "DIPANJYOTI PAUL",
      "Arpita Chowdhury",
      "Xinqi Xiong",
      "Feng-Ju Chang",
      "David Edward Carlyn",
      "Samuel Stevens",
      "Kaiya L Provost",
      "Anuj Karpatne",
      "Bryan Carstens",
      "Daniel Rubenstein",
      "Charles Stewart",
      "Tanya Berger-Wolf",
      "Yu Su",
      "Wei-Lun Chao"
    ],
    "abstract": "We present a novel usage of Transformers to make image classification interpretable. Unlike mainstream classifiers that wait until the last fully-connected layer to incorporate class information to make predictions, we investigate a proactive approach, asking each class to search for itself in an image. We realize this idea via a Transformer encoder-decoder inspired by DEtection TRansformer (DETR). We learn \"class-specific'' queries (one for each class) as input to the decoder, enabling each class to localize its patterns in an image via cross-attention. We name our approach INterpretable TRansformer (INTR), which is fairly easy to implement and exhibits several compelling properties. We show that INTR intrinsically encourages each class to attend distinctively; the cross-attention weights thus provide a faithful interpretation of the prediction. Interestingly, via \"multi-head'' cross-attention, INTR could identify different \"attributes'' of a class, making it particularly suitable for fine-grained classification and analysis, which we demonstrate on eight datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bkdWThqE6q",
    "arxiv_id": "2311.04157",
    "GitHub": [
      "https://github.com/Imageomics/INTR"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18323,
    "title": "Adaptive Stochastic Gradient Algorithm for Black-box Multi-Objective Learning",
    "authors": [
      "Feiyang YE",
      "Yueming Lyu",
      "Xuehao Wang",
      "Yu Zhang",
      "Ivor Tsang"
    ],
    "abstract": "Multi-objective optimization (MOO) has become an influential framework for various machine learning problems, including reinforcement learning and multi-task learning. In this paper, we study the black-box multi-objective optimization problem, where we aim to optimize multiple potentially conflicting objectives with function queries only. To address this challenging problem and find a Pareto optimal solution or the Pareto stationary solution, we propose a novel adaptive stochastic gradient algorithm for black-box MOO, called ASMG. Specifically, we use the stochastic gradient approximation method to obtain the gradient for the distribution parameters of the Gaussian smoothed MOO with function queries only. Subsequently, an adaptive weight is employed to aggregate all stochastic gradients to optimize all objective functions effectively. Theoretically, we explicitly provide the connection between the original MOO problem and the corresponding Gaussian smoothed MOO problem and prove the convergence rate for the proposed ASMG algorithm in both convex and non-convex scenarios.Empirically, the proposed ASMG method achieves competitive performance on multiple numerical benchmark problems. Additionally, the state-of-the-art performance on the black-box multi-task learning problem demonstrates the effectiveness of the proposed ASMG method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bm1JVsVZVu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19251,
    "title": "Rethinking Model Ensemble in Transfer-based Adversarial Attacks",
    "authors": [
      "Huanran Chen",
      "Yichi Zhang",
      "Yinpeng Dong",
      "Xiao Yang",
      "Hang Su",
      "Jun Zhu"
    ],
    "abstract": "It is widely recognized that deep learning models lack robustness to adversarial examples. An intriguing property of adversarial examples is that they can transfer across different models, which enables black-box attacks without any knowledge of the victim model. An effective strategy to improve the transferability is attacking an ensemble of models. However, previous works simply average the outputs of different models, lacking an in-depth analysis on how and why model ensemble methods can strongly improve the transferability. In this paper, we rethink the ensemble in adversarial attacks and define the common weakness of model ensemble with two properties: 1) the flatness of loss landscape; and 2) the closeness to the local optimum of each model. We empirically and theoretically show that both properties are strongly correlated with the transferability and propose a Common Weakness Attack (CWA) to generate more transferable adversarial examples by promoting these two properties. Experimental results on both image classification and object detection tasks validate the effectiveness of our approach to improving the adversarial transferability, especially when attacking adversarially trained models. We also successfully apply our method to attack a black-box large vision-language model -- Google's Bard, showing the practical effectiveness.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AcJrSoArlh",
    "arxiv_id": "2303.09105",
    "GitHub": [
      "https://github.com/huanranchen/AdversarialAttacks"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19249,
    "title": "Distinguished In Uniform: Self-Attention Vs. Virtual Nodes",
    "authors": [
      "Eran Rosenbluth",
      "Jan T\u00f6nshoff",
      "Martin Ritzert",
      "Berke Kisin",
      "Martin Grohe"
    ],
    "abstract": "Graph Transformers (GTs) such as SAN and GPS have been shown to be universal function approximators. We show that when extending MPGNNs and even 2-layer MLPs with the same positional encodings that GTs use, they also become universal function approximators on graphs. All these results hold in the non-uniform case where a different network may be used for every graph size. In order to show meaningful differences between GTs and MPGNNs we then consider the uniform setting where a single network needs to work for all graph sizes. First, we show that none of the above models is universal in that setting. Then, our main technical result is that there are functions that GTs can express while MPGNNs with virtual nodes cannot and vice versa, making their uniform expressivity provably different. We show this difference empirically on synthetic data and observe that on real-world data global information exchange through graph transformers and conceptually simpler MPGNNs with virtual nodes achieve similar performance gains over message passing on various datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AcSChDWL6V",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18322,
    "title": "Stabilizing Backpropagation Through Time to Learn Complex Physics",
    "authors": [
      "Patrick Schnell",
      "Nils Thuerey"
    ],
    "abstract": "Of all the vector fields surrounding the minima of recurrent learning setups, the gradient field with its exploding and vanishing updates appears a poor choice for optimization, offering little beyond efficient computability. We seek to improve this suboptimal practice in the context of physics simulations, where backpropagating feedback through many unrolled time steps is considered crucial to acquiring temporally coherent behavior. The alternative vector field we propose follows from two principles: physics simulators, unlike neural networks, have a balanced gradient flow and certain modifications to the backpropagation pass leave the positions of the original minima unchanged. As any modification of backpropagation decouples forward and backward pass, the rotation-free character of the gradient field is lost. Therefore, we discuss the negative implications of using such a rotational vector field for optimization and how to counteract them. Our final procedure is easily implementable via a sequence of gradient stopping and component-wise comparison operations, which do not negatively affect scalability. Our experiments on three control problems show that especially as we increase the complexity of each task, the unbalanced updates from the gradient can no longer provide the precise control signals necessary while our method still solves the tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bozbTTWcaw",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19248,
    "title": "Risk Bounds of Accelerated SGD for Overparameterized Linear Regression",
    "authors": [
      "Xuheng Li",
      "Yihe Deng",
      "Jingfeng Wu",
      "Dongruo Zhou",
      "Quanquan Gu"
    ],
    "abstract": "Accelerated stochastic gradient descent (ASGD) is a workhorse in deep learning and often achieves better generalization performance than SGD. However, existing optimization theory can only explain the faster convergence of ASGD, but cannot explain its better generalization. In this paper, we study the generalization of ASGD for overparameterized linear regression, which is possibly the simplest setting of learning with overparameterization. We establish an instance-dependent excess risk bound for ASGD within each eigen-subspace of the data covariance matrix. Our analysis shows that (i) ASGD outperforms SGD in the subspace of small eigenvalues, exhibiting a faster rate of exponential decay for bias error, while in the subspace of large eigenvalues, its bias error decays slower than SGD; and (ii) the variance error of ASGD is always larger than that of SGD. Our result suggests that ASGD can outperform SGD when the difference between the initialization and the true weight vector is mostly confined to the subspace of small eigenvalues. Additionally, when our analysis is specialized to linear regression in the strongly convex setting, it yields a tighter bound for bias error than the best-known result.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AcoXPIPh4A",
    "arxiv_id": "2311.14222",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18321,
    "title": "Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games",
    "authors": [
      "Brian Hu Zhang",
      "Gabriele Farina",
      "Tuomas Sandholm"
    ],
    "abstract": "A recent paper by Farina and Pipis (2023) established the existence of uncoupled no-linear-swap regret dynamics with polynomial-time iterations in extensive-form games. The equilibrium points reached by these dynamics, known as linear correlated equilibria, are currently the tightest known relaxation of correlated equilibrium that can be learned in polynomial time in any finite extensive-form game. However, their properties remain vastly unexplored, and their computation is onerous. In this paper, we provide several contributions shedding light on the fundamental nature of linear-swap regret. First, we show a connection between linear deviations and a generalization of communication deviations in which the player can make queries to a ``mediator'' who replies with action recommendations, and, critically, the player is not constrained to match the timing of the game as would be the case for communication deviations. We coin this latter set the untimed communication (UTC) deviations. We show that the UTC deviations coincide precisely with the linear deviations, and therefore that any player minimizing UTC regret also minimizes linear-swap regret. We then leverage this connection to develop state-of-the-art no-regret algorithms for computing linear correlated equilibria, both in theory and in practice. In theory, our algorithms achieve polynomially better per-iteration runtimes; in practice, our algorithms represent the state of the art by several orders of magnitude.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bsKMPAFHO7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17627,
    "title": "Frozen Transformers in Language Models Are Effective Visual Encoder Layers",
    "authors": [
      "Ziqi Pang",
      "Ziyang Xie",
      "Yunze Man",
      "Yu-Xiong Wang"
    ],
    "abstract": "This paper reveals that large language models (LLMs), despite being trained solely on text data, are \\emph{surprisingly} strong encoders for \\emph{purely} visual tasks in the absence of language. Even more intriguingly, this can be achieved by a simple yet previously overlooked strategy -- employing a \\emph{frozen} transformer block from \\emph{pre-trained} LLMs as a constituent encoder layer to directly process visual tokens. Our work pushes the boundaries of leveraging LLMs for computer vision tasks, significantly departing from conventional practices that typically necessitate a multi-modal vision-language setup with associated language prompts, inputs, or outputs. We demonstrate that our approach consistently enhances performance across \\emph{a diverse range of tasks}, encompassing pure 2D or 3D visual recognition tasks (e.g., image and point cloud classification), temporal modeling tasks (e.g., action recognition), non-semantic tasks (e.g., motion forecasting), and multi-modal tasks (e.g., 2D/3D visual question answering and image-text retrieval). Such improvements are a general phenomenon, applicable to various types of LLMs (e.g., LLaMA and OPT) and different LLM transformer blocks. We additionally propose the \\emph{information filtering} hypothesis to explain the effectiveness of pre-trained LLMs in visual encoding -- the pre-trained LLM transformer blocks discern informative visual tokens and further amplify their effect. This hypothesis is empirically supported by the observation that the feature activation, after training with LLM transformer blocks, exhibits a stronger focus on relevant regions. We hope that our work inspires new perspectives on utilizing LLMs and deepening our understanding of their underlying mechanisms.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=t0FI3Q66K5",
    "arxiv_id": "2310.12973",
    "GitHub": [
      "https://github.com/ziqipang/LM4VisualEncoding"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18320,
    "title": "RAPPER: Reinforced Rationale-Prompted Paradigm for Natural Language Explanation in Visual Question Answering",
    "authors": [
      "Kai-Po Chang",
      "Chi-Pin Huang",
      "Wei-Yuan Cheng",
      "Fu-En Yang",
      "Chien-Yi Wang",
      "Yung-Hsuan Lai",
      "Yu-Chiang Frank Wang"
    ],
    "abstract": "Natural Language Explanation (NLE) in vision and language tasks aims to provide human-understandable explanations for the associated decision-making process. In practice, one might encounter explanations which lack informativeness or contradict visual-grounded facts, known as \\textit{implausibility} and \\textit{hallucination} problems, respectively. To tackle these challenging issues, we consider the task of visual question answering (VQA) and introduce \\textit{Rapper}, a two-stage \\textbf{R}einforced R\\textbf{a}tionale-\\textbf{P}rom\\textbf{p}t\\textbf{e}d Pa\\textbf{r}adigm. By knowledge distillation, the former stage of \\textit{Rapper} infuses rationale-prompting via large language models (LLMs), encouraging the rationales supported by language-based facts. As for the latter stage, a unique Reinforcement Learning from NLE Feedback (RLNF) is introduced for injecting visual facts into NLE generation. Finally, quantitative and qualitative experiments on two VL-NLE benchmarks show that \\textsc{Rapper} surpasses state-of-the-art VQA-NLE methods while providing plausible and faithful NLE.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bshfchPM9H",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18319,
    "title": "Efficient Planning with Latent Diffusion",
    "authors": [
      "Wenhao Li"
    ],
    "abstract": "Temporal abstraction and efficient planning pose significant challenges in offline reinforcement learning, mainly when dealing with domains that involve temporally extended tasks and delayed sparse rewards. Existing methods typically plan in the raw action space and can be inefficient and inflexible. Latent action spaces offer a more flexible approach, capturing only possible actions within the behavior policy support and decoupling the temporal structure between planning and modeling. However, current latent-action-based methods are limited to discrete spaces and require expensive planning steps. This paper presents a unified framework for continuous latent action space representation learning and planning by leveraging latent, score-based diffusion models. We establish the theoretical equivalence between planning in the latent action space and energy-guided sampling with a pretrained diffusion model and introduce a novel sequence-level exact sampling method. Our proposed method, $\\texttt{LatentDiffuser}$, demonstrates competitive performance on low-dimensional locomotion control tasks and surpasses existing methods in higher-dimensional tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=btpgDo4u4j",
    "arxiv_id": "2310.00311",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18318,
    "title": "AnomalyCLIP: Object-agnostic Prompt Learning for Zero-shot Anomaly Detection",
    "authors": [
      "Qihang Zhou",
      "Guansong Pang",
      "Yu Tian",
      "Shibo He",
      "Jiming Chen"
    ],
    "abstract": "Zero-shot anomaly detection (ZSAD) requires detection models trained using auxiliarydata to detect anomalies without any training sample in a target dataset. Itis a crucial task when training data is not accessible due to various concerns, e.g.,data privacy, yet it is challenging since the models need to generalize to anomaliesacross different domains where the appearance of foreground objects, abnormalregions, and background features, such as defects/tumors on different products/organs, can vary significantly. Recently large pre-trained vision-languagemodels (VLMs), such as CLIP, have demonstrated strong zero-shot recognitionability in various vision tasks, including anomaly detection. However, their ZSADperformance is weak since the VLMs focus more on modeling the class semanticsof the foreground objects rather than the abnormality/normality in the images. Inthis paper we introduce a novel approach, namely AnomalyCLIP, to adapt CLIPfor accurate ZSAD across different domains. The key insight of AnomalyCLIPis to learn object-agnostic text prompts that capture generic normality and abnormalityin an image regardless of its foreground objects. This allows our model tofocus on the abnormal image regions rather than the object semantics, enablinggeneralized normality and abnormality recognition on diverse types of objects.Large-scale experiments on 17 real-world anomaly detection datasets show thatAnomalyCLIP achieves superior zero-shot performance of detecting and segmentinganomalies in datasets of highly diverse class semantics from various defectinspection and medical imaging domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=buC4E91xZE",
    "arxiv_id": "2310.18961",
    "GitHub": [
      "https://github.com/zqhang/AnomalyCLIP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18317,
    "title": "Structural Fairness-aware Active Learning for Graph Neural Networks",
    "authors": [
      "Haoyu Han",
      "Xiaorui Liu",
      "Li Ma",
      "MohamadAli Torkamani",
      "Hui Liu",
      "Jiliang Tang",
      "Makoto Yamada"
    ],
    "abstract": "Graph Neural Networks (GNNs) have seen significant achievements in semi-supervised node classification. Yet, their efficacy often hinges on access to high-quality labeled node samples, which may not always be available in real-world scenarios. While active learning is commonly employed across various domains to pinpoint and label high-quality samples based on data features, graph data present unique challenges due to their intrinsic structures that render nodes non-i.i.d. Furthermore, biases emerge from the positioning of labeled nodes; for instance, nodes closer to the labeled counterparts often yield better performance. To better leverage graph structure and mitigate structural bias in active learning, we present a unified optimization framework (SCARCE), which is also easily incorporated with node features.  Extensive experiments demonstrate that the proposed method not only improves the GNNs performance but also paves the way for more fair results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bvjcMvMn7B",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18316,
    "title": "Sharpness-Aware Data Poisoning Attack",
    "authors": [
      "Pengfei He",
      "Han Xu",
      "Jie Ren",
      "Yingqian Cui",
      "Shenglai Zeng",
      "Hui Liu",
      "Charu C. Aggarwal",
      "Jiliang Tang"
    ],
    "abstract": "Recent research has highlighted the vulnerability of Deep Neural Networks (DNNs) against data poisoning attacks. These attacks aim to inject poisoning samples into the models' training dataset such that the trained models have inference failures. While previous studies have executed different types of attacks, one major challenge that greatly limits their effectiveness is the uncertainty of the re-training process after the injection of poisoning samples. It includes the uncertainty of training initialization, algorithm and model architecture. To address this challenge, we propose a new strategy called **Sharpness-Aware Data Poisoning Attack (SAPA)**. In particular, it leverages the concept of DNNs' loss landscape sharpness to optimize the poisoning effect on the (approximately) worst re-trained model. Extensive experiments demonstrate that SAPA offers a general and principled strategy that significantly enhances various types of poisoning attacks against various types of re-training uncertainty.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=bxITGFPVWh",
    "arxiv_id": "2305.14851",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18315,
    "title": "AlignDiff: Aligning Diverse Human Preferences via Behavior-Customisable Diffusion Model",
    "authors": [
      "Zibin Dong",
      "Yifu Yuan",
      "Jianye HAO",
      "Fei Ni",
      "Yao Mu",
      "YAN ZHENG",
      "Yujing Hu",
      "Tangjie Lv",
      "Changjie Fan",
      "Zhipeng Hu"
    ],
    "abstract": "Aligning agent behaviors with diverse human preferences remains a challenging problem in reinforcement learning (RL), owing to the inherent abstractness and mutability of human preferences. To address these issues, we propose AlignDiff, a novel framework that leverages RLHF to quantify human preferences, covering abstractness, and utilizes them to guide diffusion planning for zero-shot behavior customizing, covering mutability. AlignDiff can accurately match user-customized behaviors and efficiently switch from one to another. To build the framework, we first establish the multi-perspective human feedback datasets, which contain comparisons for the attributes of diverse behaviors, and then train an attribute strength model to predict quantified relative strengths. After relabeling behavioral datasets with relative strengths, we proceed to train an attribute-conditioned diffusion model, which serves as a planner with the attribute strength model as a director for preference aligning at the inference phase. We evaluate AlignDiff on various locomotion tasks and demonstrate its superior performance on preference matching, switching, and covering compared to other baselines. Its capability of completing unseen downstream tasks under human instructions also showcases the promising potential for human-AI collaboration. More visualization videos are released on https://aligndiff.github.io/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bxfKIYfHyx",
    "arxiv_id": "2310.02054",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18314,
    "title": "Prioritized Soft Q-Decomposition for Lexicographic Reinforcement Learning",
    "authors": [
      "Finn Rietz",
      "Erik Schaffernicht",
      "Stefan Heinrich",
      "Johannes A. Stork"
    ],
    "abstract": "Reinforcement learning (RL) for complex tasks remains a challenge, primarily due to the difficulties of engineering scalar reward functions and the inherent inefficiency of training models from scratch. Instead, it would be better to specify complex tasks in terms of elementary subtasks and to reuse subtask solutions whenever possible. In this work, we address continuous space lexicographic multi-objective RL problems, consisting of prioritized subtasks, which are notoriously difficult to solve. We show that these can be scalarized with a subtask transformation and then solved incrementally using value decomposition. Exploiting this insight, we propose prioritized soft Q-decomposition (PSQD), a novel algorithm for learning and adapting subtask solutions under lexicographic priorities in continuous state-action spaces. PSQD offers the ability to reuse previously learned subtask solutions in a zero-shot composition, followed by an adaptation step. Its ability to use retained subtask training data for offline learning eliminates the need for new environment interaction during adaptation. We demonstrate the efficacy of our approach by presenting successful learning, reuse, and adaptation results for both low- and high-dimensional simulated robot control tasks, as well as offline learning results. In contrast to baseline approaches, PSQD does not trade off between conflicting subtasks or priority constraints and satisfies subtask priorities during learning. PSQD provides an intuitive framework for tackling complex RL problems, offering insights into the inner workings of the subtask composition.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c0MyyXyGfn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18313,
    "title": "Zero-Shot Robotic Manipulation with Pre-Trained Image-Editing Diffusion Models",
    "authors": [
      "Kevin Black",
      "Mitsuhiko Nakamoto",
      "Pranav Atreya",
      "Homer Rich Walke",
      "Chelsea Finn",
      "Aviral Kumar",
      "Sergey Levine"
    ],
    "abstract": "If generalist robots are to operate in truly unstructured environments, they need to be able to recognize and reason about novel objects and scenarios. Such objects and scenarios might not be present in the robot's own training data. We propose SuSIE, a method that leverages an image editing diffusion model to act as a high-level planner by proposing intermediate subgoals that a low-level controller attains. Specifically, we fine-tune InstructPix2Pix on robot data such that it outputs a hypothetical future observation given the robot's current observation and a language command. We then use the same robot data to train a low-level goal-conditioned policy to reach a given image observation. We find that when these components are combined, the resulting system exhibits robust generalization capabilities. The high-level planner utilizes its Internet-scale pre-training and visual understanding to guide the low-level goal-conditioned policy, achieving significantly better generalization than conventional language-conditioned policies. We demonstrate that this approach solves real robot control tasks involving novel objects, distractors, and even environments, both in the real world and in simulation. The project website can be found at http://subgoal-image-editing.github.io.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c0chJTSbci",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19237,
    "title": "FairTune: Optimizing Parameter Efficient Fine Tuning for Fairness in Medical Image Analysis",
    "authors": [
      "Raman Dutt",
      "Ondrej Bohdal",
      "Sotirios A. Tsaftaris",
      "Timothy Hospedales"
    ],
    "abstract": "Training models with robust group fairness properties is crucial in ethically sensitive application areas such as medical diagnosis. Despite the growing body of work aiming to minimise demographic bias in AI, this problem remains challenging. A key reason for this challenge is the fairness generalisation gap: High-capacity deep learning models can fit all training data nearly perfectly, and thus also exhibit perfect fairness during training. In this case, bias emerges only during testing when generalisation performance differs across sub-groups. This motivates us to take a bi-level optimisation perspective on fair learning: Optimising the learning strategy based on validation fairness. Specifically, we consider the highly effective workflow of adapting pre-trained models to downstream medical imaging tasks using parameter-efficient fine-tuning (PEFT) techniques. There is a trade-off between updating more parameters, enabling a better fit to the task of interest vs. fewer parameters, potentially reducing the generalisation gap. To manage this tradeoff, we propose FairTune, a framework to optimise the choice of PEFT parameters with respect to fairness. We demonstrate empirically that FairTune leads to improved fairness on a range of medical imaging datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ArpwmicoYW",
    "arxiv_id": "2310.05055",
    "GitHub": [
      "https://github.com/Raman1121/FairTune"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19235,
    "title": "Function Vectors in Large Language Models",
    "authors": [
      "Eric Todd",
      "Millicent Li",
      "Arnab Sen Sharma",
      "Aaron Mueller",
      "Byron C Wallace",
      "David Bau"
    ],
    "abstract": "We report the presence of a simple neural mechanism that represents an input-output function as a vector within autoregressive transformer language models (LMs). Using causal mediation analysis on a diverse range of in-context-learning (ICL) tasks, we find that a small number attention heads transport a compact representation of the demonstrated task, which we call a function vector (FV).  FVs are robust to changes in context, i.e., they trigger execution of the task on inputs such as zero-shot and natural text settings that do not resemble the ICL contexts from which they are collected. We test FVs across a range of tasks, models, and layers and find strong causal effects across settings in middle layers. We investigate the internal structure of FVs and find while that they often contain information that encodes the output space of the function, this information alone is not sufficient to reconstruct an FV. Finally, we test semantic vector composition in FVs, and find that to some extent they can be summed to create vectors that trigger new complex tasks. Our findings show that compact, causal internal vector representations of function abstractions can be explicitly extracted from LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AwyxtyMwaG",
    "arxiv_id": "2310.15213",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18311,
    "title": "Denoising Diffusion Step-aware Models",
    "authors": [
      "Shuai Yang",
      "Yukang Chen",
      "Luozhou WANG",
      "Shu Liu",
      "Ying-Cong Chen"
    ],
    "abstract": "Denoising Diffusion Probabilistic Models (DDPMs) have garnered popularity for data generation across various domains. However, a significant bottleneck is the necessity for whole-network computation during every step of the generative process, leading to high computational overheads. This paper presents a novel framework, Denoising Diffusion Step-aware Models (DDSM), to address this challenge. Unlike conventional approaches, DDSM employs a spectrum of neural networks whose sizes are adapted according to the importance of each generative step, as determined through evolutionary search. This step-wise network variation effectively circumvents redundant computational efforts, particularly in less critical steps, thereby enhancing the efficiency of the diffusion model. Furthermore, the step-aware design can be seamlessly integrated with other efficiency-geared diffusion models such as DDIMs and latent diffusion, thus broadening the scope of computational savings. Empirical evaluations demonstrate that DDSM achieves computational savings of 49% for CIFAR-10, 61% for CelebA-HQ, 59% for LSUN-bedroom, 71% for AFHQ, and 76% for ImageNet, all without compromising the generation quality. Our code and models will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c43FGk8Pcg",
    "arxiv_id": "2310.03337",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18310,
    "title": "GAFormer: Enhancing Timeseries Transformers Through Group-Aware Embeddings",
    "authors": [
      "Jingyun Xiao",
      "Ran Liu",
      "Eva L Dyer"
    ],
    "abstract": "Analyzing multivariate time series is important in many domains. However, it has been difficult to learn robust and generalizable representations within multivariate datasets due to complex inter-channel relationships and dynamic shifts. In this paper, we introduce a novel approach for learning spatiotemporal structure and using it to improve the application of transformers to timeseries datasets. Our framework learns a set of group tokens, and builds an instance-specific group embedding (GE) layer that assigns input tokens to a small number of group tokens to incorporate  structure into learning. We then introduce a novel architecture, Group-Aware transFormer (GAFormer), which incorporates both spatial and temporal group embeddings to achieve state-of-the-art performance on a number of time-series classification and regression tasks. In evaluations on a number of diverse timeseries datasets, we show that GE on its own can provide a nice enhancement to a number of backbones, and that by coupling spatial and temporal group embeddings, the GAFormer can outperform the existing baselines. Finally, we show how our approach discerns latent structures in data even without information about the spatial ordering of channels, and yields a more interpretable decomposition of spatial and temporal structure underlying complex multivariate datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c56TWtYp0W",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19226,
    "title": "Pre-training Sequence, Structure, and Surface Features for Comprehensive Protein Representation Learning",
    "authors": [
      "Youhan Lee",
      "Hasun Yu",
      "Jaemyung Lee",
      "Jaehoon Kim"
    ],
    "abstract": "Proteins can be represented in various ways, including their sequences, 3D structures, and surfaces. While recent studies have successfully employed sequence- or structure-based representations to address multiple tasks in protein science, there has been significant oversight in incorporating protein surface information, a critical factor for protein function. In this paper, we present a pre-training strategy that incorporates information from protein sequences, 3D structures, and surfaces to improve protein representation learning. Specifically, we utilize Implicit Neural Representations (INRs) for learning surface characteristics, and name it ProteinINR. We confirm that ProteinINR successfully reconstructs protein surfaces, and integrate this surface learning into the existing pre-training strategy of sequences and structures. Our results demonstrate that our approach can enhance performance in various downstream tasks, thereby underscoring the importance of including surface attributes in protein representation learning. These findings underline the importance of understanding protein surfaces for generating effective protein representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BEH4mGo7zP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18307,
    "title": "Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks",
    "authors": [
      "Tianyu Fan",
      "Lirong Wu",
      "Yufei Huang",
      "Haitao Lin",
      "Cheng Tan",
      "Zhangyang Gao",
      "Stan Z. Li"
    ],
    "abstract": "Recent years have witnessed the great success of graph pre-training for graph representation learning. With hundreds of graph pre-training tasks proposed, integrating knowledge acquired from multiple pre-training tasks has become a popular research topic. We identify two important collaborative processes for this topic: (1) select: how to select an optimal task combination from a given task pool based on their compatibility, and (2) weigh: how to weigh the importance of the selected tasks based on their importance. While there has been a lot of current works focused on weighing, comparatively little effort has been devoted to selecting. In this paper, we propose a novel instance-level framework for integrating multiple graph pre-training tasks, Weigh And Select (WAS), where the two collaborative processes, weighing and selecting, are combined by decoupled siamese networks. Specifically, it first adaptively learns an optimal combination of tasks for each instance from a given task pool, based on which a customized instance-level task weighing strategy is learned. Extensive experiments on 16 graph datasets across node-level and graph-level show that by combining a few simple but classical tasks, WAS can achieve comparable performance to other leading counterparts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c85tdYOOju",
    "arxiv_id": "2403.01400",
    "GitHub": [
      "https://github.com/TianyuFan0504/WAS"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18306,
    "title": "Solving Challenging Math Word Problems Using GPT-4 Code Interpreter with Code-based Self-Verification",
    "authors": [
      "Aojun Zhou",
      "Ke Wang",
      "Zimu Lu",
      "Weikang Shi",
      "Sichun Luo",
      "Zipeng Qin",
      "Shaoqing Lu",
      "Anya Jia",
      "Linqi Song",
      "Mingjie Zhan",
      "Hongsheng Li"
    ],
    "abstract": "Recent progress in large language models (LLMs) like GPT-4 and PaLM-2 has brought significant advancements in addressing math reasoning problems. In particular, OpenAI's latest version of GPT-4, known as GPT-4 Code Interpreter, shows remarkable performance on challenging math datasets. In this paper, we explore the effect of code on enhancing LLMs' reasoning capability by introducing different constraints on the Code Usage Frequency of GPT-4 Code Interpreter. We found that its success can be largely attributed to its powerful skills in generating and executing code, evaluating the output of code execution, and rectifying its solution when receiving unreasonable outputs. Based on this insight, we propose a novel and effective prompting method, explicit $\\underline{\\text{c}}$ode-based $\\underline{\\text{s}}$elf-$\\underline{\\text{v}}$erification (CSV), to further boost the mathematical reasoning potential of GPT-4 Code Interpreter. This method employs a zero-shot prompt on GPT-4 Code Interpreter to encourage it to use code to self-verify its answers. In instances where the verification state registers as \"False\", the model shall automatically amend its solution, analogous to our approach of rectifying errors during a mathematics examination. Furthermore, we recognize that the states of the verification result indicate the confidence of a solution, which can improve the effectiveness of majority voting. With GPT-4 Code Interpreter and CSV, we achieve an impressive zero-shot accuracy on MATH dataset $\\textbf{(53.9}$% \u2192 $\\textbf{84.3}$%$\\textbf{)}$.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c8McWs4Av0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18304,
    "title": "Enhancing Neural Training via a Correlated Dynamics Model",
    "authors": [
      "Jonathan Brokman",
      "Roy Betser",
      "Rotem Turjeman",
      "Tom Berkov",
      "Ido Cohen",
      "Guy Gilboa"
    ],
    "abstract": "As neural networks grow in scale, their training becomes both computationally demanding and rich in dynamics. Amidst the flourishing interest in these training dynamics, we present a novel observation: Parameters during training exhibit intrinsic correlations over time. Capitalizing on this, we introduce  \\emph{correlation mode decomposition} (CMD). This algorithm clusters the parameter space into groups, termed modes, that display synchronized behavior across epochs. This enables CMD to efficiently represent the training dynamics of complex networks, like ResNets and Transformers, using only a few modes. Moreover, test set generalization is enhanced.    We introduce an efficient CMD variant, designed to run concurrently with training. Our experiments indicate that CMD surpasses the state-of-the-art method for compactly modeled dynamics on image classification. Our modeling can improve training efficiency and lower communication overhead, as shown by our preliminary experiments in the context of federated learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c9xsaASm9L",
    "arxiv_id": "2312.13247",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18302,
    "title": "Aux-NAS: Exploiting Auxiliary Labels with Negligibly Extra Inference Cost",
    "authors": [
      "Yuan Gao",
      "WEIZHONG ZHANG",
      "Wenhan Luo",
      "Lin Ma",
      "Jin-Gang Yu",
      "Gui-Song Xia",
      "Jiayi Ma"
    ],
    "abstract": "We aim at exploiting additional auxiliary labels from an independent (auxiliary) task to boost the primary task performance which we focus on, while preserving a single task inference cost of the primary task. While most existing auxiliary learning methods are optimization-based relying on loss weights/gradients manipulation, our method is architecture-based with a flexible asymmetric structure for the primary and auxiliary tasks, which produces different networks for training and inference. Specifically, starting from two single task networks/branches (each representing a task), we propose a novel method with evolving networks where only primary-to-auxiliary links exist as the cross-task connections after convergence. These connections can be removed during the primary task inference, resulting in a single task inference cost. We achieve this by formulating a Neural Architecture Search (NAS) problem, where we initialize bi-directional connections in the search space and guide the NAS optimization converging to an architecture with only the single-side primary-to-auxiliary connections. Moreover, our method can be incorporated with existing optimization-based auxiliary learning approaches. Extensive experiments with 6 tasks on NYU v2, CityScapes, and Taskonomy datasets using VGG-16, ResNet-50, and ViTBase backbones validate the promising performance. The codes will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cINwAhrgLf",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18301,
    "title": "Deep Orthogonal Hypersphere Compression for Anomaly Detection",
    "authors": [
      "Yunhe Zhang",
      "Yan Sun",
      "Jinyu Cai",
      "Jicong Fan"
    ],
    "abstract": "A common assumption of many anomaly detection methods is that a reasonable decision boundary has a hypersphere shape, which is difficult to obtain in practice and is not sufficiently compact, especially when the data are in high-dimensional spaces. In this paper, we first propose a novel deep anomaly detection model that improves the original hypersphere learning through an orthogonal projection layer, which ensures that the training data distribution is consistent with the hypersphere hypothesis, thereby increasing the true positive rate and decreasing the false negative rate. Moreover, we propose a bi-hypersphere compression method to obtain a hyperspherical shell that yields a more compact decision region than a hyperball, which is demonstrated theoretically and numerically.  Note that the proposed methods are not confined to common datasets, such as image and tabular data, but are also extended to a more challenging but promising scenario, graph-level anomaly detection, which learns graph representation with maximum mutual information between the substructure and global structure features while exploring orthogonal single- or bi-hypersphere anomaly decision boundaries. The numerical and visualization results on benchmark datasets demonstrate the effectiveness and superiority of our methods in comparison with many baselines and the state-of-the-arts.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=cJs4oE4m9Q",
    "arxiv_id": "2302.06430",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18300,
    "title": "Exploring Effective Stimulus Encoding via Vision System Modeling for Visual Prostheses",
    "authors": [
      "Chuanqing Wang",
      "Di Wu",
      "Chaoming Fang",
      "Jie Yang",
      "Mohamad Sawan"
    ],
    "abstract": "Visual prostheses are potential devices to restore vision for the blind, which highly depends on the quality of stimulation patterns. However, existing processing frameworks utilize region detection or deep learning model to generate stimulation patterns without effective optimization methods to achieve better vision recovery. In this paper, we propose for the first time an end-to-end stimulation patterns optimization framework that consists of a retinal network to mimic the behavior of retina, phosphene model to simulate phosphene generated by retinal prostheses, and primary vision system network (PVS-net) to mimic the function from retina to visual cortex. Combining these three components, the framework can simulate the whole process of visual signals processing from external scenes to the visual perception in the cortex. Besides, we adopt biological spike responses of the visual cortex as target signals during training, providing an efficient way to generate and verify the quality of stimulation patterns. The proposed retina network adopts a spike representation encoding technique to record external scenes and a spiking recurrent neural network to predict the stimulation patterns. The phosphene model and VVS-net simulate the phosphene in the retina and predict multiple V1 neurons' response. Experimental results show that the generated stimulation patterns not only contain the feature of original scenes but also have biological plausibility to generate similar perceptions in the visual cortex. The performance of the proposed framework achieves 0.78, evaluated by the Pearson correlation coefficient between predicted values and the recorded response of normal neurons.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cKAUvMePUN",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18296,
    "title": "GlucoBench: Curated List of Continuous Glucose Monitoring Datasets with Prediction Benchmarks",
    "authors": [
      "Renat Sergazinov",
      "Elizabeth Chun",
      "Valeriya Rogovchenko",
      "Nathaniel J Fernandes",
      "Nicholas Kasman",
      "Irina Gaynanova"
    ],
    "abstract": "The rising rates of diabetes necessitate innovative methods for its management. Continuous glucose monitors (CGM) are small medical devices that measure blood glucose levels at regular intervals providing insights into daily patterns of glucose variation. Forecasting of glucose trajectories based on CGM data holds the potential to substantially improve diabetes management, by both refining artificial pancreas systems and enabling individuals to make adjustments based on predictions to maintain optimal glycemic range. Despite numerous methods proposed for CGM-based glucose trajectory prediction, these methods are typically evaluated on small, private datasets, impeding reproducibility, further research, and practical adoption. The absence of standardized prediction tasks and systematic comparisons between methods has led to uncoordinated research efforts, obstructing the identification of optimal tools for tackling specific challenges. As a result, only a limited number of prediction methods have been implemented in clinical practice.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cUSNs8nGaV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18295,
    "title": "Improved Analysis of Sparse Linear Regression in Local Differential Privacy Model",
    "authors": [
      "Liyang Zhu",
      "Meng Ding",
      "Vaneet Aggarwal",
      "Jinhui Xu",
      "Di Wang"
    ],
    "abstract": "In this paper, we revisit the problem of sparse linear regression in the local differential privacy (LDP) model. Existing research in the non-interactive and sequentially local models has focused on obtaining the lower bounds for the case where the underlying parameter is $1$-sparse, and extending such bounds to the more general $k$-sparse case has proven to be challenging. Moreover, it is unclear whether efficient non-interactive LDP (NLDP) algorithms exist. To address these issues, we  first consider the problem in the $\\epsilon$ non-interactive LDP model and provide a lower bound of $\\Omega(\\frac{\\sqrt{dk\\log d}}{\\sqrt{n}\\epsilon})$ on the $\\ell_2$-norm estimation error for sub-Gaussian data, where $n$ is the sample size and $d$ is the dimension of the space. We propose an innovative NLDP algorithm, the very first of its kind for the problem. As a remarkable outcome, this algorithm also yields a novel and highly efficient estimator as a valuable by-product. Our algorithm achieves an upper bound of $\\tilde{O}({\\frac{d\\sqrt{k}}{\\sqrt{n}\\epsilon}})$ for the estimation error when the data is sub-Gaussian, which can be further improved by a factor of  $O(\\sqrt{d})$ if the server has additional public but unlabeled data. For the sequentially interactive LDP model, we show a similar lower bound of $\\Omega({\\frac{\\sqrt{dk}}{\\sqrt{n}\\epsilon}})$. As for the upper bound, we rectify a previous method and show that it is possible to achieve a bound of $\\tilde{O}(\\frac{k\\sqrt{d}}{\\sqrt{n}\\epsilon})$. Our findings reveal fundamental differences between the non-private case, central DP model, and local DP model in the sparse linear regression problem.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cVUOnF7iVp",
    "arxiv_id": "2310.07367",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18294,
    "title": "State Representation Learning Using an Unbalanced Atlas",
    "authors": [
      "Li Meng",
      "Morten Goodwin",
      "Anis Yazidi",
      "Paal E. Engelstad"
    ],
    "abstract": "The manifold hypothesis posits that high-dimensional data often lies on a lower-dimensional manifold and that utilizing this manifold as the target space yields more efficient representations. While numerous traditional manifold-based techniques exist for dimensionality reduction, their application in self-supervised learning has witnessed slow progress. The recent MSimCLR method combines manifold encoding with SimCLR but requires extremely low target encoding dimensions to outperform SimCLR, limiting its applicability. This paper introduces a novel learning paradigm using an unbalanced atlas (UA), capable of surpassing state-of-the-art self-supervised learning approaches. We investigated and engineered the DeepInfomax with an unbalanced atlas (DIM-UA) method by adapting the Spatiotemporal DeepInfomax (ST-DIM) framework to align with our proposed UA paradigm. The efficacy of DIM-UA is demonstrated through training and evaluation on the Atari Annotated RAM Interface (AtariARI) benchmark, a modified version of the Atari 2600 framework that produces annotated image samples for representation learning. The UA paradigm improves existing algorithms significantly as the number of target encoding dimensions grows. For instance, the mean F1 score averaged over categories of DIM-UA is~75% compared to ~70% of ST-DIM when using 16384 hidden units.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cWdAYDLmPa",
    "arxiv_id": "2305.10267",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17626,
    "title": "Controlling Vision-Language Models for Multi-Task Image Restoration",
    "authors": [
      "Ziwei Luo",
      "Fredrik K. Gustafsson",
      "Zheng Zhao",
      "Jens Sj\u00f6lund",
      "Thomas B. Sch\u00f6n"
    ],
    "abstract": "Vision-language models such as CLIP have shown great impact on diverse downstream tasks for zero-shot or label-free predictions. However, when it comes to low-level vision such as image restoration their performance deteriorates dramatically due to corrupted inputs. In this paper, we present a degradation-aware vision-language model (DA-CLIP) to better transfer pretrained vision-language models to low-level vision tasks as a universal framework for image restoration. More specifically, DA-CLIP trains an additional controller that adapts the fixed CLIP image encoder to predict high-quality feature embeddings. By integrating the embedding into an image restoration network via cross-attention, we are able to pilot the model to learn a high-fidelity image reconstruction. The controller itself will also output a degradation feature that matches the real corruptions of the input, yielding a natural classifier for different degradation types. In addition, we construct a mixed degradation dataset with synthetic captions for DA-CLIP training. Our approach advances state-of-the-art performance on both degradation-specific and unified image restoration tasks, showing a promising direction of prompting image restoration with large-scale pretrained vision-language models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=t3vnnLeajU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19203,
    "title": "Complete and Efficient Graph Transformers for Crystal Material Property Prediction",
    "authors": [
      "Keqiang Yan",
      "Cong Fu",
      "Xiaofeng Qian",
      "Xiaoning Qian",
      "Shuiwang Ji"
    ],
    "abstract": "Crystal structures are characterized by atomic bases within a primitive unit cell that repeats along a regular lattice throughout 3D space. The periodic and infinite nature of crystals poses unique challenges for geometric graph representation learning. Specifically, constructing graphs that effectively capture  the complete  geometric information of crystals and handle chiral crystals remains an unsolved and challenging problem. In this paper, we introduce a novel approach that utilizes the periodic patterns of unit cells to establish the lattice-based representation for each atom, enabling efficient and expressive graph representations of crystals. Furthermore, we propose ComFormer, a SE(3) transformer designed specifically for crystalline materials. ComFormer includes two variants; namely, iComFormer that employs invariant geometric descriptors of Euclidean distances and angles, and eComFormer that utilizes equivariant vector representations.  Experimental results demonstrate the state-of-the-art predictive accuracy of ComFormer variants on various tasks across three widely-used crystal benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BnQY9XiRAS",
    "arxiv_id": "2403.11857",
    "GitHub": [
      "https://github.com/divelab/AIRS"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18293,
    "title": "Few-Shot Detection of Machine-Generated Text using Style Representations",
    "authors": [
      "Rafael Alberto Rivera Soto",
      "Kailin Koch",
      "Aleem Khan",
      "Barry Y. Chen",
      "Marcus Bishop",
      "Nicholas Andrews"
    ],
    "abstract": "The advent of instruction-tuned language models that convincingly mimic human writing poses a significant risk of abuse. For example, such models could be used for plagiarism, disinformation, spam, or phishing. However, such abuse may be counteracted with the ability to detect whether a piece of text was composed by a language model rather than a human. Some previous approaches to this problem have relied on supervised methods trained on corpora of confirmed human and machine-written documents. Unfortunately, model under-specification poses an unavoidable challenge for such detectors, making them brittle in the face of data shifts, such as the release of further language models producing still more fluent text than the models used to train the detectors. Other previous approaches require access to the models that generated the text to be detected at inference or detection time, which is often impractical. In light of these challenge, we pursue a fundamentally different approach not relying on samples from language models of concern at training time. Instead, we propose to leverage representations of writing style estimated from human-authored text. Indeed, we find that features effective at distinguishing among human authors are also effective at distinguishing human from machine authors, including state of the art large language models like Llama 2, ChatGPT, and GPT-4. Furthermore, given handfuls of examples composed by each of several specific language models of interest, our approach affords the ability to predict which model specifically generated a given document.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cWiEN1plhJ",
    "arxiv_id": "2401.06712",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18291,
    "title": "Uncertainty Quantification via Stable Distribution Propagation",
    "authors": [
      "Felix Petersen",
      "Aashwin Ananda Mishra",
      "Hilde Kuehne",
      "Christian Borgelt",
      "Oliver Deussen",
      "Mikhail Yurochkin"
    ],
    "abstract": "We propose a new approach for propagating stable probability distributions through neural networks. Our method is based on local linearization, which we show to be an optimal approximation in terms of total variation distance for the ReLU non-linearity. This allows propagating Gaussian and Cauchy input uncertainties through neural networks to quantify their output uncertainties. To demonstrate the utility of propagating distributions, we apply the proposed method to predicting calibrated confidence intervals and selective prediction on out-of-distribution data. The results demonstrate a broad applicability of propagating distributions and show the advantages of our method over other approaches such as moment matching.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cZttUMTiPL",
    "arxiv_id": "2402.08324",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18290,
    "title": "Beyond Accuracy: Evaluating Self-Consistency of Code Large Language Models with IdentityChain",
    "authors": [
      "Marcus J. Min",
      "Yangruibo Ding",
      "Luca Buratti",
      "Saurabh Pujar",
      "Gail Kaiser",
      "Suman Jana",
      "Baishakhi Ray"
    ],
    "abstract": "Code Large Language Models (Code LLMs) are being increasingly employed in real-life applications, so evaluating them is critical. While the conventional accuracy evaluates the performance of Code LLMs on a set of individual tasks, their self-consistency across different tasks is overlooked. Intuitively, a trustworthy model should be self-consistent when generating natural language specifications for its own code and generating code for its own specifications. Failure to preserve self-consistency reveals a lack of understanding of the shared semantics underlying natural language and programming language, and therefore undermines the trustworthiness of a model. In this paper, we first formally define the self-consistency of Code LLMs and then design a framework, IdentityChain, which effectively and efficiently evaluates the self-consistency and conventional accuracy of a model at the same time. We study eleven Code LLMs and show that they fail to preserve self-consistency, which is indeed a distinct aspect from conventional accuracy. Furthermore, we show that IdentityChain can be used as a model debugging tool to expose weaknesses of Code LLMs by demonstrating three major weaknesses that we identify in current models using IdentityChain. Our code is available at https://github.com/marcusm117/IdentityChain.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=caW7LdAALh",
    "arxiv_id": "2310.14053",
    "GitHub": [
      "https://github.com/marcusm117/IdentityChain"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19199,
    "title": "Enhancing Human Experience in Human-Agent Collaboration: A Human-Centered Modeling Approach Based on Positive Human Gain",
    "authors": [
      "Yiming Gao",
      "Feiyu Liu",
      "Liang Wang",
      "Dehua Zheng",
      "Zhenjie Lian",
      "Weixuan Wang",
      "Wenjin Yang",
      "Siqin Li",
      "Xianliang Wang",
      "Wenhui Chen",
      "Jing Dai",
      "QIANG FU",
      "Yang Wei",
      "Lanxiao Huang",
      "Wei Liu"
    ],
    "abstract": "Existing game AI research mainly focuses on enhancing agents' abilities to win games, but this does not inherently make humans have a better experience when collaborating with these agents. For example, agents may dominate the collaboration and exhibit unintended or detrimental behaviors, leading to poor experiences for their human partners. In other words, most game AI agents are modeled in a \"self-centered\" manner. In this paper, we propose a \"human-centered\" modeling scheme for collaborative agents that aims to enhance the experience of humans. Specifically, we model the experience of humans as the goals they expect to achieve during the task. We expect that agents should learn to enhance the extent to which humans achieve these goals while maintaining agents' original abilities (e.g., winning games). To achieve this, we propose the Reinforcement Learning from Human Gain (RLHG) approach. The RLHG approach introduces a \"baseline\", which corresponds to the extent to which humans primitively achieve their goals, and encourages agents to learn behaviors that can effectively enhance humans in achieving their goals better. We evaluate the RLHG agent in the popular Multi-player Online Battle Arena (MOBA) game, Honor of Kings, by conducting real-world human-agent tests. Both objective performance and subjective preference results show that the RLHG agent provides participants better gaming experience.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BqEvdOS1Hs",
    "arxiv_id": "2401.16444",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19193,
    "title": "Decoupled Marked Temporal Point Process using Neural Ordinary Differential Equations",
    "authors": [
      "Yujee Song",
      "Donghyun LEE",
      "Rui Meng",
      "Won Hwa Kim"
    ],
    "abstract": "A Marked Temporal Point Process (MTPP) is a stochastic process whose realization is a set of event-time data. MTPP is often used to understand complex dynamics of asynchronous temporal events such as money transaction, social media, healthcare, etc. Recent studies have utilized deep neural networks to capture complex temporal dependencies of events and generate embedding that aptly represent the observed events. While most previous studies focus on the inter-event dependencies and their representations, how individual events influence the overall dynamics over time has been under-explored. In this regime, we propose a Decoupled MTPP framework that disentangles characterization of a stochastic process into a set of evolving influences from different events. Our approach employs Neural Ordinary Differential Equations (Neural ODEs) to learn flexible continuous dynamics of these influences while simultaneously addressing multiple inference problems, such as density estimation and survival rate computation. We emphasize the significance of disentangling the influences by comparing our framework with state-of-the-art methods on real-life datasets, and provide analysis on the model behavior for potential applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BuFNoKBiMs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18289,
    "title": "Diffusion Models for Multi-Task Generative Modeling",
    "authors": [
      "Changyou Chen",
      "Han Ding",
      "Bunyamin Sisman",
      "Yi Xu",
      "Ouye Xie",
      "Benjamin Z. Yao",
      "Son Dinh Tran",
      "Belinda Zeng"
    ],
    "abstract": "Generative modeling via diffusion-based models has been achieving state-of-the-art results on various generation tasks. Most existing diffusion models, however, are limited to a single-generation modeling. Can we generalize diffusion models with the ability of multi-task generative training for more generalizable modeling? In this paper, we propose a principled way to define a diffusion model for this purpose by constructing a unified multi-task diffusion model in a common {\\em diffusion space}. We define the forward diffusion process to be driven by an information aggregation from multiple types of task-data, {\\it e.g.}, images for a generation task and labels for a classification task. In the reverse process, we enforce information sharing by parameterizing a shared backbone denoising network with additional task-specific decoder heads. Such a structure can simultaneously learn to generate different types of multi-task data with a multi-task loss, which is derived from a multi-task variational lower bound that generalizes the standard diffusion model. We propose several multi-task generation settings to verify our framework, including image transition, masked-image training, joint image-label and joint image-representation generative modeling. Extensive experimental results on ImageNet indicate the effectiveness of our framework for various multi-task generative modeling, which we believe is an important research direction worthy of more future explorations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cbv0sBIZh9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19171,
    "title": "Fast Updating Truncated SVD for Representation Learning with Sparse Matrices",
    "authors": [
      "Haoran Deng",
      "Yang Yang",
      "Jiahe Li",
      "Cheng Chen",
      "Weihao Jiang",
      "Shiliang Pu"
    ],
    "abstract": "Updating truncated Singular Value Decomposition (SVD) has extensive applications in representation learning.The continuous evolution of massive-scaled data matrices in practical scenarios highlights the importance of aligning SVD-based models with fast-paced updates.Recent methods for updating truncated SVD can be recognized as Rayleigh-Ritz projection procedures where their projection matrices are augmented based on the original singular vectors.However, the updating process in these methods densifies the update matrix and applies the projection to all singular vectors, resulting in inefficiency.This paper presents a novel method for dynamically approximating the truncated SVD of a sparse and temporally evolving matrix.The proposed method takes advantage of sparsity in the orthogonalization process of the augment matrices and employs an extended decomposition to store projections in the column space of singular vectors independently.Numerical experimental results on updating truncated SVD for evolving sparse matrices show an order of magnitude improvement in the efficiency of our proposed method while maintaining precision comparing to previous methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CX2RgsS29V",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19170,
    "title": "FLASK: Fine-grained Language Model Evaluation based on Alignment Skill Sets",
    "authors": [
      "Seonghyeon Ye",
      "Doyoung Kim",
      "Sungdong Kim",
      "Hyeonbin Hwang",
      "Seungone Kim",
      "Yongrae Jo",
      "James Thorne",
      "Juho Kim",
      "Minjoon Seo"
    ],
    "abstract": "Evaluation of Large Language Models (LLMs) is challenging because instruction-following necessitates alignment with human values and the required set of skills varies depending on the instruction. However, previous studies have mainly focused on coarse-grained evaluation (i.e. overall preference-based evaluation), which limits interpretability since it does not consider the nature of user instructions that require instance-wise skill composition. In this paper, we introduce FLASK (Fine-grained Language Model Evaluation based on Alignment Skill Sets), a fine-grained evaluation protocol for both human-based and model-based evaluation which decomposes coarse-level scoring to a skill set-level scoring for each instruction. We experimentally observe that the fine-graininess of evaluation is crucial for attaining a holistic view of model performance and increasing the reliability of the evaluation. Using FLASK, we compare multiple open-source and proprietary LLMs and observe a high correlation between model-based and human-based evaluations.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=CYmF38ysDa",
    "arxiv_id": "2307.10928",
    "GitHub": [
      "https://github.com/kaistAI/FLASK"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19164,
    "title": "WizardLM: Empowering Large Pre-Trained Language Models to Follow Complex Instructions",
    "authors": [
      "Can Xu",
      "Qingfeng Sun",
      "Kai Zheng",
      "Xiubo Geng",
      "Pu Zhao",
      "Jiazhan Feng",
      "Chongyang Tao",
      "Qingwei Lin",
      "Daxin Jiang"
    ],
    "abstract": "Training large language models (LLMs) with open-domain instruction following data brings colossal success. However, manually creating such instruction data is very time-consuming and labor-intensive. Moreover, humans may struggle to produce high-complexity instructions. In this paper, we show an avenue for creating large amounts of instruction data with varying levels of complexity using LLM instead of humans. Starting with an initial set of instructions, we use our proposed Evol-Instruct to rewrite them step by step into more complex instructions. Then, we mix all generated instruction data to fine-tune LLaMA. We call the resulting model WizardLM. Both automatic and human evaluations consistently indicate that WizardLM outperforms baselines such as Alpaca (trained from Self-Instruct) and Vicuna (trained from human-created instructions). The experimental results demonstrate that the quality of instruction-following dataset crafted by Evol-Instruct can significantly improve the performance of LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CfXh93NDgH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19160,
    "title": "Efficient Multi-agent Reinforcement Learning by Planning",
    "authors": [
      "Qihan Liu",
      "Jianing Ye",
      "Xiaoteng Ma",
      "Jun Yang",
      "Bin Liang",
      "Chongjie Zhang"
    ],
    "abstract": "Multi-agent reinforcement learning (MARL) algorithms have accomplished remarkable breakthroughs in solving large-scale decision-making tasks. Nonetheless, most existing MARL algorithms are model-free, limiting sample efficiency and hindering their applicability in more challenging scenarios. In contrast, model-based reinforcement learning (MBRL), particularly algorithms integrating planning, such as MuZero, has demonstrated superhuman performance with limited data in many tasks. Hence, we aim to boost the sample efficiency of MARL by adopting model-based approaches. However, incorporating planning and search methods into multi-agent systems poses significant challenges. The expansive action space of multi-agent systems often necessitates leveraging the nearly-independent property of agents to accelerate learning. To tackle this issue, we propose the MAZero algorithm, which combines a centralized model with Monte Carlo Tree Search (MCTS) for policy search. We design an ingenious network structure to facilitate distributed execution and parameter sharing. To enhance search efficiency in deterministic environments with sizable action spaces, we introduce two novel techniques: Optimistic Search Lambda (OS($\\lambda$)) and Advantage-Weighted Policy Optimization (AWPO). Extensive experiments on the SMAC benchmark demonstrate that MAZero outperforms model-free approaches in terms of sample efficiency and provides comparable or better performance than existing model-based methods in terms of both sample and computational efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=CpnKq3UJwp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19156,
    "title": "Idempotence and Perceptual Image Compression",
    "authors": [
      "Tongda Xu",
      "Ziran Zhu",
      "Dailan He",
      "Yanghao Li",
      "Lina Guo",
      "Yuanyuan Wang",
      "Zhe Wang",
      "Hongwei Qin",
      "Yan Wang",
      "Jingjing Liu",
      "Ya-Qin Zhang"
    ],
    "abstract": "Idempotence is the stability of image codec to re-compression. At the first glance, it is unrelated to perceptual image compression. However, we find that theoretically: 1) Conditional generative model-based perceptual codec satisfies idempotence; 2) Unconditional generative model with idempotence constraint is equivalent to conditional generative codec. Based on this newfound equivalence, we propose a new paradigm of perceptual image codec by inverting unconditional generative model with idempotence constraints. Our codec is theoretically equivalent to conditional generative codec, and it does not require training new models. Instead, it only requires a pre-trained mean-square-error codec and unconditional generative model. Empirically, we show that our proposed approach outperforms state-of-the-art methods such as HiFiC and ILLM, in terms of Fr\u00e9chet Inception Distance (FID). The source code is provided in https://github.com/tongdaxu/Idempotence-and-Perceptual-Image-Compression.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Cy5v64DqEF",
    "arxiv_id": "2401.08920",
    "GitHub": [
      "https://github.com/tongdaxu/Idempotence-and-Perceptual-Image-Compression"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19154,
    "title": "Optimistic Bayesian Optimization with Unknown Constraints",
    "authors": [
      "Quoc Phong Nguyen",
      "Wan Theng Ruth Chew",
      "Le Song",
      "Bryan Kian Hsiang Low",
      "Patrick Jaillet"
    ],
    "abstract": "Though some research efforts have been dedicated to constrained Bayesian optimization (BO), there remains a notable absence of a principled approach with a theoretical performance guarantee in the decoupled setting. Such a setting involves independent evaluations of the objective function and constraints at different inputs, and is hence a relaxation of the commonly-studied coupled setting where functions must be evaluated together. As a result, the decoupled setting requires an adaptive selection between evaluating either the objective function or a constraint, in addition to selecting an input (in the coupled setting). This paper presents a novel constrained BO algorithm with a provable performance guarantee that can address the above relaxed setting. Specifically, it considers the fundamental trade-off between exploration and exploitation in constrained BO, and, interestingly, affords a noteworthy connection to active learning. The performance of our proposed algorithms is also empirically evaluated using several synthetic and real-world optimization problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=D4NJFfrqoq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19143,
    "title": "ReLoRA: High-Rank Training Through Low-Rank Updates",
    "authors": [
      "Vladislav Lialin",
      "Sherin Muckatira",
      "Namrata Shivagunde",
      "Anna Rumshisky"
    ],
    "abstract": "Despite the dominance and effectiveness of scaling, resulting in large networks with hundreds of billions of parameters, the necessity to train overparametrized models remains poorly understood, while training costs grow exponentially. In this paper, we explore parameter-efficient training techniques as an approach to training large neural networks. We introduce a novel method called ReLoRA, which utilizes low-rank updates to train high-rank networks. We apply ReLoRA to training transformer language models with up to 1.3B parameters and demonstrate comparable performance to regular neural network training. ReLoRA saves up to 5.5Gb of RAM per GPU and improves training speed by 9-40% depending on the model size and hardware setup. Our findings show the potential of parameter-efficient techniques for large-scale pre-training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DLJznSp6X3",
    "arxiv_id": "2307.05695",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18287,
    "title": "Can LLM-Generated Misinformation Be Detected?",
    "authors": [
      "Canyu Chen",
      "Kai Shu"
    ],
    "abstract": "The advent of Large Language Models (LLMs) has made a transformative impact. However, the potential that LLMs such as ChatGPT can be exploited to generate misinformation has posed a serious concern to online safety and public trust. A fundamental research question is: will LLM-generated misinformation cause more harm than human-written misinformation? We propose to tackle this question from the perspective of detection difficulty. We first  build a  taxonomy of LLM-generated misinformation. Then we categorize and validate the potential real-world methods for generating misinformation with LLMs. Then, through extensive empirical investigation, we discover that LLM-generated misinformation can be harder to detect for humans and detectors compared to human-written misinformation with the same semantics, which suggests it can have more deceptive styles and potentially cause more harm. We also discuss the implications of our discovery  on combating misinformation in the age of LLMs and the countermeasures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ccxD4mtkTU",
    "arxiv_id": "2309.13788",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18286,
    "title": "Robust NAS under adversarial training: benchmark, theory, and beyond",
    "authors": [
      "Yongtao Wu",
      "Fanghui Liu",
      "Carl-Johann Simon-Gabriel",
      "Grigorios Chrysos",
      "Volkan Cevher"
    ],
    "abstract": "Recent developments in neural architecture search (NAS) emphasize the significance of considering robust architectures against malicious data. However, there is a notable absence of benchmark evaluations and theoretical guarantees for searching these robust architectures, especially when adversarial training is considered. In this work, we aim to address these two challenges, making twofold contributions. First, we release a comprehensive data set that encompasses both clean accuracy and robust accuracy for a vast array of adversarially trained networks from the NAS-Bench-201 search space on image datasets. Then, leveraging the neural tangent kernel (NTK) tool from deep learning theory, we establish a generalization theory for searching architecture in terms of clean accuracy and robust accuracy under multi-objective adversarial training. We firmly believe that our benchmark and theoretical insights will significantly benefit the NAS community through reliable reproducibility, efficient assessment, and theoretical foundation, particularly in the pursuit of robust architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cdUpf6t6LZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18283,
    "title": "Decongestion by Representation: Learning to Improve Economic Welfare in Marketplaces",
    "authors": [
      "Omer Nahum",
      "Gali Noti",
      "David C. Parkes",
      "Nir Rosenfeld"
    ],
    "abstract": "Congestion is a common failure mode of markets, where consumers compete inefficiently on the same subset of goods (e.g.,  chasing the same small set of properties on a vacation rental platform). The typical economic story is that prices  decongest by balancing supply and demand. But in modern online marketplaces, prices are typically set in a decentralized way by sellers, and the information about items is inevitably partial. The power of a platform  is limited to controlling *representations*---the subset of information about items presented by default to users. This motivates the present study of *decongestion by representation*, where a platform seeks to learn representations that reduce  congestion and thus improve social welfare. The technical challenge is twofold: relying only on revealed preferences from the choices of consumers, rather than true preferences; and the combinatorial problem associated with representations that  determine the  features to reveal in the default view.  We tackle both challenges by proposing a *differentiable proxy of welfare* that can be trained end-to-end on consumer choice data. We develop sufficient conditions for when decongestion promotes welfare, and present the results of extensive experiments on both synthetic and real data that demonstrate the utility of our approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=coIaBY8EVF",
    "arxiv_id": "2306.10606",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19123,
    "title": "Point2SSM: Learning Morphological Variations of Anatomies from Point Clouds",
    "authors": [
      "Jadie Adams",
      "Shireen Elhabian"
    ],
    "abstract": "We present Point2SSM, a novel unsupervised learning approach for constructing correspondence-based statistical shape models (SSMs) directly from raw point clouds. SSM is crucial in clinical research, enabling population-level analysis of morphological variation in bones and organs. Traditional methods of SSM construction have limitations, including the requirement of noise-free surface meshes or binary volumes, reliance on assumptions or templates, and prolonged inference times due to simultaneous optimization of the entire cohort. Point2SSM overcomes these barriers by providing a data-driven solution that infers SSMs directly from raw point clouds, reducing inference burdens and increasing applicability as point clouds are more easily acquired. While deep learning on 3D point clouds has seen success in unsupervised representation learning and shape correspondence, its application to anatomical SSM construction is largely unexplored. We conduct a benchmark of state-of-the-art point cloud deep networks on the SSM task, revealing their limited robustness to clinical challenges such as noisy, sparse, or incomplete input and limited training data. Point2SSM addresses these issues through an attention-based module, providing effective correspondence mappings from learned point features. Our results demonstrate that the proposed method significantly outperforms existing networks in terms of accurate surface sampling and correspondence, better capturing population-level statistics. The source code is provided at https://github.com/jadie1/Point2SSM.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=DqziS8DG4M",
    "arxiv_id": "2305.14486",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18282,
    "title": "End-to-End (Instance)-Image Goal Navigation through Correspondence as an Emergent Phenomenon",
    "authors": [
      "Guillaume Bono",
      "Leonid Antsfeld",
      "Boris Chidlovskii",
      "Philippe Weinzaepfel",
      "Christian Wolf"
    ],
    "abstract": "Most recent work in goal oriented visual navigation resorts to large-scale machine learning in simulated environments. The main challenge lies in learning compact representations generalizable to unseen environments and in learning high-capacity perception modules capable of reasoning on high-dimensional input. The latter is particularly difficult when the goal is not given as a category (\"ObjectNav\") but as an exemplar image (\"ImageNav\"), as the perception module needs to learn a comparison strategy requiring to solve an underlying visual correspondence problem. This has been shown to be difficult from reward alone or with standard auxiliary tasks. We address this problem through a sequence of two pretext tasks, which serve as a prior for what we argue is one of the main bottleneck in perception, extremely wide-baseline relative pose estimation and visibility prediction in complex scenes. The first pretext task, cross-view completion is a proxy for the underlying visual correspondence problem, while the second task addresses goal detection and finding directly. We propose a new dual encoder with a large-capacity binocular ViT  model and show that correspondence solutions naturally emerge from the training signals. Experiments show significant improvements and SOTA performance on the two benchmarks, ImageNav and the Instance-ImageNav variant, where camera intrinsics and height differ between observation and goal.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cphhnHjCvC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18281,
    "title": "Generalized Policy Iteration using Tensor Approximation for Hybrid Control",
    "authors": [
      "Suhan Shetty",
      "Teng Xue",
      "Sylvain Calinon"
    ],
    "abstract": "Control of dynamic systems involving hybrid actions is a challenging task in robotics.  To address this, we present a novel algorithm called Generalized Policy Iteration using Tensor Train (TTPI) that belongs to the class of Approximate Dynamic Programming (ADP). We use a low-rank tensor approximation technique called Tensor Train (TT) to approximate the state-value and advantage function which enables us to efficiently handle hybrid systems. We demonstrate the superiority of our approach over previous baselines for some benchmark problems with hybrid action spaces. Additionally, the robustness and generalization of the policy for hybrid systems are showcased through a real-world robotics experiment involving a non-prehensile manipulation task which is considered to be a highly challenging control problem.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=csukJcpYDe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19103,
    "title": "Invariance-based Learning of Latent Dynamics",
    "authors": [
      "Kai Lagemann",
      "Christian Lagemann",
      "Sach Mukherjee"
    ],
    "abstract": "We propose a new model class aimed at predicting dynamical trajectories from high-dimensional empirical data. This is done by combining variational autoencoders and spatio-temporal attention within a  framework designed to enforce certain scientifically-motivated invariances.The models allow inference of systembehaviour at any continuous time and generalization well beyond the data distributions seen during training.Furthermore, the models do not require anexplicit neural ODE formulation, making them efficient and highly scalable in practice.We study  behaviour through simple theoretical analyses and  extensive experiments on synthetic and real-world datasets. The latter investigate  the ability to predict the trajectories of  very complicated  systems based on finite data and show that the proposed approaches can outperform existing neural-dynamical models.We study also more general inductive bias in the context of transfer to data obtained under entirely novel system interventions. Overall, our results provide a new framework for efficiently learning complicated dynamics in a data-driven manner, with potential applications in a wide range of fields including physics, biology, and engineering.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EWTFMkTdkT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18278,
    "title": "Bounds on Representation-Induced Confounding Bias for Treatment Effect Estimation",
    "authors": [
      "Valentyn Melnychuk",
      "Dennis Frauen",
      "Stefan Feuerriegel"
    ],
    "abstract": "State-of-the-art methods for conditional average treatment effect (CATE) estimation make widespread use of representation learning. Here, the idea is to reduce the variance of the low-sample CATE estimation by a (potentially constrained) low-dimensional representation. However, low-dimensional representations can lose information about the observed confounders and thus lead to bias, because of which the validity of representation learning for CATE estimation is typically violated. In this paper, we propose a new, representation-agnostic framework for estimating bounds on the representation-induced confounding bias that comes from dimensionality reduction (or other constraints on the representations) in CATE estimation. First, we establish theoretically under which conditions CATEs are non-identifiable given low-dimensional (constrained) representations. Second, as our remedy, we propose to perform partial identification of CATEs or, equivalently, aim at estimating of upper and lower bounds of the representation-induced confounding bias. We demonstrate the effectiveness of our bounds in a series of experiments. In sum, our framework is of direct relevance in practice where the validity of CATE estimation is of importance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=d3xKPQVjSc",
    "arxiv_id": "2311.11321",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18276,
    "title": "Dynamic Layer Tying for Parameter-Efficient Transformers",
    "authors": [
      "Tamir David Hay",
      "Lior Wolf"
    ],
    "abstract": "In the pursuit of reducing the number of trainable parameters in deep transformer networks, we employ Reinforcement Learning to dynamically select layers during training and tie them together. Every few iterations, the RL agent is asked whether to train each layer $i$ independently or to copy the weights of a previous layer $j<i$. This facilitates weight sharing, reduces the number of trainable parameters, and also serves as an effective regularization technique. Experimental evaluations validate that our model modestly outperforms the baseline transformer model with regard to perplexity and drastically reduces the number of trainable parameters. In particular, the memory consumption during training is up to one order of magnitude less than the conventional training method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=d4uL2MSe0z",
    "arxiv_id": "2401.12819",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19077,
    "title": "Attention-based Iterative Decomposition for Tensor Product Representation",
    "authors": [
      "Taewon Park",
      "Inchul Choi",
      "Minho Lee"
    ],
    "abstract": "In recent research, Tensor Product Representation (TPR) is applied for the systematic generalization task of deep neural networks by learning the compositional structure of data. However,  such prior works show limited performance in discovering and representing the symbolic structure from unseen test data because of the incomplete bindings to the structural representations. In this work, we propose an Attention-based Iterative Decomposition (AID) module that can effectively improve the binding for the structured representations encoded from the sequential input features with TPR. Our AID can be easily adapted to any TPR-based model and provides enhanced systematic decomposition through a competitive attention mechanism between input features and structured representations. In our experiments, AID shows effectiveness by significantly improving the performance of TPR-based prior works on the series of systematic generalization tasks. Moreover, in the quantitative and qualitative evaluations, AID produces more compositional and well-bound structural representations than other works.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FDb2JQZsFH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18275,
    "title": "Spurious Feature Diversification Improves Out-of-distribution Generalization",
    "authors": [
      "LIN Yong",
      "Lu Tan",
      "Yifan HAO",
      "Ho Nam Wong",
      "Hanze Dong",
      "WEIZHONG ZHANG",
      "Yujiu Yang",
      "Tong Zhang"
    ],
    "abstract": "Generalization to out-of-distribution (OOD) data is a critical challenge in machine learning. Ensemble-based methods, like weight space ensembles that interpolate model parameters, have been shown to achieve superior OOD performance. However, the underlying mechanism for their effectiveness remains unclear. In this study, we closely examine WiSE-FT, a popular weight space ensemble method that interpolates between a pre-trained and a fine-tuned model. We observe an unexpected ``FalseFalseTrue\" phenomenon, in which WiSE-FT successfully corrects many cases where each individual model makes incorrect predictions, which contributes significantly to its OOD effectiveness. To gain further insights, we conduct theoretical analysis in a multi-class setting with a large number of spurious features. Our analysis predicts the above phenomenon and it further shows that ensemble-based models reduce prediction errors in the OOD settings by utilizing a more diverse set of spurious features. Contrary to the conventional wisdom that focuses on learning invariant features for better OOD performance, our findings suggest that incorporating a large number of diverse spurious features weakens their individual contributions, leading to improved overall OOD generalization performance. Empirically we demonstrate the effectiveness of utilizing diverse spurious features on a MultiColorMNIST dataset, and our experimental results are consistent with the theoretical analysis. Building upon the new theoretical insights into the efficacy of ensemble methods, we further identify an issue of WiSE-FT caused by the overconfidence of fine-tuned models in OOD situations. This overconfidence magnifies the fine-tuned model's incorrect prediction, leading to deteriorated OOD ensemble performance. To remedy this problem, we propose a novel method called BAlaNced averaGing (BANG) to mitigate the overconfidence problem, which significantly enhances the OOD performance of WiSE-FT.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=d6H4RBi7RH",
    "arxiv_id": "2309.17230",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19071,
    "title": "Bayesian Low-rank Adaptation for Large Language Models",
    "authors": [
      "Adam X. Yang",
      "Maxime Robeyns",
      "Xi Wang",
      "Laurence Aitchison"
    ],
    "abstract": "Parameter-efficient fine-tuning (PEFT) has emerged as a new paradigm for cost-efficient fine-tuning of large language models (LLMs), with low-rank adaptation (LoRA) being a widely adopted choice. However, fine-tuned LLMs often become overconfident especially when fine-tuned on small datasets. Bayesian methods, with their inherent ability to estimate uncertainty, serve as potent tools to mitigate overconfidence and enhance calibration. In this work, we introduce Laplace-LoRA, a straightforward yet effective Bayesian method, which applies the Laplace approximation to the LoRA parameters and, considerably boosts the calibration of fine-tuned LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FJiUyzOF1m",
    "arxiv_id": "2308.13111",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19066,
    "title": "A Symmetry-Aware Exploration of Bayesian Neural Network Posteriors",
    "authors": [
      "Olivier Laurent",
      "Emanuel Aldea",
      "Gianni Franchi"
    ],
    "abstract": "The distribution of the weights of modern deep neural networks (DNNs) - crucial for uncertainty quantification and robustness - is an eminently complex object due to its extremely high dimensionality. This paper proposes one of the first large-scale explorations of the posterior distribution of deep Bayesian Neural Networks (BNNs), expanding our study to real-world vision tasks and architectures. Specifically, we investigate the optimal approach for approximating the posterior, analyze the connection between posterior quality and uncertainty quantification, delve into the impact of modes on the posterior, and explore methods for visualizing the posterior. Moreover, we uncover weight-space symmetries as a critical aspect for understanding the posterior. To this extent, we develop an in-depth assessment of the impact of both permutation and scaling symmetries that tend to obfuscate the Bayesian posterior. While the first type of transformation is known for duplicating modes, we explore the relationship between the latter and L2 regularization, challenging previous misconceptions. Finally, to help the community improve our understanding of the Bayesian posterior, we will release the first large-scale checkpoint dataset, including thousands of real-world models, along with our codes, after the anonymity period.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FOSBQuXgAq",
    "arxiv_id": "2310.08287",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19065,
    "title": "ChatEval: Towards Better LLM-based Evaluators through Multi-Agent Debate",
    "authors": [
      "Chi-Min Chan",
      "Weize Chen",
      "Yusheng Su",
      "Jianxuan Yu",
      "Wei Xue",
      "Shanghang Zhang",
      "Jie Fu",
      "Zhiyuan Liu"
    ],
    "abstract": "Text evaluation has historically posed significant challenges, often demanding substantial labor and time cost. With the emergence of large language models (LLMs), researchers have explored LLMs' potential as alternatives for human evaluation. While these single-agent-based approaches show promise, experimental results suggest that further advancements are needed to bridge the gap between their current effectiveness and human-level evaluation quality.Recognizing that best practices of human evaluation processes often involve multiple human annotators collaborating in the evaluation, we resort to a multi-agent debate framework, moving beyond single-agent prompting strategies.In this paper, we construct a multi-agent referee team called $\\textbf{ChatEval}$ to autonomously discuss and evaluate the quality of different texts. Our experiments on two benchmarks illustrate that ChatEval delivers superior accuracy and correlation in alignment with human assessment. Furthermore, we find that the diverse role prompts (different personas) are essential in the multi-agent debate process; that is, utilizing the same role description in the prompts can lead to a degradation in performance. Our qualitative analysis also shows that ChatEval transcends mere textual scoring, offering a human-mimicking evaluation process for reliable assessments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FQepisCUWu",
    "arxiv_id": "2308.07201",
    "GitHub": [
      "https://github.com/chanchimin/ChatEval"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19060,
    "title": "Improving Non-Transferable Representation Learning by Harnessing Content and Style",
    "authors": [
      "Ziming Hong",
      "Zhenyi Wang",
      "Li Shen",
      "Yu Yao",
      "Zhuo Huang",
      "Shiming Chen",
      "Chuanwu Yang",
      "Mingming Gong",
      "Tongliang Liu"
    ],
    "abstract": "Non-transferable learning (NTL) aims to restrict the generalizability of models toward the target domain(s). To this end, existing works learn non-transferable representations by reducing statistical dependence between the source and target domain. However, such statistical methods essentially neglect to distinguish between *styles* and *contents*, leading them to inadvertently fit (i) spurious correlation between *styles* and *labels*, and (ii) fake independence between *contents* and *labels*. Consequently, their performance will be limited when natural distribution shifts occur or malicious intervention is imposed. In this paper, we propose a novel method (dubbed as H-NTL) to understand and advance the NTL problem by introducing a causal model to separately model *content* and *style* as two latent factors, based on which we disentangle and harness them as guidances for learning non-transferable representations with intrinsically causal relationships. Speci\ufb01cally, to avoid fitting spurious correlation and fake independence, we propose a variational inference framework to disentangle the naturally mixed *content factors* and *style factors* under our causal model. Subsequently, based on dual-path knowledge distillation, we harness the disentangled two *factors* as guidances for non-transferable representation learning: (i) we constraint the source domain representations to fit *content factors* (which are the intrinsic cause of *labels*), and (ii) we enforce that the target domain representations fit *style factors* which barely can predict labels. As a result, the learned feature representations follow optimal untransferability toward the target domain and minimal negative influence on the source domain, thus enabling better NTL performance. Empirically, the proposed H-NTL signi\ufb01cantly outperforms competing methods by a large margin.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=FYKVPOHCpE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19057,
    "title": "On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters",
    "authors": [
      "Matthias Lanzinger",
      "Pablo Barcelo"
    ],
    "abstract": "Seminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the $k$-dimensional Weisfeiler-Leman ($k$WL) test, a widely-recognized method for verifying graph isomorphism. This connection has reignited interest in comprehending the specific graph properties effectively distinguishable by the $k$WL test.A central focus of research in this field revolves around determining the least dimensionality $k$, for which $k$WL can discern graphs with different number of occurrences of a pattern graph $p$. We refer to such a least $k$ as the WL-dimension of this pattern counting problem. This inquiry traditionally delves into two distinct counting problems related to patterns: subgraph counting and induced subgraph counting. Intriguingly, despite their initial appearance as separate challenges with seemingly divergent approaches, both of these problems are interconnected components of a more comprehensive problem: \"graph motif parameters\". In this paper, we provide a precise characterization of the WL-dimension of labeled graph motif parameters. As specific instances of this result, we obtain characterizations of the WL-dimension of the subgraph counting and induced subgraph counting problem for every labeled pattern $p$. Particularly noteworthy is our resolution of a problem left open in previous work concerning induced copies.We additionally demonstrate that in cases where the $k$WL test distinguishes between graphs with varying occurrences of a pattern $p$, the exact number of occurrences of $p$ can be computed uniformly using only local information of the last layer of a corresponding GNN.We finally delve into the challenge of recognizing the WL-dimension of various graph parameters. We give a polynomial time algorithm for determining the WL-dimension of the subgraph counting problem for given pattern $p$, answering an open question from previous work.We additionally show how to utilize deep results from the field of graph motif parameters, together with our characterization, to determine the WL-dimension of induced subgraph counting and counting $k$-graphlets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FddFxi08J3",
    "arxiv_id": "2309.17053",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19049,
    "title": "Unified Language-Vision Pretraining in LLM with Dynamic Discrete Visual Tokenization",
    "authors": [
      "Yang Jin",
      "Kun Xu",
      "Kun Xu",
      "Liwei Chen",
      "Chao Liao",
      "Jianchao Tan",
      "Quzhe Huang",
      "Bin CHEN",
      "Chengru Song",
      "dai meng",
      "Di ZHANG",
      "Wenwu Ou",
      "Kun Gai",
      "Yadong MU"
    ],
    "abstract": "Recently, the remarkable advance of the Large Language Model (LLM) has inspired researchers to transfer its extraordinary reasoning capability to both vision and language data. However, the prevailing approaches primarily regard the visual input as a prompt and focus exclusively on optimizing the text generation process conditioned upon vision content by a frozen LLM. Such an inequitable treatment of vision and language heavily constrains the model's potential. In this paper, we break through this limitation by representing both vision and language in a unified form. Specifically, we introduce a well-designed visual tokenizer to translate the non-linguistic image into a sequence of discrete tokens like a foreign language that LLM can read. The resulting visual tokens encompass high-level semantics worthy of a word and also support dynamic sequence length varying from the image. Coped with this tokenizer, the presented foundation model called LaVIT can handle both image and text indiscriminately under the same generative learning paradigm. This unification empowers LaVIT to serve as an impressive generalist interface to understand and generate multi-modal content simultaneously. Extensive experiments further showcase that it outperforms the existing models by a large margin on massive vision-language tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FlvtjAB0gl",
    "arxiv_id": "2309.04669",
    "GitHub": [
      "https://github.com/jy0205/LaVIT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19044,
    "title": "AnimateDiff: Animate Your Personalized Text-to-Image Diffusion Models without Specific Tuning",
    "authors": [
      "Yuwei Guo",
      "Ceyuan Yang",
      "Anyi Rao",
      "Zhengyang Liang",
      "Yaohui Wang",
      "Yu Qiao",
      "Maneesh Agrawala",
      "Dahua Lin",
      "Bo Dai"
    ],
    "abstract": "With the advance of text-to-image (T2I) diffusion models (e.g., Stable Diffusion) and corresponding personalization techniques such as DreamBooth and LoRA, everyone can manifest their imagination into high-quality images at an affordable cost. However, adding motion dynamics to existing high-quality personalized T2Is and enabling them to generate animations remains an open challenge. In this paper, we present AnimateDiff, a practical framework for animating personalized T2I models without requiring model-specific tuning. At the core of our framework is a plug-and-play motion module that can be trained once and seamlessly integrated into any personalized T2Is originating from the same base T2I. Through our proposed training strategy, the motion module effectively learns transferable motion priors from real-world videos. Once trained, the motion module can be inserted into a personalized T2I model to form a personalized animation generator. We further propose MotionLoRA, a lightweight fine-tuning technique for AnimateDiff that enables a pre-trained motion module to adapt to new motion patterns, such as different shot types, at a low training and data collection cost. We evaluate AnimateDiff and MotionLoRA on several public representative personalized T2I models collected from the community. The results demonstrate that our approaches help these models generate temporally smooth animation clips while preserving the visual quality and motion diversity.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Fx2SbBgcte",
    "arxiv_id": "2307.04725",
    "GitHub": [
      "https://github.com/guoyww/AnimateDiff"
    ],
    "Space": [
      "guoyww/AnimateDiff"
    ],
    "Model": [
      "guoyww/animatediff"
    ],
    "Dataset": []
  },
  {
    "id": 19036,
    "title": "Grokking in Linear Estimators -- A Solvable Model that Groks without Understanding",
    "authors": [
      "Noam Itzhak Levi",
      "Alon Beck",
      "Yohai Bar-Sinai"
    ],
    "abstract": "Grokking is the intriguing phenomenon where a model learns to generalize long after it has fit the training data.     We show both analytically and numerically that grokking can surprisingly occur in linear networks performing linear tasks in a simple teacher-student setup. In this setting, the full training dynamics is derived in terms of the expected training and generalization data covariance matrix. We present exact predictions on how the grokking time depends on input and output dimensionality, train sample size, regularization, and network parameters initialization.    The key findings are that late generalization increase may not imply a transition from \"memorization\" to \"understanding\", but can simply be an artifact of the accuracy measure.    We provide empirical verification for these propositions, along with preliminary results indicating that some predictions also hold for deeper networks, with non-linear activations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GH2LYb9XV0",
    "arxiv_id": "2310.16441",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18274,
    "title": "Energy-guided Entropic Neural Optimal Transport",
    "authors": [
      "Petr Mokrov",
      "Alexander Korotin",
      "Alexander Kolesov",
      "Nikita Gushchin",
      "Evgeny Burnaev"
    ],
    "abstract": "Energy-based models (EBMs) are known in the Machine Learning community for decades. Since the seminal works devoted to EBMs dating back to the noughties, there have been a lot of efficient methods which solve the generative modelling problem by means of energy potentials (unnormalized likelihood functions). In contrast, the realm of Optimal Transport (OT) and, in particular, neural OT solvers is much less explored and limited by few recent works (excluding WGAN-based approaches which utilize OT as a loss function and do not model OT maps themselves). In our work, we bridge the gap between EBMs and Entropy-regularized OT. We present a novel methodology which allows utilizing the recent developments and technical improvements of the former in order to enrich the latter. From the theoretical perspective, we prove generalization bounds for our technique. In practice, we validate its applicability in toy 2D and image domains. To showcase the scalability, we empower our method with a pre-trained StyleGAN and apply it to high-res AFHQ $512\\times512$ unpaired I2I translation. For simplicity, we choose simple short- and long-run EBMs as a backbone of our Energy-guided Entropic OT approach, leaving the application of more sophisticated EBMs for future research. Our code is available at: https://github.com/PetrMokrov/Energy-guided-Entropic-OT",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=d6tUsZeVs7",
    "arxiv_id": "2304.06094",
    "GitHub": [
      "https://github.com/PetrMokrov/Energy-guided-Entropic-OT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18272,
    "title": "Tool-Augmented Reward Modeling",
    "authors": [
      "Lei Li",
      "Yekun Chai",
      "Shuohuan Wang",
      "Yu Sun",
      "Hao Tian",
      "Ningyu Zhang",
      "Hua Wu"
    ],
    "abstract": "Reward modeling (*a.k.a.*, preference modeling) is instrumental for aligning large language models with human preferences, particularly within the context of reinforcement learning from human feedback (RLHF). While conventional reward models (RMs) have exhibited remarkable scalability, they oft struggle with fundamental functionality such as arithmetic computation, code execution, and factual lookup. In this paper, we propose a tool-augmented preference modeling approach, named Themis, to address these limitations by empowering RMs with access to external environments, including calculators and search engines. This approach not only fosters synergy between tool utilization and reward grading but also enhances interpretive capacity and scoring reliability. Our study delves into the integration of external tools into RMs, enabling them to interact with diverse external sources and construct task-specific tool engagement and reasoning traces in an autoregressive manner. We validate our approach across a wide range of domains, incorporating seven distinct external tools. Our experimental results demonstrate a noteworthy overall improvement of 17.7% across eight tasks in preference ranking. Furthermore, our approach outperforms Gopher 280B by 7.3% on TruthfulQA task in zero-shot evaluation. In human evaluations, RLHF trained with Themis attains an average win rate of 32% when compared to baselines across four distinct tasks. Additionally, we provide a comprehensive collection of tool-related RM datasets, incorporating data from seven distinct tool APIs, totaling 15,000 instances. We have made the code, data, and model checkpoints publicly available to facilitate and inspire further research advancements (https://github.com/ernie-research/Tool-Augmented-Reward-Model).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=d94x0gWTUX",
    "arxiv_id": "2310.01045",
    "GitHub": [
      "https://github.com/ernie-research/Tool-Augmented-Reward-Model"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19025,
    "title": "Domain Randomization via Entropy Maximization",
    "authors": [
      "Gabriele Tiboni",
      "Pascal Klink",
      "Jan Peters",
      "Tatiana Tommasi",
      "Carlo D'Eramo",
      "Georgia Chalvatzaki"
    ],
    "abstract": "Varying dynamics parameters in simulation is a popular Domain Randomization (DR) approach for overcoming the reality gap in Reinforcement Learning (RL). Nevertheless, DR heavily hinges on the choice of the sampling distribution of the dynamics parameters, since high variability is crucial to regularize the agent's behavior but notoriously leads to overly conservative policies when randomizing excessively. In this paper, we propose a novel approach to address sim-to-real transfer, which automatically shapes dynamics distributions during training in simulation without requiring real-world data. We introduce DOmain RAndomization via Entropy MaximizatiON (DORAEMON), a constrained optimization problem that directly maximizes the entropy of the training distribution while retaining generalization capabilities. In achieving this, DORAEMON gradually increases the diversity of sampled dynamics parameters as long as the probability of success of the current policy is sufficiently high. We empirically validate the consistent benefits of DORAEMON in obtaining highly adaptive and generalizable policies, i.e., solving the task at hand across the widest range of dynamics parameters, as opposed to representative baselines from the DR literature. Notably, we also demonstrate the Sim2Real applicability of DORAEMON through its successful zero-shot transfer in a robotic manipulation setup under unknown real-world parameters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GXtmuiVrOM",
    "arxiv_id": "2311.01885",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18271,
    "title": "Learning to Reject with a Fixed Predictor: Application to Decontextualization",
    "authors": [
      "Christopher Mohri",
      "Daniel Andor",
      "Eunsol Choi",
      "Michael Collins",
      "Anqi Mao",
      "Yutao Zhong"
    ],
    "abstract": "We study the problem of classification with a reject option for a fixed predictor, crucial to natural language processing. We introduce a new problem formulation for this scenario, and an algorithm minimizing a new surrogate loss function. We provide a complete theoretical analysis of the surrogate loss function with a strong $H$-consistency guarantee. For evaluation, we choose the \\textit{decontextualization} task, and provide a manually-labelled dataset of $2\\mathord,000$ examples. Our algorithm significantly outperforms the baselines considered, with a $\\sim 25$% improvement in coverage when halving the error rate, which is only $\\sim 3$% away from the theoretical limit.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dCHbFDsCZz",
    "arxiv_id": "2301.09044",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18270,
    "title": "Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity",
    "authors": [
      "Runyu Zhang",
      "Yang Hu",
      "Na Li"
    ],
    "abstract": "Robust Markov Decision Processes (MDPs) and risk-sensitive MDPs are both powerful tools for making decisions in the presence of uncertainties. Previous efforts have aimed to establish their connections, revealing equivalences in specific formulations. This paper introduces a new formulation for risk-sensitive MDPs, which assesses risk in a slightly different manner compared to the classical Markov risk measure \\cite{ruszczynski2010risk}, and establishes its equivalence with a class of regularized robust MDP (RMDP) problems, including the standard RMDP as a special case. Leveraging this equivalence, we further derive the policy gradient theorem for both problems, proving gradient domination and global convergence of the exact policy gradient method under the tabular setting with direct parameterization. This forms a sharp contrast to the Markov risk measure, known to be potentially non-gradient-dominant \\cite{huang2021convergence}. We also propose a sample-based offline learning algorithm, namely the robust fitted-Z iteration (RFZI), for a specific regularized RMDP problem with a KL-divergence regularization term (or equivalently the risk-sensitive MDP with an entropy risk measure). We showcase its streamlined design and less stringent assumptions due to the equivalence and analyze its sample complexity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dEz3ge8QSo",
    "arxiv_id": "2306.11626",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18267,
    "title": "ToolLLM: Facilitating Large Language Models to Master 16000+ Real-world APIs",
    "authors": [
      "Yujia Qin",
      "Shihao Liang",
      "Yining Ye",
      "Kunlun Zhu",
      "Lan Yan",
      "Yaxi Lu",
      "Yankai Lin",
      "Xin Cong",
      "Xiangru Tang",
      "Bill Qian",
      "Sihan Zhao",
      "Lauren Hong",
      "Runchu Tian",
      "Ruobing Xie",
      "Jie Zhou",
      "Mark Gerstein",
      "dahai li",
      "Zhiyuan Liu",
      "Maosong Sun"
    ],
    "abstract": "Despite the advancements of open-source large language models (LLMs), e.g., LLaMA, they remain significantly limited in tool-use capabilities, i.e., using external tools (APIs) to fulfill human instructions. The reason is that current instruction tuning largely focuses on basic language tasks but ignores the tool-use domain. This is in contrast to the excellent tool-use capabilities of state-of-the-art (SOTA) closed-source LLMs, e.g., ChatGPT. To bridge this gap, we introduce ToolLLM, a general tool-use framework encompassing data construction, model training, and evaluation. We first present ToolBench, an instruction-tuning dataset for tool use, which is constructed automatically using ChatGPT. Specifically, the construction can be divided into three stages: (i) API collection: we collect 16,464 real-world RESTful APIs spanning 49 categories from RapidAPI Hub; (ii) instruction generation: we prompt ChatGPT to generate diverse instructions involving these APIs, covering both single-tool and multi-tool scenarios; (iii) solution path annotation: we use ChatGPT to search for a valid solution path (chain of API calls) for each instruction. To enhance the reasoning capabilities of LLMs, we develop a novel depth-first search-based decision tree algorithm. It enables LLMs to evaluate multiple reasoning traces and expand the search space. Moreover, to evaluate the tool-use capabilities of LLMs, we develop an automatic evaluator: ToolEval. Based on ToolBench, we fine-tune LLaMA to obtain an LLM ToolLLaMA, and equip it with a neural API retriever to recommend appropriate APIs for each instruction. Experiments show that ToolLLaMA demonstrates a remarkable ability to execute complex instructions and generalize to unseen APIs, and exhibits comparable performance to ChatGPT. Our ToolLLaMA also demonstrates strong zero-shot generalization ability in an out-of-distribution tool-use dataset: APIBench.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=dHng2O0Jjr",
    "arxiv_id": "2307.16789",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18266,
    "title": "Peering Through Preferences: Unraveling Feedback Acquisition for Aligning Large Language Models",
    "authors": [
      "Hritik Bansal",
      "John Dang",
      "Aditya Grover"
    ],
    "abstract": "Aligning large language models (LLMs) with human values and intents critically involves the use of human or AI feedback. While dense feedback annotations are expensive to acquire and integrate, sparse feedback presents a structural design choice between ratings (e.g., score Response A on a scale of 1-7) and rankings (e.g., is Response A better than Response B?). In this work, we analyze the effect of this design choice for the alignment and evaluation of LLMs. We uncover an inconsistency problem wherein the preferences inferred from ratings and rankings significantly disagree 60% for both human and AI annotators. Our subsequent analysis identifies various facets of annotator biases that explain this phenomena such as human annotators would rate denser responses higher while preferring accuracy during pairwise judgments, for a particular comparison instance. To our surprise, we observe that the choice of feedback protocol has a significant effect on the evaluation of aligned LLMs. In particular, we find that LLMs that leverage rankings data for alignment (say model X) are preferred over those that leverage ratings data (say model Y), with a rank-based evaluation protocol (is X/Y's response better than reference response?) but not with a rating-based evaluation protocol (score Rank X/Y's response on a scale of 1-7). Our findings thus shed light on critical gaps in methods for evaluating the real-world utility of language models and their strong dependence on the feedback protocol used for alignment.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dKl6lMwbCy",
    "arxiv_id": "2308.15812",
    "GitHub": [
      "https://github.com/Hritikbansal/sparse_feedback"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18265,
    "title": "Prompt Learning with Quaternion Networks",
    "authors": [
      "Boya Shi",
      "Zhengqin Xu",
      "Shuai Jia",
      "Chao Ma"
    ],
    "abstract": "Multimodal pre-trained models have shown impressive potential in enhancing performance on downstream tasks. However, existing fusion strategies for modalities primarily rely on explicit interaction structures that fail to capture the diverse aspects and patterns inherent in input data. This yields limited performance in zero-shot contexts, especially when fine-grained classifications and abstract interpretations are required. To address this, we propose an effective approach, namely Prompt Learning with Quaternion Networks (QNet), for semantic alignment across diverse modalities. QNet employs a quaternion hidden space where the mutually orthogonal imaginary axes capture rich intermodal semantic spatial correlations from various perspectives. Hierarchical features across multilayers are utilized to encode intricate interdependencies within various modalities with reduced parameters. Our experiments on 11 datasets demonstrate that QNet outperforms state-of-the-art prompt learning techniques in base-to-novel generalization, cross-dataset transfer, and domain transfer scenarios with fewer learnable parameters. Our code and models will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dKlxDx2SoS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19007,
    "title": "Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization",
    "authors": [
      "Mohammad Pedramfar",
      "Yididiya Y. Nadew",
      "Christopher John Quinn",
      "Vaneet Aggarwal"
    ],
    "abstract": "This paper introduces unified projection-free Frank-Wolfe type algorithms for adversarial continuous DR-submodular optimization, spanning scenarios such as full information and (semi-)bandit feedback, monotone and non-monotone functions, different constraints, and types of stochastic queries. For every problem considered in the non-monotone setting, the proposed algorithms are either the first with proven sub-linear $\\alpha$-regret bounds or have better $\\alpha$-regret bounds than the state of the art, where $\\alpha$ is a corresponding approximation bound in the offline setting. In the monotone setting, the proposed approach gives state-of-the-art sub-linear $\\alpha$-regret bounds among projection-free algorithms in 7 of the 8 considered cases while matching the result of the remaining case. Additionally, this paper addresses semi-bandit and bandit feedback for adversarial DR-submodular optimization, advancing the understanding of this optimization area.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=H4A9e8HvIn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18264,
    "title": "Robustness of AI-Image Detectors: Fundamental Limits and Practical Attacks",
    "authors": [
      "Mehrdad Saberi",
      "Vinu Sankar Sadasivan",
      "Keivan Rezaei",
      "Aounon Kumar",
      "Atoosa Chegini",
      "Wenxiao Wang",
      "Soheil Feizi"
    ],
    "abstract": "In light of recent advancements in generative AI models, it has become essential to distinguish genuine content from AI-generated one to prevent the malicious usage of fake materials as authentic ones and vice versa. Various techniques have been introduced for identifying AI-generated images, with watermarking emerging as a promising approach. In this paper, we analyze the robustness of various AI-image detectors including watermarking and classifier-based deepfake detectors. For watermarking methods that introduce subtle image perturbations (i.e., low perturbation budget methods), we reveal a fundamental trade-off between the evasion error rate (i.e., the fraction of watermarked images detected as non-watermarked ones) and the spoofing error rate (i.e., the fraction of non-watermarked images detected as watermarked ones) upon an application of a diffusion purification attack. In this regime, we also empirically show that diffusion purification effectively removes watermarks with minimal changes to images. For high perturbation watermarking methods where notable changes are applied to images, the diffusion purification attack is not effective. In this case, we develop a model substitution adversarial attack that can successfully remove watermarks. Moreover, we show that watermarking methods are vulnerable to spoofing attacks where the attacker aims to have real images (potentially obscene) identified as watermarked ones, damaging the reputation of the developers. In particular, by just having black-box access to the watermarking method, we show that one can generate a watermarked noise image which can be added to the real images to have them falsely flagged as watermarked ones. Finally, we extend our theory to characterize a fundamental trade-off between the robustness and reliability of classifier-based deep fake detectors and demonstrate it through experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dLoAdIKENc",
    "arxiv_id": "2310.00076",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19005,
    "title": "Discovering modular solutions that generalize compositionally",
    "authors": [
      "Simon Schug",
      "Seijin Kobayashi",
      "Yassir Akram",
      "Maciej Wolczyk",
      "Alexandra Maria Proca",
      "Johannes Von Oswald",
      "Razvan Pascanu",
      "Joao Sacramento",
      "Angelika Steger"
    ],
    "abstract": "The complexity of many tasks and environments can often be decomposed into simpler, independent modules.Discovering underlying compositional structure has the potential to expedite adaptation and enable _compositional generalization_.Despite progress, our most powerful systems struggle to compose flexibly.While most of these systems are monolithic, modularity promises to allow capturing the compositional nature of many tasks.However, it is unclear under which circumstances modular systems discover this hidden compositional structure.To shed light on this question, we study a teacher-student setting with a modular teacher where we have full control over the composition of ground truth modules.This allows us to relate the problem of compositional generalization to that of identification of the underlying modules.We show theoretically that identification up to linear transformation purely from demonstrations is possible in hypernetworks without having to learn an exponential number of module combinations.While our theory assumes the infinite data limit, in an extensive empirical study we demonstrate how meta-learning from finite data can discover modular solutions that generalize compositionally in modular but not monolithic architectures.We further show that our insights translate outside the teacher-student setting and demonstrate how modularity implemented by hypernetworks allows discovering compositional behavior policies and action-value functions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=H98CVcX1eh",
    "arxiv_id": "2312.15001",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19004,
    "title": "Lewis's Signaling Game as beta-VAE For Natural Word Lengths and Segments",
    "authors": [
      "Ryo Ueda",
      "Tadahiro Taniguchi"
    ],
    "abstract": "As a sub-discipline of evolutionary and computational linguistics, emergent communication (EC) studies communication protocols, called emergent languages, arising in simulations where agents communicate. A key goal of EC is to give rise to languages that share statistical properties with natural languages. In this paper, we reinterpret Lewis's signaling game, a frequently used setting in EC, as beta-VAE and reformulate its objective function as ELBO. Consequently, we clarify the existence of prior distributions of emergent languages and show that the choice of the priors can influence their statistical properties. Specifically, we address the properties of word lengths and segmentation, known as Zipf's law of abbreviation (ZLA) and Harris's articulation scheme (HAS), respectively. It has been reported that the emergent languages do not follow them when using the conventional objective. We experimentally demonstrate that by selecting an appropriate prior distribution, more natural segments emerge, while suggesting that the conventional one prevents the languages from following ZLA and HAS.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HC0msxE3sf",
    "arxiv_id": "2311.04453",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18261,
    "title": "Dual-Encoders for Extreme Multi-label Classification",
    "authors": [
      "Nilesh Gupta",
      "Fnu Devvrit",
      "Ankit Singh Rawat",
      "Srinadh Bhojanapalli",
      "Prateek Jain",
      "Inderjit S Dhillon"
    ],
    "abstract": "Dual-encoder models have demonstrated significant success in dense retrieval tasks for open-domain question answering that mostly involves zero-shot and few-shot scenarios. However, their performance in many-shot retrieval problems where training data is abundant, such as extreme multi-label classification (XMC), remains under-explored. Existing empirical evidence suggests that, for such problems, the dual-encoder method's accuracies lag behind the performance of state-of-the-art (SOTA) extreme classification methods that grow the number of learnable parameters linearly with the number of classes. As a result, some recent extreme classification techniques use a combination of dual-encoders and a learnable classification head for each class to excel on these tasks. In this paper, we investigate the potential of \"pure\" DE models in XMC tasks. Our findings reveal that when trained correctly standard dual-encoders can match or outperform SOTA extreme classification methods by up to 2% at Precision@1 even on the largest XMC datasets while being 20x smaller in terms of the number of trainable parameters. We further propose a differentiable topk error-based loss function, which can be used to specifically optimize for Recall@k metrics. We include our PyTorch implementation along with other resources for reproducing the results in the supplementary material.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dNe1T0Ahby",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18260,
    "title": "Closing the Curious Case of Neural Text Degeneration",
    "authors": [
      "Matthew Finlayson",
      "John Hewitt",
      "Alexander Koller",
      "Swabha Swayamdipta",
      "Ashish Sabharwal"
    ],
    "abstract": "Despite their ubiquity in language generation, it remains unknown why truncation sampling heuristics like nucleus sampling are so effective. We provide a theoretical explanation for the effectiveness of the truncation sampling by proving that truncation methods that discard tokens below some probability threshold (the most common type of truncation) can guarantee that all sampled tokens have nonzero true probability. However, thresholds are a coarse heuristic, and necessarily discard some tokens with nonzero true probability as well. In pursuit of a more precise sampling strategy, we show that we can leverage a known source of model errors, the softmax bottleneck, to prove that certain tokens have nonzero true probability, without relying on a threshold. Based on our findings, we develop an experimental truncation strategy and the present pilot studies demonstrating the promise of this type of algorithm. Our evaluations show that our method outperforms its threshold-based counterparts under automatic and human evaluation metrics for low-entropy (i.e., close to greedy) open-ended text generation. Our theoretical findings and pilot experiments provide both insight into why truncation sampling works, and make progress toward more expressive sampling algorithms that better surface the generative capabilities of large language models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dONpC9GL1o",
    "arxiv_id": "2310.01693",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18259,
    "title": "Fast, Expressive $\\mathrm{SE}(n)$ Equivariant Networks through Weight-Sharing in Position-Orientation Space",
    "authors": [
      "Erik J Bekkers",
      "Sharvaree Vadgama",
      "Rob Hesselink",
      "Putri A Van der Linden",
      "David W. Romero"
    ],
    "abstract": "Based on the theory of homogeneous spaces we derive geometrically optimal edge attributes to be used within the flexible message passing framework. We formalize the notion of weight sharing in convolutional networks as the sharing of message functions over point-pairs that should be treated equally. We define equivalence classes of point-pairs that are identical up to a transformation in the group and derive attributes that uniquely identify these classes. Weight sharing is then obtained by conditioning message functions on these attributes. As an application of the theory, we develop an efficient equivariant group convolutional network for processing 3D point clouds. The theory of homogeneous spaces tells us how to do group convolutions with feature maps over the homogeneous space of positions $\\mathbb{R}^3$, position and orientations $\\mathbb{R}^3 {\\times} S^2$, and the group $\\mathrm{SE}(3)$ itself. Among these, $\\mathbb{R}^3 {\\times} S^2$ is an optimal choice due to the ability to represent directional information, which $\\mathbb{R}^3$ methods cannot, and it significantly enhances computational efficiency compared to indexing features on the full $\\mathrm{SE}(3)$ group. We empirically support this claim by reaching state-of-the-art results --in accuracy and speed-- on three different benchmarks: interatomic potential energy prediction, trajectory forecasting in N-body systems, and generating molecules via equivariant diffusion models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dPHLbUqGbr",
    "arxiv_id": "2310.02970",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19001,
    "title": "Temporal Generalization Estimation in Evolving Graphs",
    "authors": [
      "Bin Lu",
      "Tingyan Ma",
      "Xiaoying Gan",
      "Xinbing Wang",
      "Yunqiang Zhu",
      "Chenghu Zhou",
      "Shiyu Liang"
    ],
    "abstract": "Graph Neural Networks (GNNs) are widely deployed in vast fields, but they often struggle to maintain accurate representations as graphs evolve. We theoretically establish a lower bound, proving that under mild conditions, representation distortion inevitably occurs over time. To estimate the temporal distortion without human annotation after deployment, one naive approach is to pre-train a recurrent model (e.g., RNN) before deployment and use this model afterwards, but the estimation is far from satisfactory. In this paper, we analyze the representation distortion from an information theory perspective, and attribute it primarily to inaccurate feature extraction during evolution. Consequently, we introduce Smart, a straightforward and effective baseline enhanced by an adaptive feature extractor through self-supervised graph reconstruction. In synthetic random graphs, we further refine the former lower bound to show the inevitable distortion over time and empirically observe that Smart achieves good estimation performance. Moreover, we observe that Smart consistently shows outstanding generalization estimation on four real-world evolving graphs. The ablation studies underscore the necessity of graph reconstruction. For example, on OGB-arXiv dataset, the estimation metric MAPE deteriorates from 2.19% to 8.00% without reconstruction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HFtrXBfNru",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18258,
    "title": "Efficient Video Diffusion Models via Content-Frame Motion-Latent Decomposition",
    "authors": [
      "Sihyun Yu",
      "Weili Nie",
      "De-An Huang",
      "Boyi Li",
      "Jinwoo Shin",
      "Anima Anandkumar"
    ],
    "abstract": "Video diffusion models have recently made great progress in generation quality, but are still limited by the high memory and computational requirements. This is because current video diffusion models often attempt to process high-dimensional videos directly. To tackle this issue, we propose content-motion latent diffusion model (CMD), a novel efficient extension of pretrained image diffusion models for video generation. Specifically, we propose an autoencoder that succinctly encodes a video as a combination of a content frame (like an image) and a low-dimensional motion latent representation. The former represents the common content, and the latter represents the underlying motion in the video, respectively. We generate the content frame by fine-tuning a pretrained image diffusion model, and we generate the motion latent representation by training a new lightweight diffusion model. A key innovation here is the design of a compact latent space that can directly utilizes a pretrained image diffusion model, which has not been done in previous latent video diffusion models. This leads to considerably better quality generation and reduced computational costs. For instance, CMD can sample a video 7.7$\\times$ faster than prior approaches by generating a video of 512$\\times$1024 resolution and length 16 in 3.1 seconds. Moreover, CMD achieves an FVD score of 212.7 on WebVid-10M, 27.3% better than the previous state-of-the-art of 292.4.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dQVtTdsvZH",
    "arxiv_id": "2403.14148",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18257,
    "title": "Neural Polynomial Gabor Fields for Macro Motion Analysis",
    "authors": [
      "Chen Geng",
      "Hong-Xing Yu",
      "Sida Peng",
      "Xiaowei Zhou",
      "Jiajun Wu"
    ],
    "abstract": "We study macro motion analysis, where macro motion refers to the collection of all visually observable motions in a dynamic scene. Traditional filtering-based methods on motion analysis typically focus only on local and tiny motions, yet fail to represent large motions or 3D scenes. Recent dynamic neural representations can faithfully represent motions using correspondences, but they cannot be directly used for motion analysis. In this work, we propose Phase-based neural polynomial Gabor fields (Phase-PGF), which learns to represent scene dynamics with low-dimensional time-varying phases. We theoretically show that Phase-PGF has several properties suitable for macro motion analysis. In our experiments, we collect diverse 2D and 3D dynamic scenes and show that Phase-PGF enables dynamic scene analysis and editing tasks including motion loop detection, motion factorization, motion smoothing, and motion magnification.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dTlKCQuuxP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18255,
    "title": "Generative Human Motion Stylization in Latent Space",
    "authors": [
      "chuan guo",
      "Yuxuan Mu",
      "Xinxin Zuo",
      "Peng Dai",
      "Youliang Yan",
      "Juwei Lu",
      "Li Cheng"
    ],
    "abstract": "Human motion stylization aims to revise the style of an input motion while keeping its content unaltered. Unlike existing works that operate directly in pose space, we leverage the \\textit{latent space} of pretrained autoencoders as a more expressive and robust representation for motion extraction and infusion. Building upon this, we present a novel \\textit{generative} model that produces diverse stylization results of a single motion (latent) code. During training, a motion code is decomposed into two coding components: a deterministic content code, and a probabilistic style code adhering to a prior distribution; then a generator massages the random combination of content and style codes to reconstruct the corresponding motion codes. Our approach is versatile, allowing the learning of probabilistic style space from either style labeled or unlabeled motions, providing notable flexibility in stylization as well. In inference, users can opt to stylize a motion using style cues from a reference motion or a label. Even in the absence of explicit style input, our model facilitates novel re-stylization by sampling from the unconditional style prior distribution. Experimental results show that our proposed stylization models, despite their lightweight design, outperform the state-of-the-arts in style reeanactment, content preservation, and generalization across various applications and settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=daEqXJ0yZo",
    "arxiv_id": "2401.13505",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18253,
    "title": "Reward Model Ensembles Help Mitigate Overoptimization",
    "authors": [
      "Thomas Coste",
      "Usman Anwar",
      "Robert Kirk",
      "David Krueger"
    ],
    "abstract": "Reinforcement learning from human feedback (RLHF) is a standard approach for fine-tuning large language models to follow instructions. As part of this process, learned reward models are used to approximately model human preferences. However, as imperfect representations of the \u201ctrue\u201d reward, these learned reward models are susceptible to overoptimization. Gao et al. (2023) studied this phenomenon in a synthetic human feedback setup with a significantly larger \u201cgold\u201d reward model acting as the true reward (instead of humans) and showed that overoptimization remains a persistent problem regardless of the size of the proxy reward model and training data used. Using a similar setup, we conduct a systematic study to evaluate the efficacy of using ensemble-based conservative optimization objectives, specifically worst-case optimization (WCO) and uncertainty-weighted optimization (UWO), for mitigating reward model overoptimization when using two optimization methods: (a) best-of-n sampling (BoN) (b) proximal policy optimization (PPO). We additionally extend the setup of Gao et al. (2023) to include 25% label noise to better mirror real-world conditions. Both with and without label noise we find that conservative optimization practically eliminates overoptimization and improves performance by up to 70% for BoN sampling. For PPO, ensemble-based conservative optimization always reduces overoptimization and outperforms single reward model optimization. Moreover, combining it with a small KL penalty successfully prevents overoptimization at no performance cost. Overall, our results demonstrate that ensemble-based conservative optimization can effectively counter overoptimization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dcjtMYkpXx",
    "arxiv_id": "2310.02743",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18252,
    "title": "Relaxing the Additivity Constraints in Decentralized No-Regret High-Dimensional Bayesian Optimization",
    "authors": [
      "Anthony Bardou",
      "Patrick Thiran",
      "Thomas Begin"
    ],
    "abstract": "Bayesian Optimization (BO) is typically used to optimize an unknown function $f$ that is noisy and costly to evaluate, by exploiting an acquisition function that must be maximized at each optimization step. Even if provably asymptotically optimal BO algorithms are efficient at optimizing low-dimensional functions, scaling them to high-dimensional spaces remains an open problem, often tackled by assuming an additive structure for $f$. By doing so, BO algorithms typically introduce additional restrictive assumptions on the additive structure that reduce their applicability domain. This paper contains two main contributions: (i) we relax the restrictive assumptions on the additive structure of $f$, at the expense of weakening the maximization guarantees of the acquisition function, and (ii) we address the over-exploration problem for decentralized BO algorithms. To these ends, we propose DumBO, an asymptotically optimal decentralized BO algorithm that achieves very competitive performance against state-of-the-art BO algorithms, especially when the additive structure of $f$ comprises high-dimensional factors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=de1218PoEl",
    "arxiv_id": "2305.19838",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18251,
    "title": "Decoding Natural Images from EEG for Object Recognition",
    "authors": [
      "Yonghao Song",
      "Bingchuan Liu",
      "Xiang Li",
      "Nanlin Shi",
      "Yijun Wang",
      "Xiaorong Gao"
    ],
    "abstract": "Electroencephalography (EEG) signals, known for the convenient non-invasive acquisition but low signal-to-noise, have recently gained substantial attention due to the potential to decode natural images. This paper presents a self-supervised framework to demonstrate the feasibility of learning image representations from EEG signals, particularly for object recognition. The framework utilizes image and EEG encoders to extract features from paired image stimuli and EEG responses. Contrastive learning aligns these two modalities by constraining their similarity. With the framework, we attain significantly above-chance results on a comprehensive EEG-image dataset, achieving a top-1 accuracy of 15.6% and a top-5 accuracy of 42.8% in challenging 200-way zero-shot tasks. Moreover, we perform extensive experiments to explore the biological plausibility by resolving the temporal, spatial, spectral, and semantic aspects of EEG signals. Besides, we introduce attention modules to capture spatial correlations, providing implicit evidence of the brain activity perceived from EEG data. These findings yield valuable insights for neural decoding and brain-computer interfaces in real-world scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dhLIno8FmH",
    "arxiv_id": "2308.13234",
    "GitHub": [
      "https://github.com/eeyhsong/NICE-EEG"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18250,
    "title": "SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesis",
    "authors": [
      "Dustin Podell",
      "Zion English",
      "Kyle Lacey",
      "Andreas Blattmann",
      "Tim Dockhorn",
      "Jonas M\u00fcller",
      "Joe Penna",
      "Robin Rombach"
    ],
    "abstract": "We present Stable Diffusion XL (SDXL), a latent diffusion model for text-to-image synthesis. Compared to previous versions of Stable Diffusion, SDXL leverages a three times larger UNet backbone, achieved by significantly increasing the number of attention blocks and including a second text encoder. Further, we design multiple novel conditioning schemes and train SDXL on multiple aspect ratios. To ensure highest quality results, we also introduce a refinement model which is used to improve the visual fidelity of samples generated by SDXL using a post-hoc image-to-image technique. We demonstrate that SDXL improves dramatically over previous versions of Stable Diffusion and achieves results competitive with those of black-box state-of-the-art image generators such as Midjourney.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=di52zR8xgf",
    "arxiv_id": "2307.01952",
    "GitHub": [
      "https://github.com/Stability-AI/generative-models"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18248,
    "title": "Retro-fallback: retrosynthetic planning in an uncertain world",
    "authors": [
      "Austin Tripp",
      "Krzysztof Maziarz",
      "Sarah Lewis",
      "Marwin Segler",
      "Jos\u00e9 Miguel Hern\u00e1ndez-Lobato"
    ],
    "abstract": "Retrosynthesis is the task of proposing a series of chemical reactions to create a desired molecule from simpler, buyable molecules. While previous works have proposed algorithms to find optimal solutions for a range of metrics (e.g. shortest, lowest-cost), these works generally overlook the fact that we have imperfect knowledge of the space of possible reactions, meaning plans created by the algorithm may not work in a laboratory. In this paper we propose a novel formulation of retrosynthesis in terms of stochastic processes to account for this uncertainty. We then propose a novel greedy algorithm called retro-fallback which maximizes the probability that at least one synthesis plan can be executed in the lab. Using in-silico benchmarks we demonstrate that retro-fallback generally produces better sets of synthesis plans than the popular MCTS and retro* algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dl0u4ODCuW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18247,
    "title": "Noise-free Score Distillation",
    "authors": [
      "Oren Katzir",
      "Or Patashnik",
      "Daniel Cohen-Or",
      "Dani Lischinski"
    ],
    "abstract": "Score Distillation Sampling (SDS) has emerged as the de facto approach for text-to-content generation in non-image domains. In this paper, we reexamine the SDS process and introduce a straightforward interpretation that demystifies the necessity for large Classifier-Free Guidance (CFG) scales, rooted in the distillation of an undesired noise term. Building upon our interpretation, we propose a novel Noise-Free Score Distillation (NFSD) process, which requires minimal modifications to the original SDS framework. Through this streamlined design, we achieve more effective distillation of pre-trained text-to-image diffusion models while using a nominal CFG scale. This strategic choice allows us to prevent the over-smoothing of results, ensuring that the generated data is both realistic and complies with the desired prompt. To demonstrate the efficacy of NFSD, we provide qualitative examples that compare NFSD and SDS, as well as several other methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dlIMcmlAdk",
    "arxiv_id": "2310.17590",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18246,
    "title": "Towards Optimal Feature-Shaping Methods for Out-of-Distribution Detection",
    "authors": [
      "Qinyu Zhao",
      "Ming Xu",
      "Kartik Gupta",
      "Akshay Asthana",
      "Liang Zheng",
      "Stephen Gould"
    ],
    "abstract": "Feature shaping refers to a family of methods that exhibit state-of-the-art performance for out-of-distribution (OOD) detection. These approaches manipulate the feature representation, typically from the penultimate layer of a pre-trained deep learning model, so as to better differentiate between in-distribution (ID) and OOD samples. However, existing feature-shaping methods usually employ rules manually designed for specific model architectures and OOD datasets, which consequently limit their generalization ability. To address this gap, we first formulate an abstract optimization framework for studying feature-shaping methods. We then propose a concrete reduction of the framework with a simple piecewise constant shaping function and show that existing feature-shaping methods approximate the optimal solution to the concrete optimization problem. Further, assuming that OOD data is inaccessible, we propose a formulation that yields a closed-form solution for the piecewise constant shaping function, utilizing solely the ID data. Through extensive experiments, we show that the feature-shaping function optimized by our method improves the generalization ability of OOD detection across a large variety of datasets and model architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dm8e7gsH0d",
    "arxiv_id": "2402.00865",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18245,
    "title": "SemiReward: A General Reward Model for Semi-supervised Learning",
    "authors": [
      "Siyuan Li",
      "Weiyang Jin",
      "Zedong Wang",
      "Fang Wu",
      "Zicheng Liu",
      "Cheng Tan",
      "Stan Z. Li"
    ],
    "abstract": "Semi-supervised learning (SSL) has witnessed great progress with various improvements in the self-training framework with pseudo labeling. The main challenge is how to distinguish high-quality pseudo labels against the confirmation bias. However, existing pseudo-label selection strategies are limited to pre-defined schemes or complex hand-crafted policies specially designed for classification, failing to achieve high-quality labels, fast convergence, and task versatility simultaneously. To these ends, we propose a Semi-supervised Reward framework (SemiReward) that predicts reward scores to evaluate and filter out high-quality pseudo labels, which is pluggable to mainstream SSL methods in wide task types and scenarios. To mitigate confirmation bias, SemiReward is trained online in two stages with a generator model and subsampling strategy. With classification and regression tasks on 13 standard SSL benchmarks of three modalities, extensive experiments verify that SemiReward achieves significant performance gains and faster convergence speeds upon Pseudo Label, FlexMatch, and Free/SoftMatch.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dnqPvUjyRI",
    "arxiv_id": "2310.03013",
    "GitHub": [
      "https://github.com/Westlake-AI/SemiReward"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18244,
    "title": "Periodicity Decoupling Framework for Long-term Series Forecasting",
    "authors": [
      "Tao Dai",
      "Beiliang Wu",
      "Peiyuan Liu",
      "Naiqi Li",
      "Jigang Bao",
      "Yong Jiang",
      "Shu-Tao Xia"
    ],
    "abstract": "Convolutional neural network (CNN)-based and Transformer-based methods have recently made significant strides in time series forecasting, which excel at modeling local temporal variations or capturing long-term dependencies. However, real-world time series usually contain intricate temporal patterns, thus making it challenging for existing methods that mainly focus on temporal variations modeling from the 1D time series directly. Based on the intrinsic periodicity of time series, we propose a novel Periodicity Decoupling Framework (PDF) to capture 2D temporal variations of decoupled series for long-term series forecasting. Our PDF mainly consists of three components: multi-periodic decoupling block (MDB), dual variations modeling block (DVMB), and variations aggregation block (VAB). Unlike the previous methods that model 1D temporal variations, our PDF mainly models 2D temporal variations, decoupled from 1D time series by MDB. After that, DVMB attempts to further capture short-term and long-term variations, followed by VAB to make final predictions. Extensive experimental results across seven real-world long-term time series datasets demonstrate the superiority of our method over other state-of-the-art methods, in terms of both forecasting performance and computational efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dp27P5HBBt",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18243,
    "title": "Minimum width for universal approximation using ReLU networks on compact domain",
    "authors": [
      "Namjun Kim",
      "Chanho Min",
      "Sejun Park"
    ],
    "abstract": "It has been shown that deep neural networks of a large enough width are universal approximators but they are not if the width is too small.There were several attempts to characterize the minimum width $w_{\\min}$ enabling the universal approximation property; however, only a few of them found the exact values.In this work, we show that the minimum width for universal approximation of $L^p$ functions from $[0,1]^{d_x}$ to $\\mathbb R^{d_y}$ is exactly $\\max\\\\{d_x,d_y,2\\\\}$ if an activation function is ReLU-Like (e.g., ReLU, GELU,  Softplus).Compared to the known result for ReLU networks, $w_{\\min}=\\max\\\\{d_x+1,d_y\\\\}$ when the domain is ${\\mathbb R^{d_x}}$, our result first shows that approximation on a compact domain requires smaller width than on ${\\mathbb R^{d_x}}$.We next prove a lower bound on $w_{\\min}$ for uniform approximation using general activation functions including ReLU: $w_{\\min}\\ge d_y+1$ if $d_x<d_y\\le2d_x$. Together with our first result, this shows a dichotomy between $L^p$ and uniform approximations for general activation functions and input/output dimensions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dpDw5U04SU",
    "arxiv_id": "2309.10402",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18241,
    "title": "Teaching Arithmetic to Small Transformers",
    "authors": [
      "Nayoung Lee",
      "Kartik Sreenivasan",
      "Jason D. Lee",
      "Kangwook Lee",
      "Dimitris Papailiopoulos"
    ],
    "abstract": "Large language models like GPT-4 exhibit emergent capabilities across general-purpose tasks, such as basic arithmetic, when trained on extensive text data, even though these tasks are not explicitly encoded by the unsupervised, next-token prediction objective. This study investigates how even small transformers, trained from random initialization, can efficiently learn arithmetic operations such as addition, multiplication, and elementary functions like square root, using the next-token prediction objective. We first demonstrate that conventional training data is not the most effective for arithmetic learning, and simple formatting changes can significantly improve accuracy. This leads to sharp phase transitions as a function of training data scale, which, in some cases, can be explained through connections to low-rank matrix completion. Building on prior work, we then train on chain-of-thought style data that includes intermediate step results. Even in the complete absence of pretraining, this approach significantly and simultaneously improves accuracy, sample complexity, and convergence speed. We also study the interplay between arithmetic and text data during training and examine the effects of few-shot prompting, pretraining, and parameter scaling. Additionally, we discuss the challenges associated with length generalization. Our work highlights the importance of high-quality, instructive data that considers the particular characteristics of the next-word prediction loss for rapidly eliciting arithmetic capabilities.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dsUB4bst9S",
    "arxiv_id": "2307.03381",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18958,
    "title": "DP-OPT: Make Large Language Model Your Privacy-Preserving Prompt Engineer",
    "authors": [
      "Junyuan Hong",
      "Jiachen T. Wang",
      "Chenhui Zhang",
      "Zhangheng LI",
      "Bo Li",
      "Zhangyang Wang"
    ],
    "abstract": "Large Language Models (LLMs) have emerged as dominant tools for various tasks, particularly when tailored for a specific target by prompt tuning. Nevertheless, concerns surrounding data privacy present obstacles due to the tuned prompts' dependency on sensitive private information. A practical solution is to host a local LLM and optimize a soft prompt privately using data. Yet, hosting a local model becomes problematic when model ownership is protected. Alternative methods, like sending data to the model's provider for training, intensify these privacy issues facing an untrusted provider. In this paper, we present a novel solution called Differentially-Private Offsite Prompt Tuning (DP-OPT) to address this challenge. Our approach involves tuning a discrete prompt on the client side and then applying it to the desired cloud models. We demonstrate that prompts suggested by LLMs themselves can be transferred without compromising performance significantly. To ensure that the prompts do not leak private information, we introduce the first private prompt generation mechanism, by a differentially-private (DP) ensemble of in-context learning with private demonstrations.  With DP-OPT, generating privacy-preserving prompts by Vicuna-7b can yield competitive performance compared to non-private in-context learning on GPT3.5 or local private prompt tuning.Codes are available at https://github.com/VITA-Group/DP-OPT.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Ifz3IgsEPX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18240,
    "title": "BadEdit: Backdooring Large Language Models by Model Editing",
    "authors": [
      "Yanzhou Li",
      "Kangjie Chen",
      "Tianlin Li",
      "Jian Zhang",
      "Shangqing Liu",
      "Wenhan Wang",
      "Tianwei Zhang",
      "Yang Liu"
    ],
    "abstract": "Mainstream backdoor attack methods typically demand substantial tuning data for poisoning, limiting their practicality and potentially degrading the overall performance when applied to Large Language Models (LLMs). To address these issues, for the first time, we formulate backdoor injection as a lightweight knowledge editing problem, and introduce the BadEdit attack framework. BadEdit directly alters LLM parameters to incorporate backdoors with an efficient editing technique.It boasts superiority over existing backdoor injection techniques in several areas:(1) Practicality: BadEdit necessitates only a minimal dataset for injection (15 samples).(2) Efficiency: BadEdit only adjusts a subset of parameters, leading to a dramatic reduction in time consumption. (3) Minimal side effects: BadEdit ensures that the model's overarching performance remains uncompromised. (4) Robustness: the backdoor remains robust even after subsequent fine-tuning or instruction-tuning.Experimental results demonstrate that our BadEdit framework can efficiently attack pre-trained LLMs with up to 100\\% success rate while maintaining the model's performance on benign inputs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=duZANm2ABX",
    "arxiv_id": "2403.13355",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18239,
    "title": "HyperHuman: Hyper-Realistic Human Generation with Latent Structural Diffusion",
    "authors": [
      "Xian Liu",
      "Jian Ren",
      "Aliaksandr Siarohin",
      "Ivan Skorokhodov",
      "Yanyu Li",
      "Dahua Lin",
      "Xihui Liu",
      "Ziwei Liu",
      "Sergey Tulyakov"
    ],
    "abstract": "Despite significant advances in large-scale text-to-image models, achieving hyper-realistic human image generation remains a desirable yet unsolved task. Existing models like Stable Diffusion and DALL\u00b7E 2 tend to generate human images with incoherent parts or unnatural poses. To tackle these challenges, our key insight is that human image is inherently structural over multiple granularities, from the coarse-level body skeleton to fine-grained spatial geometry. Therefore, capturing such correlations between the explicit appearance and latent structure in one model is essential to generate coherent and natural human images. To this end, we propose a unified framework, HyperHuman, that generates in-the-wild human images of high realism and diverse layouts. Specifically, 1) we first build a large-scale human-centric dataset, named HumanVerse, which consists of 340M images with comprehensive annotations like human pose, depth, and surface normal. 2) Next, we propose a Latent Structural Diffusion Model that simultaneously denoises the depth and surface normal along with the synthesized RGB image. Our model enforces the joint learning of image appearance, spatial relationship, and geometry in a unified network, where each branch in the model complements to each other with both structural awareness and textural richness. 3) Finally, to further boost the visual quality, we propose a Structure-Guided Refiner to compose the predicted conditions for more detailed generation of higher resolution. Extensive experiments demonstrate that our framework yields the state-of-the-art performance, generating hyper-realistic human images under diverse scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=duyA42HlCK",
    "arxiv_id": "2310.08579",
    "GitHub": [
      "https://github.com/snap-research/HyperHuman"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18238,
    "title": "On the Scalability and Memory Efficiency of Semidefinite Programs  for Lipschitz Constant Estimation of Neural Networks",
    "authors": [
      "Zi Wang",
      "Aaron J Havens",
      "Alexandre Araujo",
      "Yang Zheng",
      "Bin Hu",
      "Yudong Chen",
      "Somesh Jha"
    ],
    "abstract": "Lipschitz constant estimation plays an important role for understanding generalization, robustness, and fairness in deep learning. Unlike naive bounds based on the network weight norm product, semidefinite programs (SDPs) have shown great promise in providing less conservative Lipschitz bounds with polynomial-time complexity guarantees. However, due to the memory consumption and running speed, standard SDP algorithms cannot scale to modern neural network structures. In this paper, we transform the SDPs for Lipschitz constant estimation into an eigenvalue problem, which aligns with the modern large optimization paradigms based on first-order methods. This is amenable to autodiff frameworks such as PyTorch and TensorFlow, requiring significantly less memory than standard SDP algorithms. The transformation also allows us to leverage various existing numerical techniques for eigenvalue optimization, opening the way for further memory improvement and computational speedup. The essential technique of our eigenvalue-problem transformation is to introduce redundant quadratic constraints and then utilize both Lagrangian and Shor's SDP relaxations. Numerical examples demonstrate that our technique is more scalable than existing approaches. For networks that existing SDP solvers cannot handle, we improve the Lipschitz constant estimation by up to 58\\% compared to the weight matrix norm product bound.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dwzLn78jq7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18237,
    "title": "DiffusionNAG: Predictor-guided Neural Architecture Generation with Diffusion Models",
    "authors": [
      "Sohyun An",
      "Hayeon Lee",
      "Jaehyeong Jo",
      "Seanie Lee",
      "Sung Ju Hwang"
    ],
    "abstract": "Existing NAS methods suffer from either an excessive amount of time for repetitive sampling and training of many task-irrelevant architectures. To tackle such limitations of existing NAS methods, we propose a paradigm shift from NAS to a novel conditional Neural Architecture Generation (NAG) framework based on diffusion models, dubbed DiffusionNAG. Specifically, we consider the neural architectures as directed graphs and propose a graph diffusion model for generating them. Moreover, with the guidance of parameterized predictors, DiffusionNAG can flexibly generate task-optimal architectures with the desired properties for diverse tasks, by sampling from a region that is more likely to satisfy the properties. This conditional NAG scheme is significantly more efficient than previous NAS schemes which sample the architectures and filter them using the property predictors. We validate the effectiveness of DiffusionNAG through extensive experiments in two predictor-based NAS scenarios: Transferable NAS and Bayesian Optimization (BO)-based NAS. DiffusionNAG achieves superior performance with speedups of up to 20\u00d7 when compared to the baselines on Transferable NAS benchmarks. Furthermore, when integrated into a BO-based algorithm, DiffusionNAG outperforms existing BO-based NAS approaches, particularly in the large MobileNetV3 search space on the ImageNet 1K dataset.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dyG2oLJYyX",
    "arxiv_id": "2305.16943",
    "GitHub": [
      "https://github.com/CownowAn/DiffusionNAG"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18236,
    "title": "Initializing Models with Larger Ones",
    "authors": [
      "Zhiqiu Xu",
      "Yanjie Chen",
      "Kirill Vishniakov",
      "Yida Yin",
      "Zhiqiang Shen",
      "Trevor Darrell",
      "Lingjie Liu",
      "Zhuang Liu"
    ],
    "abstract": "Weight initialization plays an important role in neural network training. Widely used initialization methods are proposed and evaluated for networks that are trained from scratch. However, the growing number of pretrained models now offers new opportunities for tackling this classical problem of weight initialization. In this work, we introduce weight selection, a method for initializing smaller models by selecting a subset of weights from a pretrained larger model. This enables the transfer of knowledge from pretrained weights to smaller models. Our experiments demonstrate that weight selection can significantly enhance the performance of small models and reduce their training time.  Notably, it can also be used together with knowledge distillation. Weight selection offers a new approach to leverage the power of pretrained models in resource-constrained settings, and we hope it can be a useful tool for training small models in the large-model era.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=dyrGMhicMw",
    "arxiv_id": "2311.18823",
    "GitHub": [
      "https://github.com/OscarXZQ/weight-selection"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18235,
    "title": "Symmetric Single Index Learning",
    "authors": [
      "Aaron Zweig",
      "Joan Bruna"
    ],
    "abstract": "Few neural architectures lend themselves to provable learning with gradient based methods. One popular model is the single-index model, in which labels are produced by composing an unknown linear projection with a possibly unknown scalar link function. Learning this model with SGD is relatively well-understood, whereby the so-called information exponent of the link function governs a polynomial sample complexity rate.  However, extending this analysis to deeper or more complicated architectures remains challenging.In this work, we consider single index learning in the setting of symmetric neural networks.  Under analytic assumptions on the activation and maximum degree assumptions on the link function, we prove that gradient flow recovers the hidden planted direction, represented as a finitely supported vector in the feature space of power sum polynomials.  We characterize a notion of information exponent adapted to our setting that controls the efficiency of learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=e1vqloonRy",
    "arxiv_id": "2310.02117",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18234,
    "title": "ArchLock: Locking DNN Transferability at the Architecture Level with a Zero-Cost Binary Predictor",
    "authors": [
      "Tong Zhou",
      "Shaolei Ren",
      "Xiaolin Xu"
    ],
    "abstract": "Deep neural network (DNN) models, despite their impressive performance, are vulnerable to exploitation by attackers who attempt to adapt them to other tasks for their own benefit. Current defense strategies mainly address this vulnerability at the model parameter level, leaving the potential of architectural-level defense largely unexplored. This paper, for the first time, addresses the issue of model protection by reducing transferability at the architecture level. Specially, we present a novel neural architecture search (NAS)-enabled algorithm that employs zero-cost proxies and evolutionary search, to design model architectures with low transferability. Our method, namely ArchLock, aims to achieve high performance on the source task, while degrading the performance on target tasks, i.e., locking the transferability of a DNN model.To achieve efficient cross-task search without having access to the training data owned by the attackers, we utilize zero-cost proxies to speed up architecture evaluation and simulate potential target task embeddings to assist cross-task search with a binary performance predictor. Extensive experiments on NAS-Bench-201 and TransNAS-Bench-101 demonstrate that ArchLock reduces transferability by up to 30\\% and 50%, respectively, with negligible performance degradation on source tasks (<2%).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=e2YOVTenU9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18232,
    "title": "Lion Secretly Solves a Constrained Optimization: As Lyapunov Predicts",
    "authors": [
      "Lizhang Chen",
      "Bo Liu",
      "Kaizhao Liang",
      "qiang liu"
    ],
    "abstract": "Lion (Evolved Sign Momentum), a new optimizer discovered through program search, has shown promising results in training large AI models. It achieves results comparable to AdamW but with greater memory efficiency. As what we can expect from the result of the random search, Lion blends a number of elements from existing algorithms, including signed momentum, decoupled weight decay,  Polayk and Nesterov momentum, but doesn't fit into any existing category of theoretically grounded optimizers. Thus, even though Lion appears to perform well as a general-purpose optimizer for a wide range of tasks, its theoretical basis remains uncertain. This absence of theoretical clarity limits opportunities to further enhance and expand Lion's efficacy. This work aims to demystify Lion. Using both continuous-time and discrete-time analysis, we demonstrate that Lion is a novel and theoretically grounded approach for minimizing a general loss function $f(x)$ while enforcing a bound constraint $||x||_\\infty \\leq 1/\\lambda$. Lion achieves this through the incorporation of decoupled weight decay, where $\\lambda$ represents the weight decay coefficient. Our analysis is facilitated by the development of a new Lyapunov function for the Lion updates. It applies to a wide range of Lion-$\\phi$ algorithms, where the  $sign(\\cdot)$ operator in Lion is replaced by the subgradient of a convex function $\\phi$, leading to the solution of the general composite optimization problem $\\min_x f(x) + \\phi^*(x)$. Our findings provide valuable insights into the dynamics of Lion and pave the way for further enhancements and extensions of Lion-related algorithms.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=e4xS9ZarDr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17745,
    "title": "DeepZero: Scaling Up Zeroth-Order Optimization for Deep Model Training",
    "authors": [
      "Aochuan Chen",
      "Yimeng Zhang",
      "Jinghan Jia",
      "James Diffenderfer",
      "Konstantinos Parasyris",
      "Jiancheng Liu",
      "Yihua Zhang",
      "Zheng Zhang",
      "Bhavya Kailkhura",
      "Sijia Liu"
    ],
    "abstract": "Zeroth-order (ZO) optimization has become a popular technique for solving machine learning (ML) problems when first-order (FO) information is difficult or impossible to obtain. However, the scalability of ZO optimization remains an open problem: Its use has primarily been limited to relatively small-scale ML problems, such as sample-wise adversarial attack generation. To our best knowledge, no prior work has demonstrated the effectiveness of ZO optimization in training deep neural networks (DNNs) without a significant decrease in performance. To overcome this roadblock, we develop DeepZero, a principled and practical ZO deep learning (DL) framework that can scale ZO optimization to DNN training from scratch through three primary innovations. First, we demonstrate the advantages of coordinate-wise gradient estimation (CGE) over randomized vector-wise gradient estimation in training accuracy and computational efficiency. Second, we propose a sparsity-induced ZO training protocol that extends the model pruning methodology using only finite differences to explore and exploit the sparse DL prior in CGE. Third, we develop the methods of feature reuse and forward parallelization to advance the practical implementations of ZO training. Our extensive experiments show that DeepZero achieves state-of-the-art (SOTA) accuracy on ResNet-20 trained on CIFAR-10, approaching FO training performance for the first time. Furthermore, we show the practical utility of DeepZero in applications of certified adversarial defense and DL-based partial differential equation error correction, achieving 10-20% improvement over SOTA. We believe our results will inspire future research on scalable ZO optimization and contribute to advancing deep learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qBWhjsNPEY",
    "arxiv_id": "2310.02025",
    "GitHub": [
      "https://github.com/OPTML-Group/DeepZero"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18231,
    "title": "PixArt-$\\alpha$: Fast Training of Diffusion Transformer for Photorealistic Text-to-Image Synthesis",
    "authors": [
      "Junsong Chen",
      "Jincheng YU",
      "Chongjian GE",
      "Lewei Yao",
      "Enze Xie",
      "Zhongdao Wang",
      "James Kwok",
      "Ping Luo",
      "Huchuan Lu",
      "Zhenguo Li"
    ],
    "abstract": "The most advanced text-to-image (T2I) models require significant training costs (e.g., millions of GPU hours), seriously hindering the fundamental innovation for the AIGC community while increasing CO2 emissions. This paper introduces PixArt-$\\alpha$, a Transformer-based T2I diffusion model whose image generation quality is competitive with state-of-the-art image generators (e.g., Imagen, SDXL, and even Midjourney), reaching near-commercial application standards. Additionally, it supports high-resolution image synthesis up to 1024px resolution with low training cost, as shown in Figure 1 and 2. To achieve this goal, three core designs are proposed: (1) Training strategy decomposition: We devise three distinct training steps that separately optimize pixel dependency, text-image alignment, and image aesthetic quality; (2) Efficient T2I Transformer: We incorporate cross-attention modules into Diffusion Transformer (DiT) to inject text conditions and streamline the computation-intensive class-condition branch; (3) High-informative data: We emphasize the significance of concept density in text-image pairs and leverage a large Vision-Language model to auto-label dense pseudo-captions to assist text-image alignment learning. As a result, PixArt-$\\alpha$'s training speed markedly surpasses existing large-scale T2I models, e.g., PixArt-$\\alpha$ only takes 10.8% of Stable Diffusion v1.5's training time (~675 vs. ~6,250 A100 GPU days), saving nearly \\\\$300,000 (\\\\$26,000 vs. \\\\$320,000) and reducing 90% CO2 emissions. Moreover, compared with a larger SOTA model, RAPHAEL, our training cost is merely 1%. Extensive experiments demonstrate that PixArt-$\\alpha$ excels in image quality, artistry, and semantic control. We hope PixArt-$\\alpha$ will provide new insights to the AIGC community and startups to accelerate building their own high-quality yet low-cost generative models from scratch.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=eAKmQPe3m1",
    "arxiv_id": "2310.00426",
    "GitHub": [
      "https://github.com/PixArt-alpha/PixArt-alpha"
    ],
    "Space": [
      "PixArt-alpha/PixArt-alpha"
    ],
    "Model": [
      "PixArt-alpha/PixArt-XL-2-1024-MS"
    ],
    "Dataset": []
  },
  {
    "id": 18230,
    "title": "PORF: POSE RESIDUAL FIELD FOR ACCURATE NEURAL SURFACE RECONSTRUCTION",
    "authors": [
      "Jia-Wang Bian",
      "Wenjing Bian",
      "Victor Adrian Prisacariu",
      "Philip Torr"
    ],
    "abstract": "Neural surface reconstruction is sensitive to the camera pose noise, even when state-of-the-art pose estimators like COLMAP or ARKit are used. Existing Pose-NeRF joint optimisation methods have struggled to improve pose accuracy in challenging real-world scenarios. To overcome the challenges, we introduce the pose residual field (PoRF), a novel implicit representation that uses an MLP for regressing pose updates. Compared with the conventional per-frame pose parameter optimisation, this new representation is more robust due to parameter sharing that leverages global information over the entire sequence. Furthermore, we propose an epipolar geometry loss to enhance the supervision that leverages the correspondences exported from COLMAP results without the extra computational overhead. Our method yields promising results. On the DTU dataset, we reduce the rotation error of COLMAP poses by 78\\%, leading to the reduced reconstruction Chamfer distance from 3.48mm to 0.85mm. On the MobileBrick dataset that contains casually captured unbounded 360-degree videos, our method refines ARKit poses and improves the reconstruction F1 score from 69.18 to 75.67, outperforming that with the provided ground-truth pose (75.14). These achievements demonstrate the efficacy of our approach in refining camera poses and improving the accuracy of neural surface reconstruction in real-world scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eBeECjacpw",
    "arxiv_id": "2310.07449",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18229,
    "title": "Reward-Free Curricula for Training Robust World Models",
    "authors": [
      "Marc Rigter",
      "Minqi Jiang",
      "Ingmar Posner"
    ],
    "abstract": "There has been a recent surge of interest in developing generally-capable agents that can adapt to new tasks without additional training in the environment. Learning world models from reward-free exploration is a promising approach, and enables policies to be trained using imagined experience for new tasks. However, achieving a general agent requires robustness across different environments. In this work, we address the novel problem of generating curricula in the reward-free setting to train robust world models. We consider robustness in terms of minimax regret over all environment instantiations and show that the minimax regret can be connected to minimising the maximum error in the world model across environment instances. This result informs our algorithm, WAKER: Weighted Acquisition of Knowledge across Environments for Robustness. WAKER selects environments for data collection based on the estimated error of the world model for each environment. Our experiments demonstrate that WAKER outperforms na\u0131\u0308ve domain randomisation, resulting in improved robustness, efficiency, and generalisation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eCGpNGDeNu",
    "arxiv_id": "2306.09205",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18932,
    "title": "When Do Prompting and Prefix-Tuning Work? A Theory of Capabilities and Limitations",
    "authors": [
      "Aleksandar Petrov",
      "Philip Torr",
      "Adel Bibi"
    ],
    "abstract": "Context-based fine-tuning methods like prompting, in-context learning, soft prompting (prompt tuning) and prefix-tuning have gained popularity as they often match the performance of full fine-tuning with a fraction of the parameters. Despite their empirical successes, there is little theoretical understanding of how these techniques influence the internal computation of the model and their expressiveness limitations. We show that despite the continuous embedding space being much more expressive than the discrete token space, soft-prompting and prefix-tuning are strictly less expressive than full fine-tuning. Concretely, context-based fine-tuning cannot change the relative attention pattern over the content and can only bias the outputs of an attention layer in a fixed direction. While this means that fine-tuning techniques such as prompting, in-context learning, soft prompting and prefix-tuning can successfully elicit or combine skills already present in the pretrained model, they cannot learn tasks requiring new attention patterns.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JewzobRhay",
    "arxiv_id": "2310.19698",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18227,
    "title": "Blending Imitation and Reinforcement Learning for Robust Policy Improvement",
    "authors": [
      "Xuefeng Liu",
      "Takuma Yoneda",
      "Rick Stevens",
      "Matthew Walter",
      "Yuxin Chen"
    ],
    "abstract": "While reinforcement learning (RL) has shown promising performance, its sample complexity continues to be a substantial hurdle, restricting its broader application across a variety of domains. Imitation learning (IL) utilizes oracles to improve sample efficiency, yet it is often constrained by the quality of the oracles deployed. To address the demand for robust policy improvement in real-world scenarios, we introduce a novel algorithm, Robust Policy Improvement (RPI), which actively interleaves between IL and RL based on an online estimate of their performance. RPI draws on the strengths of IL, using oracle queries to facilitate exploration\u2014an aspect that is notably challenging in sparse-reward RL\u2014particularly during the early stages of learning. As learning unfolds, RPI gradually transitions to RL, effectively treating the learned policy as an improved oracle. This algorithm is capable of learning from and improving upon a diverse set of black-box oracles. Integral to RPI are Robust Active Policy Selection (RAPS) and Robust Policy Gradient (RPG), both of which reason over whether to perform state-wise imitation from the oracles or learn from its own value function when the learner\u2019s performance surpasses that of the oracles in a specific state. Empirical evaluations and theoretical analysis validate that RPI excels in comparison to existing state-of-the-art methodologies, demonstrating superior performance across various benchmark domains.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=eJ0dzPJq1F",
    "arxiv_id": "2310.01737",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18930,
    "title": "The optimality of kernel classifiers in Sobolev space",
    "authors": [
      "Jianfa Lai",
      "zhifan Li",
      "Dongming Huang",
      "Qian Lin"
    ],
    "abstract": "Kernel methods are widely used in machine learning, especially for classification problems. However, the theoretical analysis of kernel classification is still limited. This paper investigates the statistical performances of kernel classifiers. With some mild assumptions on the conditional probability $\\eta(x)=\\mathbb{P}(Y=1\\mid X=x)$, we derive an upper bound on the classification excess risk of a kernel classifier using recent advances in the theory of kernel regression. We also obtain a minimax lower bound for Sobolev spaces, which shows the optimality of the proposed classifier. Our theoretical results can be extended to the generalization error of overparameterized neural network classifiers. To make our theoretical results more applicable in realistic settings, we also propose a simple method to estimate the interpolation smoothness of $2\\eta(x)-1$ and apply the method to real datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JfqN3gu0i7",
    "arxiv_id": "2402.01148",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18226,
    "title": "DIFFTACTILE: A Physics-based Differentiable Tactile Simulator for Contact-rich Robotic Manipulation",
    "authors": [
      "Zilin Si",
      "Gu Zhang",
      "Qingwei Ben",
      "Branden Romero",
      "Zhou Xian",
      "Chao Liu",
      "Chuang Gan"
    ],
    "abstract": "We introduce DIFFTACTILE, a physics-based and fully differentiable tactile simulation system designed to enhance robotic manipulation with dense and physically-accurate tactile feedback. In contrast to prior tactile simulators which primarily focus on manipulating rigid bodies and often rely on simplified approximations to model stress and deformations of materials in contact, DIFFTACTILE emphasizes physics-based contact modeling with high fidelity, supporting simulations of diverse contact modes and interactions with objects possessing a wide range of material properties. Our system incorporates several key components, including a Finite Element Method (FEM) -based soft body model for simulating the sensing elastomer, a multi-material simulator for modeling diverse object types (such as elastic, plastic, cables) under manipulation, a penalty-based contact model for handling contact dynamics. The differentiable nature of our system facilitates gradient-based optimization for both 1) refining physical properties in simulation using real-world data, hence narrowing the sim-to-real gap, and 2) efficient learning of tactile-assisted grasping and contact-rich manipulation skills. Additionally, we introduce a method to infer the optical response of our tactile sensor to contact using an efficient pixel-based neural module. We anticipate that DIFFTACTILE will serve as a useful platform for studying contact-rich manipulations, leveraging the benefits of dense tactile feedback and differentiable physics. The source codes of DIFFTACTILE will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eJHnSg783t",
    "arxiv_id": "2403.08716",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18225,
    "title": "Combinatorial Bandits for Maximum Value Reward Function under Value-Index Feedback",
    "authors": [
      "Yiliu Wang",
      "Wei Chen",
      "Milan Vojnovic"
    ],
    "abstract": "We consider a combinatorial multi-armed bandit problem for maximum value reward function under maximum value and index feedback. This is a new feedback structure that lies in between commonly studied semi-bandit and full-bandit feedback structures. We propose an algorithm and provide a regret bound for problem instances with stochastic arm outcomes according to arbitrary distributions with finite supports. The regret analysis rests on considering an extended set of arms, associated with values and probabilities of arm outcomes, and applying a smoothness condition. Our algorithm achieves a $O((k/\\Delta)\\log(T))$ distribution-dependent and a $\\tilde{O}(\\sqrt{T})$ distribution-independent regret where $k$ is the number of arms selected in each round, $\\Delta$ is a distribution-dependent reward gap and $T$ is the horizon time. Perhaps surprisingly, the regret bound is comparable to previously-known bound under more informative semi-bandit feedback. We demonstrate the effectiveness of our algorithm through experimental results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eMHn77ZKOp",
    "arxiv_id": "2305.16074",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18224,
    "title": "On Trajectory Augmentations for Off-Policy Evaluation",
    "authors": [
      "Ge Gao",
      "Qitong Gao",
      "Xi Yang",
      "Song Ju",
      "Miroslav Pajic",
      "Min Chi"
    ],
    "abstract": "In the realm of reinforcement learning (RL), off-policy evaluation (OPE) holds a pivotal position, especially in high-stake human-involved scenarios such as e-learning and healthcare. Applying OPE to these domains is often challenging with scarce and underrepresentative offline training trajectories. Data augmentation has been a successful technique to enrich training data. However, directly employing existing data augmentation methods to OPE may not be feasible, due to the Markovian nature within the offline trajectories and the desire for generalizability across diverse target policies. In this work, we propose an offline trajectory augmentation approach to specifically facilitate OPE in human-involved scenarios. We propose sub-trajectory mining to extract potentially valuable sub-trajectories from offline data, and diversify the behaviors within those sub-trajectories by varying coverage of the state-action space. Our work was empirically evaluated in a wide array of environments, encompassing both simulated scenarios and real-world domains like robotic control, healthcare, and e-learning, where the training trajectories include varying levels of coverage of the state-action space. By enhancing the performance of a variety of OPE methods, our work offers a promising path forward for tackling OPE challenges in situations where data may be limited or underrepresentative.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eMNN0wIyVw",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18223,
    "title": "Unknown Domain Inconsistency Minimization for Domain Generalization",
    "authors": [
      "Seungjae Shin",
      "HeeSun Bae",
      "Byeonghu Na",
      "Yoon-Yeong Kim",
      "Il-chul Moon"
    ],
    "abstract": "The objective of domain generalization (DG) is to enhance the transferability of the model learned from a source domain to unobserved domains. To prevent overfitting to a specific domain, Sharpness-Aware Minimization (SAM) reduces the sharpness of the source domain's loss landscape. Although SAM and its variants have delivered significant improvements in DG, we highlight that there's still potential for improvement in generalizing to unknown domains through the exploration on data space. Building on this motivation, this paper introduces an objective rooted in both parameter and data perturbed regions for domain generalization, termed Unknown Domain Inconsistency Minimization (UDIM). UDIM reduces the loss landscape inconsistency between source domain and unknown domains. As unknown domains are inaccessible, these domains are empirically crafted by perturbing instances from the source domain dataset. In particular, by aligning the flat minima acquired in the source domain to the loss landscape of perturbed domains, we expect to achieve generalization grounded on these flat minima for the unknown domains. Theoretically, we validate that merging SAM optimization with the UDIM objective establishes an upper bound for the true objective of the DG task. In an empirical aspect, UDIM consistently outperforms SAM variants across multiple DG benchmark datasets. Notably, UDIM shows statistically significant improvements in scenarios with more restrictive domain information, underscoring UDIM's generalization capability in unseen domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eNoiRal5xi",
    "arxiv_id": "2403.07329",
    "GitHub": [
      "https://github.com/SJShin-AI/UDIM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18929,
    "title": "FLATTEN: optical FLow-guided ATTENtion for consistent text-to-video editing",
    "authors": [
      "Yuren Cong",
      "Mengmeng Xu",
      "christian simon",
      "Shoufa Chen",
      "Jiawei Ren",
      "Yanping Xie",
      "Juan-Manuel Perez-Rua",
      "Bodo Rosenhahn",
      "Tao Xiang",
      "Sen He"
    ],
    "abstract": "Text-to-video editing aims to edit the visual appearance of a source video conditional on textual prompts.A major challenge in this task is to ensure that all frames in the edited video are visually consistent. Most recent works apply advanced text-to-image diffusion models to this task by inflating 2D spatial attention in the U-Net into spatio-temporal attention.Although temporal context can be added through spatio-temporal attention, it may introduce some irrelevant information for each patch and therefore cause inconsistency in the edited video. In this paper, for the first time, we introduce optical flow into the attention module in diffusion model's U-Net to address the inconsistency issue for text-to-video editing.Our method, FLATTEN, enforces the patches on the same flow path across different frames to attend to each other in the attention module,  thus improving the visual consistency in the edited videos. Additionally, our method is training-free and can be seamlessly integrated into any diffusion based text-to-video editing methods and improve their visual consistency.Experiment results on existing text-to-video editing benchmarks show that our proposed method achieves the new state-of-the-art performance. In particular, our method excels in maintaining the visual consistency in the edited videos.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JgqftqZQZ7",
    "arxiv_id": "2310.05922",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18924,
    "title": "A Hard-to-Beat Baseline for Training-free CLIP-based Adaptation",
    "authors": [
      "Zhengbo Wang",
      "Jian Liang",
      "Lijun Sheng",
      "Ran He",
      "Zilei Wang",
      "Tieniu Tan"
    ],
    "abstract": "Contrastive Language-Image Pretraining (CLIP) has gained popularity for its remarkable zero-shot capacity. Recent research has focused on developing efficientfine-tuning methods, such as prompt learning and adapter, to enhance CLIP\u2019sperformance in downstream tasks. However, these methods still require additionaltraining time and computational resources, which is undesirable for devices withlimited resources. In this paper, we revisit a classical algorithm, Gaussian Discriminant Analysis (GDA), and apply it to the downstream classification of CLIP.Typically, GDA assumes that features of each class follow Gaussian distributionswith identical covariance. By leveraging Bayes\u2019 formula, the classifier can beexpressed in terms of the class means and covariance, which can be estimated fromthe data without the need for training. To integrate knowledge from both visual andtextual modalities, we ensemble it with the original zero-shot classifier within CLIP.Extensive results on 17 datasets validate that our method surpasses or achievescomparable results with state-of-the-art methods on few-shot classification, imbalanced learning, and out-of-distribution generalization. In addition, we extendour method to base-to-new generalization and unsupervised learning, once againdemonstrating its superiority over competing approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Js5PJPHDyY",
    "arxiv_id": "2402.04087",
    "GitHub": [
      "https://github.com/mrflogs/ICLR24"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18221,
    "title": "Diffusion in Diffusion: Cyclic One-Way Diffusion for Text-Vision-Conditioned Generation",
    "authors": [
      "Ruoyu Wang",
      "Yongqi Yang",
      "Zhihao Qian",
      "Ye Zhu",
      "Yu Wu"
    ],
    "abstract": "Originating from the diffusion phenomenon in physics that describes particle movement, the diffusion generative models inherit the characteristics of stochastic random walk in the data space along the denoising trajectory. However, the intrinsic mutual interference among image regions contradicts the need for practical downstream application scenarios where the preservation of low-level pixel information from given conditioning is desired (e.g., customization tasks like personalized generation and inpainting based on a user-provided single image). In this work, we investigate the diffusion (physics) in diffusion (machine learning) properties and propose our Cyclic One-Way Diffusion (COW) method to control the direction of diffusion phenomenon given a pre-trained frozen diffusion model for versatile customization application scenarios, where the low-level pixel information from the conditioning needs to be preserved. Notably, unlike most current methods that incorporate additional conditions by fine-tuning the base text-to-image diffusion model or learning auxiliary networks, our method provides a novel perspective to understand the task needs and is applicable to a wider range of customization scenarios in a learning-free manner. Extensive experiment results show that our proposed COW can achieve more flexible customization based on strict visual conditions in different application settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ePOjNlOjLC",
    "arxiv_id": "2306.08247",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18220,
    "title": "Annealing Self-Distillation Rectification Improves Adversarial Training",
    "authors": [
      "Yu-Yu Wu",
      "Hung-Jui Wang",
      "Shang-Tse Chen"
    ],
    "abstract": "In standard adversarial training, models are optimized to fit invariant one-hot labels for adversarial data when the perturbations are within allowable budgets. However, the overconfident target harms generalization and causes the problem of robust overfitting. To address this issue and enhance adversarial robustness, we analyze the characteristics of robust models and identify that robust models tend to produce smoother and well-calibrated outputs. Based on the observation, we propose a simple yet effective method, Annealing Self-Distillation Rectification (ADR), which generates soft labels as a better guidance mechanism that reflects the underlying distribution of data. By utilizing ADR, we can obtain rectified labels that improve model robustness without the need for pre-trained models or extensive extra computation. Moreover, our method facilitates seamless plug-and-play integration with other adversarial training techniques by replacing the hard labels in their objectives. We demonstrate the efficacy of ADR through extensive experiments and strong performances across datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eT6oLkm1cm",
    "arxiv_id": "2305.12118",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18218,
    "title": "Generative Modeling of Regular and Irregular Time Series Data via Koopman VAEs",
    "authors": [
      "Ilan Naiman",
      "N. Benjamin Erichson",
      "Pu Ren",
      "Michael W. Mahoney",
      "Omri Azencot"
    ],
    "abstract": "Generating realistic time series data is important for numerous engineering and scientific applications. Several existing works tackle this problem using generative adversarial networks, however, GANs are often unstable during training and suffer from mode collpase. While variational autoencoders (VAEs) are more robust to the above issues, surprisingly, they are considered less for time series generation. In this work, we introduce Koopman VAE (KVAE), a new generative framework that is based on a novel design for the model prior, and that can be optimized for either regular and irregular training data. Inspired by the Koopman theory, we represent the latent conditional prior dynamics using a linear map. Our approach enhances generative modeling with two desired features: (i) incorporating domain knowledge can be achieved by leverageing spectral tools that prescribe constraints on the eigenvalues of the linear map; and (ii) studying the qualitative behavior and stablity of the system can be performed using tools from dynamical systems theory. Our results show that KVAE outperforms state-of-the-art GAN and VAE methods across several challenging synthetic and real-world time series generation benchmarks. Whether trained on regular or irregular data, KVAE generates time series that improve both discriminative and predictive metrics. Further, we present visual evidence suggesting that KVAE learns probability density functions that better approximate the empirical ground truth distribution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eY7sLb0dVF",
    "arxiv_id": "2310.02619",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18217,
    "title": "G$^2$N$^2$ : Weisfeiler and Lehman go grammatical",
    "authors": [
      "Jason Piquenot",
      "Aldo Moscatelli",
      "Maxime Berar",
      "Pierre H\u00e9roux",
      "Romain Raveaux",
      "Jean-Yves RAMEL",
      "S\u00e9bastien Adam"
    ],
    "abstract": "This paper introduces a framework for formally establishing a connection between a portion of an algebraic language and a Graph Neural Network (GNN). The framework leverages Context-Free Grammars (CFG) to organize algebraic operations into generative rules that can be translated into a GNN layer model. As CFGs derived directly from a language tend to contain redundancies in their rules and variables, we present a grammar reduction scheme. By applying this strategy, we define a CFG that conforms to the third-order Weisfeiler-Lehman (3-WL) test using the matricial language MATLANG. From this 3-WL CFG, we derive a GNN model, named G$^2$N$^2$, which is provably 3-WL compliant. Through various experiments, we demonstrate the superior efficiency of G$^2$N$^2$ compared to other 3-WL GNNs across numerous downstream tasks. Specifically, one experiment highlights the benefits of grammar reduction within our framework.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eZneJ55mRO",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18215,
    "title": "Multimodal Web Navigation with Instruction-Finetuned Foundation Models",
    "authors": [
      "Hiroki Furuta",
      "Kuang-Huei Lee",
      "Ofir Nachum",
      "Yutaka Matsuo",
      "Aleksandra Faust",
      "Shixiang Shane Gu",
      "Izzeddin Gur"
    ],
    "abstract": "The progress of autonomous web navigation has been hindered by the dependence on billions of exploratory interactions via online reinforcement learning, and domain-specific model designs that make it difficult to leverage generalization from rich out-of-domain data.In this work, we study data-driven offline training for web agents with vision-language foundation models.We propose an instruction-following multimodal agent, WebGUM, that observes both webpage screenshots and HTML pages and outputs web navigation actions, such as click and type.WebGUM is trained by jointly finetuning an instruction-finetuned language model and a vision encoder with temporal and local perception on a large corpus of demonstrations.We empirically demonstrate this recipe improves the agent's ability of grounded multimodal perception, HTML comprehension, and multi-step reasoning, outperforming prior works by a significant margin. On the MiniWoB, we improve over the previous best offline methods by more than 45.8%, even outperforming online-finetuned SoTA, humans, and GPT-4-based agent. On the WebShop benchmark, our 3-billion-parameter model achieves superior performance to the existing SoTA, PaLM-540B.Furthermore, WebGUM exhibits strong positive transfer to the real-world planning tasks on the Mind2Web.We also collect 347K high-quality demonstrations using our trained models, 38 times larger than prior work, and make them available to promote future research in this direction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=efFmBWioSc",
    "arxiv_id": "2305.11854",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18906,
    "title": "Learning Implicit Representation for Reconstructing Articulated Objects",
    "authors": [
      "Hao Zhang",
      "Fang Li",
      "Samyak Rawlekar",
      "Narendra Ahuja"
    ],
    "abstract": "3D Reconstruction of moving articulated objects without additional information about object structure is a challenging problem. Current methods overcome such challenges by employing category-specific skeletal models. Consequently, they do not generalize well to articulated objects in the wild. We treat an articulated object as an unknown, semi-rigid skeletal structure surrounded by nonrigid material (e.g., skin). Our method simultaneously estimates the visible (explicit) representation (3D shapes, colors, camera parameters) and the underlying (implicit) skeletal representation, from motion cues in the object video without 3D supervision. Our implicit representation consists of four parts. (1) skeleton, which specifies which semi-rigid parts are connected. (2) Semi-rigid Part Assignment, which associates each surface vertex with a semi-rigid part. (3) Rigidity Coefficients, specifying the articulation of the local surface. (4) Time-Varying Transformations, which specify the skeletal motion and surface deformation parameters. We introduce an algorithm that uses these constraints as regularization terms and iteratively estimates both implicit and explicit representations. Our method is category-agnostic, thus eliminating the need for category-specific skeletons, we show that our method outperforms state-of-the-art across standard video datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KQ2i6jazVK",
    "arxiv_id": "2401.08809",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18214,
    "title": "SEPT: Towards Efficient Scene Representation Learning for Motion Prediction",
    "authors": [
      "Zhiqian Lan",
      "Yuxuan Jiang",
      "Yao Mu",
      "Chen Chen",
      "Shengbo Eben Li"
    ],
    "abstract": "Motion prediction is crucial for autonomous vehicles to operate safely in complex traffic environments. Extracting effective spatiotemporal relationships among traffic elements is key to accurate forecasting. Inspired by the successful practice of pretrained large language models, this paper presents SEPT, a modeling framework that leverages self-supervised learning to develop powerful spatiotemporal understanding for complex traffic scenes. Specifically, our approach involves three masking-reconstruction modeling tasks on scene inputs including agents' trajectories and road network, pretraining the scene encoder to capture kinematics within trajectory, spatial structure of road network, and interactions among roads and agents. The pretrained encoder is then finetuned on the downstream forecasting task. Extensive experiments demonstrate that SEPT, without elaborate architectural design or manual feature engineering, achieves state-of-the-art performance on the Argoverse 1 and Argoverse 2 motion forecasting benchmarks, outperforming previous methods on all main metrics by a large margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=efeBC1sQj9",
    "arxiv_id": "2309.15289",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18212,
    "title": "SAN: Inducing Metrizability of GAN with Discriminative Normalized Linear Layer",
    "authors": [
      "Yuhta Takida",
      "Masaaki Imaizumi",
      "Takashi Shibuya",
      "Chieh-Hsin Lai",
      "Toshimitsu Uesaka",
      "Naoki Murata",
      "Yuki Mitsufuji"
    ],
    "abstract": "Generative adversarial networks (GANs) learn a target probability distribution by optimizing a generator and a discriminator with minimax objectives. This paper addresses the question of whether such optimization actually provides the generator with gradients that make its distribution close to the target distribution. We derive *metrizable conditions*, sufficient conditions for the discriminator to serve as the distance between the distributions, by connecting the GAN formulation with the concept of sliced optimal transport. Furthermore, by leveraging these theoretical results, we propose a novel GAN training scheme called the Slicing Adversarial Network (SAN). With only simple modifications, a broad class of existing GANs can be converted to SANs. Experiments on synthetic and image datasets support our theoretical results and the effectiveness of SAN as compared to the usual GANs. We also apply SAN to StyleGAN-XL, which leads to a state-of-the-art FID score amongst GANs for class conditional generation on ImageNet 256$\\times$256.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eiF7TU1E8E",
    "arxiv_id": "2301.12811",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18899,
    "title": "Constraint-Free Structure Learning with Smooth Acyclic Orientations",
    "authors": [
      "Riccardo Massidda",
      "Francesco Landolfi",
      "Martina Cinquini",
      "Davide Bacciu"
    ],
    "abstract": "The structure learning problem consists of fitting data generated by a Directed Acyclic Graph (DAG) to correctly reconstruct its arcs. In this context, differentiable approaches constrain or regularize an optimization problem with a continuous relaxation of the acyclicity property. The computational cost of evaluating graph acyclicity is cubic on the number of nodes and significantly affects scalability. In this paper, we introduce COSMO, a constraint-free continuous optimization scheme for acyclic structure learning. At the core of our method lies a novel differentiable approximation of an orientation matrix parameterized by a single priority vector. Differently from previous works, our parameterization fits a smooth orientation matrix and the resulting acyclic adjacency matrix without evaluating acyclicity at any step. Despite this absence, we prove that COSMO always converges to an acyclic solution. In addition to being asymptotically faster, our empirical analysis highlights how COSMO performance on graph reconstruction compares favorably with competing structure learning methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KWO8LSUC5W",
    "arxiv_id": "2309.08406",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18209,
    "title": "Consistency Training with Learnable Data Augmentation for Graph Anomaly Detection with Limited Supervision",
    "authors": [
      "Nan Chen",
      "Zemin Liu",
      "Bryan Hooi",
      "Bingsheng He",
      "Rizal Fathony",
      "Jun Hu",
      "Jia Chen"
    ],
    "abstract": "Graph Anomaly Detection (GAD) has surfaced as a significant field of research, predominantly due to its substantial influence in production environments. Although existing approaches for node anomaly detection have shown effectiveness, they have yet to fully address two major challenges: operating in settings with limited supervision and managing class imbalance effectively. In response to these challenges, we propose a novel model, ConsisGAD, which is tailored for GAD in scenarios characterized by limited supervision and is anchored in the principles of consistency training. Under limited supervision, ConsisGAD effectively leverages the abundance of unlabeled data for consistency training by incorporating a novel learnable data augmentation mechanism, thereby introducing controlled noise into the dataset. Moreover, ConsisGAD takes advantage of the variance in homophily distribution between normal and anomalous nodes to craft a simplified GNN backbone, enhancing its capability to distinguish effectively between these two classes. Comprehensive experiments on several benchmark datasets validate the superior performance of ConsisGAD in comparison to state-of-the-art baselines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=elMKXvhhQ9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18208,
    "title": "Consciousness-Inspired Spatio-Temporal Abstractions for Better Generalization in Reinforcement Learning",
    "authors": [
      "Mingde Zhao",
      "Safa Alver",
      "Harm van Seijen",
      "Romain Laroche",
      "Doina Precup",
      "Yoshua Bengio"
    ],
    "abstract": "Inspired by human conscious planning, we propose Skipper, a model-based reinforcement learning agent that utilizes spatial and temporal abstractions to generalize learned skills in novel situations. It automatically decomposes the task at hand into smaller-scale, more manageable subtasks and hence enables sparse decision-making and focuses its computation on the relevant parts of the environment. This relies on the definition of a high-level proxy problem represented as a directed graph, in which vertices and edges are learned end-to-end using hindsight. Our theoretical analyses provide performance guarantees under appropriate assumptions and establish where our approach is expected to be helpful. Generalization-focused experiments validate Skipper\u2019s significant advantage in zero-shot generalization, compared to existing state-of-the-art hierarchical planning methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eo9dHwtTFt",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18207,
    "title": "Towards Energy Efficient Spiking Neural Networks: An Unstructured Pruning Framework",
    "authors": [
      "Xinyu Shi",
      "Jianhao Ding",
      "Zecheng Hao",
      "Zhaofei Yu"
    ],
    "abstract": "Spiking Neural Networks (SNNs)  have emerged as energy-efficient alternatives to  Artificial Neural Networks (ANNs) when deployed on neuromorphic chips.  While recent studies have demonstrated the impressive performance of deep SNNs on challenging tasks, their energy efficiency advantage has been diminished. Existing methods targeting energy consumption reduction do not fully exploit sparsity, whereas powerful pruning methods can achieve high sparsity but are not directly targeted at energy efficiency, limiting their effectiveness in energy saving. Furthermore, none of these works fully exploit the sparsity of neurons or the potential for unstructured neuron pruning in SNNs. In this paper, we propose a novel pruning framework that combines unstructured weight pruning with unstructured neuron pruning to maximize the utilization of the sparsity of neuromorphic computing, thereby enhancing energy efficiency. To the best of our knowledge, this is the first application of unstructured neuron pruning to deep SNNs. Experimental results demonstrate that  our method achieves impressive energy efficiency gains. The sparse network pruned by our method with only 0.63\\% remaining connections can achieve a remarkable 91 times increase in energy efficiency compared to the original dense network, requiring only 8.5M SOPs for inference, with merely 2.19\\% accuracy loss on the CIFAR-10 dataset. Our work suggests that deep and dense SNNs exhibit high redundancy in energy consumption, highlighting the potential for targeted SNN sparsification to save energy.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=eoSeaK4QJo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18206,
    "title": "Maximum Likelihood Estimation is All You Need for Well-Specified Covariate Shift",
    "authors": [
      "Jiawei Ge",
      "Shange Tang",
      "Jianqing Fan",
      "Cong Ma",
      "Chi Jin"
    ],
    "abstract": "A key challenge of modern machine learning systems is to achieve Out-of-Distribution (OOD) generalization --- generalizing to target data whose distribution differs from those of source data. Despite its significant importance, the fundamental question of ``what are the most effective algorithms for OOD generalization'' remains open even under the standard setting of covariate shift.This paper addresses this fundamental question by proving that, surprisingly, classical Maximum Likelihood Estimation (MLE) purely using source data (without any modification) achieves the *minimax* optimality for covariate shift under the *well-specified* setting. This result holds for a very large class of parametric models, including but not limited to linear regression, logistic regression, and phase retrieval, and does not require any boundedness condition on the density ratio. This paper further complement the study by proving that for the *misspecified setting*, MLE can perform poorly, and the Maximum Weighted Likelihood Estimator (MWLE) emerges as minimax optimal in specific scenarios, outperforming MLE.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eoTCKKOgIs",
    "arxiv_id": "2311.15961",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18896,
    "title": "SNIP: Bridging Mathematical Symbolic and Numeric Realms with Unified Pre-training",
    "authors": [
      "Kazem Meidani",
      "Parshin Shojaee",
      "Chandan K. Reddy",
      "Amir Barati Farimani"
    ],
    "abstract": "In an era where symbolic mathematical equations are indispensable for modeling complex natural phenomena, scientific inquiry often involves collecting observations and translating them into mathematical expressions. Recently, deep learning has emerged as a powerful tool for extracting insights from data. However, existing models typically specialize in either numeric or symbolic domains, and are usually trained in a supervised manner tailored to specific tasks. This approach neglects the substantial benefits that could arise from a task-agnostic unified understanding between symbolic equations and their numeric counterparts. To bridge the gap, we introduce SNIP, a Symbolic-Numeric Integrated Pre-training, which employs joint contrastive learning between symbolic and numeric domains, enhancing their mutual similarities in the pre-trained embeddings. By performing latent space analysis, we observe that SNIP provides cross-domain insights into the representations, revealing that symbolic supervision enhances the embeddings of numeric data and vice versa. We evaluate SNIP across diverse tasks, including symbolic-to-numeric mathematical property prediction and numeric-to-symbolic equation discovery, commonly known as symbolic regression. Results show that SNIP effectively transfers to various tasks, consistently outperforming fully supervised baselines and competing strongly with established task-specific methods, especially in few-shot learning scenarios where available data is limited.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KZSEgJGPxu",
    "arxiv_id": "2310.02227",
    "GitHub": [
      "https://github.com/deep-symbolic-mathematics/Multimodal-Math-Pretraining"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18205,
    "title": "LLM-grounded Video Diffusion Models",
    "authors": [
      "Long Lian",
      "Baifeng Shi",
      "Adam Yala",
      "Trevor Darrell",
      "Boyi Li"
    ],
    "abstract": "Text-conditioned diffusion models have emerged as a promising tool for neural video generation. However, current models still struggle with intricate spatiotemporal prompts and often generate restricted or incorrect motion (e.g., even lacking the ability to be prompted for objects moving from left to right). To address these limitations, we introduce LLM-grounded Video Diffusion (LVD). Instead of directly generating videos from the text inputs, LVD first leverages a large language model (LLM) to generate dynamic scene layouts based on the text inputs and subsequently uses the generated layouts to guide a diffusion model for video generation. We show that LLMs are able to understand complex spatiotemporal dynamics from text alone and generate layouts that align closely with both the prompts and the object motion patterns typically observed in the real world. We then propose to guide video diffusion models with these layouts by adjusting the attention maps. Our approach is training-free and can be integrated into any video diffusion model that admits classifier guidance. Our results demonstrate that LVD significantly outperforms its base video diffusion model and several strong baseline methods in faithfully generating videos with the desired attributes and motion patterns.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=exKHibougU",
    "arxiv_id": "2309.17444",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18895,
    "title": "Online GNN Evaluation Under Test-time Graph Distribution Shifts",
    "authors": [
      "Xin Zheng",
      "Dongjin Song",
      "Qingsong Wen",
      "Bo Du",
      "Shirui Pan"
    ],
    "abstract": "Evaluating the performance of a well-trained GNN model on real-world graphs is a pivotal step for reliable GNN online deployment and serving. Due to a lack of test node labels and unknown potential training-test graph data distribution shifts, conventional model evaluation encounters limitations in calculating performance metrics (e.g., test error) and measuring graph data-level discrepancies, particularly when the training graph used for developing GNNs remains unobserved during test time.In this paper, we study a new research problem, online GNN evaluation, which aims to provide valuable insights into the well-trained GNNs's ability to effectively generalize to real-world unlabeled graphs under the test-time graph distribution shifts.Concretely, we develop an effective learning behavior discrepancy score, dubbed LeBeD, to estimate the test-time generalization errors of well-trained GNN models. Through a novel GNN re-training strategy with a parameter-free optimality criterion, the proposed LeBeD comprehensively integrates learning behavior discrepancies from both node prediction and structure reconstruction perspectives.This enables the effective evaluation of the well-trained GNNs' ability to capture test node semantics and structural representations, making it an expressive metric for estimating the generalization error in online GNN evaluation.Extensive experiments on real-world test graphs under diverse graph distribution shifts could verify the effectiveness of the proposed method, revealing its strong correlation with ground-truth test errors on various well-trained GNN models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=KbetDM33YG",
    "arxiv_id": "2403.09953",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18890,
    "title": "DePT: Decomposed Prompt Tuning for Parameter-Efficient Fine-tuning",
    "authors": [
      "Zhengxiang Shi",
      "Aldo Lipani"
    ],
    "abstract": "Prompt tuning (PT), where a small amount of trainable soft (continuous) prompt vectors is affixed to the input of language models (LM), has shown promising results across various tasks and models for parameter-efficient fine-tuning (PEFT). PT stands out from other PEFT approaches because it maintains competitive performance with fewer trainable parameters and does not drastically scale up its parameters as the model size expands. However, PT introduces additional soft prompt tokens, leading to longer input sequences, which significantly impacts training and inference time and memory usage due to the Transformer's quadratic complexity. Particularly concerning for Large Language Models (LLMs) that face heavy daily querying. To address this issue, we propose Decomposed Prompt Tuning (DePT), which decomposes the soft prompt into a shorter soft prompt and a pair of low-rank matrices that are then optimised with two different learning rates. This allows DePT to achieve better performance while saving substantial memory and time costs compared to vanilla PT and its variants, without changing trainable parameter sizes. Through extensive experiments on 23 natural language processing (NLP) and vision-language (VL) tasks, we demonstrate that DePT outperforms state-of-the-art PEFT approaches, including the full fine-tuning baseline, in some scenarios. Additionally, we empirically show that DEPT grows more efficient as the model size increases. Our further study reveals that DePT integrates seamlessly with parameter-efficient transfer learning in the few-shot learning setting and highlights its adaptability to various model architectures and sizes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KjegfPGRde",
    "arxiv_id": "2309.05173",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18886,
    "title": "Mitigating Emergent Robustness Degradation while Scaling Graph Learning",
    "authors": [
      "Xiangchi Yuan",
      "Chunhui Zhang",
      "Yijun Tian",
      "Yanfang Ye",
      "Chuxu Zhang"
    ],
    "abstract": "Although graph neural networks have exhibited remarkable performance in various graph tasks, a significant concern is their vulnerability to adversarial attacks. Consequently, many defense methods have been proposed to alleviate the deleterious effects of adversarial attacks and learn robust graph representations. However, most of them are difficult to *simultaneously* avoid two major limitations: (i) an emergent and severe degradation in robustness when exposed to very intense attacks, and (ii) heavy computation complexity hinders them from scaling to large graphs. In response to these challenges, we introduce an innovative graph defense method for unpredictable real-world scenarios by *designing a graph robust learning framework that is resistant to robustness degradation* and *refraining from unscalable designs with heavy computation*: specifically, our method employs a denoising module, which eliminates edges that are associated with attacked nodes to reconstruct a cleaner graph; Then, it applies Mixture-of-Experts to select differentially private noises with varying magnitudes to counteract the hidden features attacked at different intensities toward robust predictions; Moreover, our overall design avoids the reliance on heavy adjacency matrix computations, such as SVD, thus facilitating its applicability even on large graphs. Comprehensive experiments have been conducted to demonstrate the anti-degraded robustness and scalability of our method, as compared to popular graph adversarial learning methods, under diverse attack intensities and various datasets of different sizes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Koh0i2u8qX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18204,
    "title": "SweetDreamer: Aligning Geometric Priors in 2D diffusion for Consistent Text-to-3D",
    "authors": [
      "Weiyu Li",
      "Rui Chen",
      "Xuelin Chen",
      "Ping Tan"
    ],
    "abstract": "It is inherently ambiguous to lift 2D results from pre-trained diffusion models to a 3D world for text-to-3D generation. 2D diffusion models solely learn view-agnostic priors and thus lack 3D knowledge during the lifting, leading to the multi-view inconsistency problem. We find that this problem primarily stems from geometric inconsistency, and avoiding misplaced geometric structures substantially mitigates the problem in the final outputs. Therefore, we improve the consistency by aligning the 2D geometric priors in diffusion models with well-defined 3D shapes during the lifting, addressing the vast majority of the problem. This is achieved by fine-tuning the 2D diffusion model to be viewpoint-aware and to produce view-specific coordinate maps of canonically oriented 3D objects. In our process, only coarse 3D information is used for aligning. This \u201ccoarse\u201d alignment not only resolves the multi-view inconsistency in geometries but also retains the ability in 2D diffusion models to generate detailed and diversified high-quality ob-jects unseen in the 3D datasets. Furthermore, our aligned geometric priors (AGP) are generic and can be seamlessly integrated into various state-of-the-art pipelines, obtaining high generalizability in terms of unseen shapes and visual appearance while greatly alleviating the multi-view inconsistency problem. Our method represents a new state-of-the-art performance with a 85+% consistency rate by human evaluation, while many previous methods are around 30%.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=extpNXo6hB",
    "arxiv_id": "2310.02596",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18884,
    "title": "Particle Guidance: non-I.I.D. Diverse Sampling with Diffusion Models",
    "authors": [
      "Gabriele Corso",
      "Yilun Xu",
      "Valentin De Bortoli",
      "Regina Barzilay",
      "Tommi S. Jaakkola"
    ],
    "abstract": "In light of the widespread success of generative models, a significant amount of research has gone into speeding up their sampling time. However, generative models are often sampled multiple times to obtain a diverse set incurring in a cost that is orthogonal to sampling time. We tackle the question of how to improve diversity and sample efficiency by moving beyond the common assumption of independent samples. For this we propose particle guidance, an extension of diffusion-based generative sampling where a joint-particle time-evolving potential enforces diversity. We analyze theoretically the joint distribution that particle guidance generates, its implications on the choice of potential, and the connections with methods in other disciplines. Empirically, we test the framework both in the setting of conditional image generation, where we are able to increase diversity without affecting quality, and molecular conformer generation, where we reduce the state-of-the-art median error by 13% on average.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KqbCvIFBY7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18203,
    "title": "Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity",
    "authors": [
      "Emmeran Johnson",
      "Ciara Pike-Burke",
      "Patrick Rebeschini"
    ],
    "abstract": "We theoretically explore the relationship between sample-efficiency and adaptivity in reinforcement learning. An algorithm is sample-efficient if it uses a number of queries $n$ to the environment that is polynomial in the dimension $d$ of the problem. Adaptivity refers to the frequency at which queries are sent and feedback is processed to update the querying strategy. To investigate this interplay, we employ a learning framework that allows sending queries in $K$ batches, with feedback being processed and queries updated after each batch. This model encompasses the whole adaptivity spectrum, ranging from non-adaptive `offline' ($K=1$) to fully adaptive ($K=n$) scenarios, and regimes in between. For the problems of policy evaluation and best-policy identification under $d$-dimensional linear function approximation, we establish $\\Omega(\\log \\log d)$ lower bounds on the number of batches $K$ required for sample-efficient algorithms with $n = O(poly(d))$ queries. Our results show that just having adaptivity ($K>1$) does not necessarily guarantee sample-efficiency. Notably, the adaptivity-boundary for sample-efficiency is not between offline reinforcement learning ($K=1$), where sample-efficiency was known to not be possible, and adaptive settings. Instead, the boundary lies between different regimes of adaptivity and depends on the problem dimension.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ey3GhWXQ97",
    "arxiv_id": "2310.01616",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18202,
    "title": "AnyText: Multilingual Visual Text Generation and Editing",
    "authors": [
      "Yuxiang Tuo",
      "Wangmeng Xiang",
      "Jun-Yan He",
      "Yifeng Geng",
      "Xuansong Xie"
    ],
    "abstract": "Diffusion model based Text-to-Image has achieved impressive achievements recently. Although current technology for synthesizing images is highly advanced and capable of generating images with high fidelity, it is still possible to give the show away when focusing on the text area in the generated image, as synthesized text often contains blurred, unreadable, or incorrect characters, making visual text generation one of the most challenging issues in this field. To address this issue, we introduce AnyText, a diffusion-based multilingual visual text generation and editing model, that focuses on rendering accurate and coherent text in the image. AnyText comprises a diffusion pipeline with two primary elements: an auxiliary latent module and a text embedding module. The former uses inputs like text glyph, position, and masked image to generate latent features for text generation or editing. The latter employs an OCR model for encoding stroke data as embeddings, which blend with image caption embeddings from the tokenizer to generate texts that seamlessly integrate with the background. We employed text-control diffusion loss and text perceptual loss for training to further enhance writing accuracy. AnyText can write characters in multiple languages, to the best of our knowledge, this is the first work to address multilingual visual text generation. It is worth mentioning that AnyText can be plugged into existing diffusion models from the community for rendering or editing text accurately. After conducting extensive evaluation experiments, our method has outperformed all other approaches by a significant margin. Additionally, we contribute the first large-scale multilingual text images dataset, AnyWord-3M, containing 3 million image-text pairs with OCR annotations in multiple languages. Based on AnyWord-3M dataset, we propose AnyText-benchmark for the evaluation of visual text generation accuracy and quality. Our project will be open-sourced soon to improve and promote the development of text generation technology.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ezBH9WE9s2",
    "arxiv_id": "2311.03054",
    "GitHub": [
      "https://github.com/tyxsspa/AnyText"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18201,
    "title": "Convolution Meets LoRA: Parameter Efficient Finetuning for Segment Anything Model",
    "authors": [
      "Zihan Zhong",
      "Zhiqiang Tang",
      "Tong He",
      "Haoyang Fang",
      "Chun Yuan"
    ],
    "abstract": "The Segment-Anything Model (SAM) stands as a foundational framework for image segmentation. While it exhibits remarkable zero-shot generalization in typical scenarios, its advantage diminishes when applied to specialized domains like medical imagery and remote sensing. To address this limitation, this paper introduces Conv-LoRA, a simple yet effective parameter-efficient fine-tuning approach. By integrating ultra-lightweight convolutional parameters into LoRA, Conv-LoRA can inject image-related inductive biases into the plain ViT encoder, further reinforcing SAM\u2019s local prior assumption. Notably, Conv-LoRA not only preserves SAM\u2019s extensive segmentation knowledge but also revives its capacity of learning high-level image semantics, which is constrained by SAM\u2019s foreground-background segmentation pretraining. Comprehensive experimentation across diverse benchmarks spanning multiple domains underscores Conv-LoRA\u2019s superiority in adapting SAM to real-world semantic segmentation tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ezscMer8L0",
    "arxiv_id": "2401.17868",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18880,
    "title": "Teaching Large Language Models to Self-Debug",
    "authors": [
      "Xinyun Chen",
      "Maxwell Lin",
      "Nathanael Sch\u00e4rli",
      "Denny Zhou"
    ],
    "abstract": "Large language models (LLMs) have achieved impressive performance on code generation. However, for complex programming tasks, generating the correct solution in one go becomes challenging, thus some prior works have designed program repair approaches to improve code generation performance. In this work, we propose self-debugging, which teaches a large language model to debug its predicted program. In particular, we demonstrate that self-debugging can teach the large language model to perform rubber duck debugging; i.e., without any human feedback on the code correctness or error messages, the model is able to identify its mistakes by leveraging code execution and explaining the generated code in natural language. Self-debugging achieves the state-of-the-art performance on several code generation benchmarks, including the Spider dataset for text-to-SQL generation, TransCoder for C++-to-Python translation, and MBPP for text-to-Python generation. On the Spider benchmark where there are no unit tests to verify the correctness of predictions, self-debugging with code explanation consistently improves the baseline by 2-3%, and improves the prediction accuracy on problems of the hardest level by 9%. On TransCoder and MBPP where unit tests are available, self-debugging improves the baseline accuracy by up to 12%. Meanwhile, by leveraging feedback messages and reusing failed predictions, self-debugging notably improves sample efficiency, and can match or outperform baseline models that generate more than 10$\\times$ candidate programs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KuPixIqPiq",
    "arxiv_id": "2304.05128",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18200,
    "title": "Cycle Consistency Driven Object Discovery",
    "authors": [
      "Aniket Rajiv Didolkar",
      "Anirudh Goyal",
      "Yoshua Bengio"
    ],
    "abstract": "Developing deep learning models that effectively learn object-centric representations, akin to human cognition, remains a challenging task. Existing approaches facilitate object discovery by representing objects as fixed-size vectors, called ``slots'' or ``object files''. While these approaches have shown promise in certain scenarios, they still exhibit certain limitations. First, they rely on architectural priors which can be unreliable and usually require meticulous engineering to identify the correct objects. Second, there has been a notable gap in investigating the practical utility of these representations in downstream tasks. To address the first limitation, we introduce a method that explicitly optimizes the constraint that each object in a scene should be associated with a distinct slot. We formalize this constraint by introducing  consistency objectives which are cyclic in nature. By integrating these consistency objectives into various existing slot-based object-centric methods, we showcase substantial improvements in object-discovery performance. These enhancements consistently hold true across both synthetic and real-world scenes, underscoring the effectiveness and adaptability of the proposed approach. To tackle the second limitation, we apply the learned object-centric representations from the proposed method to two downstream reinforcement learning tasks, demonstrating considerable performance enhancements compared to conventional slot-based and monolithic representation learning methods. Our results suggest that the proposed approach not only improves object discovery, but also provides richer features for downstream tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=f1xnBr4WD6",
    "arxiv_id": "2306.02204",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18198,
    "title": "UniAdapter: Unified Parameter-Efficient Transfer Learning for Cross-modal Modeling",
    "authors": [
      "Haoyu Lu",
      "Yuqi Huo",
      "Guoxing Yang",
      "Zhiwu Lu",
      "Wei Zhan",
      "Masayoshi Tomizuka",
      "Mingyu Ding"
    ],
    "abstract": "Large-scale vision-language pre-trained models have shown promising transferability to various downstream tasks. As the size of these foundation models and the number of downstream tasks grow, the standard full fine-tuning paradigm becomes unsustainable due to heavy computational and storage costs. This paper proposes UniAdapter, which unifies unimodal and multimodal adapters for parameter-efficient cross-modal adaptation on pre-trained vision-language models. Specifically, adapters are distributed to different modalities and their interactions, with the total number of tunable parameters reduced by partial weight sharing. The unified and knowledge-sharing design enables powerful cross-modal representations that can benefit various downstream tasks, requiring only 1.0%-2.0% tunable parameters of the pre-trained model. Extensive experiments on 7 cross-modal downstream benchmarks (including video-text retrieval, image-text retrieval, VideoQA, VQA and Caption) show that in most cases, UniAdapter not only outperforms the state-of-the-arts, but even beats the full fine-tuning strategy. Particularly, on the MSRVTT retrieval task, UniAdapter achieves 49.7% recall@1 with 2.2% model parameters, outperforming the latest competitors by 2.0%. The code and models are available at https://github.com/UniAdapter/UniAdapter.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=f5H8WGLQm5",
    "arxiv_id": "2302.06605",
    "GitHub": [
      "https://github.com/RERV/UniAdapter"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18196,
    "title": "DIAGNOSIS: Detecting Unauthorized Data Usages in Text-to-image Diffusion Models",
    "authors": [
      "Zhenting Wang",
      "Chen Chen",
      "Lingjuan Lyu",
      "Dimitris N. Metaxas",
      "Shiqing Ma"
    ],
    "abstract": "Recent text-to-image diffusion models have shown surprising performance in generating high-quality images. However, concerns have arisen regarding the unauthorized data usage during the training or fine-tuning process. One example is when a model trainer collects a set of images created by a particular artist and attempts to train a model capable of generating similar images without obtaining permission and giving credit to the artist. To address this issue, we propose a method for detecting such unauthorized data usage by planting the injected memorization into the text-to-image diffusion models trained on the protected dataset. Specifically, we modify the protected images by adding unique contents on these images using stealthy image warping functions that are nearly imperceptible to human but can be captured and memorized by diffusion models. By analyzing whether the model has memorized the injected content (i.e., whether the generated images are processed by the injected post-processing function), we can detect models that had illegally utilized the unauthorized data. Experiments on Stable Diffusion and VQ Diffusion with different model training or fine-tuning methods (i.e, LoRA, DreamBooth, and standard training) demonstrate the effectiveness of our proposed method in detecting unauthorized data usages.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=f8S3aLm0Vp",
    "arxiv_id": "2307.03108",
    "GitHub": [
      "https://github.com/ZhentingWang/DIAGNOSIS"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18856,
    "title": "Instructive Decoding: Instruction-Tuned Large Language Models are Self-Refiner from Noisy Instructions",
    "authors": [
      "Taehyeon Kim",
      "Joonkee Kim",
      "Gihun Lee",
      "Se-Young Yun"
    ],
    "abstract": "While instruction-tuned language models have demonstrated impressive zero-shot generalization, these models often struggle to generate accurate responses when faced with instructions that fall outside their training set. This paper presents Instructive Decoding (ID), a simple yet effective approach that augments the efficacy of instruction-tuned models. Specifically, ID adjusts the logits for next-token prediction in a contrastive manner, utilizing predictions generated from a manipulated version of the original instruction, referred to as a noisy instruction. This noisy instruction aims to elicit responses that could diverge from the intended instruction yet remain plausible. We conduct experiments across a spectrum of such noisy instructions, ranging from those that insert semantic noise via random words to others like 'opposite' that elicit the deviated responses. Our approach achieves considerable performance gains across various instruction-tuned models and tasks without necessitating any additional parameter updates. Notably, utilizing 'opposite' as the noisy instruction in ID, which shows the maximum divergence from the original instruction, consistently produces the most significant performance gains across multiple models and tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=LebzzClHYw",
    "arxiv_id": "2311.00233",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18195,
    "title": "Pre-training LiDAR-based 3D Object Detectors through Colorization",
    "authors": [
      "Tai-Yu Pan",
      "Chenyang Ma",
      "Tianle Chen",
      "Cheng Perng Phoo",
      "Katie Z Luo",
      "Yurong You",
      "Mark Campbell",
      "Kilian Q Weinberger",
      "Bharath Hariharan",
      "Wei-Lun Chao"
    ],
    "abstract": "Accurate 3D object detection and understanding for self-driving cars heavily relies on LiDAR point clouds, necessitating large amounts of labeled data to train. In this work, we introduce an innovative pre-training approach, Grounded Point Colorization (GPC), to bridge the gap between data and labels by teaching the model to colorize LiDAR point clouds, equipping it with valuable semantic cues. To tackle challenges arising from color variations and selection bias, we incorporate color as \"context\" by providing ground-truth colors as hints during colorization.Experimental results on the KITTI and Waymo datasets demonstrate GPC's remarkable effectiveness. Even with limited labeled data, GPC significantly improves fine-tuning performance; notably, on just 20% of the KITTI dataset, GPC outperforms training from scratch with the entire dataset. In sum, we introduce a fresh perspective on pre-training for 3D object detection, aligning the objective with the model's intended role and ultimately advancing the accuracy and efficiency of 3D object detection for autonomous vehicles.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fB1iiH9xo7",
    "arxiv_id": "2310.14592",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18193,
    "title": "Near-Optimal Solutions of Constrained Learning Problems",
    "authors": [
      "Juan Elenter",
      "Luiz F. O. Chamon",
      "Alejandro Ribeiro"
    ],
    "abstract": "With the widespread adoption of machine learning systems, the need to curtail their behavior has become increasingly apparent. This is evidenced by recent advancements towards developing models that satisfy robustness, safety and fairness requirements. Imposing these requirements leads to constrained learning problems, which can be tackled with dual ascent methods. However, convergence guarantees for dual ascent algorithms typically involve a randomized or averaged sequence of primal iterates. These solutions are impractical, since they require storing an ever growing sequence of models. Although it has been observed that final iterates perform well in practice, theoretical guarantees for their optimality and feasibility have remained elusive. In this work, we characterize the infeasibility of Lagrangian minimizers associated with optimal dual variables, which leads to a sub-optimality bound for best primal iterates. To do this, we leverage the fact that constrained learning problems are parametrized versions of convex functional programs. This bound sheds light on how the richness of the parametrization and the curvature of the objective impact the convergence of primal iterates. We empirically validate this finding in learning problems with fairness constraints.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fDaLmkdSKU",
    "arxiv_id": "2403.11844",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18194,
    "title": "Zero-Shot Robustification of Zero-Shot Models",
    "authors": [
      "Dyah Adila",
      "Changho Shin",
      "Linrong Cai",
      "Frederic Sala"
    ],
    "abstract": "Zero-shot inference is a powerful paradigm that enables the use of large pretrained models for downstream classification tasks without further training. However, these models are vulnerable to inherited biases that can impact their performance. The traditional solution is fine-tuning, but this undermines the key advantage of pretrained models, which is their ability to be used out-of-the-box. We propose RoboShot, a method that improves the robustness of pretrained model embeddings in a fully zero-shot fashion. First, we use language models (LMs) to obtain useful insights from task descriptions. These insights are embedded and used to remove harmful and boost useful components in embeddings---without any supervision. Theoretically, we provide a simple and tractable model for biases in zero-shot embeddings and give a result characterizing under what conditions our approach can boost performance. Empirically, we evaluate RoboShot on nine image and NLP classification tasks and show an average improvement of 15.98% over several zero-shot baselines. Additionally, we demonstrate that RoboShot is compatible with a variety of pretrained and language models and propose a way to further boost performance with a zero-shot adaptation variant.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fCeUoDr9Tq",
    "arxiv_id": "2309.04344",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18850,
    "title": "A Graph is Worth 1-bit Spikes: When Graph Contrastive Learning Meets Spiking Neural Networks",
    "authors": [
      "Jintang Li",
      "Huizhe Zhang",
      "Ruofan Wu",
      "Zulun Zhu",
      "Baokun Wang",
      "Changhua Meng",
      "Zibin Zheng",
      "Liang Chen"
    ],
    "abstract": "While contrastive self-supervised learning has become the de-facto learning paradigm for graph neural networks, the pursuit of higher task accuracy requires a larger hidden dimensionality to learn informative and discriminative full-precision representations, raising concerns about computation, memory footprint, and energy consumption burden (largely overlooked) for real-world applications. This work explores a promising direction for graph contrastive learning (GCL) with spiking neural networks (SNNs), which leverage sparse and binary characteristics to learn more biologically plausible and compact representations. We propose SpikeGCL, a novel GCL framework to learn binarized 1-bit representations for graphs, making balanced trade-offs between efficiency and performance. We provide theoretical guarantees to demonstrate that SpikeGCL has comparable expressiveness with its full-precision counterparts. Experimental results demonstrate that, with nearly 32x representation storage compression, SpikeGCL is either comparable to or outperforms many fancy state-of-the-art supervised and self-supervised methods across several graph benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LnLySuf1vp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18847,
    "title": "Sign2GPT: Leveraging Large Language Models for Gloss-Free Sign Language Translation",
    "authors": [
      "Ryan Wong",
      "Necati Cihan Camgoz",
      "Richard Bowden"
    ],
    "abstract": "Automatic Sign Language Translation requires the integration of both computer vision and natural language processing to effectively bridge the communication gap between sign and spoken languages. However, the deficiency in large-scale training data to support sign language translation means we need to leverage resources from spoken language. We introduce, Sign2GPT, a novel framework for sign language translation that utilizes large-scale pretrained vision and language models via lightweight adapters for gloss-free sign language translation. The lightweight adapters are crucial for sign language translation, due to the constraints imposed by limited dataset sizes and the computational requirements when training with long sign videos.We also propose a novel pretraining strategy that directs our encoder to learn sign representations from automatically extracted pseudo-glosses without requiring gloss order information or annotations.We evaluate our approach on two public benchmark sign language translation datasets, namely RWTH-PHOENIX-Weather 2014T and CSL-Daily, and improve on state-of-the-art gloss-free translation performance with a significant margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LqaEEs3UxU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18192,
    "title": "CoLiDE: Concomitant Linear DAG Estimation",
    "authors": [
      "Seyed Saman Saboksayr",
      "Gonzalo Mateos",
      "Mariano Tepper"
    ],
    "abstract": "We deal with the combinatorial problem of learning directed acyclic graph (DAG) structure from observational data adhering to a linear structural equation model (SEM). Leveraging advances in differentiable, nonconvex characterizations of acyclicity, recent efforts have advocated a continuous constrained optimization paradigm to efficiently explore the space of DAGs. Most existing methods employ lasso-type score functions to guide this search, which (i) require expensive penalty parameter retuning when the \\emph{unknown} SEM noise variances change across problem instances; and (ii) implicitly rely on limiting homoscedasticity assumptions. In this work, we propose a new convex score function for sparsity-aware learning of linear DAGs, which incorporates concomitant estimation of scale and thus effectively decouples the sparsity parameter from noise levels. Regularization via a smooth, nonconvex acyclicity penalty term yields CoLiDE ($\\textbf{Co}$ncomitant $\\textbf{Li}$near $\\textbf{D}$AG $\\textbf{E}$stimation), a regression-based criterion amenable to efficient gradient computation and closed-form estimation of exogenous noise levels in heteroscedastic scenarios. Our algorithm outperforms state-of-the-art methods without incurring added complexity, especially when the DAGs are larger and the noise level profile is heterogeneous. We also find CoLiDE exhibits enhanced stability manifested via reduced standard deviations in several domain-specific metrics, underscoring the robustness of our novel linear DAG estimator.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fGAIgO75dG",
    "arxiv_id": "2310.02895",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18191,
    "title": "Magnitude Invariant Parametrizations Improve Hypernetwork Learning",
    "authors": [
      "Jose Javier Gonzalez Ortiz",
      "John Guttag",
      "Adrian V Dalca"
    ],
    "abstract": "Hypernetworks, neural networks that predict the parameters of another neural network, are powerful models that have been successfully used in diverse applications from image generation to multi-task learning. Unfortunately, existing hypernetworks are often challenging to train. Training typically converges far more slowly than for non-hypernetwork models, and the rate of convergence can be very sensitive to hyperparameter choices. In this work, we identify a fundamental and previously unidentified problem that contributes to the challenge of training hypernetworks: a magnitude proportionality between the inputs and outputs of the hypernetwork. We demonstrate both analytically and empirically that this can lead to unstable optimization, thereby slowing down convergence, and sometimes even preventing any learning. We present a simple solution to this problem using a revised hypernetwork formulation that we call Magnitude Invariant Parametrizations (MIP). We demonstrate the proposed solution on several hypernetwork tasks, where it consistently stabilizes training and achieves faster convergence. Furthermore, we perform a comprehensive ablation study including choices of activation function, normalization strategies, input dimensionality, and hypernetwork architecture; and find that MIP improves training in all scenarios. We provide easy-to-use code that can turn existing networks into MIP-based hypernetworks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fJNnerz6iH",
    "arxiv_id": "2304.07645",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18190,
    "title": "Convergence of Bayesian Bilevel Optimization",
    "authors": [
      "Shi Fu",
      "Fengxiang He",
      "Xinmei Tian",
      "Dacheng Tao"
    ],
    "abstract": "This paper presents the first theoretical guarantee for Bayesian bilevel optimization (BBO) that we term for the prevalent bilevel framework combining Bayesian optimization at the outer level to tune hyperparameters, including the inner-level stochastic gradient descent (SGD). We prove sublinear regret bounds suggesting simultaneous convergence of the inner-level model parameters and outer-level hyperparameters to optimal configurations for generalization capability. A pivotal, technical novelty in the proofs is modeling the excess risk of the SGD-trained parameters as evaluation noise during Bayesian optimization. Our theory implies the inner unit horizon, defined as the number of SGD iterations, shapes the convergence behavior of BBO. This suggests practical guidance on configuring the inner unit horizon to enhance training efficiency and model performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=fLXpXa7iiz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18189,
    "title": "$\\mathcal{B}$-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis",
    "authors": [
      "Zishun Yu",
      "Yunzhe Tao",
      "Liyu Chen",
      "Tao Sun",
      "Hongxia Yang"
    ],
    "abstract": "Program synthesis aims to create accurate, executable code from natural language descriptions. This field has leveraged the power of reinforcement learning (RL) in conjunction with large language models (LLMs), significantly enhancing code generation capabilities. This integration focuses on directly optimizing functional correctness, transcending conventional supervised losses. While current literature predominantly favors policy-based algorithms, attributes of program synthesis suggest a natural compatibility with value-based methods. This stems from rich collection of off-policy programs developed by human programmers, and the straightforward verification of generated programs through automated unit testing (i.e. easily obtainable rewards in RL language). Diverging from the predominant use of policy-based algorithms, our work explores the applicability of value-based approaches, leading to the development of our $\\mathcal{B}$-Coder (pronounced Bellman coder). Yet, training value-based methods presents challenges due to the enormous search space inherent to program synthesis. To this end, we propose an initialization protocol for RL agents utilizing pre-trained LMs and a conservative Bellman operator to reduce training complexities. Moreover, we demonstrate how to leverage the learned value functions as a dual strategy to post-process generated programs. Our empirical evaluations demonstrated $\\mathcal{B}$-Coder's capability in achieving state-of-the-art performance compared with policy-based methods. Remarkably, this achievement is reached with minimal reward engineering effort, highlighting the effectiveness of value-based RL, independent of reward designs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=fLf589bx1f",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18188,
    "title": "Unveiling the Pitfalls of Knowledge Editing for Large Language Models",
    "authors": [
      "Zhoubo Li",
      "Ningyu Zhang",
      "Yunzhi Yao",
      "Mengru Wang",
      "Xi Chen",
      "Huajun Chen"
    ],
    "abstract": "As the cost associated with fine-tuning Large Language Models (LLMs) continues to rise, recent research efforts have pivoted towards developing methodologies to edit implicit knowledge embedded within LLMs. Yet, there's still a dark cloud lingering overhead -- will knowledge editing trigger butterfly effect? since it is still unclear whether knowledge editing might introduce side effects that pose potential risks or not. This paper pioneers the investigation into the potential pitfalls associated with knowledge editing for LLMs. To achieve this, we introduce new benchmark datasets and propose innovative evaluation metrics. Our results underline two pivotal concerns: (1) Knowledge Conflict: Editing groups of facts that logically clash can magnify the inherent inconsistencies in LLMs\u2014a facet neglected by previous methods. (2) Knowledge Distortion: Altering parameters with the aim of editing factual knowledge can irrevocably warp the innate knowledge structure of LLMs. Experimental results vividly demonstrate that knowledge editing might inadvertently cast a shadow of unintended consequences on LLMs, which warrant attention and efforts for future works. Codes are in the supplementary materials and will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fNktD3ib16",
    "arxiv_id": "2310.02129",
    "GitHub": [
      "https://github.com/zjunlp/PitfallsKnowledgeEditing"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18187,
    "title": "Unifying Feature and Cost Aggregation with Transformers for Semantic and Visual Correspondence",
    "authors": [
      "Sunghwan Hong",
      "Seokju Cho",
      "Seungryong Kim",
      "Stephen Lin"
    ],
    "abstract": "This paper introduces a Transformer-based integrative feature and cost aggregation network designed for dense matching tasks. In the context of dense matching, many works benefit from one of two forms of aggregation: feature aggregation, which pertains to the alignment of similar features, or cost aggregation, a procedure aimed at instilling coherence in the flow estimates across neighboring pixels. In this work, we first show that feature aggregation and cost aggregation exhibit distinct characteristics and reveal the potential for substantial benefits stemming from the judicious use of both aggregation processes. We then introduce a simple yet effective architecture that harnesses self- and cross-attention mechanisms to show that our approach unifies feature aggregation and cost aggregation and effectively harnesses the strengths of both techniques. Within the proposed attention layers, the features and cost volume both complement each other, and the attention layers are interleaved through a coarse-to-fine design to further promote accurate correspondence estimation. Finally at inference, our network produces multi-scale predictions, computes their confidence scores, and selects the most confident flow for final prediction. Our framework is evaluated on standard benchmarks for semantic matching, and also applied to geometric matching, where we show that our approach achieves significant improvements compared to existing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fQHb1uZzl7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18185,
    "title": "Nougat: Neural Optical Understanding for Academic Documents",
    "authors": [
      "Lukas Blecher",
      "Guillem Cucurull",
      "Thomas Scialom",
      "Robert Stojnic"
    ],
    "abstract": "Scientific knowledge is predominantly stored in books and scientific journals, often in the form of PDFs. However, the PDF format leads to a loss of semantic information, particularly for mathematical expressions. We propose Nougat (Neural Optical Understanding for Academic Documents), a Visual Transformer model that performs an Optical Character Recognition (OCR) task for processing scientific documents into a markup language, and demonstrate the effectiveness of our model on a new dataset of scientific documents. The proposed approach offers a promising solution to enhance the accessibility of scientific knowledge in the digital age, by bridging the gap between human- readable documents and machine-readable text. We release the models and code to accelerate future work on scientific text recognition.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fUtxNAKpdV",
    "arxiv_id": "2308.13418",
    "GitHub": [
      "https://github.com/facebookresearch/nougat"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18184,
    "title": "An interpretable error correction method for enhancing code-to-code translation",
    "authors": [
      "Min Xue",
      "Artur Andrzejak",
      "Marla Leuther"
    ],
    "abstract": "Transformer-based machine translation techniques currently dominate the field of program translation. However, these models pose challenges in explaining program translations. Moreover, researchers frequently invest substantial time and computational resources in retraining models, yet the improvement in translation accuracy is quite limited.To address these issues, we introduce a novel approach, $k\\text{NN-ECD}$, which combines $k$-nearest-neighbor search with a key-value error correction datastore to overwrite the wrong translations of TransCoder-ST. This provides a decision-making basis for interpreting the corrected translations. Building upon this, we further propose $k\\text{NN-ECS}_{m}$, a methodology that employs a distributed structure with $m$ sub-datastores connected in series,  utilizing $m$ diverse experts for multi-round error correction. Additionally, we put forward a unified name rule, encouraging the datastore to focus more on code logic and structure rather than diverse rare identifiers. Our experimental results show that our approach improves the translation accuracy from 68.9\\% to 89.9\\% of TransCoder-ST (for translation from Java to Python). This error correction method augments program translation, overcoming the inherent limitations of Transformer-based code translation models, such as resource-intensive retraining requirements and uninterpretable outcomes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fVxIEHGnVT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18183,
    "title": "Consistent Multi-Class Classification from Multiple Unlabeled Datasets",
    "authors": [
      "Zixi Wei",
      "Senlin Shu",
      "Yuzhou Cao",
      "Hongxin Wei",
      "Bo An",
      "Lei Feng"
    ],
    "abstract": "Weakly supervised learning aims to construct effective predictive models from imperfectly labeled data. The recent trend of weakly supervised learning has focused on how to learn an accurate classifier from completely unlabeled data, given little supervised information such as class priors. In this paper, we consider a newly proposed weakly supervised learning problem called multi-class classification from multiple unlabeled datasets, where only multiple sets of unlabeled data and their class priors (i.e., the proportions of each class) are provided for training the classifier. To solve this problem, we first propose a classifier-consistent method (CCM) based on a probability transition matrix. However, CCM cannot guarantee risk consistency and lacks of purified supervision information during training. Therefore, we further propose a risk-consistent method (RCM) that progressively purifies supervision information during training by importance weighting. We provide comprehensive theoretical analyses for our methods to demonstrate the statistical consistency. Experimental results on multiple benchmark datasets and various prior matrices demonstrate the superiority of our proposed methods.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=fW7DOHDQvF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18182,
    "title": "A Paradigm Shift in Machine Translation: Boosting Translation Performance of Large Language Models",
    "authors": [
      "Haoran Xu",
      "Young Jin Kim",
      "Amr Sharaf",
      "Hany Hassan Awadalla"
    ],
    "abstract": "Generative Large Language Models (LLMs) have achieved remarkable advancements in various NLP tasks. However, these advances have not been reflected in the translation task, especially those with moderate model sizes (i.e., 7B or 13B parameters), which still lag behind conventional supervised encoder-decoder translation models. Previous studies have attempted to improve the translation capabilities of these LLMs, but their gains have been limited. In this study, we propose a novel fine-tuning approach for LLMs that is specifically designed for the translation task, eliminating the need for the abundant parallel data that traditional translation models usually depend on.Our approach consists of two fine-tuning stages: initial fine-tuning on monolingual data followed by subsequent fine-tuning on a small set of high-quality parallel data.  We introduce the LLM  developed through this strategy as **A**dvanced **L**anguage **M**odel-based tr**A**nslator (**ALMA**). Based on LLaMA-2 as our underlying model, our results show that the model can achieve an average improvement of more than 12 BLEU and 12 COMET over its zero-shot performance across 10 translation directions from the WMT'21 (2 directions) and WMT'22 (8 directions) test datasets. The performance is significantly better than all prior work and even superior to the NLLB-54B model \\citep{nllb} and GPT-3.5-text-davinci-003, with only 7B or 13B parameters. This method establishes the foundation for a novel training paradigm in machine translation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=farT6XXntP",
    "arxiv_id": "2309.11674",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18181,
    "title": "AuG-KD: Anchor-Based Mixup Generation for Out-of-Domain Knowledge Distillation",
    "authors": [
      "Zihao TANG",
      "Zheqi Lv",
      "Shengyu Zhang",
      "Yifan Zhou",
      "Xinyu Duan",
      "Fei Wu",
      "Kun Kuang"
    ],
    "abstract": "Due to privacy or patent concerns, a growing number of large models are released without granting access to their training data, making transferring their knowledge inefficient and problematic. In response, Data-Free Knowledge Distillation (DFKD) methods have emerged as direct solutions. However, simply adopting models derived from DFKD for real-world applications suffers significant performance degradation, due to the discrepancy between teachers' training data and real-world scenarios (student domain). The degradation stems from the portions of teachers' knowledge that are not applicable to the student domain. They are specific to the teacher domain and would undermine students' performance. Hence, selectively transferring teachers' appropriate knowledge becomes the primary challenge in DFKD. In this work, we propose a simple but effective method AuG-KD. It utilizes an uncertainty-guided and sample-specific anchor to align student-domain data with the teacher domain and leverages a generative method to progressively trade off the learning process between OOD knowledge distillation and domain-specific information learning via mixup learning. Extensive experiments in 3 datasets and 8 settings demonstrate the stability and superiority of our approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fcqWJ8JgMR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18178,
    "title": "REFACTOR: Learning to Extract Theorems from Proofs",
    "authors": [
      "Jin Peng Zhou",
      "Yuhuai Wu",
      "Qiyang Li",
      "Roger Baker Grosse"
    ],
    "abstract": "Human mathematicians are often good at recognizing modular and reusable theorems that make complex mathematical results within reach. In this paper, we propose a novel method called theoREm-from-prooF extrACTOR (REFACTOR) for training neural networks to mimic this ability in formal mathematical theorem proving. We show on a set of unseen proofs, REFACTOR is able to extract 19.6\\% of the theorems that humans would use to write the proofs. When applying the model to the existing Metamath library, REFACTOR extracted 16 new theorems. With newly extracted theorems, we show that the existing proofs in the MetaMath database can be refactored. The new theorems are used very frequently after refactoring, with an average usage of 733.5 times, and help shorten the proof lengths. Lastly, we demonstrate that the prover trained on the new-theorem refactored dataset proves more test theorems and outperforms state-of-the-art baselines by frequently leveraging a diverse set of newly extracted theorems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fgKjiVrm6u",
    "arxiv_id": "2402.17032",
    "GitHub": [
      "https://github.com/jinpz/refactor"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18176,
    "title": "GAIA: a benchmark for General AI Assistants",
    "authors": [
      "Gr\u00e9goire Mialon",
      "Cl\u00e9mentine Fourrier",
      "Thomas Wolf",
      "Yann LeCun",
      "Thomas Scialom"
    ],
    "abstract": "We introduce GAIA, a benchmark for General AI Assistants that, if solved, would represent a milestone in AI research. GAIA proposes real-world questions that require a set of fundamental abilities such as reasoning, multi-modality handling, web browsing, and generally tool-use proficiency. Our questions allow simple, fast, and factual verification. GAIA questions are conceptually simple for humans yet challenging for most advanced AIs: we show that human respondents obtain 92\\% vs. 15\\% for GPT-4 equipped with plugins. This notable performance disparity contrasts with the recent trend of LLMs outperforming humans on  tasks requiring professional skills in e.g. law or chemistry. GAIA's philosophy departs from the current trend in AI benchmarks suggesting to target tasks that are ever more difficult for humans. We posit that the advent of Artificial General Intelligence (AGI) hinges on a system's capability to exhibit similar robustness as the average human does on such questions. Using GAIA's methodology, we devise 466 questions and their answer. We release our questions while retaining answers to 300 of them to power a leader-board \\href{https://huggingface.co/xxx}{hereby accessible}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fibxvahvs3",
    "arxiv_id": "2311.12983",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18175,
    "title": "Stochastic Gradient Descent for Gaussian Processes Done Right",
    "authors": [
      "Jihao Andreas Lin",
      "Shreyas Padhy",
      "Javier Antoran",
      "Austin Tripp",
      "Alexander Terenin",
      "Csaba Szepesvari",
      "Jos\u00e9 Miguel Hern\u00e1ndez-Lobato",
      "David Janz"
    ],
    "abstract": "We study the optimisation problem associated with Gaussian process regression using squared loss. The most common approach to this problem is to apply an exact solver, such as conjugate gradient descent, either directly on the problem or on a reduced-order version of it. However, stochastic gradient descent has recently gained traction in the Gaussian process literature, driven largely by its successes in deep learning. In this paper, we show that this approach when done right---by which we mean using specific insights from the optimisation and kernel communities---is highly effective.We thus introduce a particular stochastic dual gradient descent algorithm, conveniently implementable with a few lines of code using any deep learning framework. We explain our design decisions by illustrating their advantage against alternatives with ablation studies.We then show that the new method is highly competitive: our evaluations on standard regression benchmarks and a Bayesian optimisation task set our approach apart from conjugate gradients, variational Gaussian process approximations, and a prior version of stochastic gradient descent tailored for Gaussian processes. On a molecular binding affinity prediction task, our method places Gaussian process regression on par in terms of performance with graph neural networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fj2E5OcLFn",
    "arxiv_id": "2310.20581",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18174,
    "title": "New Insight of Variance reduce in Zero-Order Hard-Thresholding: Mitigating Gradient Error and Expansivity Contradictions",
    "authors": [
      "Xinzhe Yuan",
      "William de Vazelhes",
      "Bin Gu",
      "Huan Xiong"
    ],
    "abstract": "Hard-thresholding is an important type of algorithm in machine learning that is used to solve $\\ell_0$ constrained optimization problems. However,  the true gradient of the objective function can be difficult to access in certain scenarios, which normally can be approximated by zeroth-order (ZO) methods. SZOHT algorithm is the only algorithm tackling $\\ell_0$ sparsity constraints with zeroth-order gradients so far. Unfortunately,  SZOHT  has a notable limitation on the number of random directions due to the inherent conflict between the deviation of ZO gradients and the expansivity of the hard-thresholding operator. This paper approaches this problem by considering the role of variance and provides a new insight into variance reduction: mitigating the unique conflicts between ZO gradients and hard-thresholding.  Under this perspective, we propose a generalized variance reduced ZO hard-thresholding algorithm as well as the generalized convergence analysis under standard assumptions. The theoretical results demonstrate the new algorithm eliminates the restrictions on the number of random directions, leading to improved convergence rates and broader applicability compared with SZOHT.  Finally, we illustrate the utility of our method on a portfolio optimization problem as well as black-box adversarial attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fjf3YenThE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18828,
    "title": "SyncDreamer: Generating Multiview-consistent Images from a Single-view Image",
    "authors": [
      "Yuan Liu",
      "Cheng Lin",
      "Zijiao Zeng",
      "Xiaoxiao Long",
      "Lingjie Liu",
      "Taku Komura",
      "Wenping Wang"
    ],
    "abstract": "In this paper, we present a novel diffusion model called SyncDreamer that generates multiview-consistent images from a single-view image. Using pretrained large-scale 2D diffusion models, recent work Zero123 demonstrates the ability to generate plausible novel views from a single-view image of an object. However, maintaining consistency in geometry and colors for the generated images remains a challenge. To address this issue, we propose a synchronized multiview diffusion model that models the joint probability distribution of multiview images, enabling the generation of multiview-consistent images in a single reverse process. SyncDreamer synchronizes the intermediate states of all the generated images at every step of the reverse process through a 3D-aware feature attention mechanism that correlates the corresponding features across different views. Experiments show that SyncDreamer generates images with high consistency across different views, thus making it well-suited for various 3D generation tasks such as novel-view-synthesis, text-to-3D, and image-to-3D.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=MN3yH2ovHb",
    "arxiv_id": "2309.03453",
    "GitHub": [
      "https://github.com/liuyuan-pal/SyncDreamer"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18173,
    "title": "Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting",
    "authors": [
      "Aleksei Ustimenko",
      "Aleksandr Beznosikov"
    ],
    "abstract": "This work considers a rather general and broad class of Markov chains, Ito chains that look like Euler-Maryama discretization of some Stochastic Differential Equation. The chain we study is a unified framework for theoretical analysis. It comes with almost arbitrary isotropic and state-dependent noise instead of normal and state-independent one, as in most related papers. Moreover, the drift and diffusion coefficient in our chain can be inexact to cover a wide range of applications such as Stochastic Gradient Langevin Dynamics, sampling, Stochastic Gradient Descent, or Stochastic Gradient Boosting. We prove the bound in $\\mathcal{W}_2$-distance between the laws of our Ito chain and the corresponding differential equation. These results improve or cover most of the known estimates. Moreover, for some particular cases, our analysis is the first.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fjpfCOV4ru",
    "arxiv_id": "2310.06081",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18172,
    "title": "Efficient Dynamics Modeling in Interactive Environments with Koopman Theory",
    "authors": [
      "Arnab Kumar Mondal",
      "Siba Smarak Panigrahi",
      "Sai Rajeswar",
      "Kaleem Siddiqi",
      "Siamak Ravanbakhsh"
    ],
    "abstract": "The accurate modeling of dynamics in interactive environments is critical for successful long-range prediction. Such a capability could advance Reinforcement Learning (RL) and Planning algorithms, but achieving it is challenging. Inaccuracies in model estimates can compound, resulting in increased errors over long horizons.We approach this problem from the lens of Koopman theory, where the nonlinear dynamics of the environment can be linearized in a high-dimensional latent space. This allows us to efficiently parallelize the sequential problem of long-range prediction using convolution while accounting for the agent's action at every time step.Our approach also enables stability analysis and better control over gradients through time. Taken together, these advantages result in significant improvement over the existing approaches, both in the efficiency and the accuracy of modeling dynamics over extended horizons. We also show that this model can be easily incorporated into dynamics modeling for model-based planning and model-free RL and report promising experimental results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fkrYDQaHOJ",
    "arxiv_id": "2306.11941",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18169,
    "title": "Are Human-generated Demonstrations Necessary for In-context Learning?",
    "authors": [
      "Rui Li",
      "Guoyin Wang",
      "Jiwei Li"
    ],
    "abstract": "Despite the promising few-shot ability of large language models (LLMs), the standard paradigm of In-context Learning (ICL) suffers the disadvantages of susceptibility to selected demonstrations and the intricacy to generate these demonstrations. In this paper, we raise the fundamental question that whether human-generated demonstrations are necessary for ICL. To answer this question, we propose self-contemplation prompting strategy (SEC), a paradigm free from human-crafted demonstrations. The key point of SEC is that, instead of using hand-crafted examples as demonstrations in ICL, SEC asks LLMs to first create demonstrations on their own, based on which the final output is generated. SEC is a flexible framework and can be adapted to both the vanilla ICL and the chain-of-thought (CoT), but with greater ease: as the manual-generation process of both examples and rationale can be saved. Extensive experiments in arithmetic reasoning, commonsense reasoning, multi-task language understanding, and code generation benchmarks, show that SEC, which does not require hand-crafted demonstrations, significantly outperforms the zero-shot learning strategy, and achieves comparable results to ICL with hand-crafted demonstrations. This demonstrates that, for many tasks, contemporary LLMs possess a sufficient level of competence to exclusively depend on their own capacity for decision making, removing the need for external training data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=frRDT6EOhg",
    "arxiv_id": "2309.14681",
    "GitHub": [
      "https://github.com/ruili33/SEC"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18167,
    "title": "Can We Evaluate Domain Adaptation Models Without Target-Domain Labels?",
    "authors": [
      "Jianfei Yang",
      "Hanjie Qian",
      "Yuecong Xu",
      "Kai Wang",
      "Lihua Xie"
    ],
    "abstract": "Unsupervised domain adaptation (UDA) involves adapting a model trained on a label-rich source domain to an unlabeled target domain. However, in real-world scenarios, the absence of target-domain labels makes it challenging to evaluate the performance of UDA models. Furthermore, prevailing UDA methods relying on adversarial training and self-training could lead to model degeneration and negative transfer, further exacerbating the evaluation problem. In this paper, we propose a novel metric called the Transfer Score to address these issues. The proposed metric enables the unsupervised evaluation of UDA models by assessing the spatial uniformity of the classifier via model parameters, as well as the transferability and discriminability of deep representations. Based on the metric, we achieve three novel objectives without target-domain labels: (1) selecting the best UDA method from a range of available options, (2) optimizing hyperparameters of UDA models to prevent model degeneration, and (3) identifying which checkpoint of UDA model performs optimally. Our work bridges the gap between data-level UDA research and practical UDA scenarios, enabling a realistic assessment of UDA model performance. We validate the effectiveness of our metric through extensive empirical studies on UDA datasets of different scales and imbalanced distributions. The results demonstrate that our metric robustly achieves the aforementioned goals.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fszrlQ2DuP",
    "arxiv_id": "2305.18712",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18164,
    "title": "Crystalformer: Infinitely Connected Attention for Periodic Structure Encoding",
    "authors": [
      "Tatsunori Taniai",
      "Ryo Igarashi",
      "Yuta Suzuki",
      "Naoya Chiba",
      "Kotaro Saito",
      "Yoshitaka Ushiku",
      "Kanta Ono"
    ],
    "abstract": "Predicting physical properties of materials from their crystal structures is a fundamental problem in materials science. In peripheral areas such as the prediction of molecular properties, fully connected attention networks have been shown to be successful. However, unlike these finite atom arrangements, crystal structures are infinitely repeating, periodic arrangements of atoms, whose fully connected attention results in infinitely connected attention. In this work, we show that this infinitely connected attention can lead to a computationally tractable and physically interpretable formulation. We then propose a simple yet effective transformer-based encoder architecture for crystal structures called Crystalformer. Compared with an existing transformer-based model, the proposed model requires only 38% of number of parameters per attention block. Despite the architectural simplicity, the proposed method outperforms state-of-the-art methods for various property regression tasks on the Materials Project and JARVIS-DFT datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fxQiecl9HB",
    "arxiv_id": "2403.11686",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18162,
    "title": "Adaptive Federated Learning with Auto-Tuned Clients",
    "authors": [
      "Junhyung Lyle Kim",
      "Taha Toghani",
      "Cesar A Uribe",
      "Anastasios Kyrillidis"
    ],
    "abstract": "Federated learning (FL) is a distributed machine learning framework where the global model of a central server is trained via multiple collaborative steps by participating clients without sharing their data. While being a flexible framework, where the distribution of local data, participation rate, and computing power of each client can greatly vary, such flexibility gives rise to many new challenges, especially in the hyperparameter tuning on the client side. We propose $\\Delta$-SGD, a simple step size rule for SGD that enables each client to use its own step size by adapting to the local smoothness of the function each client is optimizing. We provide theoretical and empirical results where the benefit of the client adaptivity is shown in various FL scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=g0mlwqs8pi",
    "arxiv_id": "2306.11201",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18824,
    "title": "Differentiable Euler Characteristic Transforms for Shape Classification",
    "authors": [
      "Ernst R\u00f6ell",
      "Bastian Rieck"
    ],
    "abstract": "The Euler Characteristic Transform (ECT) has proven to be a powerful representation, combining geometrical and topological characteristics of shapes and graphs. However, the ECT was hitherto unable to learn task-specific representations. We overcome this issue and develop a novel computational layer that enables learning the ECT in an end-to-end fashion. Our method, DECT, is fast and computationally efficient, while exhibiting performance on a par with more complex models in both graph and point cloud classification tasks. Moreover, we show that this seemingly unexpressive statistic still provides the same topological expressivity as more complex topological deep learning layers provide.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MO632iPq3I",
    "arxiv_id": "2310.07630",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18818,
    "title": "Denoising Task Routing for Diffusion Models",
    "authors": [
      "Byeongjun Park",
      "Sangmin Woo",
      "Hyojun Go",
      "Jin-Young Kim",
      "Changick Kim"
    ],
    "abstract": "Diffusion models generate highly realistic images by learning a multi-step denoising process, naturally embodying the principles of multi-task learning (MTL). Despite the inherent connection between diffusion models and MTL, there remains an unexplored area in designing neural architectures that explicitly incorporate MTL into the framework of diffusion models. In this paper, we present Denoising Task Routing (DTR), a simple add-on strategy for existing diffusion model architectures to establish distinct information pathways for individual tasks within a single architecture by selectively activating subsets of channels in the model. What makes DTR particularly compelling is its seamless integration of prior knowledge of denoising tasks into the framework: (1) Task Affinity: DTR activates similar channels for tasks at adjacent timesteps and shifts activated channels as sliding windows through timesteps, capitalizing on the inherent strong affinity between tasks at adjacent timesteps. (2) Task Weights: During the early stages (higher timesteps) of the denoising process, DTR assigns a greater number of task-specific channels, leveraging the insight that diffusion models prioritize reconstructing global structure and perceptually rich contents in earlier stages, and focus on simple noise removal in later stages. Our experiments reveal that DTR not only consistently boosts diffusion models' performance across different evaluation protocols without adding extra parameters but also accelerates training convergence. Finally, we show the complementarity between our architectural approach and existing MTL optimization techniques, providing a more complete view of MTL in the context of diffusion training. Significantly, by leveraging this complementarity, we attain matched performance of DiT-XL using the smaller DiT-L with a reduction in training iterations from 7M to 2M. Our project page is available at https://byeongjun-park.github.io/DTR/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MY0qlcFcUg",
    "arxiv_id": "2310.07138",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18161,
    "title": "Neural Active Learning Beyond Bandits",
    "authors": [
      "Yikun Ban",
      "Ishika Agarwal",
      "Ziwei Wu",
      "Yada Zhu",
      "Kommy Weldemariam",
      "Hanghang Tong",
      "Jingrui He"
    ],
    "abstract": "We study both stream-based and pool-based active learning with neural network approximations. A recent line of works proposed bandit-based approaches that transformed active learning into a bandit problem, achieving both theoretical and empirical success. However, the performance and computational costs of these methods may be susceptible to the number of classes, denoted as $K$, due to this transformation. Therefore, this paper seeks to answer the question: \"How can we mitigate the adverse impacts of $K$   while retaining the advantages of principled exploration and provable performance guarantees in active learning?\" To tackle this challenge, we propose two algorithms based on the newly designed exploitation and exploration neural networks for stream-based and pool-based active learning. Subsequently, we provide theoretical performance guarantees for both algorithms in a non-parametric setting, demonstrating a slower error-growth rate concerning $K$ for the proposed approaches. We use extensive experiments to evaluate the proposed algorithms, which consistently outperform state-of-the-art baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=g1S72T3FGc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18160,
    "title": "A Progressive Training Framework for Spiking Neural Networks with Learnable Multi-hierarchical Model",
    "authors": [
      "Zecheng Hao",
      "Xinyu Shi",
      "Zihan Huang",
      "Tong Bu",
      "Zhaofei Yu",
      "Tiejun Huang"
    ],
    "abstract": "Spiking Neural Networks (SNNs) have garnered considerable attention due to their energy efficiency and unique biological characteristics. However, the widely adopted Leaky Integrate-and-Fire (LIF) model, as the mainstream neuron model in current SNN research, has been revealed to exhibit significant deficiencies in deep-layer gradient calculation and capturing global information on the time dimension. In this paper, we propose the Learnable Multi-hierarchical (LM-H) model to address these issues by dynamically regulating its membrane-related factors. We point out that the LM-H model fully encompasses the information representation range of the LIF model while offering the flexibility to adjust the extraction ratio between historical and current information. Additionally, we theoretically demonstrate the effectiveness of the LM-H model and the functionality of its internal parameters, and propose a progressive training algorithm tailored specifically for the LM-H model. Furthermore, we devise an efficient training framework for our novel advanced model, encompassing hybrid training and time-slicing online training. Through extensive experiments on various datasets, we validate the remarkable superiority of our model and training algorithm compared to previous state-of-the-art approaches. Code is available at [https://github.com/hzc1208/STBP_LMH](https://github.com/hzc1208/STBP_LMH).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=g52tgL8jy6",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18158,
    "title": "Follow-Up Differential Descriptions: Language Models Resolve Ambiguities for Image Classification",
    "authors": [
      "Reza Esfandiarpoor",
      "Stephen Bach"
    ],
    "abstract": "Extending the class descriptions (i.e., prompts) with related attributes, e.g., using brown sparrow instead of sparrow, improves the performance of vision-language models like CLIP for image classification. However, current methods select a subset of attributes regardless of commonalities between the target classes, potentially providing no useful information that would have helped to distinguish between them. For instance, they may use color instead of bill shape to distinguish between sparrows and wrens, which are both brown. We propose Follow-up Differential Descriptions (FuDD), a zero-shot approach that tailors the class descriptions to each dataset and leads to additional attributes that better differentiate the target classes. FuDD first identifies the ambiguous classes for each image, and then uses a Large Language Model (LLM) to generate new class descriptions that differentiate between them. The new class descriptions resolve the initial ambiguity and help predict the correct label. In our experiments, FuDD consistently outperforms generic description ensembles and naive LLM-generated descriptions on 12 datasets. We show that differential descriptions are an effective tool to resolve class ambiguities, which otherwise significantly degrade the performance. We also show that high quality natural language class descriptions produced by FuDD result in comparable performance to few-shot adaptation methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=g6rZtxaXRm",
    "arxiv_id": "2311.07593",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18156,
    "title": "On the Parameterization of Second-Order Optimization Effective towards the Infinite Width",
    "authors": [
      "Satoki Ishikawa",
      "Ryo Karakida"
    ],
    "abstract": "Second-order optimization has been developed to accelerate the training of deep neural networks and it is being applied to increasingly larger-scale models. In this study, towards training on further larger scales, we identify a specific parameterization for second-order optimization that promotes feature learning in a stable manner even if the network width increases significantly. Inspired by a maximal update parametrization, we consider a one-step update of the gradient and reveal the appropriate scales of hyperparameters including random initialization, learning rates, and damping terms. Our approach covers two major second-order optimization algorithms, K-FAC and Shampoo, and we demonstrate that our parametrization achieves higher generalization performance in feature learning.In particular, it enables us to transfer the hyperparameters across models with different widths.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=g8sGBSQjYk",
    "arxiv_id": "2312.12226",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18155,
    "title": "Adaptive Rational Activations to Boost Deep Reinforcement Learning",
    "authors": [
      "Quentin Delfosse",
      "Patrick Schramowski",
      "Martin Mundt",
      "Alejandro Molina",
      "Kristian Kersting"
    ],
    "abstract": "Latest insights from biology show that intelligence not only emerges from the connections between neurons, but that individual neurons shoulder more computational responsibility than previously anticipated. Specifically, neural plasticity should be critical in the context of constantly changing reinforcement learning (RL) environments, yet current approaches still primarily employ static activation functions. In this work, we motivate the use of adaptable activation functions in RL and show that rational activation functions are particularly suitable for augmenting plasticity. Inspired by residual networks, we derive a condition under which rational units are closed under residual connections and formulate a naturally regularised version. The proposed joint-rational activation allows for desirable degrees of flexibility, yet regularises plasticity to an extent that avoids overfitting by leveraging a mutual set of activation function parameters across layers. We demonstrate that equipping popular algorithms with (joint) rational activations leads to consistent improvements on different games from the Atari Learning Environment benchmark, notably making DQN competitive to DDQN and Rainbow.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=g90ysX1sVs",
    "arxiv_id": "2102.09407",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18154,
    "title": "Evaluating the Zero-shot Robustness of Instruction-tuned Language Models",
    "authors": [
      "Jiuding Sun",
      "Chantal Shaib",
      "Byron C Wallace"
    ],
    "abstract": "Instruction fine-tuning has recently emerged as a promising approach for improving the zero-shot capabilities of Large Language Models (LLMs) on new tasks. This technique has shown particular strength in improving the performance of modestly sized LLMs, sometimes inducing performance competitive with much larger model variants. In this paper, we ask two questions: (1) How sensitive are instruction-tuned models to the particular phrasings of instructions, and, (2) How can we make them more robust to such natural language variation? To answer the former, we collect a set of 319 instructions manually written by NLP practitioners for over 80 unique tasks included in widely used benchmarks, and we evaluate the variance and average performance of these instructions as compared to instruction phrasings observed during instruction fine-tuning. We find that using novel (unobserved) but appropriate instruction phrasings consistently degrades model performance, sometimes substantially so. Further, such natural instructions yield a wide variance in downstream performance, despite their semantic equivalence. Put another way, instruction-tuned models are not especially robust to instruction re-phrasings. We propose a simple method to mitigate this issue by introducing ``soft prompt'' embedding parameters and optimizing these to maximize the similarity between representations of semantically equivalent instructions. We show that this method consistently improves the robustness of instruction-tuned models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=g9diuvxN6D",
    "arxiv_id": "2306.11270",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18153,
    "title": "BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation",
    "authors": [
      "Peng Xu",
      "Wenqi Shao",
      "Mengzhao Chen",
      "Shitao Tang",
      "Kaipeng Zhang",
      "Peng Gao",
      "Fengwei An",
      "Yu Qiao",
      "Ping Luo"
    ],
    "abstract": "Large language models (LLMs) have demonstrated outstanding performance in various tasks, such as text summarization, text question-answering, and etc. While their performance is impressive, the computational footprint due to their vast number of parameters can be prohibitive. Existing solutions such as SparseGPT and Wanda attempt to alleviate this issue through weight pruning. However, their layer-wise approach results in significant perturbation to the model's output and requires meticulous hyperparameter tuning, such as the pruning rate, which can adversely affect overall model performance. To address this, this paper introduces a novel LLM pruning technique dubbed blockwise parameter-efficient sparsity allocation (BESA) by applying a blockwise reconstruction loss. In contrast to the typical layer-wise pruning techniques, BESA is characterized by two distinctive attributes: i) it targets the overall pruning error with respect to individual transformer blocks, and ii) it allocates layer-specific sparsity in a differentiable manner, both of which ensure reduced performance degradation after pruning. Our experiments show that BESA achieves state-of-the-art performance, efficiently pruning LLMs like LLaMA1, and LLaMA2 with 7B to 70B parameters on a single A100 GPU in just five hours. Code is available at [here](https://github.com/LinkAnonymous/BESA).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gC6JTEU3jl",
    "arxiv_id": "2402.16880",
    "GitHub": [
      "https://github.com/OpenGVLab/LLMPrune-BESA"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18145,
    "title": "An Unforgeable Publicly Verifiable Watermark for Large Language Models",
    "authors": [
      "Aiwei Liu",
      "Leyi Pan",
      "Xuming Hu",
      "Shuang Li",
      "Lijie Wen",
      "Irwin King",
      "Philip S. Yu"
    ],
    "abstract": "Recently, text watermarking algorithms for large language models (LLMs) have been proposed to mitigate the potential harms of text generated by LLMs, including fake news and copyright issues. However, current watermark detection algorithms require the secret key used in the watermark generation process, making them susceptible to security breaches and counterfeiting.To address this limitation, we propose the first private watermarking algorithm that uses two different neural networks for watermark generation and detection, instead of using the same key at both stages. Meanwhile, the token embedding parameters are shared between the generation and detection networks, which makes the detection network achieve a high accuracy very efficiently.Experiments demonstrate that Our algorithm attains high detection accuracy and computational efficiency through neural networks with a minimized number of parameters. Subsequent analysis confirms the high complexity involved in reverse-engineering the watermark generation algorithms from the detection network.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gMLQwKDY3N",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18146,
    "title": "LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Models",
    "authors": [
      "Gunho Park",
      "Baeseong park",
      "Minsub Kim",
      "Sungjae Lee",
      "Jeonghoon Kim",
      "Beomseok Kwon",
      "Se Jung Kwon",
      "Byeongwook Kim",
      "Youngjoo Lee",
      "Dongsoo Lee"
    ],
    "abstract": "Recent advances in self-supervised learning and the Transformer architecture have significantly improved natural language processing (NLP), achieving remarkably low perplexity.However, the growing size of NLP models introduces a memory wall problem during the generation phase.To mitigate this issue, recent efforts have focused on quantizing model weights to sub-4-bit precision while preserving full precision for activations, resulting in practical speed-ups during inference on a single GPU.However, these improvements primarily stem from reduced memory movement, which necessitates a resource-intensive dequantization process rather than actual computational reduction.In this paper, we introduce LUT-GEMM, an efficient kernel for quantized matrix multiplication, which not only eliminates the resource-intensive dequantization process but also reduces computational costs compared to previous kernels for weight-only quantization.Furthermore, we proposed group-wise quantization to offer a flexible trade-off between compression ratio and accuracy.The impact of LUT-GEMM is facilitated by implementing high compression ratios through low-bit quantization and efficient LUT-based operations.We show experimentally that when applied to the OPT-175B model with 3-bit quantization, LUT-GEMM substantially accelerates token generation latency, achieving a remarkable 2.1x improvement on a single GPU when compared to OPTQ, which relies on the costly dequantization process.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gLARhFLE0F",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18798,
    "title": "A Sublinear Adversarial Training Algorithm",
    "authors": [
      "Yeqi Gao",
      "Lianke Qin",
      "Zhao Song",
      "Yitan Wang"
    ],
    "abstract": "Adversarial training is a widely used strategy for making neural networks resistant to adversarial perturbations. For a neural network of width $m$, $n$ input training data in $d$ dimension, it takes $\\Omega(mnd)$ time cost per training iteration for the forward and backward computation. In this paper we analyze the convergence guarantee of adversarial training procedure on a two-layer neural network with shifted ReLU activation, and shows that only $o(m)$ neurons will be activated for each input data per iteration. Furthermore, we develop an algorithm for adversarial training with time cost $o(m n d)$ per iteration by applying half-space reporting data structure.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=N2WchST43h",
    "arxiv_id": "2208.05395",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18794,
    "title": "Efficient Streaming Language Models with Attention Sinks",
    "authors": [
      "Guangxuan Xiao",
      "Yuandong Tian",
      "Beidi Chen",
      "Song Han",
      "Mike Lewis"
    ],
    "abstract": "Deploying Large Language Models (LLMs) in streaming applications such as multi-round dialogue, where long interactions are expected, is urgently needed but poses two major challenges.Firstly, during the decoding stage, caching previous tokens' Key and Value states (KV) consumes extensive memory.Secondly, popular LLMs cannot generalize to longer texts than the training sequence length.Window attention, where only the most recent KVs are cached, is a natural approach --- but we show that it fails when the text length surpasses the cache size.We observe an interesting phenomenon, namely attention sink, that keeping the KV of initial tokens will largely recover the performance of window attention. In this paper, we first demonstrate that the emergence of attention sink is due to the strong attention scores towards initial tokens as a ``sink'' even if they are not semantically important.Based on the above analysis, we introduce StreamingLLM, an efficient framework that enables LLMs trained with a finite length attention window to generalize to infinite sequence length without any fine-tuning.We show that StreamingLLM can enable Llama-2, MPT, Falcon, and Pythia to perform stable and efficient language modeling with up to 4 million tokens and more.In addition, we discover that adding a placeholder token as a dedicated attention sink during pre-training can further improve streaming deployment. In streaming settings, StreamingLLM outperforms the sliding window recomputation baseline by up to 22.2$\\times$ speedup.Code and datasets are provided in the anonymous link.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NG7sS51zVF",
    "arxiv_id": "2309.17453",
    "GitHub": [
      "https://github.com/mit-han-lab/streaming-llm"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18141,
    "title": "Logical Languages Accepted by Transformer Encoders with Hard Attention",
    "authors": [
      "Pablo Barcelo",
      "Alexander Kozachinskiy",
      "Anthony Widjaja Lin",
      "Vladimir Podolskii"
    ],
    "abstract": "We contribute to the study of formal languages that can be recognized by transformer encoders. We focus on two self-attention mechanisms: (1) UHAT (Unique Hard Attention Transformers) and (2) AHAT (Average Hard Attention Transformers). UHAT encoders are known to  recognize only languages inside the circuit complexity class ${\\sf AC}^0$, i.e., accepted by a family of poly-sized and depth-bounded boolean circuits with unbounded fan-ins. On the other hand, AHAT encoders can recognize languages outside ${\\sf AC}^0$), but their expressive power still lies within the bigger circuit complexity class ${\\sf TC}^0$, i.e., ${\\sf AC}^0$-circuits extended by majority gates.We first show a negative result that there is an  ${\\sf AC}^0$-language that cannot be recognized by an UHAT encoder. On the positive side, we show that UHAT encoders can recognize a rich fragment of ${\\sf AC}^0$-languages, namely, all languages definable in first-order logic with arbitrary unary numerical predicates. This logic, includes, for example, all regular languages from  ${\\sf AC}^0$. We then show that AHAT encoders can recognize all languages of our logic even when we enrich it with counting terms. We apply these results to derive new results on the expressive power of UHAT and AHAT up to permutation of letters (a.k.a. Parikh images).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gbrHZq07mq",
    "arxiv_id": "2310.03817",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18140,
    "title": "Feature Collapse",
    "authors": [
      "Thomas Laurent",
      "James von Brecht",
      "Xavier Bresson"
    ],
    "abstract": "We formalize and study a phenomenon called *feature collapse* that makes precise the intuitive idea that entities playing a similar role in a learning task receive similar representations. As feature collapse requires a notion of task, we leverage a synthetic task in which a learner must classify  `sentences' constituted of $L$ tokens. We start by showing experimentally that feature collapse goes hand in hand with generalization. We then prove that, in the large sample limit,  distinct tokens that play identical roles in the task receive identical local feature representations in the first layer of the network. This analysis shows that a neural network trained on this task provably learns interpretable and meaningful representations in its first layer.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gctmyMiPHH",
    "arxiv_id": "2305.16162",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18139,
    "title": "OmniControl: Control Any Joint at Any Time for Human Motion Generation",
    "authors": [
      "Yiming Xie",
      "Varun Jampani",
      "Lei Zhong",
      "Deqing Sun",
      "Huaizu Jiang"
    ],
    "abstract": "We present a novel approach named OmniControl for incorporating flexible spatial control signals into a text-conditioned human motion generation model based on the diffusion process. Unlike previous methods that can only control the pelvis trajectory, OmniControl can incorporate flexible spatial control signals over different joints at different times with only one model. Specifically, we propose analytic spatial guidance that ensures the generated motion can tightly conform to the input control signals. At the same time, realism guidance is introduced to refine all the joints to generate more coherent motion. Both the spatial and realism guidance are essential and they are highly complementary for balancing control accuracy and motion realism. By combining them, OmniControl generates motions that are realistic, coherent, and consistent with the spatial constraints. Experiments on HumanML3D and KIT-ML datasets show that OmniControl not only achieves significant improvement over state-of-the-art methods on pelvis control but also shows promising results when incorporating the constraints over other joints. Our code and model weights will be publicly released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gd0lAEtWso",
    "arxiv_id": "2310.08580",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18138,
    "title": "Attention Satisfies: A Constraint-Satisfaction Lens on Factual Errors of Language Models",
    "authors": [
      "Mert Yuksekgonul",
      "Varun Chandrasekaran",
      "Erik Jones",
      "Suriya Gunasekar",
      "Ranjita Naik",
      "Hamid Palangi",
      "Ece Kamar",
      "Besmira Nushi"
    ],
    "abstract": "We investigate the internal behavior of Transformer-based Large Language Models (LLMs) when they generate factually incorrect text. We propose modeling factual queries as constraint satisfaction problems and use this framework to investigate how the LLM interacts internally with factual constraints. We find a strong positive relationship between the LLM's attention to constraint tokens and the factual accuracy of generations. We curate a suite of 11 datasets containing over 40,000 prompts to study the task of predicting factual errors with the Llama-2 family across all scales (7B, 13B, 70B). We propose SAT Probe, a method probing attention patterns, that can predict factual errors and fine-grained constraint satisfaction, and allow early error identification. The approach and findings take another step towards using the mechanistic understanding of LLMs to enhance their reliability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gfFVATffPd",
    "arxiv_id": "2309.15098",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18137,
    "title": "FedImpro: Measuring and Improving Client Update in Federated Learning",
    "authors": [
      "Zhenheng Tang",
      "Yonggang Zhang",
      "Shaohuai Shi",
      "Xinmei Tian",
      "Tongliang Liu",
      "Bo Han",
      "Xiaowen Chu"
    ],
    "abstract": "Federated Learning (FL) models typically suffer from client drift caused by heterogeneous data, where data distributions vary with clients. To this end, advanced works mainly focus on manipulating exist gradients to obtain more similar client models. In this paper, we propose a different view of client drift and correct it by producing better local models. First, we analyze the generalization contribution of local training and conclude that the generalization contribution of local training is bounded by the conditional Wasserstein distance between clients' data distributions. Then, we propose FedImpro, to constructs similar conditional distributions for local training. Specifically, FedImpro decouples the model into high-level and low-level parts and trains the high-level part on reconstructed feature distributions, causing promoted generalization contribution and alleviated gradient dissimilarity of FL. Experimental results demonstrate that FedImpro can help FL defend against data heterogeneity and improve model generalization",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=giU9fYGTND",
    "arxiv_id": "2402.07011",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18135,
    "title": "Can LLMs Express Their Uncertainty? An Empirical Evaluation of Confidence Elicitation in LLMs",
    "authors": [
      "Miao Xiong",
      "Zhiyuan Hu",
      "Xinyang Lu",
      "YIFEI LI",
      "Jie Fu",
      "Junxian He",
      "Bryan Hooi"
    ],
    "abstract": "Empowering large language models (LLMs) to accurately express confidence in their answers is essential for reliable and trustworthy decision-making. Previous confidence elicitation methods, which primarily rely on *white-box access* to internal model information or model fine-tuning, have become less suitable for LLMs, especially closed-source commercial APIs. This leads to a growing need to explore the untapped area of *black-box* approaches for LLM uncertainty estimation. To better break down the problem, we define a systematic framework with three components: *prompting* strategies for eliciting verbalized confidence, *sampling* methods for generating multiple responses, and *aggregation* techniques for computing consistency. We then benchmark these methods on two key tasks\u2014confidence calibration and failure prediction\u2014across five types of datasets (e.g., commonsense and arithmetic reasoning) and five widely-used LLMs including GPT-4 and LLaMA 2. Our analysis uncovers several key insights: 1) LLMs, when verbalizing their confidence, tend to be overconfident, potentially imitating human patterns of expressing confidence. 2) As model capability scales up, both calibration and failure prediction performance improve, yet still far from ideal performance. 3) Human-inspired prompting strategies mitigate this overconfidence, albeit with diminishing returns in advanced models like GPT-4, especially in improving failure prediction. 4) Employing sampling strategies paired with specific aggregators can effectively enhance failure prediction; moreover, the choice of aggregator can be tailored based on the desired performance enhancement. Despite these advancements, all investigated methods struggle in challenging tasks, such as those requiring professional knowledge, indicating significant scope for improvement. We believe this study can serve as a strong baseline and provide insights for eliciting confidence in black-box LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gjeQKFxFpZ",
    "arxiv_id": "2306.13063",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18136,
    "title": "PRES: Toward Scalable Memory-Based Dynamic Graph Neural Networks",
    "authors": [
      "Junwei Su",
      "Difan Zou",
      "Chuan Wu"
    ],
    "abstract": "Memory-based Dynamic Graph Neural Networks (MDGNNs) are a family of dynamic graph neural networks that leverage a memory module to extract, distill, and memorize long-term temporal dependencies, leading to superior performance compared to memory-less counterparts. However, training MDGNNs faces the challenge of handling entangled temporal and structural dependencies, requiring sequential and chronological processing of data sequences to capture accurate temporal patterns. During the batch training, the temporal data points within the same batch will be processed in parallel, while their temporal dependencies are neglected. This issue is referred to as temporal discontinuity and restricts the effective temporal batch size, limiting data parallelism and reducing MDGNNs' flexibility in industrial applications. This paper studies the efficient training of MDGNNs at scale, focusing on the temporal discontinuity in training MDGNNs with large temporal batch sizes. We first conduct a theoretical study on the impact of temporal batch size on the convergence of MDGNN training. Based on the analysis, we propose PRES, an iterative prediction-correction scheme combined with a memory coherence learning objective to mitigate the effect of temporal discontinuity, enabling MDGNNs to be trained with significantly larger temporal batches without sacrificing generalization performance. Experimental results demonstrate that our approach enables up to a 4 $\\times$ larger temporal batch (3.4$\\times$ speed-up) during MDGNN training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gjXor87Xfy",
    "arxiv_id": "2402.04284",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18134,
    "title": "DyVal: Dynamic Evaluation of Large Language Models for Reasoning Tasks",
    "authors": [
      "Kaijie Zhu",
      "Jiaao Chen",
      "Jindong Wang",
      "Neil Zhenqiang Gong",
      "Diyi Yang",
      "Xing Xie"
    ],
    "abstract": "Large language models (LLMs) have achieved remarkable performance in various evaluation benchmarks. However, concerns about their performance are raised on potential data contamination in their considerable volume of training corpus. Moreover, the static nature and fixed complexity of current benchmarks may inadequately gauge the advancing capabilities of LLMs. In this paper, we introduce DyVal, a novel, general, and flexible evaluation protocol for dynamic evaluation of LLMs. Based on our proposed dynamic evaluation framework, we build graph-informed DyVal by leveraging the structural advantage of directed acyclic graphs to dynamically generate evaluation samples with controllable complexities. DyVal generates challenging evaluation sets on reasoning tasks including mathematics, logical reasoning, and algorithm problems. We evaluate various LLMs ranging from Flan-T5-large to ChatGPT and GPT4. Experiments demonstrate that LLMs perform worse in DyVal-generated evaluation samples with different complexities, emphasizing the significance of dynamic evaluation. We also analyze the failure cases and results of different prompting methods. Moreover, DyVal-generated samples are not only evaluation sets, but also helpful data for fine-tuning to improve the performance of LLMs on existing benchmarks. We hope that DyVal can shed light on the future evaluation research of LLMs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=gjfOL9z5Xr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18133,
    "title": "Confronting Reward Model Overoptimization with Constrained RLHF",
    "authors": [
      "Ted Moskovitz",
      "Aaditya K Singh",
      "DJ Strouse",
      "Tuomas Sandholm",
      "Ruslan Salakhutdinov",
      "Anca Dragan",
      "Stephen Marcus McAleer"
    ],
    "abstract": "Large language models are typically aligned with human preferences by optimizing reward models (RMs) fitted to human feedback. However, human preferences are multi-faceted, and it is increasingly common to derive reward from a composition of simpler reward models which each capture a different aspect of language quality. This itself presents a challenge, as it is difficult to appropriately weight these component RMs when combining them. Compounding this difficulty, because any RM is only a proxy for human evaluation, this process is vulnerable to *overoptimization*, wherein past a certain point, accumulating higher reward is associated with worse human ratings. In this paper, we perform the first study on overoptimization in composite RMs, showing that correlation between component RMs has a significant effect on the locations of these points. We then introduce an approach to solve this issue using constrained reinforcement learning as a means of preventing the agent from exceeding each RM's threshold of usefulness. Our method addresses the problem of weighting component RMs by learning dynamic weights, naturally given by the Lagrange multipliers. As a result, each RM stays within the range at which it is an effective proxy, improving evaluation performance. Finally, we introduce an adaptive method using gradient-free optimization to identify and optimize towards these points during a single run.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=gkfUvn0fLU",
    "arxiv_id": "2310.04373",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18132,
    "title": "VertiBench: Advancing Feature Distribution Diversity in Vertical Federated Learning Benchmarks",
    "authors": [
      "Zhaomin Wu",
      "Junyi Hou",
      "Bingsheng He"
    ],
    "abstract": "Vertical Federated Learning (VFL) is a crucial paradigm for training machine learning models on feature-partitioned, distributed data. However, due to privacy restrictions, few public real-world VFL datasets exist for algorithm evaluation, and these represent a limited array of feature distributions. Existing benchmarks often resort to synthetic datasets, derived from arbitrary feature splits from a global set, which only capture a subset of feature distributions, leading to inadequate algorithm performance assessment. This paper addresses these shortcomings by introducing two key factors affecting VFL performance - feature importance and feature correlation - and proposing associated evaluation metrics and dataset splitting methods. Our comprehensive evaluation of cutting-edge VFL algorithms provides valuable insights for future research in the field.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=glwwbaeKm2",
    "arxiv_id": "2307.02040",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18130,
    "title": "SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation",
    "authors": [
      "Chongyu Fan",
      "Jiancheng Liu",
      "Yihua Zhang",
      "Eric Wong",
      "Dennis Wei",
      "Sijia Liu"
    ],
    "abstract": "With evolving data regulations, machine unlearning (MU) has become an important tool for fostering trust and safety in today's AI models. However, existing MU methods focusing on data and/or weight perspectives often suffer limitations in unlearning accuracy, stability, and cross-domain applicability. To address these challenges, we introduce the concept of 'weight saliency' for MU, drawing parallels with input saliency in model explanation. This innovation directs MU's attention toward specific model weights rather than the entire model, improving effectiveness and efficiency. The resultant method that we call saliency unlearning (SalUn) narrows the performance gap with 'exact' unlearning (model retraining from scratch after removing the forgetting data points). To the best of our knowledge, SalUn is the first principled MU approach that can effectively erase the influence of forgetting data, classes, or concepts in both image classification and generation tasks. As highlighted below, For example, SalUn yields a stability advantage in high-variance random data forgetting, e.g., with a 0.2% gap compared to exact unlearning on the CIFAR-10 dataset. Moreover, in preventing conditional diffusion models from generating harmful images, SalUn achieves nearly 100% unlearning accuracy, outperforming current state-of-the-art baselines like Erased Stable Diffusion and Forget-Me-Not. Codes are available at https://github.com/OPTML-Group/Unlearn-Saliency.**WARNING**: This paper contains model outputs that may be offensive in nature.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=gn0mIhQGNM",
    "arxiv_id": "2310.12508",
    "GitHub": [
      "https://github.com/OPTML-Group/Unlearn-Saliency"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18129,
    "title": "Efficient Subgraph GNNs by Learning Effective Selection Policies",
    "authors": [
      "Beatrice Bevilacqua",
      "Moshe Eliasof",
      "Eli Meirom",
      "Bruno Ribeiro",
      "Haggai Maron"
    ],
    "abstract": "Subgraph GNNs are provably expressive neural architectures that learn graph representations from sets of subgraphs. Unfortunately, their applicability is hampered by the computational complexity associated with performing message passing on many subgraphs. In this paper, we consider the problem of learning to select a small subset of the large set of possible subgraphs in a data-driven fashion. We first motivate the problem by proving that there are families of WL-indistinguishable graphs for which there exist efficient subgraph selection policies: small subsets of subgraphs that can already identify all the graphs within the family. We then propose a new approach, called _Policy-Learn_, that learns how to select subgraphs in an iterative manner. We prove that, unlike popular random policies and prior work addressing the same problem, our architecture is able to learn the efficient policies mentioned above. Our experimental results demonstrate that _Policy-Learn_ outperforms existing baselines across a wide range of datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gppLqZLQeY",
    "arxiv_id": "2310.20082",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18782,
    "title": "GIM: Learning Generalizable Image Matcher From Internet Videos",
    "authors": [
      "Xuelun Shen",
      "zhipeng cai",
      "Wei Yin",
      "Matthias M\u00fcller",
      "Zijun Li",
      "Kaixuan Wang",
      "Xiaozhi Chen",
      "Cheng Wang"
    ],
    "abstract": "Image matching is a fundamental computer vision problem. While learning-based methods achieve state-of-the-art performance on existing benchmarks, they generalize poorly to in-the-wild images. Such methods typically need to train separate models for different scene types (e.g., indoor vs. outdoor) and are impractical when the scene type is unknown in advance. One of the underlying problems is the limited scalability of existing data construction pipelines, which limits the diversity of standard image matching datasets. To address this problem, we propose GIM, a self-training framework for learning a single generalizable model based on any image matching architecture using internet videos, an abundant and diverse data source. Given an architecture, GIM first trains it on standard domain-specific datasets and then combines it with complementary matching methods to create dense labels on nearby frames of novel videos. These labels are filtered by robust fitting, and then enhanced by propagating them to distant frames. The final model is trained on propagated data with strong augmentations. Not relying on complex 3D reconstruction makes GIM much more efficient and less likely to fail than standard SfM-and-MVS based frameworks. We also propose ZEB, the first zero-shot evaluation benchmark for image matching. By mixing data from diverse domains, ZEB can thoroughly assess the cross-domain generalization performance of different methods. Experiments demonstrate the effectiveness and generality of GIM. Applying GIM consistently improves the zero-shot performance of 3 state-of-the-art image matching architectures as the number of downloaded videos increases (Fig. 1 (a)); with 50 hours of YouTube videos, the relative zero-shot performance improves by 8.4% \u2212 18.1%. GIM also enables generalization to extreme cross-domain data such as Bird Eye View (BEV) images of projected 3D point clouds (Fig. 1 (c)). More importantly, our single zero-shot model consistently outperforms domain-specific baselines when evaluated on downstream tasks inherent to their respective domains. The code will be released upon acceptance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=NYN1b8GRGS",
    "arxiv_id": "2402.11095",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18776,
    "title": "The Expressive Power of Transformers with Chain of Thought",
    "authors": [
      "William Merrill",
      "Ashish Sabharwal"
    ],
    "abstract": "Recent theoretical work has identified surprisingly simple reasoning problems, such as checking if two nodes in a graph are connected or simulating finite-state machines, that are provably unsolvable by standard transformers that answer immediately after reading their input. However, in practice, transformers' reasoning can be improved by allowing them to use a \"chain of thought\" or \"scratchpad\", i.e., generate and condition on a sequence of intermediate tokens before answering. Motivated by this, we ask: *Does such intermediate generation fundamentally extend the computational power of a decoder-only transformer?* We show that the answer is *yes*, but the amount of increase depends crucially on the amount of intermediate generation. For instance, we find that transformer decoders with a logarithmic number of decoding steps (w.r.t. the input length) push the limits of standard transformers only slightly, while a linear number of decoding steps adds a clear new ability (under standard complexity conjectures): recognizing all regular languages. Our results also imply that linear steps keep transformer decoders within context-sensitive languages, and polynomial steps make them recognize exactly the class of polynomial-time solvable problems---the first exact characterization of a type of transformers in terms of standard complexity classes. Together, our results provide a nuanced framework for understanding how the length of a transformer\u2019s chain of thought or scratchpad impacts its reasoning power.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NjNGlPh8Wh",
    "arxiv_id": "2310.07923",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18770,
    "title": "fairret: a Framework for Differentiable Fairness Regularization Terms",
    "authors": [
      "Maarten Buyl",
      "MaryBeth Defrance",
      "Tijl De Bie"
    ],
    "abstract": "Current tools for machine learning fairness only admit a limited range of fairness definitions and have seen little integration with automatic differentiation libraries, despite the central role these libraries play in modern machine learning pipelines.We introduce a framework of fairness regularization terms (fairret) which quantify bias as modular objectives that are easily integrated in automatic differentiation pipelines. By employing a general definition of fairness in terms of linear-fractional statistics, a wide class of fairrets can be computed efficiently. Experiments show the behavior of their gradients and their utility in enforcing fairness with minimal loss of predictive power compared to baselines. Our contribution includes a PyTorch implementation of the fairret framework.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NnyD0Rjx2B",
    "arxiv_id": "2310.17256",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18128,
    "title": "Generative Judge for Evaluating Alignment",
    "authors": [
      "Junlong Li",
      "Shichao Sun",
      "Weizhe Yuan",
      "Run-Ze Fan",
      "hai zhao",
      "Pengfei Liu"
    ],
    "abstract": "The rapid development of Large Language Models (LLMs) has substantially expanded the range of tasks they can address. In the field of Natural Language Processing (NLP), researchers have shifted their focus from conventional NLP tasks (e.g., sequence tagging and parsing) towards tasks that revolve around aligning with human needs (e.g., brainstorming and email writing). This shift in task distribution imposes new requirements on evaluating these aligned models regarding *generality* (i.e., assessing performance across diverse scenarios), *flexibility* (i.e., examining under different protocols), and *interpretability* (i.e., scrutinizing models with explanations). In this paper, we propose a generative judge with 13B parameters, **Auto-J**, designed to address these challenges. Our model is trained on user queries and LLM-generated responses under massive real-world scenarios and accommodates diverse evaluation protocols (e.g., pairwise response comparison and single-response evaluation) with well-structured natural language critiques. To demonstrate the efficacy of our approach, we construct a new testbed covering 58 different scenarios. Experimentally, **Auto-J** outperforms a series of strong competitors, including both open-source and closed-source models, by a large margin. We also provide detailed analysis and case studies to further reveal the potential of our method and make a variety of resources public at https://anonymous.4open.science/r/Auto-J-ICLR-ver-0107.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gtkFw6sZGS",
    "arxiv_id": "2310.05470",
    "GitHub": [
      "https://github.com/GAIR-NLP/auto-j"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18127,
    "title": "CausalLM is not optimal for in-context learning",
    "authors": [
      "Nan Ding",
      "Tomer Levinboim",
      "Jialin Wu",
      "Sebastian Goodman",
      "Radu Soricut"
    ],
    "abstract": "Recent empirical evidence indicates that transformer based in-context learning performs better when using a prefix language model (prefixLM), in which in-context samples can all attend to each other, compared to causal language models (causalLM), which use auto-regressive attention that prohibits in-context samples to attend to future samples. While this result is intuitive, it is not understood from a theoretical perspective. In this paper we take a theoretical approach and analyze the convergence behavior of prefixLM and causalLM under a certain parameter construction. Our analysis shows that both LM types converge to their stationary points at a linear rate, but that while prefixLM converges to the optimal solution of linear regression, causalLM convergence dynamics follows that of an online gradient descent algorithm, which is not guaranteed to be optimal even as the number of samples grows infinitely. We supplement our theoretical claims with empirical experiments over synthetic and real tasks and using various types of transformers. Our experiments verify that causalLM consistently underperforms prefixLM in all settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=guRNebwZBb",
    "arxiv_id": "2308.06912",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18126,
    "title": "Dual Associated Encoder for Face Restoration",
    "authors": [
      "YU-JU TSAI",
      "Yu-Lun Liu",
      "Lu Qi",
      "Kelvin C.K. Chan",
      "Ming-Hsuan Yang"
    ],
    "abstract": "Restoring facial details from low-quality (LQ) images has remained challenging due to the nature of the problem caused by various degradations in the wild. The codebook prior has been proposed to address the ill-posed problems by leveraging an autoencoder and learned codebook of high-quality (HQ) features, achieving remarkable quality.However, existing approaches in this paradigm frequently depend on a single encoder pre-trained on HQ data for restoring HQ images, disregarding the domain gap and distinct feature representations between LQ and HQ images.As a result, encoding LQ inputs with the same encoder could be insufficient, resulting in imprecise feature representation and leading to suboptimal performance.To tackle this problem, we propose a novel dual-branch framework named $\\textit{DAEFR}$. Our method introduces an auxiliary LQ branch that extracts domain-specific information from the LQ inputs. Additionally, we incorporate association training to promote effective synergy between the two branches, enhancing code prediction and restoration quality.We evaluate the effectiveness of DAEFR on both synthetic and real-world datasets, demonstrating its superior performance in restoring facial details.Source codes and trained models will be publicly released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gwDuW7Ok5f",
    "arxiv_id": "2308.07314",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18125,
    "title": "Learning Large DAGs is Harder than you Think: Many Losses are Minimal for the Wrong DAG",
    "authors": [
      "Jonas Seng",
      "Matej Ze\u010devi\u0107",
      "Devendra Singh Dhami",
      "Kristian Kersting"
    ],
    "abstract": "Structure learning is a crucial task in science, especially in fields such as medicine and biology, where the wrong identification of (in)dependencies among random variables can have significant implications. The primary objective of structure learning is to learn a Directed Acyclic Graph (DAG) that represents the underlying probability distribution of the data. Many prominent DAG learners rely on least square losses or log-likelihood losses for optimization. It is well-known from regression models that least square losses are heavily influenced by the scale of the variables. Recently it has been demonstrated that the scale of data also affects performance of structure learning algorithms, though with a strong focus on linear 2-node systems and simulated data. Moving beyond these results, we provide conditions under which square-based losses are minimal for wrong DAGs in $d$-dimensional cases. Furthermore, we also show that scale can impair performance of structure learners if relations among variables are non-linear for both square based and log-likelihood based losses. We confirm our theoretical findings through extensive experiments on synthetic and real-world data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gwbQ2YwLhD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17743,
    "title": "VONet: Unsupervised Video Object Learning With Parallel U-Net Attention and Object-wise Sequential VAE",
    "authors": [
      "Haonan Yu",
      "Wei Xu"
    ],
    "abstract": "Unsupervised video object learning seeks to decompose video scenes into structural object representations without any supervision from depth, optical flow, or segmentation. We present VONet, an innovative approach that is inspired by MONet. While utilizing a U-Net architecture, VONet employs an efficient and effective parallel attention inference process, generating attention masks for all slots simultaneously. Additionally, to enhance the temporal consistency of each mask across consecutive video frames, VONet develops an object-wise sequential VAE framework. The integration of these innovative encoder-side techniques, in conjunction with an expressive transformer-based decoder, establishes VONet as the leading unsupervised method for object learning across five MOVI datasets, encompassing videos of diverse complexities. Code is available at https://github.com/hnyu/vonet.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qCyhvr0GG8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17742,
    "title": "Explaining Time Series via Contrastive and Locally Sparse Perturbations",
    "authors": [
      "Zichuan Liu",
      "Yingying ZHANG",
      "Tianchun Wang",
      "Zefan Wang",
      "Dongsheng Luo",
      "Mengnan Du",
      "Min Wu",
      "Yi Wang",
      "Chunlin Chen",
      "Lunting Fan",
      "Qingsong Wen"
    ],
    "abstract": "Explaining multivariate time series is a compound challenge, as it requires identifying important locations in the time series and matching complex temporal patterns.Although previous saliency-based methods addressed the challenges,their perturbation may not alleviate the distribution shift issue, which is inevitable especially in heterogeneous samples.We present ContraLSP, a locally sparse model that introduces counterfactual samples to build uninformative perturbations but keeps distribution using contrastive learning.Furthermore, we incorporate sample-specific sparse gates to generate more binary-skewed and smooth masks, which easily integrate temporal trends and select the salient features parsimoniously.Empirical studies on both synthetic and real-world datasets show that ContraLSP outperforms state-of-the-art models, demonstrating a substantial improvement in explanation quality for time series data.The source code is available at \\url{https://github.com/zichuan-liu/ContraLSP}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qDdSRaOiyb",
    "arxiv_id": "2401.08552",
    "GitHub": [
      "https://github.com/zichuan-liu/ContraLSP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18123,
    "title": "Diffeomorphic Mesh Deformation via Efficient Optimal Transport for Cortical Surface Reconstruction",
    "authors": [
      "Thanh Tung Le",
      "Khai Nguyen",
      "shanlin sun",
      "Kun Han",
      "Nhat Ho",
      "Xiaohui Xie"
    ],
    "abstract": "Mesh deformation plays a pivotal role in many 3D vision tasks including dynamic simulations, rendering, and reconstruction. However, defining an efficient discrepancy between predicted and target meshes remains an open problem. A prevalent approach in current deep learning is the set-based approach which measures the discrepancy between two surfaces by comparing two randomly sampled point-clouds from the two meshes with Chamfer pseudo-distance. Nevertheless, the set-based approach still has limitations such as lacking a theoretical guarantee for choosing the number of points in sampled point-clouds, and the pseudo-metricity and the quadratic complexity of the Chamfer divergence. To address these issues, we propose a novel metric for learning mesh deformation. The metric is defined by sliced Wasserstein distance on meshes represented as probability measures that generalize the set-based approach. By leveraging probability measure space, we gain flexibility in encoding meshes using diverse forms of probability measures, such as continuous, empirical, and discrete measures via \\textit{varifold} representation. After having encoded probability measures, we can compare meshes by using the sliced Wasserstein distance which is an effective optimal transport distance with linear computational complexity and can provide a fast statistical rate for approximating the surface of meshes. To the end, we employ a neural ordinary differential equation (ODE) to deform the input surface into the target shape by modeling the trajectories of the points on the surface. Our experiments on cortical surface reconstruction demonstrate that our approach surpasses other competing methods in multiple datasets and metrics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gxhRR8vUQb",
    "arxiv_id": "2305.17555",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18122,
    "title": "Learning Polynomial Problems with $SL(2, \\mathbb{R})$-Equivariance",
    "authors": [
      "Hannah Lawrence",
      "Mitchell Tong Harris"
    ],
    "abstract": "Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large semidefinite programs, with poor scaling in dimension and degree. In this work, we demonstrate for the first time that neural networks can effectively solve such problems in a data-driven fashion, achieving tenfold speedups while retaining high accuracy. Moreover, we observe that these polynomial learning problems are equivariant to the non-compact group $SL(2,\\mathbb{R})$, which consists of area-preserving linear transformations. We therefore adapt our learning pipelines to accommodate this structure, including data augmentation, a new $SL(2,\\mathbb{R})$-equivariant architecture, and an architecture equivariant with respect to its maximal compact subgroup, $SO(2, \\mathbb{R})$. Surprisingly, the most successful approaches in practice do not enforce equivariance to the entire group, which we prove arises from an unusual lack of architecture universality for $SL(2,\\mathbb{R})$ in particular. A consequence of this result, which is of independent interest, is that there exists an equivariant function for which there is no sequence of equivariant approximating  polynomials. This is a rare example of a symmetric problem where data augmentation outperforms a fully equivariant architecture, and provides interesting lessons in both theory and practice for other problems with non-compact symmetries.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gyfXuRfxW2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18761,
    "title": "Exposing Text-Image Inconsistency Using Diffusion Models",
    "authors": [
      "Mingzhen Huang",
      "Shan Jia",
      "Zhou Zhou",
      "Yan Ju",
      "Jialing Cai",
      "Siwei Lyu"
    ],
    "abstract": "In the battle against widespread online misinformation, a growing problem is text-image inconsistency, where images are misleadingly paired with texts with different intent or meaning. Existing classification-based methods for text-image inconsistency can identify contextual inconsistencies but fail to provide explainable justifications for their decisions that humans can understand. Although more nuanced, human evaluation is impractical at scale and susceptible to errors. To address these limitations, this study introduces D-TIIL (Diffusion-based Text-Image Inconsistency Localization), which employs text-to-image diffusion models to localize semantic inconsistencies in text and image pairs. These models, trained on large-scale datasets act as ``omniscient\" agents that filter out irrelevant information and incorporate background knowledge to identify inconsistencies. In addition, D-TIIL uses text embeddings and modified image regions to visualize these inconsistencies. To evaluate D-TIIL's efficacy, we introduce a new TIIL dataset containing 14K consistent and inconsistent text-image pairs. Unlike existing datasets, TIIL enables assessment at the level of individual words and image regions and is carefully designed to represent various inconsistencies. D-TIIL offers a scalable and evidence-based approach to identifying and localizing text-image inconsistency, providing a robust framework for future research combating misinformation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Ny150AblPu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18121,
    "title": "Automatic Functional Differentiation in JAX",
    "authors": [
      "Min Lin"
    ],
    "abstract": "We extend JAX with the capability to automatically differentiate higher-order functions (functionals and operators). By representing functions as infinite dimensional generalization of arrays, we seamlessly use JAX's existing primitive system to implement higher-order functions. We present a set of primitive operators that serve as foundational building blocks for constructing several key types of functionals. For every introduced primitive operator, we derive and implement both linearization and transposition rules, aligning with JAX's internal protocols for forward and reverse mode automatic differentiation. This enhancement allows for functional differentiation in the same syntax traditionally use for functions. The resulting functional gradients are themselves functions ready to be invoked in python. We showcase this tool's efficacy and simplicity through applications where functional derivatives are indispensable.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gzT61ziSCu",
    "arxiv_id": "2311.18727",
    "GitHub": [
      "https://github.com/sail-sg/autofd"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18120,
    "title": "Path Choice Matters for Clear Attributions in Path Methods",
    "authors": [
      "Borui Zhang",
      "Wenzhao Zheng",
      "Jie Zhou",
      "Jiwen Lu"
    ],
    "abstract": "Rigorousness and clarity are both essential for interpretations of DNNs to engender human trust. Path methods are commonly employed to generate rigorous attributions that satisfy three axioms. However, the meaning of attributions remains ambiguous due to distinct path choices. To address the ambiguity, we introduce Concentration Principle, which centrally allocates high attributions to indispensable features, thereby endowing aesthetic and sparsity. We then present SAMP, a model-agnostic interpreter, which efficiently searches the near-optimal path from a pre-defined set of manipulation paths. Moreover, we propose the infinitesimal constraint (IC) and momentum strategy (MS) to improve the rigorousness and optimality. Visualizations show that SAMP can precisely reveal DNNs by pinpointing salient image pixels.We also perform quantitative experiments and observe that our method significantly outperforms the counterparts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gzYgsZgwXa",
    "arxiv_id": "2401.10442",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18119,
    "title": "Language Model Beats Diffusion - Tokenizer is key to visual generation",
    "authors": [
      "Lijun Yu",
      "Jose Lezama",
      "Nitesh Bharadwaj Gundavarapu",
      "Luca Versari",
      "Kihyuk Sohn",
      "David Minnen",
      "Yong Cheng",
      "Agrim Gupta",
      "Xiuye Gu",
      "Alexander G Hauptmann",
      "Boqing Gong",
      "Ming-Hsuan Yang",
      "Irfan Essa",
      "David A Ross",
      "Lu Jiang"
    ],
    "abstract": "While Large Language Models (LLMs) are the dominant models for generative tasks in language, they do not perform as well as diffusion models on image and video generation. To effectively use LLMs for visual generation, one crucial component is the visual tokenizer that maps pixel-space inputs to discrete tokens appropriate for LLM learning. In this paper, we introduce \\modelname{}, a video tokenizer designed to generate concise and expressive tokens for both videos and images using a common token vocabulary. Equipped with this new tokenizer, we show that LLMs outperform diffusion models on standard image and video generation benchmarks including ImageNet and Kinetics. In addition, we demonstrate that our tokenizer surpasses the previously top-performing video tokenizer on two more tasks: (1) video compression comparable to the next-generation video codec (VCC) according to human evaluations, and (2) learning effective representations for action recognition tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gzqrANCF4g",
    "arxiv_id": "2310.05737",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18118,
    "title": "Understanding Certified Training with Interval Bound Propagation",
    "authors": [
      "Yuhao Mao",
      "Mark Niklas Mueller",
      "Marc Fischer",
      "Martin Vechev"
    ],
    "abstract": "As robustness verification methods are becoming more precise, training certifiably robust neural networks is becoming ever more relevant. To this end, certified training methods compute and then optimize an upper bound on the worst-case loss over a robustness specification. Curiously, training methods based on the imprecise interval bound propagation (IBP) consistently outperform those leveraging more precise bounds. Still, we lack a theoretical understanding of the mechanisms making IBP so successful. In this work, we investigate these mechanisms by leveraging a novel metric measuring the tightness of IBP bounds. We first show theoretically that, for deep linear models (DLNs), tightness decreases with width and depth at initialization, but improves with IBP training. We, then, derive sufficient and necessary conditions on weight matrices for IBP bounds to become exact and demonstrate that these impose strong regularization, providing an explanation for the observed robustness-accuracy trade-off. Finally, we show how these results on DLNs transfer to ReLU networks, before conducting an extensive empirical study, (i) confirming this transferability and yielding state-of-the-art certified accuracy, (ii) finding that while all IBP-based training methods lead to high tightness, this increase is dominated by the size of the propagated input regions rather than the robustness specification, and finally (iii) observing that non-IBP-based methods do not increase tightness. Together, these results help explain the success of recent certified training methods and may guide the development of new ones.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h05eQniJsQ",
    "arxiv_id": "2306.10426",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18117,
    "title": "DFormer: Rethinking RGBD Representation Learning for Semantic Segmentation",
    "authors": [
      "Bowen Yin",
      "Xuying Zhang",
      "Zhong-Yu Li",
      "Li Liu",
      "Ming-Ming Cheng",
      "Qibin Hou"
    ],
    "abstract": "We present DFormer, a novel RGB-D pretraining framework to learn transferable representations for RGB-D segmentation tasks. DFormer has two new key innovations: 1) Unlike previous works that encode RGB-D information with RGB pretrained backbone, we pretrain the backbone using image-depth pairs from ImageNet-1K, and thus the DFormer is endowed with the capacity to encode RGB-D representations; 2) DFormer comprises a sequence of RGB-D blocks, which are tailored for encoding both RGB and depth information through a novel building block design. DFormer avoids the mismatched encoding of the 3D geometry relationships in depth maps by RGB pretrained backbones, which widely lies in existing methods but has not been resolved. We finetune the pretrained DFormer on two popular RGB-D tasks, i.e., RGB-D semantic segmentation and RGB-D salient object detection, with a lightweight decoder head. Experimental results show that our DFormer achieves new state-of-the-art performance on these two tasks with less than half of the computational cost of the current best methods on two RGB-D semantic segmentation datasets and five RGB-D salient object detection datasets. Code will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h1sFUGlI09",
    "arxiv_id": "2309.09668",
    "GitHub": [
      "https://github.com/VCIP-RGBD/DFormer"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18116,
    "title": "Improved sampling via learned diffusions",
    "authors": [
      "Lorenz Richter",
      "Julius Berner"
    ],
    "abstract": "Recently, a series of papers proposed deep learning-based approaches to sample from unnormalized target densities using controlled diffusion processes. In this work, we identify these approaches as special cases of the Schr\u00f6dinger bridge problem, seeking the most likely stochastic evolution between a given prior distribution and the specified target, and propose the perspective from measures on path space as a unifying framework. The optimal controls of such entropy-constrained optimal transport problems can then be described by systems of partial differential equations and corresponding backward stochastic differential equations. Building on these optimality conditions and exploiting the path measure perspective, we obtain variational formulations of the respective approaches and recover the objectives which can be approached via gradient descent. Our formulations allow to introduce losses different from the typically employed reverse Kullback-Leibler divergence that is known to suffer from mode collapse. In particular, we propose the so-called $\\textit{log-variance loss}$, which exhibits favorable numerical properties and leads to significantly improved performance across all considered approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h4pNROsO06",
    "arxiv_id": "2307.01198",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18115,
    "title": "Self-Supervised Dataset Distillation for Transfer Learning",
    "authors": [
      "Dong Bok Lee",
      "Seanie Lee",
      "Joonho Ko",
      "Kenji Kawaguchi",
      "Juho Lee",
      "Sung Ju Hwang"
    ],
    "abstract": "Dataset distillation methods have achieved remarkable success in distilling a large dataset into a small set of representative samples. However, they are not designed to produce a distilled dataset that can be effectively used for facilitating self-supervised pre-training. To this end, we propose a novel problem of distilling an unlabeled dataset into a set of small synthetic samples for efficient self-supervised learning (SSL). We first prove that a gradient of synthetic samples with respect to a SSL objective in naive bilevel optimization is \\textit{biased} due to the randomness originating from data augmentations or masking. To address this issue, we propose to minimize the mean squared error (MSE) between a model's representations of the synthetic examples and their corresponding learnable target feature representations for the inner objective, which does not introduce any randomness. Our primary motivation is that the model obtained by the proposed inner optimization can mimic the \\textit{self-supervised target model}. To achieve this, we also introduce the MSE between representations of the inner model and the self-supervised target model on the original full dataset for outer optimization. Lastly, assuming that a feature extractor is fixed, we only optimize a linear head on top of the feature extractor, which allows us to reduce the computational cost and  obtain a closed-form solution of the head with kernel ridge regression. We empirically validate the effectiveness of our method on various applications involving transfer learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h57gkDO2Yg",
    "arxiv_id": "2310.06511",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18114,
    "title": "VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs",
    "authors": [
      "Ling Yang",
      "Ye Tian",
      "Minkai Xu",
      "Zhongyi Liu",
      "Shenda Hong",
      "Wei Qu",
      "Wentao Zhang",
      "Bin CUI",
      "Muhan Zhang",
      "Jure Leskovec"
    ],
    "abstract": "GNN-to-MLP distillation aims to utilize knowledge distillation (KD) to learn computationally-efficient multi-layer perceptron (student MLP) on graph data by mimicking the output representations of teacher GNN. Existing methods mainly make the MLP to mimic the GNN predictions over a few class labels. However, the class space may not be expressive enough for covering numerous diverse local graph structures, thus limiting the performance of knowledge transfer from GNN to MLP. To address this issue, we propose to learn a new powerful graph representation space by directly labeling nodes' diverse local structures for GNN-to-MLP distillation. Specifically, we propose a variant of VQ-VAE to learn a structure-aware tokenizer on graph data that can encode each node's local substructure as a discrete code. The discrete codes constitute a codebook as a new graph representation space that is able to identify different local graph structures of nodes with the corresponding code indices. Then, based on the learned codebook, we propose a new distillation target, namely soft code assignments, to directly transfer the structural knowledge of each node from GNN to MLP. The resulting framework VQGraph achieves new state-of-the-art performance on GNN-to-MLP distillation in both transductive and inductive settings across seven graph datasets. We show that VQGraph with better performance infers faster than GNNs by 828\u00d7, and also achieves accuracy improvement over GNNs and stand-alone MLPs by 3.90% and 28.05% on average, respectively. Our code is available at https://github.com/YangLing0818/VQGraph",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h6Tz85BqRI",
    "arxiv_id": "2308.02117",
    "GitHub": [
      "https://github.com/YangLing0818/VQGraph"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18113,
    "title": "Active Retrosynthetic Planning Aware of Route Quality",
    "authors": [
      "Luotian Yuan",
      "Yemin Yu",
      "Ying Wei",
      "Yongwei Wang",
      "Zhihua Wang",
      "Fei Wu"
    ],
    "abstract": "Retrosynthetic planning is a sequential decision-making process of identifying synthetic routes from the available building block materials to reach a desired target molecule.Though existing planning approaches show promisingly high solving rates and low costs, the trivial route cost evaluation via pre-trained forward reaction prediction models certainly falls short of real-world chemical practice.An alternative option is to annotate the actual cost of a route, such as yield, through chemical experiments or input from chemists, while this often leads to substantial query costs.In order to strike the balance between query costs and route quality evaluation, we propose an Active Retrosynthetic Planning (ARP) framework that remains compatible with the established retrosynthetic planners.On one hand, the proposed ARP trains an actor that decides whether to query the cost of a reaction; on the other hand, it resorts to a critic to estimate the value of a molecule with its preceding reaction cost as input. Those molecules with low reaction costs are preferred to expand first.We apply our framework to different existing approaches on both the benchmark and an expert dataset and demonstrate that it outperforms the existing state-of-the-art approach by 6.2\\% in route quality while reducing the query cost by 12.8\\%.In addition, ARP consistently plans high-quality routes with either abundant or sparse annotations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h7DGnWGeos",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18749,
    "title": "Multi-View Causal Representation Learning with Partial Observability",
    "authors": [
      "Dingling Yao",
      "Danru Xu",
      "Sebastien Lachapelle",
      "Sara Magliacane",
      "Perouz Taslakian",
      "Georg Martius",
      "Julius von K\u00fcgelgen",
      "Francesco Locatello"
    ],
    "abstract": "We present a unified framework for studying the identifiability of representations learned from simultaneously observed views, such as different data modalities. We allow a partially observed setting in which each view constitutes a nonlinear mixture of a subset of underlying latent variables, which can be causally related.We prove that the information shared across all subsets of any number of views can be learned up to a smooth bijection using contrastive learning and a single encoder per view. We also provide graphical criteria indicating which latent variables can be identified through a simple set of rules, which we refer to as identifiability algebra. Our general framework and theoretical results unify and extend several previous work on multi-view nonlinear ICA, disentanglement, and causal representation learning. We experimentally validate our claims on numerical, image, and multi-modal data sets. Further, we demonstrate that the performance of prior methods is recovered in different special cases of our setup. Overall, we find that access to multiple partial views offers unique opportunities for identifiable representation learning, enabling the discovery of latent structures from purely observational data.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=OGtnhKQJms",
    "arxiv_id": "2311.04056",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18748,
    "title": "Protein Multimer Structure Prediction via Prompt Learning",
    "authors": [
      "Ziqi Gao",
      "Xiangguo Sun",
      "Zijing Liu",
      "Yu Li",
      "Hong Cheng",
      "Jia Li"
    ],
    "abstract": "Understanding the 3D structures of protein multimers is crucial, as they play a vital role in regulating various cellular processes. It has been empirically confirmed that the multimer structure prediction (MSP) can be well handled in a step-wise assembly fashion using provided dimer structures and predicted protein-protein interactions (PPIs). However, due to the biological gap in the formation of dimers and larger multimers, directly applying PPI prediction techniques can often cause a poor generalization to the MSP task. To address this challenge, we aim to extend the PPI knowledge to multimers of different scales (i.e., chain numbers). Specifically, we propose PromptMSP, a pre-training and Prompt tuning framework for Multimer Structure Prediction. First, we tailor the source and target tasks for effective PPI knowledge learning and efficient inference, respectively. We design PPI-inspired prompt learning to narrow the gaps of two task formats and generalize the PPI knowledge to multimers of different scales. We utilize the meta-learning approach to learn a reliable initialization of the prompt model, enabling our prompting framework to effectively adapt to limited data for large-scale multimers. Empirically, we achieve both significant accuracy (RMSD and TM-Score) and efficiency improvements compared to advanced MSP models. For instance, when both methods utilize AlphaFold-Multimer to prepare dimers, PromptMSP achieves a 21.43\\% improvement in TM-Score with only 0.5\\% of the running time compared to the competitive MoLPC baseline.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OHpvivXrQr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18108,
    "title": "Solving Homogeneous and Heterogeneous Cooperative Tasks with Greedy Sequential Execution",
    "authors": [
      "Shanqi Liu",
      "Dong Xing",
      "Pengjie Gu",
      "Xinrun Wang",
      "Bo An",
      "Yong Liu"
    ],
    "abstract": "Effectively handling both homogeneous and heterogeneous tasks is crucial for the practical application of cooperative agents. However, existing solutions have not been successful in addressing both types of tasks simultaneously. On one hand, value-decomposition-based approaches demonstrate superior performance in homogeneous tasks. Nevertheless, they tend to produce agents with similar policies, which is unsuitable for heterogeneous tasks. On the other hand, solutions based on personalized observation or assigned roles are well-suited for heterogeneous tasks. However, they often lead to a trade-off situation where the agent's performance in homogeneous scenarios is negatively affected due to the aggregation of distinct policies. An alternative approach is to adopt sequential execution policies, which offer a flexible form for learning both types of tasks. However, learning sequential execution policies poses challenges in terms of credit assignment, and the lack of sufficient information about subsequently executed agents can lead to sub-optimal solutions. To tackle these issues, this paper proposes Greedy Sequential Execution (GSE) as a solution to learn the optimal policy that covers both scenarios. In the proposed GSE framework, we introduce an individual utility function into the framework of value decomposition to consider the complex interactions between agents. This function is capable of representing both the homogeneous and heterogeneous optimal policies. Furthermore, we utilize a greedy marginal contribution calculated by the utility function as the credit value of the sequential execution policy to address the credit assignment problem. We evaluated GSE in both homogeneous and heterogeneous scenarios. The results demonstrate that GSE achieves significant improvement in performance across multiple domains, especially in scenarios involving both homogeneous and heterogeneous tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=hB2hXtxIPH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18739,
    "title": "Evoke: Evoking Critical Thinking Abilities in LLMs via Reviewer-Author Prompt Editing",
    "authors": [
      "Xinyu Hu",
      "Pengfei Tang",
      "Simiao Zuo",
      "Zihan Wang",
      "Bowen Song",
      "Qiang Lou",
      "Jian Jiao",
      "Denis X Charles"
    ],
    "abstract": "Large language models (LLMs) have made impressive progress in natural language processing. These models rely on proper human instructions (or prompts) to generate suitable responses. However, the potential of LLMs are not fully harnessed by commonly-used prompting methods: many human-in-the-loop algorithms employ ad-hoc procedures for prompt selection; while auto prompt generation approaches are essentially searching all possible prompts randomly and inefficiently. We propose Evoke, an automatic prompt refinement framework. In Evoke, there are two instances of a same LLM: one as a reviewer (LLM-Reviewer), it scores the current prompt; the other as an author (LLM-Author), it edits the prompt by considering the edit history and the reviewer's feedback. Such an author-reviewer feedback loop ensures that the prompt is refined in each iteration. We further aggregate a data selection approach to Evoke, where only the hard samples are exposed to the LLM. The hard samples are more important because the LLM can develop deeper understanding of the tasks out of them, while the model may already know how to solve the easier cases. Experimental results show that Evoke significantly outperforms existing methods. For instance, in the challenging task of logical fallacy detection, Evoke scores above 80, while all other baseline methods struggle to reach 20.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OXv0zQ1umU",
    "arxiv_id": "2310.13855",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18734,
    "title": "Spectrally Transformed Kernel Regression",
    "authors": [
      "Runtian Zhai",
      "Rattana Pukdee",
      "Roger Jin",
      "Maria Florina Balcan",
      "Pradeep Kumar Ravikumar"
    ],
    "abstract": "Unlabeled data is a key component of modern machine learning. In general, the roleof unlabeled data is to impose a form of smoothness, usually from the similarityinformation encoded in a base kernel, such as the \u03f5-neighbor kernel or the adjacencymatrix of a graph. This work revisits the classical idea of spectrally transformedkernel regression (STKR), and provides a new class of general and scalable STKRestimators able to leverage unlabeled data. Intuitively, via spectral transformation,STKR exploits the data distribution for which unlabeled data can provide additionalinformation. First, we show that STKR is a principled and general approach,by characterizing a universal type of \u201ctarget smoothness\u201d, and proving that anysufficiently smooth function can be learned by STKR. Second, we provide scalableSTKR implementations for the inductive setting and a general transformationfunction, while prior work is mostly limited to the transductive setting. Third, wederive statistical guarantees for two scenarios: STKR with a known polynomialtransformation, and STKR with kernel PCA when the transformation is unknown.Overall, we believe that this work helps deepen our understanding of how to workwith unlabeled data, and its generality makes it easier to inspire new methods.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=OeQE9zsztS",
    "arxiv_id": "2402.00645",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18728,
    "title": "Universal Humanoid Motion Representations for Physics-Based Control",
    "authors": [
      "Zhengyi Luo",
      "Jinkun Cao",
      "Josh Merel",
      "Alexander Winkler",
      "Jing Huang",
      "Kris M. Kitani",
      "Weipeng Xu"
    ],
    "abstract": "We present a universal motion representation that encompasses a comprehensive range of motor skills for physics-based humanoid control. Due to the high-dimensionality of humanoid control as well as the inherent difficulties in reinforcement learning, prior methods have focused on learning skill embeddings for a narrow range of movement styles (e.g. locomotion, game characters) from specialized motion datasets. This limited scope hampers its applicability in complex tasks. Our work closes this gap, significantly increasing the coverage of motion representation space. To achieve this, we first learn a motion imitator that can imitate all of human motion from a large, unstructured motion dataset. We then create our motion representation by distilling skills directly from the imitator. This is achieved using an encoder-decoder structure with a variational information bottleneck. Additionally, we jointly learn a prior conditioned on proprioception (humanoid's own pose and velocities) to improve model expressiveness and sampling efficiency for downstream tasks. Sampling from the prior, we can generate long, stable, and diverse human motions. Using this latent space for hierarchical RL, we show that our policies solve tasks using natural and realistic human behavior. We demonstrate the effectiveness of our motion representation by solving generative tasks and motion tracking using VR controllers.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=OrOd8PxOO2",
    "arxiv_id": "2310.04582",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18107,
    "title": "PhyloGFN: Phylogenetic inference with generative flow networks",
    "authors": [
      "Ming Yang Zhou",
      "Zichao Yan",
      "Elliot Layne",
      "Nikolay Malkin",
      "Dinghuai Zhang",
      "Moksh Jain",
      "Mathieu Blanchette",
      "Yoshua Bengio"
    ],
    "abstract": "Phylogenetics is a branch of computational biology that studies the evolutionary relationships among biological entities. Its long history and numerous applications notwithstanding, inference of phylogenetic trees from sequence data remains challenging: the high complexity of tree space poses a significant obstacle for the current combinatorial and probabilistic techniques. In this paper, we adopt the framework of generative flow networks (GFlowNets) to tackle two core problems in phylogenetics: parsimony-based and Bayesian phylogenetic inference. Because GFlowNets are well-suited for sampling complex combinatorial structures, they are a natural choice for exploring and sampling from the multimodal posterior distribution over tree topologies and evolutionary distances. We demonstrate that our amortized posterior sampler, PhyloGFN, produces diverse and high-quality evolutionary hypotheses on real benchmark datasets. PhyloGFN is competitive with prior works in marginal likelihood estimation and achieves a closer fit to the target distribution than state-of-the-art variational inference methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hB7SlfEmze",
    "arxiv_id": "2310.08774",
    "GitHub": [
      "https://github.com/zmy1116/phylogfn"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18106,
    "title": "PolyVoice: Language Models for Speech to Speech Translation",
    "authors": [
      "Qian qian Dong",
      "Zhiying Huang",
      "Qiao Tian",
      "Chen Xu",
      "Tom Ko",
      "yunlong zhao",
      "Siyuan Feng",
      "Tang Li",
      "Kexin Wang",
      "Xuxin Cheng",
      "Fengpeng Yue",
      "Ye Bai",
      "Xi Chen",
      "Lu Lu",
      "Zejun MA",
      "Yuping Wang",
      "Mingxuan Wang",
      "Yuxuan Wang"
    ],
    "abstract": "With the huge success of GPT models in natural language processing, there is a growing interest in applying language modeling approaches to speech tasks.Currently, the dominant architecture in speech-to-speech translation (S2ST) remains the encoder-decoder paradigm, creating a need to investigate the impact of language modeling approaches in this area. In this study, we introduce PolyVoice, a language model-based framework designed for S2ST systems. Our framework comprises three decoder-only language models: a translation language model, a duration language model, and a speech synthesis language model. These language models employ different types of prompts to extract learned information effectively. By utilizing unsupervised semantic units, our framework can transfer semantic information across these models, making it applicable even to unwritten languages. We evaluate our system on Chinese $\\rightarrow$ English and English $\\rightarrow$ Spanish language pairs. Experimental results demonstrate that PolyVoice outperforms the state-of-the-art encoder-decoder model, producing voice-cloned speech with high translation and audio quality.Speech samples are available at \\url{https://polyvoice.github.io}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hCrFG9cyuC",
    "arxiv_id": "2306.02982",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18105,
    "title": "P$^2$OT: Progressive Partial Optimal Transport for Deep Imbalanced Clustering",
    "authors": [
      "Chuyu Zhang",
      "Hui Ren",
      "Xuming He"
    ],
    "abstract": "Deep clustering, which learns representation and semantic clustering without labels information, poses a great challenge for deep learning-based approaches. Despite significant progress in recent years, most existing methods focus on uniformly distributed datasets, significantly limiting the practical applicability of their methods. In this paper, we first introduce a more practical problem setting named deep imbalanced clustering, where the underlying classes exhibit an imbalance distribution. To tackle this problem, we propose a novel pseudo-labeling-based learning framework. Our framework formulates pseudo-label generation as a progressive partial optimal transport problem, which progressively transports each sample to imbalanced clusters under prior distribution constraints, thus generating imbalance-aware pseudo-labels and learning from high-confidence samples.In addition, we transform the initial formulation into an unbalanced optimal transport problem with augmented constraints, which can be solved efficiently by a fast matrix scaling algorithm. Experiments on various datasets, including a human-curated long-tailed CIFAR100, challenging ImageNet-R, and large-scale subsets of fine-grained iNaturalist2018 datasets, demonstrate the superiority of our method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hD3sGVqPsr",
    "arxiv_id": "2401.09266",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18104,
    "title": "Label-free Node Classification on Graphs with Large Language Models (LLMs)",
    "authors": [
      "Zhikai Chen",
      "Haitao Mao",
      "Hongzhi Wen",
      "Haoyu Han",
      "Wei Jin",
      "Haiyang Zhang",
      "Hui Liu",
      "Jiliang Tang"
    ],
    "abstract": "In recent years, there have been remarkable advancements in node classification achieved by Graph Neural Networks (GNNs). However, they necessitate abundant high-quality labels to ensure promising performance. In contrast, Large Language Models (LLMs) exhibit impressive zero-shot proficiency on text-attributed graphs. Yet, they face challenges in efficiently processing structural data and suffer from high inference costs. In light of these observations, this work introduces a label-free node classification on graphs with LLMs pipeline, LLM-GNN. It amalgamates the strengths of both GNNs and LLMs while mitigating their limitations. Specifically, LLMs are leveraged to annotate a small portion of nodes and then GNNs are trained on LLMs' annotations to make predictions for the remaining large portion of nodes. The implementation of LLM-GNN faces a unique challenge: how can we actively select nodes for LLMs to annotate and consequently enhance the GNN training? How can we leverage LLMs to obtain annotations of high quality, representativeness, and diversity, thereby enhancing GNN performance with less cost?To tackle this challenge, we develop an annotation quality heuristic and leverage the confidence scores derived from LLMs to advanced node selection. Comprehensive experimental results validate the effectiveness of LLM-GNN. In particular, LLM-GNN can achieve an accuracy of 74.9\\% on a vast-scale dataset \\products with a cost less than 1 dollar.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hESD2NJFg8",
    "arxiv_id": "2310.04668",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18102,
    "title": "True Knowledge Comes from Practice: Aligning Large Language Models with Embodied Environments via Reinforcement Learning",
    "authors": [
      "Weihao Tan",
      "Wentao Zhang",
      "Shanqi Liu",
      "Longtao Zheng",
      "Xinrun Wang",
      "Bo An"
    ],
    "abstract": "Despite the impressive performance across numerous tasks, large language models (LLMs) often fail in solving simple decision-making tasks due to the misalignment of the knowledge in LLMs with environments. On the contrary, reinforcement learning (RL) agents learn policies from scratch, which makes them always align with environments but difficult to incorporate prior knowledge for efficient explorations. To narrow the gap, we propose TWOSOME, a novel general online framework that deploys LLMs as decision-making agents to efficiently interact and align with embodied environments via RL without requiring any prepared datasets or prior knowledge of the environments. Firstly, we query thejoint probabilities of each valid action with LLMs to form behavior policies. Then, to enhance the stability and robustness of the policies, we propose two normalization methods and summarize four prompt design principles. Finally, we design a novel parameter-efficient training architecture where the actor and critic share one frozen LLM equipped with low-rank adapters (LoRA) updated by PPO. We conduct extensive experiments to evaluate TWOSOME. i) TWOSOME exhibits significantly better sample efficiency and performance compared to the conventional RL method, PPO, and prompt tuning method, SayCan, in both classical decision-making environment, Overcooked, and simulated household environment, VirtualHome. ii) Benefiting from LLMs' open-vocabulary feature, TWOSOME shows superior generalization ability to unseen tasks. iii) Under our framework, there is no significant loss of the LLMs' original ability during online PPO finetuning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hILVmJ4Uvu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18101,
    "title": "Contrastive Learning is Spectral Clustering on Similarity Graph",
    "authors": [
      "Zhiquan Tan",
      "Yifan Zhang",
      "Jingqin Yang",
      "Yang Yuan"
    ],
    "abstract": "Contrastive learning is a powerful self-supervised learning method, but we have a limited theoretical understanding of how it works and why it works. In this paper, we prove that contrastive learning with the standard InfoNCE loss is equivalent to spectral clustering on the similarity graph. Using this equivalence as the building block, we extend our analysis to the CLIP model and rigorously characterize how similar multi-modal objects are embedded together. Motivated by our theoretical insights, we introduce the Kernel-InfoNCE loss, incorporating mixtures of kernel functions that outperform the standard Gaussian kernel on several vision datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hLZQTFGToA",
    "arxiv_id": "2303.15103",
    "GitHub": [
      "https://github.com/yifanzhang-pro/Kernel-InfoNCE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18100,
    "title": "Lemur: Harmonizing Natural Language and Code for Language Agents",
    "authors": [
      "Yiheng Xu",
      "Hongjin SU",
      "Chen Xing",
      "Boyu Mi",
      "Qian Liu",
      "Weijia Shi",
      "Binyuan Hui",
      "Fan Zhou",
      "Yitao Liu",
      "Tianbao Xie",
      "Zhoujun Cheng",
      "Siheng Zhao",
      "Lingpeng Kong",
      "Bailin Wang",
      "Caiming Xiong",
      "Tao Yu"
    ],
    "abstract": "We introduce Lemur and Lemur-Chat, openly accessible language models optimized for both natural language and coding capabilities to serve as the backbone of versatile language agents. The evolution from language chat models to fully functional language agents necessitates models to ground natural language instructions effectively in diverse environments and execute valid actions within them, requiring models for the synergy between language and coding capabilities. Lemur and Lemur-Chat are proposed to address this necessity, demonstrating balanced proficiencies in both domains, unlike existing open-source models that tend to specialize in either. Through meticulous pre-training using a code-intensive corpus and instruction fine-tuning on text and code data, our models achieve state-of-the-art averaged performance across diverse text and coding benchmarks. Comprehensive experiments demonstrate Lemur\u2019s superiority over existing open-source models and its proficiency across various agent tasks involving human communication, tool usage, and interaction under fully- and partially- observable environments. The harmonization between natural and programming languages enables Lemur-Chat to significantly narrow the gap with proprietary models on agent abilities, providing key insights into developing advanced open-source agents adept at reasoning, planning, and operating seamlessly across environments. Our model and code will be open-sourced.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=hNhwSmtXRh",
    "arxiv_id": "2310.06830",
    "GitHub": [
      "https://github.com/OpenLemur/Lemur"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18099,
    "title": "Piecewise Linear Parametrization of Policies: Towards Interpretable Deep Reinforcement Learning",
    "authors": [
      "Maxime Wabartha",
      "Joelle Pineau"
    ],
    "abstract": "Learning inherently interpretable policies is a central challenge in the path to developing autonomous agents that humans can trust. Linear policies can justify their decisions while interacting in a dynamic environment, but their reduced expressivity prevents them from solving hard tasks. Instead, we argue for the use of piecewise-linear policies. We carefully study to what extent they can retain the interpretable properties of linear policies while reaching competitive performance with neural baselines. In particular, we propose the HyperCombinator (HC), a piecewise-linear neural architecture expressing a policy with a controllably small number of sub-policies. Each sub-policy is linear with respect to interpretable features, shedding light on the decision process of the agent without requiring an additional explanation model. We evaluate HC policies in control and navigation experiments, visualize the improved interpretability of the agent and highlight its trade-off with performance. Moreover, we validate that the restricted model class that the HyperCombinator belongs to is compatible with the algorithmic constraints of various reinforcement learning algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hOMVq57Ce0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18713,
    "title": "Reinforcement Symbolic Regression Machine",
    "authors": [
      "Yilong Xu",
      "Yang Liu",
      "Hao Sun"
    ],
    "abstract": "In nature, the behavior of many complex systems can be described by parsimonious math equations. Symbolic Regression (SR) is defined as the task of automatically distilling equations from limited data. Keen efforts have been placed on tackling this issue and demonstrated success in SR. However, there still exist bottlenecks that current methods struggle to break, when the expressions we need to explore tend toward infinity and especially when the underlying math formula is intricate. To this end, we propose a novel Reinforcement Symbolic Regression Machine (RSRM) that masters the capability of uncovering complex math equations from only scarce data. The RSRM model is composed of three key modules: (1) a Monte Carlo tree search (MCTS) agent, designed for exploration, that explores optimal math expression trees consisting of pre-defined math operators and variables, (2) a Double Q-learning block,  designed for exploitation, that helps reduce the feasible search space of MCTS via properly understanding the distribution of reward, and (3) a modulated sub-tree discovery block that heuristically learns and defines new math operators to improve representation ability of math expression trees. Binding of these modules yields the SOTA performance of RSRM in SR as demonstrated by multiple benchmark datasets. The RSRM shows clear superiority over several representative baseline models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PJVUWpPnZC",
    "arxiv_id": "2305.14656",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17741,
    "title": "Conditional Instrumental Variable Regression with Representation Learning for Causal Inference",
    "authors": [
      "Debo Cheng",
      "Ziqi Xu",
      "Jiuyong Li",
      "Lin Liu",
      "Jixue Liu",
      "Thuc Duy Le"
    ],
    "abstract": "This paper studies the challenging problem of estimating causal effects from observational data, in the presence of unobserved confounders. The two-stage least square (TSLS) method and its variants with a standard instrumental variable (IV) are commonly used to eliminate confounding bias, including the bias caused by unobserved confounders, but they rely on the linearity assumption. Besides, the strict condition of unconfounded instruments posed on a standard IV is too strong to be practical. To address these challenging and practical problems of the standard IV method (linearity assumption and the strict condition), in this paper, we use a conditional IV (CIV) to relax the unconfounded instrument condition of standard IV and propose a non-linear \\underline{CIV} regression with \\underline{C}onfounding \\underline{B}alancing \\underline{R}epresentation \\underline{L}earning,  CBRL.CIV, for jointly eliminating the confounding bias from unobserved confounders and balancing the observed confounders, without the linearity assumption. We theoretically demonstrate the soundness of CBRL.CIV. Extensive experiments on synthetic and two real-world datasets show the competitive performance of CBRL.CIV against state-of-the-art IV-based estimators and superiority in dealing with the non-linear situation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qDhq1icpO8",
    "arxiv_id": "2310.01865",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18705,
    "title": "Integrating Planning and Deep Reinforcement Learning via Automatic Induction of Task Substructures",
    "authors": [
      "Jung-Chun Liu",
      "Chi-Hsien Chang",
      "Shao-Hua Sun",
      "Tian-Li Yu"
    ],
    "abstract": "Despite the recent advancement in deep reinforcement learning (DRL), it still struggles at learning sparse-reward goal-directed tasks. On the other hand, classical planning approaches excel at addressing tasks with hierarchical structures by employing symbolic knowledge for high-level planning. Yet, most classical planning methods rely on assumptions about pre-defined subtasks, making them inapplicable in domains without domain knowledge or models. To bridge the best of both worlds, we propose a framework that integrates DRL with classical planning by automatically inducing task structures and substructures from a few demonstrations. Specifically, we use symbolic regression for substructure induction by adopting genetic programming where the program model reflects prior domain knowledge of effect rules. We compare our proposed framework to DRL algorithms, imitation learning methods, and an exploration approach in various domains. The experimental results show that our framework outperforms the baselines in terms of sample efficiency and task performance. Moreover, our framework achieves strong generalization performance by inducing the new rules and composing the task structures. Ablation studies justify the design of the induction module and the proposed genetic programming procedure.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PR6RMsxuW7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18098,
    "title": "Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates",
    "authors": [
      "Siqi Zhang",
      "Sayantan Choudhury",
      "Sebastian U Stich",
      "Nicolas Loizou"
    ],
    "abstract": "Distributed and federated learning algorithms and techniques associated primarily with minimization problems. However, with the increase of minimax optimization and variational inequality problems in machine learning, the necessity of designing efficient distributed/federated learning approaches for these problems is becoming more apparent. In this paper, we provide a unified convergence analysis of communication-efficient local training methods for distributed variational inequality problems (VIPs). Our approach is based on a general key assumption on the stochastic estimates that allows us to propose and analyze several novel local training algorithms under a single framework for solving a class of structured non-monotone VIPs. We present the first local gradient descent-accent algorithms with provable improved communication complexity for solving distributed variational inequalities on heterogeneous data. The general algorithmic framework recovers state-of-the-art algorithms and their sharp convergence guarantees when the setting is specialized to minimization or minimax optimization problems. Finally, we demonstrate the strong performance of the proposed algorithms compared to state-of-the-art methods when solving federated minimax optimization problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hORCalGn3Z",
    "arxiv_id": "2306.05100",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18097,
    "title": "Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited",
    "authors": [
      "Lu Yu",
      "Avetik Karagulyan",
      "Arnak S. Dalalyan"
    ],
    "abstract": "We revisit the problem of sampling from a target distribution that has a smooth strongly log-concave density everywhere in $\\mathbb{R}^p$. In this context, if no additional density information is available, the randomized midpoint discretization for the kinetic Langevin diffusion is known to be the most scalable method in high dimensions with large condition numbers. Our main result is a nonasymptotic and easy to compute upper bound on the $W_2$-error of this method. To provide a more thorough explanation of our method for establishing the computable upper bound, we conduct an analysis of the midpoint discretization for the vanilla Langevin process. This analysis helps to clarify the underlying principles and provides valuable insights that we use to establish an improved upper bound for the kinetic Langevin process with the midpoint discretization. Furthermore, by applying these techniques we establish new guarantees for the kinetic Langevin process with Euler discretization, which have a better dependence on the condition number than existing upper bounds",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hOxgrGM63n",
    "arxiv_id": "2306.08494",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18695,
    "title": "Fusing Models with Complementary Expertise",
    "authors": [
      "Hongyi Wang",
      "Felipe Maia Polo",
      "Yuekai Sun",
      "Souvik Kundu",
      "Eric Xing",
      "Mikhail Yurochkin"
    ],
    "abstract": "Training AI models that generalize across tasks and domains has long been among the open problems driving AI research. The emergence of Foundation Models made it easier to obtain expert models for a given task, but the heterogeneity of data that may be encountered at test time often means that any single expert is insufficient. We consider the Fusion of Experts (FoE) problem of fusing outputs of expert models with complementary knowledge of the data distribution and formulate it as an instance of supervised learning. Our method is applicable to both discriminative and generative tasks and leads to significant performance improvements in image and text classification, text summarization, multiple-choice QA, and automatic evaluation of generated text. We also extend our method to the \"frugal\" setting where it is desired to reduce the number of expert model evaluations at test time.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PhMrGCMIRL",
    "arxiv_id": "2310.01542",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18093,
    "title": "Bongard-OpenWorld: Few-Shot Reasoning for Free-form Visual Concepts in the Real World",
    "authors": [
      "Rujie Wu",
      "Xiaojian Ma",
      "Zhenliang Zhang",
      "Wei Wang",
      "Qing Li",
      "Song-Chun Zhu",
      "Yizhou Wang"
    ],
    "abstract": "We introduce $\\textbf{Bongard-OpenWorld}$, a new benchmark for evaluating real-world few-shot reasoning for machine vision. It originates from the classical Bongard Problems (BPs): Given two sets of images (positive and negative), the model needs to identify the set that query images belong to by inducing the visual concept, which is exclusively depicted by images from the positive set. Our benchmark inherits the few-shot concept induction of the original BPs while adding the two novel layers of challenge: 1) open-world free-form concepts, as the visual concepts in Bongard-OpenWorld are unique compositions of terms from an open vocabulary, ranging from object categories to abstract visual attributes and commonsense factual knowledge; 2)  real-world images, as opposed to the synthetic diagrams used by many counterparts. In our exploration, Bongard-OpenWorld already imposes a significant challenge to current few-shot reasoning algorithms. We further investigate to which extent the recently introduced Large Language Models (LLMs) and Vision-Language Models (VLMs) can solve our task, by directly probing VLMs, and combining VLMs and LLMs in an interactive reasoning scheme. We even designed a neuro-symbolic reasoning approach that reconciles LLMs & VLMs with logical reasoning to emulate the human problem-solving process for Bongard problems. However, none of these approaches manage to close the human-machine gap, as the best learner achieves 64% accuracy while human participants easily reach 91%. We hope Bongard-OpenWorld can help us better understand the limitations of current visual intelligence and facilitate future research on visual agents with stronger few-shot visual reasoning capabilities. All implementation details and reproduction code, including Bongard-OpenWorld dataset, are available in an anonymous github repository https://github.com/Bongard-OpenWorld.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hWS4MueyzC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18092,
    "title": "FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneity",
    "authors": [
      "Kai Yi",
      "Nidham Gazagnadou",
      "Peter Richt\u00e1rik",
      "Lingjuan Lyu"
    ],
    "abstract": "The interest in federated learning has surged in recent research due to its unique ability to train a global model using privacy-secured information held locally on each client. This paper pays particular attention to the issue of client-side model heterogeneity, a pervasive challenge in the practical implementation of FL that escalates its complexity.  Assuming a scenario where each client possesses varied memory storage, processing capabilities and network bandwidth - a phenomenon referred to as system heterogeneity - there is a pressing need to customize a unique model for each client. In response to this, we present an effective and adaptable federated framework FedP3, representing Federated Personalized and Privacy-friendly network Pruning, tailored for model heterogeneity scenarios. Our proposed methodology can incorporate and adapt well-established techniques to its specific instances.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hbHwZYqk9T",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18679,
    "title": "Decodable and Sample Invariant Continuous Object Encoder",
    "authors": [
      "Dehao Yuan",
      "Furong Huang",
      "Cornelia Fermuller",
      "Yiannis Aloimonos"
    ],
    "abstract": "We propose Hyper-Dimensional Function Encoding (HDFE). Given samples of a continuous object (e.g. a function), HDFE produces an explicit vector representation of the given object, invariant to the sample distribution and density. Sample distribution and density invariance enables HDFE to consistently encode continuous objects regardless of their sampling, and therefore allows neural networks to receive continuous objects as inputs for machine learning tasks, such as classification and regression. Besides, HDFE does not require any training and is proved to map the object into an organized embedding space, which facilitates the training of the downstream tasks.  In addition, the encoding is decodable, which enables neural networks to regress continuous objects by regressing their encodings.  Therefore, HDFE serves as an interface for processing continuous objects. We apply HDFE to function-to-function mapping, where vanilla HDFE achieves competitive performance with the state-of-the-art algorithm. We apply HDFE to point cloud surface normal estimation, where a simple replacement from PointNet to HDFE leads to  12\\% and 15\\% error reductions in two benchmarks. In addition, by integrating HDFE into the PointNet-based SOTA network, we improve the SOTA baseline by 2.5\\% and 1.7\\% on the same benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=QLoepRnoue",
    "arxiv_id": "2311.00187",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18090,
    "title": "GPAvatar: Generalizable and Precise Head Avatar from Image(s)",
    "authors": [
      "Xuangeng Chu",
      "Yu Li",
      "Ailing Zeng",
      "Tianyu Yang",
      "Lijian Lin",
      "Yunfei Liu",
      "Tatsuya Harada"
    ],
    "abstract": "Head avatar reconstruction, crucial for applications in virtual reality, online meetings, gaming, and film industries, has garnered substantial attention within the computer vision community. The fundamental objective of this field is to faithfully recreate the head avatar and precisely control expressions and postures. Existing methods, categorized into 2D-based warping, mesh-based, and neural rendering approaches, present challenges in maintaining multi-view consistency, incorporating non-facial information, and generalizing to new identities. In this paper, we propose a framework named GPAvatar that reconstructs 3D head avatars from one or several images in a single forward pass. The key idea of this work is to introduce a dynamic point-based expression field driven by a point cloud to precisely and effectively capture expressions. Furthermore, we use a Multi Tri-planes Attention (MTA) fusion module in tri-planes canonical field to leverage information from multiple input images. The proposed method achieves faithful identity reconstruction, precise expression control, and multi-view consistency, demonstrating promising results for free-viewpoint rendering and novel view synthesis.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hgehGq2bDv",
    "arxiv_id": "2401.10215",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18089,
    "title": "A path-norm toolkit for modern networks: consequences, promises and challenges",
    "authors": [
      "Antoine Gonon",
      "Nicolas Brisebarre",
      "Elisa Riccietti",
      "R\u00e9mi Gribonval"
    ],
    "abstract": "This work introduces the first toolkit around path-norms that is fully able to encompass general DAG ReLU networks with biases, skip connections and max pooling.This toolkit notably allows us to establish generalization bounds for real modern neural networks that are not only the most widely applicable path-norm based ones, but also recover or beat the sharpest known bounds of this type. These extended path-norms further enjoy the usual benefits of path-norms: ease of computation,  invariance under the symmetries of the network, and improved sharpness on feedforward networks compared to the product of operators' norms, another complexity measure most commonly used. The versatility of the toolkit and its ease of implementation allow us to challenge the concrete promises of path-norm-based generalization bounds, by numerically evaluating the sharpest known bounds for ResNets on ImageNet.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=hiHZVUIYik",
    "arxiv_id": "2310.01225",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18088,
    "title": "Better Neural PDE Solvers Through Data-Free Mesh Movers",
    "authors": [
      "Peiyan Hu",
      "Yue Wang",
      "Zhi-Ming Ma"
    ],
    "abstract": "Recently, neural networks have been extensively employed to solve partial differential equations (PDEs) in physical system modeling. While major studies focus on learning system evolution on predefined static mesh discretizations, some methods utilize reinforcement learning or supervised learning techniques to create adaptive and dynamic meshes, due to the dynamic nature of these systems. However, these approaches face two primary challenges: (1) the need for expensive optimal mesh data, and (2) the change of the solution space's degree of freedom and topology during mesh refinement. To address these challenges, this paper proposes a neural PDE solver with a neural mesh adapter. To begin with, we introduce a novel data-free neural mesh adaptor, called Data-free Mesh Mover (DMM), with two main innovations. Firstly, it is an operator that maps the solution to adaptive meshes and is trained using the Monge-Amp\u00e8re equation without optimal mesh data. Secondly, it dynamically changes the mesh by moving existing nodes rather than adding or deleting nodes and edges. Theoretical analysis shows that meshes generated by DMM have the lowest interpolation error bound. Based on DMM, to efficiently and accurately model dynamic systems, we develop a moving mesh based neural PDE solver (MM-PDE) that embeds the moving mesh with a two-branch architecture and a learnable interpolation framework to preserve information within the data. Empirical experiments demonstrate that our method generates suitable meshes and considerably enhances accuracy when modeling widely considered PDE systems. The code can be found at: https://github.com/Peiyannn/MM-PDE.git.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hj9ZuNimRl",
    "arxiv_id": "2312.05583",
    "GitHub": [
      "https://github.com/Peiyannn/MM-PDE.git"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18087,
    "title": "A Differentially Private Clustering Algorithm for Well-Clustered Graphs",
    "authors": [
      "Weiqiang He",
      "Hendrik Fichtenberger",
      "Pan Peng"
    ],
    "abstract": "We study differentially private (DP) algorithms for recovering clusters in well-clustered graphs, which are graphs whose vertex set can be partitioned into a small number of sets, each inducing a subgraph of high inner conductance and small outer conductance. Such graphs have widespread application as a benchmark in the theoretical analysis of spectral clustering.We provide an efficient ($\\epsilon$,$\\delta$)-DP algorithm tailored specifically for such graphs. Our algorithm draws inspiration from the recent work of Chen et al., who developed DP algorithms for recovery of stochastic block models in cases where the graph comprises exactly two nearly-balanced clusters. Our algorithm works for well-clustered graphs with $k$ nearly-balanced clusters, and the misclassification ratio almost matches the one of the best-known non-private algorithms. We conduct experimental evaluations on datasets with known ground truth clusters to substantiate the prowess of our algorithm. We also show that any (pure) $\\epsilon$-DP algorithm would result in substantial error.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hkSjjs4o5d",
    "arxiv_id": "2403.14332",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18086,
    "title": "Polynormer: Polynomial-Expressive Graph Transformer in Linear Time",
    "authors": [
      "Chenhui Deng",
      "Zichao Yue",
      "Zhiru Zhang"
    ],
    "abstract": "Graph transformers (GTs) have emerged as a promising architecture that is theoretically more expressive than message-passing graph neural networks (GNNs). However, typical GT models have at least quadratic complexity and thus cannot scale to large graphs. While there are several linear GTs recently proposed, they still lag behind GNN counterparts on several popular graph datasets, which poses a critical concern on their practical expressivity. To balance the trade-off between expressivity and scalability of GTs, we propose Polynormer, a polynomial-expressive GT model with linear complexity. Polynormer is built upon a novel base model that learns a high-degree polynomial on input features. To enable the base model permutation equivariant, we integrate it with graph topology and node features separately, resulting in local and global equivariant attention models. Consequently, Polynormer adopts a linear local-to-global attention scheme to learn high-degree equivariant polynomials whose coefficients are controlled by attention scores. Polynormer has been evaluated on $13$ homophilic and heterophilic datasets, including large graphs with millions of nodes. Our extensive experiment results show that Polynormer outperforms state-of-the-art GNN and GT baselines on most datasets, even without the use of nonlinear activation functions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hmv1LpNfXa",
    "arxiv_id": "2403.01232",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18083,
    "title": "Causally Aligned Curriculum Learning",
    "authors": [
      "Mingxuan Li",
      "Junzhe Zhang",
      "Elias Bareinboim"
    ],
    "abstract": "A pervasive challenge in Reinforcement Learning (RL) is the ``curse of dimensionality'' which is the exponential growth in the state-action space when optimizing a high-dimensional target task (Bellman, 95). The framework of curriculum learning trains the agent in a curriculum composed of a sequence of related and more manageable source tasks. The expectation is that when some optimal decision rules are shared across source tasks and the target task, the agent could more quickly pick up the necessary skills to behave optimally in the environment, thus accelerating the learning process. However, this critical assumption of invariant optimal decision rules does not necessarily hold in many practical applications, specifically when the underlying environment contains unobserved confounders. This paper studies the problem of curriculum RL through causal lenses. We derive a sufficient graphical condition characterizing causally aligned source tasks, i.e., the invariance of optimal decision rules holds. We further develop an efficient algorithm to generate a causally aligned curriculum, provided with qualitative causal knowledge of the target environment. Finally, we validate our proposed methodology through experiments in confounded environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hp4yOjhwTs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18082,
    "title": "InstructDET: Diversifying Referring Object Detection with Generalized Instructions",
    "authors": [
      "Ronghao Dang",
      "Jiangyan Feng",
      "Haodong Zhang",
      "Chongjian GE",
      "Lin Song",
      "Lijun GONG",
      "Chengju Liu",
      "Qijun Chen",
      "Feng Zhu",
      "Rui Zhao",
      "Yibing Song"
    ],
    "abstract": "We propose InstructDET, a data-centric method for referring object detection (ROD) that localizes target objects based on user instructions. While deriving from referring expressions (REC), the instructions we leverage are greatly diversified to encompass common user intentions related to object detection. For one image, we produce tremendous instructions that refer to every single object and different combinations of multiple objects. Each instruction and its corresponding object bounding boxes (bbxs) constitute one training data pair. In order to encompass common detection expressions, we involve emerging vision-language model (VLM) and large language model (LLM) to generate instructions guided by text prompts and object bbxs, as the generalizations of foundation models are effective to produce human-like expressions (e.g., describing object property, category, and relationship). We name our constructed dataset as InDET. It contains images, bbxs and generalized instructions that are from foundation models. Our InDET is developed from existing REC datasets and object detection datasets, with the expanding potential that any image with object bbxs can be incorporated through using our InstructDET method. By using our InDET dataset, we show that a conventional ROD model surpasses existing methods on standard REC datasets and our InDET test set. Our data-centric method InstructDET, with automatic data expansion by leveraging foundation models, directs a promising field that ROD can be greatly diversified to execute common object detection instructions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hss35aoQ1Y",
    "arxiv_id": "2310.05136",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18081,
    "title": "Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression",
    "authors": [
      "Ivan Butakov",
      "Alexander Tolmachev",
      "Sofia Malanchuk",
      "Anna Neopryatnaya",
      "Alexey Frolov",
      "Kirill Andreev"
    ],
    "abstract": "The Information Bottleneck (IB) principle offers an information-theoretic framework for analyzing the training process of deep neural networks (DNNs). Its essence lies in tracking the dynamics of two mutual information (MI) values: between the hidden layer output and the DNN input/target. According to the hypothesis put forth by Shwartz-Ziv & Tishby (2017), the training process consists of two distinct phases: fitting and compression. The latter phase is believed to account for the good generalization performance exhibited by DNNs. Due to the challenging nature of estimating MI between high-dimensional random vectors, this hypothesis has only been verified for NNs of tiny sizes or specific types, such as quantized NNs. In this paper, we introduce a framework for conducting IB analysis of general NNs. Our approach leverages the stochastic NN method proposed by Goldfeld et al. (2019) and incorporates a compression step to overcome the obstacles associated with high dimensionality. In other words, we estimate the MI between the compressed representations of high-dimensional random vectors. The proposed method is supported by both theoretical and practical justifications. Notably, we demonstrate the accuracy of our estimator through synthetic experiments featuring predefined MI values and comparison with MINE (Belghazi et al., 2018). Finally, we perform IB analysis on a close-to-real-scale convolutional DNN, which reveals new features of the MI dynamics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=huGECz8dPp",
    "arxiv_id": "2305.08013",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18080,
    "title": "Graph Parsing Networks",
    "authors": [
      "Yunchong Song",
      "Siyuan Huang",
      "Xinbing Wang",
      "Chenghu Zhou",
      "Zhouhan Lin"
    ],
    "abstract": "Graph pooling compresses graph information into a compact representation. State-of-the-art graph pooling methods follow a hierarchical approach, which reduces the graph size step-by-step. These methods must balance memory efficiency with preserving node information, depending on whether they use node dropping or node clustering. Additionally, fixed pooling ratios or numbers of pooling layers are predefined for all graphs, which prevents personalized pooling structures from being captured for each individual graph. In this work, inspired by bottom-up grammar induction, we propose an efficient graph parsing algorithm to infer the pooling structure, which then drives graph pooling. The resulting Graph Parsing Network (GPN) adaptively learns personalized pooling structure for each individual graph. GPN benefits from the discrete assignments generated by the graph parsing algorithm, allowing good memory efficiency while preserving node information intact. Experimental results on standard benchmarks demonstrate that GPN outperforms state-of-the-art graph pooling methods in graph classification tasks while being able to achieve competitive performance in node classification tasks. We also conduct a graph reconstruction task to show GPN's ability to preserve node information and measure both memory and time efficiency through relevant tests.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hv3SklibkL",
    "arxiv_id": "2402.14393",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18078,
    "title": "On Bias-Variance Alignment in Deep Models",
    "authors": [
      "Lin Chen",
      "Michal Lukasik",
      "Wittawat Jitkrittum",
      "Chong You",
      "Sanjiv Kumar"
    ],
    "abstract": "Classical wisdom in machine learning holds that the generalization error can be decomposed into bias and variance, and these two terms exhibit a \\emph{trade-off}. However, in this paper, we show that for an ensemble of deep learning based classification models, bias and variance are \\emph{aligned} at a sample level, where squared bias is approximately \\emph{equal} to variance for correctly classified sample points. We present empirical evidence confirming this phenomenon in a variety of deep learning models and datasets. Moreover, we study this phenomenon from two theoretical perspectives: calibration and neural collapse. We first show theoretically that under the assumption that the models are well calibrated, we can observe the bias-variance alignment. Second, starting from the picture provided by the neural collapse theory, we show an approximate correlation between bias and variance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=i2Phucne30",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18661,
    "title": "Is attention required for ICL? Exploring the Relationship Between Model Architecture and In-Context Learning Ability",
    "authors": [
      "Ivan Lee",
      "Nan Jiang",
      "Taylor Berg-Kirkpatrick"
    ],
    "abstract": "What is the relationship between model architecture and the ability to perform in-context learning? In this empirical study, we take the first steps towards answering this question. In particular, we evaluate fifteen model architectures across a suite of synthetic in-context learning tasks. The selected architectures represent a broad range of paradigms, including recurrent and convolution-based neural networks, transformers, and state-space models. We discover that all considered architectures can perform in-context learning under certain conditions. However, contemporary architectures are found to be the best performing, especially as task complexity grows. Additionally, our follow-up experiments delve into various factors that influence in-context learning. We observe varied sensitivities among architectures with respect to hyperparameter settings. Our study of training dynamics reveals that certain architectures exhibit a smooth, progressive learning trajectory, while others demonstrate periods of stagnation followed by abrupt mastery of the task. Finally, and somewhat surprisingly, we find that several state-space model variants are more robust in-context learners than transformers; since state-space models have constant-sized memory footprints at inference time, this result opens the future possibility of scaling up in-context learning to vastly larger numbers of in-context examples.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Qwq4cpLtoX",
    "arxiv_id": "2310.08049",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18076,
    "title": "Locality Sensitive Sparse Encoding for Learning World Models Online",
    "authors": [
      "Zichen Liu",
      "Chao Du",
      "Wee Sun Lee",
      "Min Lin"
    ],
    "abstract": "Model-based reinforcement learning (MBRL) is known to have better sample efficiency. However, acquiring an accurate world model is challenging due to the non-stationarity of data generated from agent interaction, which typically causes catastrophic interference for neural networks (NN). From the online learning perspective, a Follow-The-Leader (FTL) world model is desirable: a model that is optimal for all previous experiences. Unfortunately, for NN-based models, FTL means re-training the NN on all accumulated data at every interaction step, which is computationally expensive for lifelong agents. In this paper, we revisit models that can achieve FTL with efficient incremental updates. Specifically, our world model is a linear regression model supported by nonlinear random features. The linear part ensures efficient FTL update while the nonlinear random feature empowers the fitting of complex environments. To best trade off model capacity and computation efficiency, we introduce a locality sensitive encoding that is sparse in nature, which allows us to perform efficient online update even with very high dimensional nonlinear features. We present empirical results to validate the representation power of our encoding and verify that it is capable of learning incrementally under data covariate shift, a setting neural networks simply fail. Building on the demonstrated strength of our encoding, we further showcase its efficacy in MBRL settings, spanning both discrete and continuous control tasks. Our online world models, trained using a single pass of trajectory data, either surpass or match the capabilities of neural networks trained with replay and other continual learning methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=i8PjQT3Uig",
    "arxiv_id": "2401.13034",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18075,
    "title": "Scaling Laws for Sparsely-Connected Foundation Models",
    "authors": [
      "Elias Frantar",
      "Carlos Riquelme Ruiz",
      "Neil Houlsby",
      "Dan Alistarh",
      "Utku Evci"
    ],
    "abstract": "We explore the impact of parameter sparsity on the scaling behavior of Transformers trained on massive datasets (i.e., \"foundation models\"), in both vision and language domains. In this setting, we identify the first scaling law describing the relationship between weight sparsity, number of non-zero parameters, and amount of training data, which we validate empirically across model and data scales; on ViT/JFT-4B and T5/C4. These results allow us to characterize the \"optimal sparsity\", the sparsity level which yields the best performance for a given effective model size and training budget. For a fixed number of non-zero parameters, we identify that the optimal sparsity increases with the amount of data used for training. We also extend our study to different sparsity structures (such as the hardware-friendly n:m pattern) and strategies (such as starting from a pretrained dense model). Our findings shed light on the power and limitations of weight sparsity across various parameter and computational settings, offering both theoretical understanding and practical implications for leveraging sparsity towards computational efficiency improvements.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=i9K2ZWkYIP",
    "arxiv_id": "2309.08520",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18074,
    "title": "Asymptotically Free Sketched Ridge Ensembles: Risks, Cross-Validation, and Tuning",
    "authors": [
      "Pratik Patil",
      "Daniel LeJeune"
    ],
    "abstract": "We employ random matrix theory to establish consistency of generalized cross validation (GCV) for estimating prediction risks of sketched ridge regression ensembles, enabling efficient and consistent tuning of regularization and sketching parameters. Our results hold for a broad class of asymptotically free sketches under very mild data assumptions. For squared prediction risk, we provide a decomposition into an unsketched equivalent implicit ridge bias and a sketching-based variance, and prove that the risk can be globally optimized by only tuning sketch size in infinite ensembles. For general subquadratic prediction risk functionals, we extend GCV to construct consistent risk estimators, and thereby obtain distributional convergence of the GCV-corrected predictions in Wasserstein-2 metric. This in particular allows construction of prediction intervals with asymptotically correct coverage conditional on the training data. We also propose an \"ensemble trick\" whereby the risk for unsketched ridge regression can be efficiently estimated via GCV using small sketched ridge ensembles. We empirically validate our theoretical results using both synthetic and real large-scale datasets with practical sketches including CountSketch and subsampled randomized discrete cosine transforms.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=i9Vs5NGDpk",
    "arxiv_id": "2310.04357",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18073,
    "title": "Feature emergence via margin maximization: case studies in algebraic tasks",
    "authors": [
      "Depen Morwani",
      "Benjamin L. Edelman",
      "Costin-Andrei Oncescu",
      "Rosie Zhao",
      "Sham M. Kakade"
    ],
    "abstract": "Understanding the internal representations learned by neural networks is a cornerstone challenge in the science of machine learning. While there have been significant recent strides in some cases towards understanding *how* neural networks implement specific target functions, this paper explores a complementary question -- *why* do networks arrive at particular computational strategies? Our inquiry focuses on the algebraic learning tasks of modular addition, sparse parities, and finite group operations. Our primary theoretical findings analytically characterize the features learned by stylized neural networks for these algebraic tasks. Notably, our main technique demonstrates how the principle of margin maximization alone can be used to fully specify the features learned by the network. Specifically, we prove that the trained networks utilize Fourier features to perform modular addition and employ features corresponding to irreducible group-theoretic representations to perform compositions in general groups, aligning closely with the empirical observations of Nanda et al. (2023) and Chughtai et al. (2023). More generally, we hope our techniques can help to foster a deeper understanding of why neural networks adopt specific computational strategies.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=i9wDX850jR",
    "arxiv_id": "2311.07568",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18072,
    "title": "Negatively Correlated Ensemble Reinforcement Learning for Online Diverse Game Level Generation",
    "authors": [
      "Ziqi Wang",
      "Chengpeng Hu",
      "Jialin Liu",
      "Xin Yao"
    ],
    "abstract": "Deep reinforcement learning has recently been successfully applied to online procedural content generation in which a policy determines promising game-level segments.  However, existing methods can hardly discover diverse level patterns, while the lack of diversity makes the gameplay boring. This paper proposes an ensemble reinforcement learning approach that uses multiple negatively correlated sub-policies to generate different alternative level segments, and stochastically selects one of them following a selector model. A novel policy regularisation technique is integrated into the approach to diversify the generated alternatives. In addition, we develop theorems to provide general methodologies for optimising policy regularisation in a Markov decision process. The proposed approach is compared with several state-of-the-art policy ensemble methods and classic methods on a well-known level generation benchmark, with two different reward functions expressing game-design goals from different perspectives. Results show that our approach boosts level diversity notably with competitive performance in terms of the reward.  Furthermore, by varying the regularisation coefficient, the trained generators form a well-spread Pareto front, allowing explicit trade-offs between diversity and rewards of generated levels.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iAW2EQXfwb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18071,
    "title": "Neural Contractive Dynamical Systems",
    "authors": [
      "Hadi Beik Mohammadi",
      "S\u00f8ren Hauberg",
      "Georgios Arvanitidis",
      "Nadia Figueroa",
      "Gerhard Neumann",
      "Leonel Rozo"
    ],
    "abstract": "Stability guarantees are crucial when ensuring a fully autonomous robot does not take undesirable or potentially harmful actions.Unfortunately, global stability guarantees are hard to provide in dynamical systems learned from data, especially when the learned dynamics are governed by neural networks. We propose a novel methodology to learn neural contractive dynamical systems, where our neural architecture ensures contraction, and hence, global stability. To efficiently scale the method to high-dimensional dynamical systems, we develop a variant of the variational autoencoder that learns dynamics in a low-dimensional latent representation space while retaining contractive stability after decoding.  We further extend our approach to learning contractive systems on the Lie group of rotations to account for full-pose end-effector dynamic motions. The result is the first highly flexible learning architecture that provides contractive stability guarantees with capability to perform obstacle avoidance. Empirically, we demonstrate that our approach encodes the desired dynamics more accurately than the current state-of-the-art, which provides less strong stability guarantees.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=iAYIRHOYy8",
    "arxiv_id": "2401.09352",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18070,
    "title": "Rethinking Backdoor Attacks on Dataset Distillation: A Kernel Method Perspective",
    "authors": [
      "Ming-Yu Chung",
      "Sheng-Yen Chou",
      "Chia-Mu Yu",
      "Pin-Yu Chen",
      "Sy-Yen Kuo",
      "Tsung-Yi Ho"
    ],
    "abstract": "Dataset distillation offers a potential means to enhance data efficiency in deep learning. Recent studies have shown its ability to counteract backdoor risks present in original training samples. In this study, we delve into the theoretical aspects of backdoor attacks and dataset distillation based on kernel methods. We introduce two new theory-driven trigger pattern generation methods specialized for dataset distillation. Following a comprehensive set of analyses and experiments, we show that our optimization-based trigger design framework informs effective backdoor attacks on dataset distillation. Notably, datasets poisoned by our designed trigger prove resilient against conventional backdoor attack detection and mitigation methods.  Our empirical results validate that the triggers developed using our approaches are proficient at executing resilient backdoor attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iCNOK45Csv",
    "arxiv_id": "2311.16646",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18069,
    "title": "Poly-View Contrastive Learning",
    "authors": [
      "Amitis Shidani",
      "R Devon Hjelm",
      "Jason Ramapuram",
      "Russell Webb",
      "Eeshan Gunesh Dhekane",
      "Dan Busbridge"
    ],
    "abstract": "Contrastive learning typically matches pairs of related views among a number of unrelated negatives. These two related be generated (e.g. by augmentations) or occur naturally. We investigate matching when there are more than two related views which we call poly-view tasks, and derive new representation learning objectives using information maximization and sufficient statistics. We show that with unlimited computation, one should maximize the number of related views, and with a fixed compute budget, it is beneficial to decrease the number of unique samples whilst increasing the number of views of those samples. In particular, poly-view contrastive models trained for 128 epochs with batch size 256 outperform SimCLR trained for 1024 epochs at batch size 4096 on ImageNet1k, challenging the belief that contrastive models require large batch sizes and many training epochs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iHcTLIor0m",
    "arxiv_id": "2403.05490",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18640,
    "title": "Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning",
    "authors": [
      "Xiaoxin He",
      "Xavier Bresson",
      "Thomas Laurent",
      "Adam Perold",
      "Yann LeCun",
      "Bryan Hooi"
    ],
    "abstract": "Representation learning on text-attributed graphs (TAGs) has become a critical research problem in recent years. A typical example of a TAG is a paper citation graph, where the text of each paper serves as node attributes. Initial graph neural network (GNN) pipelines handled these text attributes by transforming them into shallow or hand-crafted features, such as skip-gram or bag-of-words features. Recent efforts have focused on enhancing these pipelines with language models (LMs), which typically demand intricate designs and substantial computational resources. With the advent of powerful large language models (LLMs) such as GPT or Llama2, which demonstrate an ability to reason and to utilize general knowledge, there is a growing need for techniques which combine the textual modelling abilities of LLMs with the structural learning capabilities of GNNs. Hence, in this work, we focus on leveraging LLMs to capture textual information as features, which can be used to boost GNN performance on downstream tasks. A key innovation is our use of \\emph{explanations as features}: we prompt an LLM to perform zero-shot classification, request textual explanations for its decision-making process, and design an \\emph{LLM-to-LM interpreter} to translate these explanations into informative features that enhance downstream GNNs. Our experiments demonstrate that our method achieves state-of-the-art results on well-established TAG datasets, including \\texttt{Cora}, \\texttt{PubMed}, \\texttt{ogbn-arxiv}, as well as our newly introduced dataset, \\texttt{arXiv-2023}. Furthermore, our method significantly speeds up training, achieving a 2.88 times improvement over the closest baseline on \\texttt{ogbn-arxiv}. Lastly, we believe the versatility of the proposed method extends beyond TAGs and holds the potential to enhance other tasks involving graph-text data~\\footnote{Our codes and datasets are available at: \\url{https://anonymous.4open.science/r/TAPE-dev}}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RXFVcynVe1",
    "arxiv_id": "2305.19523",
    "GitHub": [
      "https://github.com/XiaoxinHe/TAPE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18068,
    "title": "Disentangling Time Series Representations via Contrastive Independence-of-Support on $l$-Variational Inference",
    "authors": [
      "Khalid Oublal",
      "Said Ladjal",
      "David Benhaiem",
      "Emmanuel LE BORGNE",
      "Fran\u00e7ois Roueff"
    ],
    "abstract": "Learning disentangled representations is crucial for Time Series, offering benefits like feature derivation and improved interpretability, thereby enhancing task performance. We focus on disentangled representation learning for home appliance electricity usage, enabling users to understand and optimize their consumption for a reduced carbon footprint. Our approach frames the problem as disentangling each attribute's role in total consumption (e.g., dishwashers, fridges, \\dots). Unlike existing methods assuming attribute independence, we acknowledge real-world time series attribute correlations, like the operating of dishwashers and washing machines during the winter season. To tackle this, we employ weakly supervised contrastive disentanglement, facilitating representation generalization across diverse correlated scenarios and new households. Our method utilizes innovative $l$-variational inference layers with self-attention, effectively addressing temporal dependencies across bottom-up and top-down networks. We find that DisCo (Disentangling via Contrastive) can enhance the task of reconstructing electricity consumption for individual appliances. We introduce TDS (Time Disentangling Score) to gauge disentanglement quality. TDS reliably reflects disentanglement performance, making it a valuable metric for evaluating time series representations. Code available at https://anonymous.4open.science/r/DisCo.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iI7hZSczxE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18066,
    "title": "Identifying Policy Gradient Subspaces",
    "authors": [
      "Jan Schneider",
      "Pierre Schumacher",
      "Simon Guist",
      "Le Chen",
      "Daniel Haeufle",
      "Bernhard Sch\u00f6lkopf",
      "Dieter B\u00fcchler"
    ],
    "abstract": "Policy gradient methods hold great potential for solving complex continuous control tasks. Still, their training efficiency can be improved by exploiting structure within the optimization problem. Recent work indicates that supervised learning can be accelerated by leveraging the fact that gradients lie in a low-dimensional and slowly-changing subspace. In this paper, we demonstrate the existence of such gradient subspaces for policy gradient algorithms despite the continuously changing data distribution inherent to reinforcement learning. Our findings reveal promising directions for more efficient reinforcement learning, e.g., through improving parameter-space exploration or enabling second-order optimization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iPWxqnt2ke",
    "arxiv_id": "2401.06604",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18065,
    "title": "Deceptive Fairness Attacks on Graphs via Meta Learning",
    "authors": [
      "Jian Kang",
      "Yinglong Xia",
      "Ross Maciejewski",
      "Jiebo Luo",
      "Hanghang Tong"
    ],
    "abstract": "We study deceptive fairness attacks on graphs to answer the following question: How can we achieve poisoning attacks on a graph learning model to exacerbate the bias deceptively? We answer this question via a bi-level optimization problem and propose a meta learning-based framework named FATE. FATE is broadly applicable with respect to various fairness definitions and graph learning models, as well as arbitrary choices of manipulation operations. We further instantiate FATE to attack statistical parity and individual fairness on graph neural networks. We conduct extensive experimental evaluations on real-world datasets in the task of semi-supervised node classification. The experimental results demonstrate that FATE could amplify the bias of graph neural networks with or without fairness consideration while maintaining the utility on the downstream task. We hope this paper provides insights into the adversarial robustness of fair graph learning and can shed light on designing robust and fair graph learning in future studies.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iS5ADHNg2A",
    "arxiv_id": "2310.15653",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18064,
    "title": "Kernelised Normalising Flows",
    "authors": [
      "Eshant English",
      "Matthias Kirchler",
      "Christoph Lippert"
    ],
    "abstract": "Normalising Flows are non-parametric statistical models known for their dual capabilities of density estimation and generation. They are distinguished by their inherently invertible architecture. However, the requirement of invertibility imposes constraints on their expressiveness, necessitating a large number of parameters and innovative architectural designs to achieve satisfactory outcomes. Whilst flow-based models predominantly rely on neural-network-based transformations for expressive designs, alternative transformation methods have received limited attention. In this work, we present Ferumal flow, a novel kernelised normalising flow paradigm that integrates kernels into the framework. Our results demonstrate that a kernelised flow can yield competitive or superior results compared to neural network-based flows whilst maintaining parameter efficiency. Kernelised flows excel especially in the low-data regime, enabling flexible non-parametric density estimation in applications with sparse data availability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iTFdNLHE7k",
    "arxiv_id": "2307.14839",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18633,
    "title": "MT-Ranker: Reference-free machine translation evaluation by inter-system ranking",
    "authors": [
      "Ibraheem Muhammad Moosa",
      "Rui Zhang",
      "Wenpeng Yin"
    ],
    "abstract": "Traditionally, Machine Translation (MT) Evaluation has been treated as a regression problem -- producing an absolute translation-quality score. This approach has two limitations: i) the scores lack interpretability, and human annotators struggle with giving consistent scores; ii) most scoring methods are based on (reference, translation) pairs, limiting their applicability in real-world scenarios where references are absent. In practice, we often care about whether a new MT system is better or worse than some competitors. In addition, reference-free MT evaluation is increasingly practical and necessary. Unfortunately, these two practical considerations have yet to be jointly explored. In this work, we formulate the reference-free MT evaluation into a pairwise ranking problem. Given the source sentence and a pair of translations, our system predicts which translation is better. In addition to proposing this new formulation, we further show that this new paradigm can demonstrate superior correlation with human judgments by merely using indirect supervision from natural language inference and weak supervision from our synthetic data. In the context of reference-free evaluation, MT-Ranker, trained without any human annotations, achieves state-of-the-art results on the WMT Shared Metrics Task benchmarks DARR20, MQM20, and MQM21. On a more challenging benchmark, ACES, which contains fine-grained evaluation criteria such as addition, omission, and mistranslation errors, MT-Ranker marks state-of-the-art against reference-free as well as reference-based baselines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Rry1SeSOQL",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18632,
    "title": "Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms",
    "authors": [
      "Yi Li",
      "Honghao Lin",
      "David Woodruff"
    ],
    "abstract": "We study the problem of residual error estimation for matrix and vector norms using a linear sketch. Such estimates can be used, for example, to quickly assess how useful a more expensive low-rank approximation computation will be. The matrix case concerns the Frobenius norm and the task is to approximate the $k$-residual $\\|A - A_k\\|_F$ of the input matrix $A$ within a $(1+\\epsilon)$-factor, where $A_k$ is the optimal rank-$k$ approximation. We provide a tight bound of $\\Theta(k^2/\\epsilon^4)$ on the size of bilinear sketches, which have the form of a matrix product $SAT$. This improves the previous $O(k^2/\\epsilon^6)$ upper bound in (Andoni et al. SODA 2013) and gives the first non-trivial lower bound, to the best of our knowledge. In our algorithm, our sketching matrices $S$ and $T$ can both be sparse matrices, allowing for a very fast update time. We demonstrate that this gives a substantial advantage empirically, for roughly the same sketch size and accuracy as in previous work. For the vector case, we consider the $\\ell_p$-norm for $p>2$, where the task is to approximate the $k$-residual $\\|x - x_k\\|_p$ up to a constant factor, where $x_k$ is the optimal $k$-sparse approximation to $x$. Such vector norms are frequently studied in the data stream literature and are useful for finding frequent items or so-called heavy hitters. We establish an upper bound of $O(k^{2/p}n^{1-2/p}\\operatorname{poly}(\\log n))$ for constant $\\epsilon$ on the dimension of a linear sketch for this problem. Our algorithm can be extended to the $\\ell_p$ sparse recovery problem with the same sketching dimension, which seems to be the first such bound for $p > 2$. We also show an $\\Omega(k^{2/p}n^{1-2/p})$ lower bound for the sparse recovery problem, which is tight up to a $\\mathrm{poly}(\\log n)$ factor.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RsJwmWvE6Q",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18622,
    "title": "Kill Two Birds with One Stone: Rethinking Data Augmentation for Deep Long-tailed Learning",
    "authors": [
      "Binwu Wang",
      "Pengkun Wang",
      "Wei Xu",
      "Xu Wang",
      "Yudong Zhang",
      "Kun Wang",
      "Yang Wang"
    ],
    "abstract": "Real-world tasks are universally associated with training samples that exhibit a long-tailed class distribution, and traditional deep learning models are not suitable for fitting this distribution, thus resulting in a biased trained model. To surmount this dilemma, massive deep long-tailed learning studies have been proposed to achieve inter-class fairness models by designing sophisticated sampling strategies or improving existing model structures and loss functions. Habitually, these studies tend to apply data augmentation strategies to improve the generalization performance of their models. However, this augmentation strategy applied to balanced distributions may not be the best option for long-tailed distributions. For a profound understanding of data augmentation, we first theoretically analyze the gains of traditional augmentation strategies in long-tailed learning, and observe that augmentation methods cause the long-tailed distribution to be imbalanced again, resulting in an intertwined imbalance: inherent data-wise imbalance and extrinsic augmentation-wise imbalance, i.e., two 'birds' co-exist in long-tailed learning. Motivated by this observation, we propose an adaptive Dynamic Optional Data Augmentation (DODA) to address this intertwined imbalance, i.e., one 'stone' simultaneously 'kills' two 'birds', which allows each class to choose appropriate augmentation methods by maintaining a corresponding augmentation probability distribution for each class during training. Extensive experiments across mainstream long-tailed recognition benchmarks (e.g., CIFAR-100-LT, ImageNet-LT, and iNaturalist 2018) prove the effectiveness and flexibility of the DODA in overcoming the intertwined imbalance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RzY9qQHUXy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18062,
    "title": "Contrastive Preference Learning: Learning from Human Feedback without Reinforcement Learning",
    "authors": [
      "Joey Hejna",
      "Rafael Rafailov",
      "Harshit Sikchi",
      "Chelsea Finn",
      "Scott Niekum",
      "W. Bradley Knox",
      "Dorsa Sadigh"
    ],
    "abstract": "Reinforcement Learning from Human Feedback (RLHF) has emerged as a popular paradigm for aligning models with human intent. Typically RLHF algorithms operate in two phases: first, use human preferences to learn a reward function and second, align the model by optimizing the learned reward via reinforcement learning (RL). This paradigm assumes that human preferences are distributed according to reward, but recent work suggests that they instead follow the regret under the user's optimal policy. Thus, learning a reward function from feedback is not only based on a flawed assumption of human preference, but also leads to unwieldy optimization challenges that stem from policy gradients or bootstrapping in the RL phase. Because of these optimization challenges, contemporary RLHF methods restrict themselves to contextual bandit settings (e.g., as in large language models) or limit observation dimensionality (e.g., state-based robotics). We overcome these limitations by introducing a new family of algorithms for optimizing behavior from human feedback using the regret model of human preferences. Using the principle of maximum entropy, we derive Contrastive Preference Learning (CPL), an algorithm for learning optimal policies from preferences without learning reward functions, circumventing the need for RL. CPL is fully off-policy, uses only a simple contrastive objective, and can be applied to arbitrary MDPs. In contrast to prior work, this enables CPL to elegantly scale to high-dimensional and sequential RLHF problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iX1RjVQODj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18606,
    "title": "Neuron Activation Coverage: Rethinking Out-of-distribution Detection and Generalization",
    "authors": [
      "Yibing Liu",
      "Chris XING TIAN",
      "Haoliang Li",
      "Lei Ma",
      "Shiqi Wang"
    ],
    "abstract": "The out-of-distribution (OOD) problem generally arises when neural networks encounter data that significantly deviates from the training data distribution, i.e., in-distribution (InD). In this paper, we study the OOD problem from a neuron activation view. We first formulate neuron activation states by considering both the neuron output and its influence on model decisions. Then, to characterize the relationship between neurons and OOD issues, we introduce the *neuron activation coverage* (NAC) -- a simple measure for neuron behaviors under InD data. Leveraging our NAC, we show that 1) InD and OOD inputs can be largely separated based on the neuron behavior, which significantly eases the OOD detection problem and beats the 21 previous methods over three benchmarks (CIFAR-10, CIFAR-100, and ImageNet-1K). 2) a positive correlation between NAC and model generalization ability consistently holds across architectures and datasets, which enables a NAC-based criterion for evaluating model robustness. Compared to prevalent InD validation criteria, we show that NAC not only can select more robust models, but also has a stronger correlation with OOD test performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=SNGXbZtK6Q",
    "arxiv_id": "2306.02879",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18061,
    "title": "On the Hardness of Online Nonconvex Optimization with Single Oracle Feedback",
    "authors": [
      "Ziwei Guan",
      "Yi Zhou",
      "Yingbin Liang"
    ],
    "abstract": "Online nonconvex optimization has been an active area of research recently. Previous studies either considered the global regret with full information about the objective functions, or studied the local regret with window-smoothed objective functions, which required access to unlimited number of gradient oracles per time step. In this paper, we focus on the more challenging and practical setting, where access to only a single oracle is allowed per time step, and take the local regret of the original (i.e., unsmoothed) objective functions as the performance metric. Specifically, for both settings respectively with a single exact and stochastic gradient oracle feedback, we derive lower bounds on the local regret and show that the classical online (stochastic) gradient descent algorithms are optimal. Moreover, for the more challenging setting with a single function value oracle feedback, we develop an online algorithm based on a one-point running difference gradient estimator, and show that such an algorithm achieves a local regret that a generic stochastic gradient oracle can best achieve.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iZgECfyHXF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18602,
    "title": "When can transformers reason with abstract symbols?",
    "authors": [
      "Enric Boix-Adser\u00e0",
      "Omid Saremi",
      "Emmanuel Abbe",
      "Samy Bengio",
      "Etai Littwin",
      "Joshua M. Susskind"
    ],
    "abstract": "We investigate the capability of Transformer large language models (LLMs) to generalize on unseen symbols when trained on  tasks that rely on abstract symbols (e.g.,  variables in programming and mathematics). Such a 'variable-binding' capability  has long been studied in the neuroscience literature as one of the most basic 'reasoning' capabilities. For (i) binary classification tasks, we prove that Transformers can generalize to unseen symbols but require astonishingly large training data. For (ii) tasks with labels dependent on input symbols, we show an ''inverse scaling law'': Transformers fail to generalize to unseen symbols as their embedding dimension increases. For both cases (i) and (ii), we propose a Transformer modification, adding two trainable parameters per head that can reduce the amount of data needed.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=STUGfUz8ob",
    "arxiv_id": "2310.09753",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18060,
    "title": "Identifiable Latent Polynomial Causal Models through the Lens of Change",
    "authors": [
      "Yuhang Liu",
      "Zhen Zhang",
      "Dong Gong",
      "Mingming Gong",
      "Biwei Huang",
      "Anton van den Hengel",
      "Kun Zhang",
      "Javen Qinfeng Shi"
    ],
    "abstract": "Causal representation learning aims to unveil latent high-level causal representations from observed low-level data. One of its primary tasks is to provide reliable assurance of identifying these latent causal models, known as \\textit{identifiability}. A recent breakthrough explores identifiability by leveraging the change of causal influences among latent causal variables across multiple environments \\citep{liu2022identifying}. However, this progress rests on the assumption that the causal relationships among latent causal variables adhere strictly to linear Gaussian models. In this paper, we extend the scope of latent causal models to involve nonlinear causal relationships, represented by polynomial models, and general noise distributions conforming to the exponential family. Additionally, we investigate the necessity of imposing changes on all causal parameters and present partial identifiability results when part of them remains unchanged. Further, we propose a novel empirical estimation method, grounded in our theoretical finding, that enables learning consistent latent causal representations. Our experimental results, obtained from both synthetic and real-world data, validate our theoretical contributions concerning identifiability and consistency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ia9fKO1Vjq",
    "arxiv_id": "2310.15580",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18576,
    "title": "TiC-CLIP: Continual Training of CLIP Models",
    "authors": [
      "Saurabh Garg",
      "Mehrdad Farajtabar",
      "Hadi Pouransari",
      "Raviteja Vemulapalli",
      "Sachin Mehta",
      "Oncel Tuzel",
      "Vaishaal Shankar",
      "Fartash Faghri"
    ],
    "abstract": "Keeping large foundation models up to date on latest data is inherently expensive. To avoid the prohibitive costs of constantly retraining, it is imperative to continually train these models.  This problem is exacerbated by the lack of any large scale continual learning benchmarks or baselines. We introduce the first set of web-scale Time-Continual (TiC) benchmarks for training vision-language models:  TIC-DataComp, TIC-YFCC, and TIC-RedCaps with over 12.7B timestamped image-text pairs spanning 9 years (2014--2022). We first use our benchmarks to curate various dynamic evaluations to measure temporal robustness of existing models. We show OpenAI\u2019s CLIP (trained on data up to 2020) loses $\\approx 8\\%$ zero-shot accuracy on our curated retrieval task from 2021--2022 compared with more recently trained models in OpenCLIP repository. We then study how to efficiently train models on time-continuous data. We demonstrate that a simple rehearsal-based approach that continues training from the last checkpoint  and replays old data reduces compute by $2.5\\times$ when compared to the standard practice of retraining from scratch.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TLADT8Wrhn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18574,
    "title": "Test-time Adaption against Multi-modal Reliability Bias",
    "authors": [
      "Mouxing Yang",
      "Yunfan Li",
      "Changqing Zhang",
      "Peng Hu",
      "Xi Peng"
    ],
    "abstract": "Test-time adaption (TTA) has emerged as a new paradigm for reconciling distribution shifts between domains without accessing source data. However, existing TTA methods mainly concentrate on uni-modal tasks, overlooking the complexity in multi-modal scenarios.In this paper, we delve into the multi-modal test-time adaption and reveal a new challenge named reliability bias. Different from the definition of traditional distribution shifts, reliability bias refers to the information discrepancies across different modalities derived from intra-modal distribution shifts. To solve the challenge, we propose a novel method, dubbed reliable fusion and robust adaption (RFRA). On the one hand, unlike the existing TTA paradigm that mainly repurposes the normalization layers, RFRA employs a new paradigm that modulates the attention between modalities in a self-adaptive way, supporting reliable fusion against reliability bias. On the other hand, RFRA adopts a novel objective function for robust multi-modal adaption, where the contributions of confident predictions could be amplified and the negative impacts of noisy predictions could be mitigated. Moreover, we introduce two new benchmarks to facilitate comprehensive evaluations of multi-modal TTA under reliability bias. Extensive experiments on the benchmarks not only verify the effectiveness of our method but also give some new observations to the community. The code and benchmarks will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TPZRq4FALB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18572,
    "title": "Fast Hyperboloid Decision Tree Algorithms",
    "authors": [
      "Philippe Chlenski",
      "Ethan Turok",
      "Antonio Khalil Moretti",
      "Itsik Pe'er"
    ],
    "abstract": "Hyperbolic geometry is gaining traction in machine learning due to its capacity to effectively capture hierarchical structures in real-world data. Hyperbolic spaces, where neighborhoods grow exponentially, offer substantial advantages and have consistently delivered state-of-the-art results across diverse applications. However, hyperbolic classifiers often grapple with computational challenges. Methods reliant on Riemannian optimization frequently exhibit sluggishness, stemming from the increased computational demands of operations on Riemannian manifolds. In response to these challenges, we present HyperDT, a novel extension of decision tree algorithms into hyperbolic space. Crucially, HyperDT eliminates the need for computationally intensive Riemannian optimization, numerically unstable exponential and logarithmic maps, or pairwise comparisons between points by leveraging inner products to adapt Euclidean decision tree algorithms to hyperbolic space. Our approach is conceptually straightforward and maintains constant-time decision complexity while mitigating the scalability issues inherent in high-dimensional Euclidean spaces. Building upon HyperDT, we introduce HyperRF, a hyperbolic random forest model. Extensive benchmarking across diverse datasets underscores the superior performance of these models, providing a swift, precise, accurate, and user-friendly toolkit for hyperbolic data analysis.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TTonmgTT9X",
    "arxiv_id": "2310.13841",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18057,
    "title": "Dissecting Sample Hardness: A Fine-Grained Analysis of Hardness Characterization Methods for Data-Centric AI",
    "authors": [
      "Nabeel Seedat",
      "Fergus Imrie",
      "Mihaela van der Schaar"
    ],
    "abstract": "Characterizing samples that are difficult to learn from is crucial to developing highly performant ML models. This has led to numerous Hardness Characterization Methods (HCMs) that aim to identify ''hard'' samples. However, there is a lack of consensus regarding the definition and evaluation of ''hardness''. Unfortunately, current HCMs have only been evaluated on specific types of hardness and often only qualitatively or with respect to downstream performance, overlooking the fundamental quantitative identification task. We address this gap by presenting a fine-grained taxonomy of various types of hardness. Additionally, we propose the Hardness Characterization Analysis Toolkit (H-CAT), which supports comprehensive and quantitative benchmarking of HCMs across the hardness taxonomy and can easily be extended to new HCMs, hardness types, and datasets. We use H-CAT to evaluate 13 different HCMs across 8 hardness types. This comprehensive evaluation encompassing over 14K setups uncovers various strengths and weaknesses of different HCMs, leading to practical tips to guide HCM selection and future development. Our findings highlight the need for more comprehensive HCM evaluation, while we hope our hardness taxonomy and toolkit will advance the principled evaluation and uptake of data-centric AI methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=icTZCUbtD6",
    "arxiv_id": "2403.04551",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18056,
    "title": "First-order ANIL provably learns representations despite overparametrisation",
    "authors": [
      "O\u011fuz Kaan Y\u00fcksel",
      "Etienne Boursier",
      "Nicolas Flammarion"
    ],
    "abstract": "Due to its empirical success in few-shot classification and reinforcement learning, meta-learning has recently received significant interest. Meta-learning methods leverage data from previous tasks to learn a new task in a sample-efficient manner. In particular, model-agnostic methods look for initialisation points from which gradient descent quickly adapts to any new task. Although it has been empirically suggested that such methods perform well by learning shared representations during pretraining, there is limited theoretical evidence of such behavior. More importantly, it has not been rigorously shown that these methods still learn a shared structure, despite architectural misspecifications. In this direction, this work shows, in the limit of an infinite number of tasks, that first-order ANIL with a linear two-layer network architecture successfully learns linear shared representations. This result even holds with _overparametrisation_; having a width larger than the dimension of the shared representations results in an asymptotically low-rank solution. The learnt solution then yields a good adaptation performance on any new task after a single gradient step. Overall, this illustrates how well model-agnostic methods such as first-order ANIL can learn shared representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=if2vRbS8Ew",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18055,
    "title": "USB-NeRF: Unrolling Shutter Bundle Adjusted Neural Radiance Fields",
    "authors": [
      "Moyang Li",
      "Peng Wang",
      "Lingzhe Zhao",
      "Bangyan Liao",
      "Peidong Liu"
    ],
    "abstract": "Neural Radiance Fields (NeRF) has received much attention recently due to its impressive capability to represent 3D scene and synthesize novel view images. Existing works usually assume that the input images are captured by a global shutter camera. Thus, rolling shutter (RS) images cannot be trivially applied to an off-the-shelf NeRF algorithm for novel view synthesis. Rolling shutter effect would also affect the accuracy of the camera pose estimation (e.g. via COLMAP), which further prevents the success of NeRF algorithm with RS images.In this paper, we propose Unrolling Shutter Bundle Adjusted Neural Radiance Fields (USB-NeRF). USB-NeRF is able to correct rolling shutter distortions and recover accurate camera motion trajectory simultaneously under the framework of NeRF, by modeling the physical image formation process of a RS camera.Experimental results demonstrate that USB-NeRF achieves better performance compared to prior works, in terms of RS effect removal, novel view image synthesis as well as camera motion estimation. Furthermore, our algorithm can also be used to recover high-fidelity high frame-rate global shutter video from a sequence of RS images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=igfDXfMvm5",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18054,
    "title": "Graph Metanetworks for Processing Diverse Neural Architectures",
    "authors": [
      "Derek Lim",
      "Haggai Maron",
      "Marc T. Law",
      "Jonathan Lorraine",
      "James Lucas"
    ],
    "abstract": "Neural networks efficiently encode learned information within their parameters. Consequently, many tasks can be unified by treating neural networks themselves as input data. When doing so, recent studies demonstrated the importance of accounting for the symmetries and geometry of parameter spaces. However, those works developed architectures tailored to specific networks such as MLPs and CNNs without normalization layers, and generalizing such architectures to other types of networks can be challenging. In this work, we overcome these challenges by building new metanetworks --- neural networks that take weights from other neural networks as input. Put simply, we carefully build graphs representing the input neural networks and process the graphs using graph neural networks. Our approach, Graph Metanetworks (GMNs), generalizes to neural architectures where competing methods struggle, such as multi-head attention layers, normalization layers, convolutional layers, ResNet blocks, and group-equivariant linear layers. We prove that GMNs are expressive and equivariant to parameter permutation symmetries that leave the input neural network functions unchanged. We validate the effectiveness of our method on several metanetwork tasks over diverse neural network architectures.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ijK5hyxs0n",
    "arxiv_id": "2312.04501",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18053,
    "title": "FreeNoise: Tuning-Free Longer Video Diffusion via Noise Rescheduling",
    "authors": [
      "Haonan Qiu",
      "Menghan Xia",
      "Yong Zhang",
      "Yingqing He",
      "Xintao Wang",
      "Ying Shan",
      "Ziwei Liu"
    ],
    "abstract": "With the availability of large-scale video datasets and the advances of diffusion models, text-driven video generation has achieved substantial progress. However, existing video generation models are typically trained on a limited number of frames, resulting in the inability to generate high-fidelity long videos during inference. Furthermore, these models only support single-text conditions, whereas real-life scenarios often require multi-text conditions as the video content changes over time. To tackle these challenges, this study explores the potential of extending the text-driven capability to generate longer videos conditioned on multiple texts. 1) We first analyze the impact of initial noise in video diffusion models. Then building upon the observation of noise, we propose FreeNoise, a tuning-free and time-efficient paradigm to enhance the generative capabilities of pretrained video diffusion models while preserving content consistency. Specifically, instead of initializing noises for all frames, we reschedule a sequence of noises for long-range correlation and perform temporal attention over them by window-based fusion. 2) Additionally, we design a novel motion injection method to support the generation of videos conditioned on multiple text prompts. Extensive experiments validate the superiority of our paradigm in extending the generative capabilities of video diffusion models. It is noteworthy that compared with the previous best-performing method which brought about 255% extra time cost, our method incurs only negligible time cost of approximately 17%. Generated video samples are available at our website: http://haonanqiu.com/projects/FreeNoise.html.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ijoqFqSC7p",
    "arxiv_id": "2310.15169",
    "GitHub": [
      "https://github.com/arthur-qiu/LongerCrafter"
    ],
    "Space": [
      "MoonQiu/FreeNoise"
    ],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18555,
    "title": "Understanding and Mitigating the Label Noise in Pre-training on Downstream Tasks",
    "authors": [
      "Hao Chen",
      "Jindong Wang",
      "Ankit Shah",
      "Ran Tao",
      "Hongxin Wei",
      "Xing Xie",
      "Masashi Sugiyama",
      "Bhiksha Raj"
    ],
    "abstract": "Pre-training on large-scale datasets and then fine-tuning on downstream tasks have become a standard practice in deep learning. However, pre-training data often contain label noise that may adversely affect the generalization of the model. This paper aims to understand the nature of noise in pre-training datasets and to mitigate its impact on downstream tasks. More specifically, through extensive experiments of supervised pre-training models on synthetic noisy ImageNet-1K and YFCC15M datasets, we demonstrate that while slight noise in pre-training can benefit in-domain (ID) transfer performance, where the training and testing data share the same distribution, it always deteriorates out-of-domain (OOD) performance, where training and testing data distribution are different. We empirically verify that the reason behind is noise in pre-training shapes the feature space differently. We then propose a lightweight black-box tuning method (NMTune) to affine the feature space to mitigate the malignant effect of noise and improve generalization on both ID and OOD tasks, considering one may not be able to fully fine-tune or even access the pre-trained models. We conduct practical experiments on popular vision and language models that are pre-trained on noisy data for evaluation of our approach. Our analysis and results show the importance of this interesting and novel research direction, which we term Noisy Model Learning.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TjhUtloBZU",
    "arxiv_id": "2309.17002",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18554,
    "title": "Mol-Instructions: A Large-Scale Biomolecular Instruction Dataset for Large Language Models",
    "authors": [
      "Yin Fang",
      "Xiaozhuan Liang",
      "Ningyu Zhang",
      "Kangwei Liu",
      "Rui Huang",
      "Zhuo Chen",
      "Xiaohui Fan",
      "Huajun Chen"
    ],
    "abstract": "Large Language Models (LLMs), with their remarkable task-handling capabilities and innovative outputs, have catalyzed significant advancements across a spectrum of fields. However, their proficiency within specialized domains such as biomolecular studies remains limited. To address this challenge, we introduce Mol-Instructions, a comprehensive instruction dataset designed for the biomolecular domain. Mol-Instructions encompasses three key components: molecule-oriented instructions, protein-oriented instructions, and biomolecular text instructions. Each component aims to improve the understanding and prediction capabilities of LLMs concerning biomolecular features and behaviors. Through extensive instruction tuning experiments on LLMs, we demonstrate the effectiveness of Mol-Instructions in enhancing large models' performance in the intricate realm of biomolecular studies, thus fostering progress in the biomolecular research community. Mol-Instructions is publicly available for ongoing research and will undergo regular updates to enhance its applicability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Tlsdsb6l9n",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18548,
    "title": "Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Data",
    "authors": [
      "Thomas TCK Zhang",
      "Leonardo Felipe Toso",
      "James Anderson",
      "Nikolai Matni"
    ],
    "abstract": "A powerful concept behind much of the recent progress in machine learning is the extraction of common features across data from heterogeneous sources or tasks. Intuitively, using all of one's data to learn a common representation function benefits both computational effort and statistical generalization by leaving a smaller number of parameters to fine-tune on a given task. Toward theoretically grounding these merits, we propose a general setting of recovering linear operators $M$from noisy vector measurements $y = Mx + w$, where the covariates $x$ may be both non-i.i.d. and non-isotropic. We demonstrate that existing isotropy-agnostic meta-learning approaches incur biases on the representation update, which causes the scaling of the noise terms to lose favorable dependence on the number of source tasks. This in turn can cause the sample complexity of representation learning to be bottlenecked by the single-task data size. We introduce an adaptation, $\\texttt{De-bias}$ & $\\texttt{Feature-Whiten}$ ($\\texttt{DFW}$), of the popular alternating minimization-descent (AMD) scheme proposed in Collins et al., (2021), and establish linear convergence to the optimal representation with noise level scaling down with the $\\textit{total}$ source data size. This leads to generalization bounds on the same order as an oracle empirical risk minimizer. We verify the vital importance of $\\texttt{DFW}$ on various numerical simulations. In particular, we show that vanilla alternating-minimization descent fails catastrophically even for iid, but mildly non-isotropic data.Our analysis unifies and generalizes prior work, and provides a flexible framework for a wider range of applications, such as in controls and dynamical systems.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Tr3fZocrI6",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18546,
    "title": "Spatially-Aware Transformers for Embodied Agents",
    "authors": [
      "Junmo Cho",
      "Jaesik Yoon",
      "Sungjin Ahn"
    ],
    "abstract": "Episodic memory plays a crucial role in various cognitive processes, such as the ability to mentally recall past events. While cognitive science emphasizes the significance of spatial context in the formation and retrieval of episodic memory, the current primary approach to implementing episodic memory in AI systems is through transformers that store temporally ordered experiences, which overlooks the spatial dimension. As a result, it is unclear how the underlying structure could be extended to incorporate the spatial axis beyond temporal order alone and thereby what benefits can be obtained. To address this, this paper explores the use of Spatially-Aware Transformer models that incorporate spatial information. These models enable the creation of place-centric episodic memory that considers both temporal and spatial dimensions. Adopting this approach, we demonstrate that memory utilization efficiency can be improved, leading to enhanced accuracy in various place-centric downstream tasks. Additionally, we propose the Adaptive Memory Allocator, a memory management method based on reinforcement learning that aims to optimize efficiency of memory utilization. Our experiments demonstrate the advantages of our proposed model in various environments and across multiple downstream tasks, including prediction, generation, reasoning, and reinforcement learning. The source code for our models and experiments will be available at \\href{https://github.com/spatially_aware_transformer}{https://github.com/spatially_aware_transformer}.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Ts95eXsPBc",
    "arxiv_id": "2402.15160",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18052,
    "title": "A Neural Framework for Generalized Causal Sensitivity Analysis",
    "authors": [
      "Dennis Frauen",
      "Fergus Imrie",
      "Alicia Curth",
      "Valentyn Melnychuk",
      "Stefan Feuerriegel",
      "Mihaela van der Schaar"
    ],
    "abstract": "Unobserved confounding is common in many applications, making causal inference from observational data challenging. As a remedy, causal sensitivity analysis is an important tool to draw causal conclusions under unobserved confounding with mathematical guarantees. In this paper, we propose NeuralCSA, a neural framework for generalized causal sensitivity analysis. Unlike previous work, our framework is compatible with (i) a large class of sensitivity models, including the marginal sensitivity model, $f$-sensitivity models, and Rosenbaum's sensitivity model; (ii) different treatment types (i.e., binary and continuous); and (iii) different causal queries, including (conditional) average treatment effects and simultaneous effects on multiple outcomes. This generality is achieved by learning a latent distribution shift that corresponds to a treatment intervention using two conditional normalizing flows. We provide theoretical guarantees that NeuralCSA is able to infer valid bounds on the causal query of interest and also demonstrate this empirically using both simulated and real-world data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ikX6D1oM1c",
    "arxiv_id": "2311.16026",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18050,
    "title": "How Do Transformers Learn In-Context Beyond Simple Functions? A Case Study on Learning with Representations",
    "authors": [
      "Tianyu Guo",
      "Wei Hu",
      "Song Mei",
      "Huan Wang",
      "Caiming Xiong",
      "Silvio Savarese",
      "Yu Bai"
    ],
    "abstract": "While large language models based on the transformer architecture have demonstrated remarkable in-context learning (ICL) capabilities, understandings of such capabilities are still in an early stage, where existing theory and mechanistic understanding focus mostly on simple scenarios such as learning simple function classes. This paper takes initial steps on understanding ICL in more complex scenarios, by studying learning with \\emph{representations}. Concretely, we construct synthetic in-context learning problems with a compositional structure, where the label depends on the input through a possibly complex but \\emph{fixed} representation function, composed with a linear function that \\emph{differs} in each instance. By construction, the optimal ICL algorithm first transforms the inputs by the representation function, and then performs linear ICL on top of the transformed dataset. We show theoretically the existence of transformers that approximately implement such algorithms with mild depth and size.  Empirically, we find trained transformers consistently achieve near-optimal ICL performance in this setting, and exhibit the desired dissection where lower layers transforms the dataset and upper layers perform linear ICL. Through extensive probing and a new pasting experiment, we further reveal several mechanisms within the trained transformers, such as concrete copying behaviors on both the inputs and the representations, linear ICL capability of the upper layers alone, and a post-ICL representation selection mechanism in a harder mixture setting. These observed mechanisms align well with our theory and may shed light on how transformers perform ICL in more realistic scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ikwEDva1JZ",
    "arxiv_id": "2310.10616",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18539,
    "title": "FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods",
    "authors": [
      "Xiaotian Han",
      "Jianfeng Chi",
      "Yu Chen",
      "Qifan Wang",
      "Han Zhao",
      "Na Zou",
      "Xia Hu"
    ],
    "abstract": "This paper introduces the Fair Fairness Benchmark (\\textsf{FFB}), a benchmarking framework for in-processing group fairness methods. Ensuring fairness in machine learning is critical for ethical and legal compliance. However, there exist challenges in comparing and developing of fairness methods due to inconsistencies in experimental settings, lack of accessible algorithmic implementations, and limited extensibility of current fairness packages and tools. To address these issues, we introduce an open-source, standardized benchmark for evaluating in-processing group fairness methods and provide a comprehensive analysis of state-of-the-art methods to ensure different notions of group fairness. This work offers the following key contributions: the provision of flexible, extensible, minimalistic, and research-oriented open-source code; the establishment of unified fairness method benchmarking pipelines; and extensive benchmarking, which yields key insights from $\\mathbf{45,079}$ experiments. We believe our work will significantly facilitate the growth and development of the fairness research community.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TzAJbTClAz",
    "arxiv_id": "2306.09468",
    "GitHub": [
      "https://github.com/ahxt/fair_fairness_benchmark"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18537,
    "title": "ODEFormer: Symbolic Regression of Dynamical Systems with Transformers",
    "authors": [
      "St\u00e9phane d'Ascoli",
      "S\u00f6ren Becker",
      "Philippe Schwaller",
      "Alexander Mathis",
      "Niki Kilbertus"
    ],
    "abstract": "We introduce ODEFormer, the first transformer able to infer multidimensional ordinary differential equation (ODE) systems in symbolic form from the observation of a single solution trajectory. We perform extensive evaluations on two datasets: (i) the existing \u2018Strogatz\u2019 dataset featuring two-dimensional systems; (ii) ODEBench, a collection of one- to four-dimensional systems that we carefully curated from the literature to provide a more holistic benchmark. ODEFormer consistently outperforms existing methods while displaying substantially improved robustness to noisy and irregularly sampled observations, as well as faster inference. We release our code, model and benchmark dataset publicly.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=TzoHLiGVMo",
    "arxiv_id": "2310.05573",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18528,
    "title": "A Precise Characterization of SGD Stability Using Loss Surface Geometry",
    "authors": [
      "Gregory Dexter",
      "Borja Ocejo",
      "Sathiya Keerthi",
      "Aman Gupta",
      "Ayan Acharya",
      "Rajiv Khanna"
    ],
    "abstract": "Stochastic Gradient Descent (SGD) stands as a cornerstone optimization algorithm with proven real-world empirical successes but relatively limited theoretical understanding. Recent research has illuminated a key factor contributing to its practical efficacy: the implicit regularization it instigates. Several studies have investigated the linear stability property of SGD in the vicinity of a stationary point as a predictive proxy for sharpness and generalization error in overparameterized neural networks (Wu et al., 2022; Jastrzebski et al., 2019; Cohen et al., 2021). In this paper, we delve deeper into the relationship between linear stability and sharpness. More specifically, we meticulously delineate the necessary and sufficient conditions for linear stability, contingent on hyperparameters of SGD and the sharpness at the optimum. Towards this end, we introduce a novel coherence measure of the loss Hessian that encapsulates pertinent geometric properties of the loss function that are relevant to the linear stability of SGD. It enables us to provide a simplified sufficient condition for identifying linear instability at an optimum. Notably, compared to previous works, our analysis relies on significantly milder assumptions and is applicable for a broader class of loss functions than known before, encompassing not only mean-squared error but also cross-entropy loss.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UMOlFJzLfL",
    "arxiv_id": "2401.12332",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18049,
    "title": "Multi-View Representation is What You Need for Point-Cloud Pre-Training",
    "authors": [
      "Siming Yan",
      "Chen Song",
      "Youkang Kong",
      "Qixing Huang"
    ],
    "abstract": "A promising direction for pre-training 3D point clouds is to leverage the massive amount of data in 2D, whereas the domain gap between 2D and 3D creates a fundamental challenge. This paper proposes a novel approach to point-cloud pre-training that learns 3D representations by leveraging pre-trained 2D networks. Different from the popular practice of predicting 2D features first and then obtaining 3D features through dimensionality lifting, our approach directly uses a 3D network for feature extraction. We train the 3D feature extraction network with the help of the novel 2D knowledge transfer loss, which enforces the 2D projections of the 3D feature to be consistent with the output of pre-trained 2D networks. To prevent the feature from discarding 3D signals, we introduce the multi-view consistency loss that additionally encourages the projected 2D feature representations to capture pixel-wise correspondences across different views. Such correspondences induce 3D geometry and effectively retain 3D features in the projected 2D features. Experimental results demonstrate that our pre-trained model can be successfully transferred to various downstream tasks, including 3D shape classification, part segmentation, 3D object detection, and semantic segmentation, achieving state-of-the-art performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=imZcqOrbig",
    "arxiv_id": "2306.02558",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18525,
    "title": "Separate and Diffuse: Using a Pretrained Diffusion Model for Better Source Separation",
    "authors": [
      "Shahar Lutati",
      "Eliya Nachmani",
      "Lior Wolf"
    ],
    "abstract": "The problem of speech separation, also known as the cocktail party problem,refers to the task of isolating a single speech signal from a mixture of speechsignals. Previous work on source separation derived an upper bound for thesource separation task in the domain of human speech. This bound is derived fordeterministic models. Recent advancements in generative models challenge thisbound. We show how the upper bound can be generalized to the case of randomgenerative models. Applying a diffusion model Vocoder that was pretrained tomodel single-speaker voices on the output of a deterministic separation model leadsto state-of-the-art separation results. It is shown that this requires one to combinethe output of the separation model with that of the diffusion model. In our method,a linear combination is performed, in the frequency domain, using weights that areinferred by a learned model. We show state-of-the-art results on 2, 3, 5, 10, and 20speakers on multiple benchmarks. In particular, for two speakers, our method isable to surpass what was previously considered the upper performance bound.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=UXALv0lJZS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18046,
    "title": "MAPE-PPI: Towards Effective and Efficient Protein-Protein Interaction Prediction via Microenvironment-Aware Protein Embedding",
    "authors": [
      "Lirong Wu",
      "Yijun Tian",
      "Yufei Huang",
      "Siyuan Li",
      "Haitao Lin",
      "Nitesh V Chawla",
      "Stan Z. Li"
    ],
    "abstract": "Protein-Protein Interactions (PPIs) are fundamental in various biological processes and play a key role in life activities. The growing demand and cost of experimental PPI assays require computational methods for efficient PPI prediction. While existing methods rely heavily on protein sequence for PPI prediction, it is the protein structure that is the key to determine the interactions. To take both protein modalities into account, we define the microenvironment of an amino acid residue by its sequence and structural contexts, which describe the surrounding chemical properties and geometric features. In addition, microenvironments defined in previous work are largely based on experimentally assayed physicochemical properties, for which the \"vocabulary\" is usually extremely small. This makes it difficult to cover the diversity and complexity of microenvironments. In this paper, we propose Microenvironment-Aware Protein Embedding for PPI prediction (MPAE-PPI), which encodes microenvironments into chemically meaningful discrete codes via a sufficiently large microenvironment \"vocabulary\" (i.e., codebook). Moreover, we propose a novel pre-training strategy, namely Masked Codebook Modeling (MCM), to capture the dependencies between different microenvironments by randomly masking the codebook and reconstructing the input. With the learned microenvironment codebook, we can reuse it as an off-the-shelf tool to efficiently and effectively encode proteins of different sizes and functions for large-scale PPI prediction. Extensive experiments show that MAPE-PPI can scale to PPI prediction with millions of PPIs with superior trade-offs between effectiveness and computational efficiency than the state-of-the-art competitors.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=itGkF993gz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18517,
    "title": "Query-Policy Misalignment in Preference-Based Reinforcement Learning",
    "authors": [
      "Xiao Hu",
      "Jianxiong Li",
      "Xianyuan Zhan",
      "Qing-Shan Jia",
      "Ya-Qin Zhang"
    ],
    "abstract": "Preference-based reinforcement learning (PbRL) provides a natural way to align RL agents\u2019 behavior with human desired outcomes, but is often restrained by costly human feedback. To improve feedback efficiency, most existing PbRL methods focus on selecting queries to maximally improve the overall quality of the reward model, but counter-intuitively, we find that this may not necessarily lead to improved performance. To unravel this mystery, we identify a long-neglected issue in the query selection schemes of existing PbRL studies: Query-Policy Misalignment. We show that the seemingly informative queries selected to improve the overall quality of reward model actually may not align with RL agents\u2019 interests, thus offering little help on policy learning and eventually resulting in poor feedback efficiency. We show that this issue can be effectively addressed via policy-aligned query and a specially designed hybrid experience replay, which together enforce the bidirectional query-policy alignment. Simple yet elegant, our method can be easily incorporated into existing approaches by changing only a few lines of code. We showcase in comprehensive experiments that our method achieves substantial gains in both human feedback and RL sample efficiency, demonstrating the importance of addressing query-policy misalignment in PbRL tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=UoBymIwPJR",
    "arxiv_id": "2305.17400",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18516,
    "title": "Accelerating Data Generation for Neural Operators via Krylov Subspace Recycling",
    "authors": [
      "Hong Wang",
      "Zhongkai Hao",
      "Jie Wang",
      "Zijie Geng",
      "Zhen Wang",
      "Bin Li",
      "Feng Wu"
    ],
    "abstract": "Learning neural operators for solving partial differential equations (PDEs) has attracted great attention due to its high inference efficiency.However, training such operators requires generating a substantial amount of labeled data, i.e., PDE problems together with their solutions.The data generation process is exceptionally time-consuming, as it involves solving numerous systems of linear equations to obtain numerical solutions to the PDEs.Many existing methods solve these systems independently without considering their inherent similarities, resulting in extremely redundant computations.To tackle this problem, we propose a novel method, namely **S**orting **K**rylov **R**ecycling (**SKR**), to boost the efficiency of solving these systems, thus significantly accelerating data generation for neural operators training.To the best of our knowledge, SKR is the first attempt to address the time-consuming nature of data generation for learning neural operators.The working horse of SKR is Krylov subspace recycling, a powerful technique for solving a series of interrelated systems by leveraging their inherent similarities.Specifically, SKR employs a sorting algorithm to arrange these systems in a sequence, where adjacent systems exhibit high similarities.Then it equips a solver with Krylov subspace recycling to solve the systems sequentially instead of independently, thus effectively enhancing the solving efficiency.Both theoretical analysis and extensive experiments demonstrate that SKR can significantly accelerate neural operator data generation, achieving a remarkable speedup of up to 13.9 times.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=UpgRVWexaD",
    "arxiv_id": "2401.09516",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18042,
    "title": "Spoken Question Answering and Speech Continuation Using Spectrogram-Powered LLM",
    "authors": [
      "Eliya Nachmani",
      "Alon Levkovitch",
      "Roy Hirsch",
      "Julian Salazar",
      "Chulayuth Asawaroengchai",
      "Soroosh Mariooryad",
      "Ehud Rivlin",
      "RJ Skerry-Ryan",
      "Michelle Tadmor Ramanovich"
    ],
    "abstract": "We present a novel approach to adapting pre-trained large language models (LLMs) to perform question answering (QA) and speech continuation. By endowing the LLM with a pre-trained speech encoder, our model becomes able to take speech inputs and generate speech outputs. The entire system is trained end-to-end and operates directly on spectrograms, simplifying our architecture. Key to our approach is a training objective that jointly supervises speech recognition, text continuation, and speech synthesis using only paired speech-text pairs, enabling a `cross-modal' chain-of-thought within a single decoding pass. Our method surpasses existing spoken language models in speaker preservation and semantic coherence. Furthermore, the proposed model improves upon direct initialization in retaining the knowledge of the original LLM as demonstrated through spoken QA datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=izrOLJov5y",
    "arxiv_id": "2305.15255",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18514,
    "title": "A representation-learning game for classes of prediction tasks",
    "authors": [
      "Neria Uzan",
      "Nir Weinberger"
    ],
    "abstract": "We propose a game-based formulation for learning dimensionality-reducing representations of feature vectors, when only a prior knowledge on future prediction tasks is available. In this game, the first player chooses a representation, and then the second player adversarially chooses a prediction task from a given class, representing the prior knowledge. The first player aims is to minimize, and the second player to maximize, the regret: The minimal prediction loss using the representation, compared to the same loss using the original features. For the canonical setting in which the representation, the response to predict and the predictors are all linear functions, and under the mean squared error loss function, we derive the theoretically optimal representation in pure strategies, which shows the effectiveness of the prior knowledge, and the optimal regret in mixed strategies, which shows the usefulness of randomizing the representation. For general representations and loss functions, we propose an efficient algorithm to optimize a randomized representation. The algorithm only requires the gradients of the loss function, and is based on incrementally adding a representation rule to a mixture of such rules.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Uw8xvFqVAE",
    "arxiv_id": "2403.06971",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18041,
    "title": "ContextRef: Evaluating Referenceless Metrics for Image Description Generation",
    "authors": [
      "Elisa Kreiss",
      "Eric Zelikman",
      "Christopher Potts",
      "Nick Haber"
    ],
    "abstract": "Referenceless metrics (e.g., CLIPScore) use pretrained vision--language models to assess image descriptions directly without costly ground-truth reference texts. Such methods can facilitate rapid progress, but only if they truly align with human preference judgments. In this paper, we introduce ContextRef, a benchmark for assessing referenceless metrics for such alignment. ContextRef has two components: human ratings along a variety of established quality dimensions, and ten diverse robustness checks designed to uncover fundamental weaknesses. A crucial aspect of ContextRef is that images and descriptions are presented in context, reflecting prior work showing that context is important for description quality. Using ContextRef, we assess a variety of pretrained models, scoring functions, and techniques for incorporating context. None of the methods is successful with ContextRef, but we show that careful fine-tuning yields substantial improvements. ContextRef remains a challenging benchmark though, in large part due to the challenge of context dependence.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=j0ZvKSNZiP",
    "arxiv_id": "2309.11710",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18040,
    "title": "Training Graph Transformers via Curriculum-Enhanced Attention Distillation",
    "authors": [
      "Yisong Huang",
      "Jin Li",
      "Xinlong Chen",
      "Yang-Geng Fu"
    ],
    "abstract": "Recent studies have shown that Graph Transformers (GTs) can be effective for specific graph-level tasks. However, when it comes to node classification, training GTs remains challenging, especially in semi-supervised settings with a severe scarcity of labeled data. Our paper aims to address this research gap by focusing on semi-supervised node classification. To accomplish this, we develop a curriculum-enhanced attention distillation method that involves utilizing a Local GT teacher and a Global GT student. Additionally, we introduce the concepts of in-class and out-of-class and then propose two improvements, out-of-class entropy and top-k pruning, to facilitate the student's out-of-class exploration under the teacher's in-class guidance. Taking inspiration from human learning, our method involves a curriculum mechanism for distillation that initially provides strict guidance to the student and gradually allows for more out-of-class exploration by a dynamic balance. Extensive experiments show that our method outperforms many state-of-the-art approaches on seven public graph benchmarks, proving its effectiveness.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=j4VMrwgn1M",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18039,
    "title": "Non-Exchangeable Conformal Risk Control",
    "authors": [
      "Ant\u00f3nio Farinhas",
      "Chrysoula Zerva",
      "Dennis Thomas Ulmer",
      "Andre Martins"
    ],
    "abstract": "Split conformal prediction has recently sparked great interest due to its ability to provide formally guaranteed uncertainty sets or intervals for predictions made by black-box neural models, ensuring a predefined probability of containing the actual ground truth. While the original formulation assumes data exchangeability, some extensions handle non-exchangeable data, which is often the case in many real-world scenarios. In parallel, some progress has been made in conformal methods that provide statistical guarantees for a broader range of objectives, such as bounding the best $F_1$-score or minimizing the false negative rate in expectation. In this paper, we leverage and extend these two lines of work by proposing non-exchangeable conformal risk control, which allows controlling the expected value of any monotone loss function when the data is not exchangeable. Our framework is flexible, makes very few assumptions, and allows weighting the data based on its statistical similarity with the test examples; a careful choice of weights may result on tighter bounds, making our framework useful in the presence of change points, time series, or other forms of distribution drift. Experiments with both synthetic and real world data show the usefulness of our method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=j511LaqEeP",
    "arxiv_id": "2310.01262",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18038,
    "title": "Safe Offline Reinforcement Learning with Feasibility-Guided Diffusion Model",
    "authors": [
      "Yinan Zheng",
      "Jianxiong Li",
      "Dongjie Yu",
      "Yujie Yang",
      "Shengbo Eben Li",
      "Xianyuan Zhan",
      "Jingjing Liu"
    ],
    "abstract": "Safe offline reinforcement learning is a promising way to bypass risky online interactions towards safe policy learning. Most existing methods only enforce soft constraints, i.e., constraining safety violations in expectation below thresholds predetermined. This can lead to potentially unsafe outcomes, thus unacceptable in safety-critical scenarios. An alternative is to enforce the hard constraint of zero violation. However, this can be challenging in offline setting, as it needs to strike the right balance among three highly intricate and correlated aspects: safety constraint satisfaction, reward maximization, and behavior regularization imposed by offline datasets. Interestingly, we discover that via reachability analysis of safe-control theory, the hard safety constraint can be equivalently translated to identifying the largest feasible region given the offline dataset. This seamlessly converts the original trilogy problem to a feasibility-dependent objective, i.e., maximizing reward value within the feasible region while minimizing safety risks in the infeasible region. Inspired by these, we propose FISOR (FeasIbility-guided Safe Offline RL), which allows safety constraint adherence, reward maximization, and offline policy learning to be realized via three decoupled processes, while offering strong safety performance and stability. In FISOR, the optimal policy for the translated optimization problem can be derived in a special form of weighted behavior cloning, which can be effectively extracted with a guided diffusion model thanks to its expressiveness.  We compare FISOR against baselines on DSRL benchmark for safe offline RL. Evaluation results show that FISOR is the only method that can guarantee safety satisfaction in all tasks, while achieving top returns in most tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=j5JvZCaDM0",
    "arxiv_id": "2401.10700",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18037,
    "title": "Solving Inverse Problems with Latent Diffusion Models via Hard Data Consistency",
    "authors": [
      "Bowen Song",
      "Soo Min Kwon",
      "Zecheng Zhang",
      "Xinyu Hu",
      "Qing Qu",
      "Liyue Shen"
    ],
    "abstract": "Diffusion models have recently emerged as powerful generative priors for solving inverse problems. However, training diffusion models in the pixel space are both data-intensive and computationally demanding, which restricts their applicability as priors for high-dimensional real-world data such as medical images. Latent diffusion models, which operate in a much lower-dimensional space, offer a solution to these challenges. However, incorporating latent diffusion models to solve inverse problems remains a challenging problem due to the nonlinearity of the encoder and decoder. To address these issues, we propose ReSample, an algorithm that can solve general inverse problems with pre-trained latent diffusion models. Our algorithm incorporates data consistency by solving an optimization problem during the reverse sampling process, a concept that we term as hard data consistency. Upon solving this optimization problem, we propose a novel resampling scheme to map the measurement-consistent sample back onto the noisy data manifold and theoretically demonstrate its benefits. Lastly, we apply our algorithm to solve a wide range of linear and nonlinear inverse problems in both natural and medical images, demonstrating that our approach outperforms existing state-of-the-art approaches, including those based on pixel-space diffusion models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=j8hdRqOUhN",
    "arxiv_id": "2307.08123",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18036,
    "title": "Language Models Represent Space and Time",
    "authors": [
      "Wes Gurnee",
      "Max Tegmark"
    ],
    "abstract": "The capabilities of large language models (LLMs) have sparked debate over whether such systems just learn an enormous collection of superficial statistics or a coherent model of the data generating process---a world model. We find evidence for the latter by analyzing the learned representations of three spatial datasets (world, US, NYC places) and three temporal datasets (historical figures, artworks, news headlines) in the Llama-2 family of models. We discover that LLMs learn linear representations of space and time across multiple scales. These representations are robust to prompting variations and unified across different entity types (e.g. cities and landmarks). In addition, we identify individual ``space neurons'' and ``time neurons'' that reliably encode spatial and temporal coordinates. Our analysis demonstrates that modern LLMs acquire structured knowledge about fundamental dimensions such as space and time, supporting the view that they learn not merely superficial statistics, but literal world models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jE8xbmvFin",
    "arxiv_id": "2310.02207",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18502,
    "title": "Order-Preserving GFlowNets",
    "authors": [
      "Yihang Chen",
      "Lukas Mauch"
    ],
    "abstract": "Generative Flow Networks (GFlowNets) have been introduced as a method to sample a diverse set of candidates with probabilities proportional to a given reward. However, GFlowNets can only be used with a predefined scalar reward, which can be either computationally expensive or not directly accessible, in the case of multi-objective optimization (MOO) tasks for example. Moreover, to prioritize identifying high-reward candidates, the conventional practice is to raise the reward to a higher exponent, the optimal choice of which may vary across different environments. To address these issues, we propose Order-Preserving GFlowNets (OP-GFNs), which sample with probabilities in proportion to a learned reward function that is consistent with a provided (partial) order on the candidates, thus eliminating the need for an explicit formulation of the reward function. We theoretically prove that the training process of OP-GFNs gradually sparsifies the learned reward landscape in single-objective maximization tasks. The sparsification concentrates on candidates of a higher hierarchy in the ordering, ensuring exploration at the beginning and exploitation towards the end of the training. We demonstrate OP-GFN's state-of-the-art performance in single-objective maximization (totally ordered) and multi-objective Pareto front approximation (partially ordered) tasks, including synthetic datasets, molecule generation, and neural architecture search.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VXDPXuq4oG",
    "arxiv_id": "2310.00386",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18035,
    "title": "Compressing Latent Space via Least Volume",
    "authors": [
      "Qiuyi Chen",
      "Mark Fuge"
    ],
    "abstract": "This paper introduces Least Volume---a simple yet effective regularization inspired by geometric intuition---that can reduce the necessary number of latent dimensions needed by an autoencoder without requiring any prior knowledge of the intrinsic dimensionality of the dataset. We show that the Lipschitz continuity of the decoder is the key to making it work, provide a proof that PCA is just a linear special case of it, and reveal that it has a similar PCA-like importance ordering effect when applied to nonlinear models. We demonstrate the intuition behind the regularization on some pedagogical toy problems, and its effectiveness on several benchmark problems, including MNIST, CIFAR-10 and CelebA.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jFJPd9kIiF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18492,
    "title": "Understanding Catastrophic Forgetting in Language Models via Implicit Inference",
    "authors": [
      "Suhas Kotha",
      "Jacob Mitchell Springer",
      "Aditi Raghunathan"
    ],
    "abstract": "We lack a systematic understanding of the effects of fine-tuning (via methods such as instruction-tuning or reinforcement learning from human feedback), particularly on tasks outside the narrow fine-tuning distribution. In a simplified scenario, we demonstrate that improving performance on tasks within the fine-tuning data distribution comes at the expense of capabilities on other tasks. We hypothesize that language models implicitly infer the task of the prompt and that fine-tuning skews this inference towards tasks in the fine-tuning distribution. To test this, we propose Conjugate Prompting, which artificially makes the task look farther from the fine-tuning distribution while requiring the same capability, and we find that this recovers some of the pretraining capabilities on our synthetic setup. Since real-world fine-tuning distributions are predominantly English, we apply conjugate prompting to recover pretrained capabilities in LLMs by simply translating the prompts to different languages. This allows us to recover the in-context learning abilities lost via instruction tuning, and more concerningly, recover harmful content generation suppressed by safety fine-tuning in chatbots like ChatGPT.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VrHiF2hsrm",
    "arxiv_id": "2309.10105",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18485,
    "title": "Motion Guidance: Diffusion-Based Image Editing with Differentiable Motion Estimators",
    "authors": [
      "Daniel Geng",
      "Andrew Owens"
    ],
    "abstract": "Diffusion models are capable of generating impressive images conditioned on text descriptions, and extensions of these models allow users to edit images at a relatively coarse scale. However, the ability to precisely edit the layout, position, pose, and shape of objects in images with diffusion models is still difficult. To this end, we propose {\\it motion guidance}, a zero-shot technique that allows a user to specify dense, complex motion fields that indicate where each pixel in an image should move. Motion guidance works by steering the diffusion sampling process with the gradients through an off-the-shelf optical flow network. Specifically, we design a guidance loss that encourages the sample to have the desired motion, as estimated by a flow network, while also being visually similar to the source image. By simultaneously sampling from a diffusion model and guiding the sample to have low guidance loss, we can obtain a motion-edited image. We demonstrate that our technique works on complex motions and produces high quality edits of real and generated images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WIAO4vbnNV",
    "arxiv_id": "2401.18085",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18034,
    "title": "IRAD: Implicit Representation-driven Image Resampling against Adversarial Attacks",
    "authors": [
      "Yue Cao",
      "Tianlin Li",
      "Xiaofeng Cao",
      "Ivor Tsang",
      "Yang Liu",
      "Qing Guo"
    ],
    "abstract": "We introduce a novel approach to counter adversarial attacks, namely, image resampling. Image resampling transforms a discrete image into a new one, simulating the process of scene recapturing or rerendering as specified by a geometrical transformation. The underlying rationale behind our idea is that image resampling can alleviate the influence of adversarial perturbations while preserving essential semantic information, thereby conferring an inherent advantage in defending against adversarial attacks. To validate this concept, we present a comprehensive study on leveraging image resampling to defend against adversarial attacks. We have developed basic resampling methods that employ interpolation strategies and coordinate shifting magnitudes. Our analysis reveals that these basic methods can partially mitigate adversarial attacks. However, they come with apparent limitations: the accuracy of clean images noticeably decreases, while the improvement in accuracy on adversarial examples is not substantial.We propose implicit representation-driven image resampling (IRAD) to overcome these limitations. First, we construct an implicit continuous representation that enables us to represent any input image within a continuous coordinate space. Second, we introduce SampleNet, which automatically generates pixel-wise shifts for resampling in response to different inputs. Furthermore, we can extend our approach to the state-of-the-art diffusion-based method, accelerating it with fewer time steps while preserving its defense capability. Extensive experiments demonstrate that our method significantly enhances the adversarial robustness of diverse deep models against various attacks while maintaining high accuracy on clean images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jFa5KESW65",
    "arxiv_id": "2310.11890",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18482,
    "title": "On the Role of Discrete Tokenization in Visual Representation Learning",
    "authors": [
      "Tianqi Du",
      "Yifei Wang",
      "Yisen Wang"
    ],
    "abstract": "In the realm of self-supervised learning (SSL), masked image modeling (MIM) has gained popularity alongside contrastive learning methods. MIM involves reconstructing masked regions of input images using unmasked portions. A notable subset of MIM methodologies employs discrete visual tokens as reconstruction target. This study explores the role of discrete visual tokens in MIM, with the aim of decoding their potential benefits and inherent constraints. Building upon the connection between MIM and contrastive learning, we provide comprehensive explanations on how discrete tokenization affects generalization performance of MIM. Furthermore, we introduce a novel metric designed to quantify the proficiency of discrete visual tokens in the MIM framework. Inspired by this metric, we contribute an accessible tokenizer design and demonstrate its superior performance across various benchmark datasets and ViT backbones.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=WNLAkjUm19",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18033,
    "title": "LitCab: Lightweight Language Model Calibration over Short- and Long-form Responses",
    "authors": [
      "Xin Liu",
      "Muhammad Khalifa",
      "Lu Wang"
    ],
    "abstract": "A model is considered well-calibrated when its probability estimate aligns with the true likelihood of the output being correct. Calibrating large language models (LLMs) is crucial, as it plays a vital role in detecting and mitigating hallucinations, a common issue of LLMs, as well as building more trustworthy models.  Yet popular neural model calibration techniques are not well-suited for LLMs due to their lack of flexibility in discerning answer correctness and their high computational costs. For instance, post-processing methods, e.g., temperature scaling, are often unable to reorder the candidate generations. Moreover, training-based methods require fine-tuning the entire model, which becomes impractical due to the increasing sizes of modern LLMs. In this paper, we present Litcab, a lightweight calibration mechanism consisting of a single linear layer that takes as input the sentence representation and predicts a bias term, which is then added to the LM output logits. Litcab results with better-calibrated models, by only adding and training <2% of the original model parameters. For evaluation, we construct CaT, a benchmark consisting of six open-ended question-answering (QA) tasks, covering responses ranging from short phrases to paragraphs. We test Litcab with Llama2-7B, where it improves calibration across all tasks. We further conduct a comprehensive evaluation with multiple popular open-sourced LLMs from GPT and LLaMA families, yielding the following key findings:  (i) Larger models within the same family exhibit better calibration. (ii) GPT-family models show superior calibration compared to LLaMA, Llama2 and Vicuna models despite having much fewer parameters. (iii) Fine-tuning pretrained model (e.g., LLaMA) with samples of focused purpose (e.g., conversations) may lead to worse calibration, highlighting the importance of fine-tuning setups.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jH67LHVOIO",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18476,
    "title": "Mind Your Augmentation: The Key to Decoupling Dense Self-Supervised Learning",
    "authors": [
      "Congpei Qiu",
      "Tong Zhang",
      "Yanhao Wu",
      "Wei Ke",
      "Mathieu Salzmann",
      "Sabine S\u00fcsstrunk"
    ],
    "abstract": "Dense Self-Supervised Learning (SSL) creates positive pairs by establishing correspondences between regions or points, thereby aiming to preserve local features, for example of individual objects.However, existing approaches tend to couple objects by leaking information from the neighboring contextual regions when the pairs have a limited overlap. In this paper, we first quantitatively identify and confirm the existence of such a coupling phenomenon. We then address it by developing a remarkably simple yet highly effective solution comprising a novel augmentation method, Region Collaborative Cutout (RCC), and a corresponding decoupling branch. Importantly, our design is versatile and can be seamlessly integrated into existing SSL frameworks, whether based on Convolutional Neural Networks (CNNs) or Vision Transformers (ViTs). We conduct extensive experiments, incorporating our solution into two CNN-based and two ViT-based methods, with results confirming the effectiveness of our approach. Moreover, we provide empirical evidence that our method significantly contributes to the disentanglement of feature representations among objects, both in quantitative and qualitative terms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WQYHbr36Fo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18466,
    "title": "Real-time Photorealistic Dynamic Scene Representation and Rendering with 4D Gaussian Splatting",
    "authors": [
      "Zeyu Yang",
      "Hongye Yang",
      "Zijie Pan",
      "Li Zhang"
    ],
    "abstract": "Reconstructing dynamic 3D scenes from 2D images and generating diverse views over time is challenging due to scene complexity and temporal dynamics. Despite advancements in neural implicit models, limitations persist: (i) Inadequate Scene Structure: Existing methods struggle to reveal the spatial and temporal structure of dynamic scenes from directly learning the complex 6D plenoptic function. (ii) Scaling Deformation Modeling: Explicitly modeling scene element deformation becomes impractical for complex dynamics. To address these issues, we consider the spacetime as an entirety and propose to approximate the underlying spatio-temporal 4D volume of a dynamic scene by optimizing a collection of 4D primitives, with explicit geometry and appearance modeling. Learning to optimize the 4D primitives enables us to synthesize novel views at any desired time with our tailored rendering routine. Our model is conceptually simple, consisting of a 4D Gaussian parameterized by anisotropic ellipses that can rotate arbitrarily in space and time, as well as view-dependent and time-evolved appearance represented by the coefficient of 4D spherindrical harmonics. This approach offers simplicity, flexibility for variable-length video and end-to-end training, and efficient real-time rendering, making it suitable for capturing complex dynamic scene motions. Experiments across various benchmarks, including monocular and multi-view scenarios, demonstrate our 4DGS model's superior visual quality and efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WhgB5sispV",
    "arxiv_id": "2310.10642",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18032,
    "title": "Provably Efficient UCB-type Algorithms For Learning Predictive State Representations",
    "authors": [
      "Ruiquan Huang",
      "Yingbin Liang",
      "Jing Yang"
    ],
    "abstract": "The general sequential decision-making problem, which includes Markov decision processes (MDPs) and partially observable MDPs (POMDPs) as special cases, aims at maximizing a cumulative reward by making a sequence of decisions based on a history of observations and actions over time. Recent studies have shown that the sequential decision-making problem is statistically learnable if it admits a low-rank structure modeled by predictive state representations (PSRs). Despite these advancements, existing approaches typically involve oracles or steps that are computationally intractable. On the other hand, the upper confidence bound (UCB) based approaches, which have served successfully as computationally efficient methods in bandits and MDPs, have not been investigated for more general PSRs, due to the difficulty of optimistic bonus design in these more challenging settings. This paper proposes the first known UCB-type approach for PSRs, featuring a novel bonus term that upper bounds the total variation distance between the estimated and true models. We further characterize the sample complexity bounds for our designed UCB-type algorithms for both online and offline PSRs. In contrast to existing approaches for PSRs, our UCB-type algorithms enjoy computational tractability, last-iterate guaranteed near-optimal policy, and guaranteed model accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jId5PXbBbX",
    "arxiv_id": "2307.00405",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18031,
    "title": "BioBridge: Bridging Biomedical Foundation Models via Knowledge Graphs",
    "authors": [
      "Zifeng Wang",
      "Zichen Wang",
      "Balasubramaniam Srinivasan",
      "Vassilis N. Ioannidis",
      "Huzefa Rangwala",
      "RISHITA ANUBHAI"
    ],
    "abstract": "Foundation models (FMs) learn from large volumes of unlabeled data to demonstrate superior performance across a wide range of tasks. However, FMs developed for biomedical domains have largely remained unimodal, i.e., independently trained and used for tasks on protein sequences alone, small molecule structures alone, or clinical data alone.To overcome this limitation, we present BioBridge, a parameter-efficient learning framework, to bridge independently trained unimodal FMs to establish multimodal behavior. BioBridge achieves it by utilizing Knowledge Graphs (KG) to learn transformations between one unimodal FM and another without fine-tuning any underlying unimodal FMs.Our results demonstrate that BioBridge canbeat the best baseline KG embedding methods (on average by ~ 76.3%) in cross-modal retrieval tasks. We also identify BioBridge demonstrates out-of-domain generalization ability by extrapolating to unseen modalities or relations. Additionally, we also show that BioBridge presents itself as a general-purpose retriever that can aid biomedical multimodal question answering as well as enhance the guided generation of novel drugs. Code is at https://github.com/RyanWangZf/BioBridge.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jJCeMiwHdH",
    "arxiv_id": "2310.03320",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18030,
    "title": "Task Planning for Visual Room Rearrangement under Partial Observability",
    "authors": [
      "Karan Mirakhor",
      "Sourav Ghosh",
      "Dipanjan Das",
      "Brojeshwar Bhowmick"
    ],
    "abstract": "This paper presents a novel hierarchical task planner under partial observabilitythat empowers an embodied agent to use visual input to efficiently plan a sequenceof actions for simultaneous object search and rearrangement in an untidy room,to achieve a desired tidy state. The paper introduces (i) a novel Search Networkthat utilizes commonsense knowledge from large language models to find unseenobjects, (ii) a Deep RL network trained with proxy reward, along with (iii) a novelgraph-based state representation to produce a scalable and effective planner thatinterleaves object search and rearrangement to minimize the number of steps takenand overall traversal of the agent, as well as to resolve blocked goal and swapcases, and (iv) a sample-efficient cluster-biased sampling for simultaneous trainingof the proxy reward network along with the Deep RL network. Furthermore,the paper presents new metrics and a benchmark dataset - RoPOR, to measurethe effectiveness of rearrangement planning. Experimental results show that ourmethod significantly outperforms the state-of-the-art rearrangement methods Weihset al. (2021a); Gadre et al. (2022); Sarch et al. (2022); Ghosh et al. (2022).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jJvXNpvOdM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18029,
    "title": "OpenWebMath: An Open Dataset of High-Quality Mathematical Web Text",
    "authors": [
      "Keiran Paster",
      "Marco Dos Santos",
      "Zhangir Azerbayev",
      "Jimmy Ba"
    ],
    "abstract": "There is growing evidence that pretraining on high quality, carefully thought-out tokens such as code or mathematics plays an important role in improving the reasoning abilities of large language models. For example, Minerva, a PaLM model finetuned on billions of tokens of mathematical documents from arXiv and the web, reported dramatically improved performance on problems that require quantitative reasoning. However, because all known open source web datasets employ preprocessing that does not faithfully preserve mathematical notation, the benefits of large scale training on quantitive web documents are unavailable to the research community. We introduce OpenWebMath, an open dataset inspired by these works containing 14.7B tokens of mathematical webpages from Common Crawl. We describe in detail our method for extracting text and LaTeX content and removing boilerplate from HTML documents, as well as our methods for quality filtering and deduplication. Additionally, we run small-scale experiments by training 1.4B language models on OpenWebMath, showing that models trained on 14.7B tokens of our dataset surpass the performance of models trained on over 20x the amount of general language data. We hope that our dataset, open-sourced and released on the Hugging Face Hub, will help spur advances in the reasoning abilities of large language models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jKHmjlpViu",
    "arxiv_id": "2310.06786",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18448,
    "title": "Stack Attention: Improving the Ability of Transformers to Model Hierarchical Patterns",
    "authors": [
      "Brian DuSell",
      "David Chiang"
    ],
    "abstract": "Attention, specifically scaled dot-product attention, has proven effective for natural language, but it does not have a mechanism for handling hierarchical patterns of arbitrary nesting depth, which limits its ability to recognize certain syntactic structures. To address this shortcoming, we propose stack attention: an attention operator that incorporates stacks, inspired by their theoretical connections to context-free languages (CFLs). We show that stack attention is analogous to standard attention, but with a latent model of syntax that requires no syntactic supervision. We propose two variants: one related to deterministic pushdown automata (PDAs) and one based on nondeterministic PDAs, which allows transformers to recognize arbitrary CFLs. We show that transformers with stack attention are very effective at learning CFLs that standard transformers struggle on, achieving strong results on a CFL with theoretically maximal parsing difficulty. We also show that stack attention is more effective at natural language modeling under a constrained parameter budget, and we include results on machine translation.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=XVhm3X8Fum",
    "arxiv_id": "2310.01749",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18027,
    "title": "Rethinking Branching on Exact Combinatorial Optimization Solver: The First Deep Symbolic Discovery Framework",
    "authors": [
      "Yufei Kuang",
      "Jie Wang",
      "Haoyang Liu",
      "Fangzhou Zhu",
      "Xijun Li",
      "Jia Zeng",
      "Jianye HAO",
      "Bin Li",
      "Feng Wu"
    ],
    "abstract": "Machine learning (ML) have been shown to successfully accelerate solving NP-hard combinatorial optimization (CO) problems under the branch and bound framework. However, the high training and inference cost and limited interpretability of ML approaches severely limit their wide application to modern exact CO solvers. In contrast, human-designed policies---though widely integrated in modern CO solvers due to their compactness and reliability---can not capture data-driven patterns for higher performance. To combine the advantages of the two paradigms, we propose the first symbolic discovery framework---namely, deep symbolic discovery for exact combinatorial optimization solver (Symb4CO)---to learn high-performance symbolic policies on the branching task. Specifically, we show the potential existence of small symbolic policies empirically, employ a large neural network to search in the high-dimensional discrete space, and compile the learned symbolic policies directly for fast deployment. Experiments show that the Symb4CO learned purely CPU-based policies consistently achieve *comparable* performance to previous GPU-based state-of-the-art approaches. Furthermore, the appealing features of Symb4CO include its high training (*ten training instances*) and inference (*one CPU core*) efficiency and good interpretability (*one-line expressions*), making it simple and reliable for deployment. The results show encouraging potential for the *wide* deployment of ML to modern CO solvers.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jKhNBulNMh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18442,
    "title": "Spatio-Temporal Approximation: A Training-Free SNN Conversion for Transformers",
    "authors": [
      "Yizhou Jiang",
      "Kunlin Hu",
      "Tianren Zhang",
      "Haichuan Gao",
      "Yuqian Liu",
      "Ying Fang",
      "Feng Chen"
    ],
    "abstract": "Spiking neural networks (SNNs) are energy-efficient and hold great potential for large-scale inference. Since training SNNs from scratch is costly and has limited performance, converting pretrained artificial neural networks (ANNs) to SNNs is an attractive approach that retains robust performance without additional training data and resources. However, while existing conversion methods work well on convolution networks, emerging Transformer models introduce unique mechanisms like self-attention and test-time normalization, leading to non-causal non-linear interactions unachievable by current SNNs. To address this, we approximate these operations in both temporal and spatial dimensions, thereby providing the first SNN conversion pipeline for Transformers. We propose \\textit{Universal Group Operators} to approximate non-linear operations spatially and a \\textit{Temporal-Corrective Self-Attention Layer} that approximates spike multiplications at inference through an estimation-correction approach. Our algorithm is implemented on a pretrained ViT-B/32 from CLIP, inheriting its zero-shot classification capabilities, while improving control over conversion losses. To our knowledge, this is the first direct training-free conversion of a pretrained Transformer to a purely event-driven SNN, promising for neuromorphic hardware deployment.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XrunSYwoLr",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18026,
    "title": "Debiasing Attention Mechanism in Transformer without Demographics",
    "authors": [
      "Shenyu Lu",
      "Yipei Wang",
      "Xiaoqian Wang"
    ],
    "abstract": "Although transformers demonstrate impressive capabilities in a variety of tasks, the fairness issue remains a significant concern when deploying these models. Existing works to address fairness issues in transformers require sensitive labels (such as age, gender, etc.), which can raise privacy concerns or violate legal regulations. An alternative way is through fairness without demographics. However, existing works that improve Rawlsian Max-Min fairness may impose overly restrictive constraints. Other methods that use auxiliary networks could be parameter inefficient. In this paper, we present a new approach to debiasing transformers by leveraging their inherent structure.  By reconsidering the roles of important components (queries, keys, and values) in the attention mechanism, we introduce a simple yet effective debiasing strategy from two perspectives: 1) Grounded in theoretical analysis, we normalize and apply absolute value operations to queries and keys to minimize the bias in attention weight allocation; 2) We reduce the bias within values through local alignment via contrastive learning. Throughout the entire process, our approach does not require any sensitive labels. Furthermore, to enhance memory efficiency in the training phase, we propose a strategy that debias only the last encoder to improve fairness in pre-trained models. We conduct experiments in computer vision and natural language processing tasks and show that our method is comparable and even outperforms the state-of-the-art method with substantially lower energy consumption.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jLIUfrAcMQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18437,
    "title": "Balancing Act: Constraining Disparate Impact in Sparse Models",
    "authors": [
      "Meraj Hashemizadeh",
      "Juan Ramirez",
      "Rohan Sukumaran",
      "Golnoosh Farnadi",
      "Simon Lacoste-Julien",
      "Jose Gallego-Posada"
    ],
    "abstract": "Model pruning is a popular approach to enable the deployment of large deep learning models on edge devices with restricted computational or storage capacities. Although sparse models achieve performance comparable to that of their dense counterparts at the level of the entire dataset, they exhibit high accuracy drops for some data sub-groups. Existing methods to mitigate this disparate impact induced by pruning (i) rely on surrogate metrics that address the problem indirectly and have limited interpretability; or (ii) scale poorly with the number of protected sub-groups in terms of computational cost. We propose a constrained optimization approach that _directly addresses the disparate impact of pruning_: our formulation bounds the accuracy change between the dense and sparse models, for each sub-group. This choice of constraints provides an interpretable success criterion to determine if a pruned model achieves acceptable disparity levels. Experimental results demonstrate that our technique scales reliably to problems involving large models and hundreds of protected sub-groups.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Xz13DtbOVW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18024,
    "title": "Analyzing and Improving Optimal-Transport-based Adversarial Networks",
    "authors": [
      "Jaemoo Choi",
      "Jaewoong Choi",
      "Myungjoo Kang"
    ],
    "abstract": "Optimal transport (OT) problem aims to find a transport plan that bridges two distributions while minimizing a given cost function. OT theory has been widely utilized in generative modeling. In the beginning, OT distance has been used as a measure for assessing the distance between data and generated distributions. Recently, OT transport map between data and prior distributions has been utilized as a generative model. These OT-based generative models share a similar adversarial training objective. In this paper, we begin by unifying these OT-based adversarial methods within a single framework. Then, we elucidate the role of each component in training dynamics through a comprehensive analysis of this unified framework. Moreover, we suggest a simple but novel method that improves the previously best-performing OT-based model. Intuitively, our approach conducts a gradual refinement of the generated distribution, progressively aligning it with the data distribution. Our approach achieves a FID score of 2.51 on CIFAR-10, outperforming unified OT-based adversarial approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jODehvtTDx",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18420,
    "title": "Composed Image Retrieval with Text Feedback via Multi-grained Uncertainty Regularization",
    "authors": [
      "Yiyang Chen",
      "Zhedong Zheng",
      "Wei Ji",
      "Leigang Qu",
      "Tat-Seng Chua"
    ],
    "abstract": "We investigate composed image retrieval with text feedback. Users gradually look for the target of interest by moving from coarse to fine-grained feedback.  However, existing methods merely focus on the latter, i.e., fine-grained search, by harnessing positive and negative pairs during training. This pair-based paradigm only considers the one-to-one distance between a pair of specific points, which is not aligned with the one-to-many coarse-grained retrieval process and compromises the recall rate. In an attempt to fill this gap, we introduce a unified learning approach to simultaneously modeling the coarse- and fine-grained retrieval by considering the multi-grained uncertainty. The key idea underpinning the proposed method is to integrate fine- and coarse-grained retrieval as matching data points with small and large fluctuations, respectively.Specifically, our method contains two modules: uncertainty modeling and uncertainty regularization. (1) The uncertainty modeling simulates the multi-grained queries by introducing identically distributed fluctuations in the feature space. (2) Based on the uncertainty modeling, we further introduce uncertainty regularization to adapt the matching objective according to the fluctuation range.Compared with existing methods, the proposed strategy explicitly prevents the model from pushing away potential candidates in the early stage and thus improves the recall rate.  On the three public datasets, i.e., FashionIQ, Fashion200k, and Shoes, the proposed method has achieved +4.03%, + 3.38%, and + 2.40% Recall@50 accuracy over a strong baseline, respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Yb5KvPkKQg",
    "arxiv_id": "2211.07394",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18023,
    "title": "Optimal Sample Complexity for Average Reward Markov Decision Processes",
    "authors": [
      "Shengbo Wang",
      "Jose Blanchet",
      "Peter Glynn"
    ],
    "abstract": "We settle the sample complexity of policy learning for the maximization of the long run average reward associated with a uniformly ergodic Markov decision process (MDP), assuming a generative model. In this context, the existing literature provides a sample complexity upper bound of $\\widetilde O(|S||At_{\\text{mix}}^2 \\epsilon^{-2})$ and a lower bound of $\\Omega(|S||A|t_{\\text{mix}} \\epsilon^{-2})$.  In these expressions, $|S|$ and $|A|$ denote the cardinalities of the state and action spaces respectively, $t_{\\text{mix}}$ serves as a uniform upper limit for the total variation mixing times, and $\\epsilon$ signifies the error tolerance. Therefore, a notable gap of $t_{\\text{mix}}$ still remains to be bridged. Our primary contribution is to establish an estimator for the optimal policy of average reward MDPs with a sample complexity of $\\widetilde O(|S||A|t_{\\text{mix}}\\epsilon^{-2})$, effectively reaching the lower bound in the literature. This is achieved by combining algorithmic ideas in Jin \\& Sidford (2021) with those of Li et al. (2020).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jOm5p3q7c7",
    "arxiv_id": "2310.08833",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18419,
    "title": "Improving Intrinsic Exploration by Creating Stationary Objectives",
    "authors": [
      "Roger Creus Castanyer",
      "Joshua Romoff",
      "Glen Berseth"
    ],
    "abstract": "Exploration bonuses in reinforcement learning guide long-horizon exploration by defining custom intrinsic objectives. Count-based methods use the frequency of state visits to derive an exploration bonus. In this paper, we identify that any intrinsic reward function derived from count-based methods is non-stationary and hence induces a difficult objective to optimize for the agent. The key contribution of our work lies in transforming the original non-stationary rewards into stationary rewards through an augmented state representation. For this purpose, we introduce the Stationary Objectives For Exploration (SOFE) framework. SOFE requires *identifying* sufficient statistics for different exploration bonuses and finding an *efficient* encoding of these statistics to use as input to a deep network. SOFE is based on proposing state augmentations that expand the state space but hold the promise of simplifying the optimization of the agent's objective. Our experiments show that SOFE improves the agents' performance in challenging exploration problems, including sparse-reward tasks, pixel-based observations, 3D navigation, and procedurally generated environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YbZxT0SON4",
    "arxiv_id": "2310.18144",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18299,
    "title": "ADDP: Learning General Representations for Image Recognition and Generation with Alternating Denoising Diffusion Process",
    "authors": [
      "Changyao Tian",
      "Chenxin Tao",
      "Jifeng Dai",
      "Hao Li",
      "Ziheng Li",
      "Lewei Lu",
      "Xiaogang Wang",
      "Hongsheng Li",
      "Gao Huang",
      "Xizhou Zhu"
    ],
    "abstract": "Image recognition and generation have long been developed independently of each other. With the recent trend towards general-purpose representation learning, the development of general representations for both recognition and generation tasks is also promoted. However, preliminary attempts mainly focus on generation performance, but are still inferior on recognition tasks. These methods are modeled in the vector-quantized (VQ) space, whereas leading recognition methods use pixels as inputs. Our key insights are twofold: *(1) pixels as inputs are crucial for recognition tasks; (2) VQ tokens as reconstruction targets are beneficial for generation tasks.* These observations motivate us to propose an **Alternating Denoising Diffusion Process (ADDP)** that integrates these two spaces within a single representation learning framework. In each denoising step, our method first decodes pixels from previous VQ tokens, then generates new VQ tokens from the decoded pixels. The diffusion process gradually masks out a portion of VQ tokens to construct the training samples. The learned representations can be used to generate diverse high-fidelity images and also demonstrate excellent transfer performance on recognition tasks. Extensive experiments show that our method achieves competitive performance on unconditional generation, ImageNet classification, COCO detection, and ADE20k segmentation. Importantly, our method represents *the first successful development* of general representations applicable to both generation and dense recognition tasks. Code shall be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cMPm8YFXZe",
    "arxiv_id": "2306.05423",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19752,
    "title": "Is ImageNet worth 1 video? Learning strong image encoders from 1 long unlabelled video",
    "authors": [
      "Shashanka Venkataramanan",
      "Mamshad Nayeem Rizve",
      "Joao Carreira",
      "Yuki M Asano",
      "Yannis Avrithis"
    ],
    "abstract": "Self-supervised learning has unlocked the potential of scaling up pretraining to billions of images, since annotation is unnecessary. But are we making the best use of data? How more economical can we be? In this work, we attempt to answer this question by making two contributions. First, we investigate first-person videos and introduce a ``Walking Tours'' dataset. These videos are high-resolution, hours-long, captured in a single uninterrupted take, depicting a large number of objects and actions with natural scene transitions. They are unlabeled and uncurated, thus realistic for self-supervision and comparable with human learning. Second, we introduce a novel self-supervised image pretraining method tailored for learning from continuous videos. Existing methods typically adapt image-based pretraining approaches to incorporate more frames. Instead, we advocate a ``tracking to learn to recognize'' approach. Our method called DoRA, leads to attention maps that **D**isc**O**ver and t**RA**ck objects over time in an end-to-end manner, using transformer cross-attention. We derive multiple views from the tracks and use them in a classical self-supervised distillation loss. Using our novel approach, a single Walking Tours video remarkably becomes a strong competitor to ImageNet for several image and video downstream tasks.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=Yen1lGns2o",
    "arxiv_id": "2310.08584",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18022,
    "title": "Pushing Boundaries: Mixup's Influence on Neural Collapse",
    "authors": [
      "Quinn LeBlanc Fisher",
      "Haoming Meng",
      "Vardan Papyan"
    ],
    "abstract": "Mixup is a data augmentation strategy that employs convex combinations of training instances and their respective labels to augment the robustness and calibration of deep neural networks. Despite its widespread adoption, the nuanced mechanisms that underpin its success are not entirely understood. The observed phenomenon of Neural Collapse, where the last-layer activations and classifier of deep networks converge to a simplex equiangular tight frame (ETF), provides a compelling motivation to explore whether mixup induces alternative geometric configurations and whether those could explain its success. In this study, we delve into the last-layer activations of training data for deep networks subjected to mixup, aiming to uncover insights into its operational efficacy. Our investigation, spanning various architectures and dataset pairs, reveals that mixup's last-layer activations predominantly converge to a distinctive configuration. In this configuration, activations from mixed-up examples of identical classes align with the classifier, while those from different classes delineate channels along the decision boundary. To validate our empirical observations, we further conduct a theoretical analysis under the assumption of an unconstrained features model, utilizing the mixup loss. Through this, we characterize and derive the optimal last-layer features, culminating in a configuration consistent with our experimental findings, thereby shedding light on the intricate workings of mixup in the training of deep networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jTSKkcbEsj",
    "arxiv_id": "2402.06171",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18411,
    "title": "Trajeglish: Learning the Language of Driving Scenarios",
    "authors": [
      "Jonah Philion",
      "Xue Bin Peng",
      "Sanja Fidler"
    ],
    "abstract": "A longstanding challenge for self-driving development is the ability to simulate dynamic driving scenarios seeded from recorded driving logs. Given an initial scene observed during a test drive, we seek the ability to sample plausible scene-consistent future trajectories for all agents in the scene, even when the actions for a subset of agents are chosen by an external source, such as a black-box self-driving planner. In order to model the complicated spatial and temporal interaction across agents in driving scenarios, we propose to tokenize the motion of dynamic agents and use tools from language modeling to model the full sequence of multi-agent actions. Our traffic model explicitly captures intra-timestep dependence between agents, which we show is essential for simulation given only a single frame of historical scene context, as well as enabling improvements when provided longer historical context. We demonstrate competitive results sampling scenarios given initializations from the Waymo Open Dataset with full autonomy as well as partial autonomy, and show that the representations learned by our model can quickly be adapted to improve performance on nuScenes, a considerably smaller dataset. We additionally use density estimates from our model to quantify the saliency of context length and intra-timestep interaction for the traffic modeling task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Z59Rb5bPPP",
    "arxiv_id": "2312.04535",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18021,
    "title": "Hybrid Distillation: Connecting Masked Autoencoders with Contrastive Learners",
    "authors": [
      "Bowen Shi",
      "XIAOPENG ZHANG",
      "Yaoming Wang",
      "Jin Li",
      "Wenrui Dai",
      "Junni Zou",
      "Hongkai Xiong",
      "Qi Tian"
    ],
    "abstract": "As two prominent strategies for representation learning, Contrastive Learning (CL) and Masked Image Modeling (MIM) have witnessed significant progress. Previous studies have demonstrated the advantages of each approach in specific scenarios. CL, resembling supervised pre-training, excels at capturing longer-range global patterns and enhancing feature discrimination, while MIM is adept at introducing local and diverse attention across transformer layers. Considering the respective strengths, previous studies utilize feature distillation to inherit both discrimination and diversity. In this paper, we thoroughly examine previous feature distillation methods and observe that the increase in diversity mainly stems from asymmetric designs, which may in turn compromise the discrimination ability. To strike a balance between the two properties, we propose a simple yet effective strategy termed Hybrid Distill, which leverages both the CL and MIM teachers to jointly guide the student model. Hybrid Distill emulates the token relations of the MIM teacher at intermediate layers for diversity, while simultaneously distilling the final features of the CL teacher to enhance discrimination. A progressive redundant token masking strategy is employed to reduce the expenses associated with distillation and aid in preventing the model from converging to local optima. Experimental results demonstrate that Hybrid Distill achieves superior performance on various benchmark datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jUWktnsplU",
    "arxiv_id": "2306.15876",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18408,
    "title": "Leftover-Lunch: Advantage-based Offline Reinforcement Learning for Language Models",
    "authors": [
      "Ashutosh Baheti",
      "Ximing Lu",
      "Faeze Brahman",
      "Ronan Le Bras",
      "Maarten Sap",
      "Mark Riedl"
    ],
    "abstract": "Language Models (LMs) achieve substantial language capabilities when finetuned using Reinforcement Learning with Human Feedback (RLHF). However, RLHF is an unstable and data-hungry process that continually requires new high-quality LM-generated data for finetuning. We introduce Advantage-Leftover Lunch RL (A-LoL), a new class of offline policy gradient algorithms that enable RL training on any pre-existing data. By assuming the entire LM output sequence as a single action, A-LoL allows incorporating sequence-level classifiers or human-designed scoring functions as rewards. Subsequently, by using LM\u2019s internal sequence-level value estimate, A-LoL filters negative advantage (low-quality) data points during training, making it resilient to noise. Overall, A-LoL is an easy-to-implement LM training recipe that is sample-efficient and stable.We demonstrate the effectiveness of A-LoL and its variants with a set of four different language generation tasks. We compare against both online RL (PPO) and recent preference-based (DPO, PRO) and reward-based (GOLD) offline RL baselines. On the commonly-used RLHF benchmark, Helpful and Harmless Assistant (HHA), LMs trained with A-LoL methods achieve the highest diversity while also being rated more safe and helpful than baselines according to humans. Additionally, in the remaining three tasks, A-LoL could optimize multiple distinct reward functions even when using noisy or suboptimal training data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZDGKPbF0VQ",
    "arxiv_id": "2305.14718",
    "GitHub": [
      "https://github.com/abaheti95/LoL-RL"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18398,
    "title": "Mean Field Theory in Deep Metric Learning",
    "authors": [
      "Takuya Furusawa"
    ],
    "abstract": "In this paper, we explore the application of mean field theory, a technique from statistical physics, to deep metric learning and address the high training complexity commonly associated with conventional metric learning loss functions.By adapting mean field theory for deep metric learning, we develop an approach to design classification-based loss functions from pair-based ones, which can be considered complementary to the proxy-based approach.Applying the mean field theory to two pair-based loss functions, we derive two new loss functions, MeanFieldContrastive and MeanFieldClassWiseMultiSimilarity losses, with reduced training complexity.We extensively evaluate these derived loss functions on three image-retrieval datasets and demonstrate that our loss functions outperform baseline methods in two out of the three datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZPdZLlNXSm",
    "arxiv_id": "2306.15368",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18396,
    "title": "Alleviating Exposure Bias in Diffusion Models through Sampling with Shifted Time Steps",
    "authors": [
      "Mingxiao Li",
      "Tingyu Qu",
      "Ruicong Yao",
      "Wei Sun",
      "Marie-Francine Moens"
    ],
    "abstract": "Diffusion Probabilistic Models (DPM) have shown remarkable efficacy in the synthesis of high-quality images. However, their inference process characteristically requires numerous, potentially hundreds, of iterative steps, which could exaggerate the problem of exposure bias due to the training and inference discrepancy. Previous work has attempted to mitigate this issue by perturbing inputs during training, which consequently mandates the retraining of the DPM. In this work, we conduct a systematic study of exposure bias in DPM and, intriguingly, we find that the exposure bias could be alleviated with a novel sampling method that we propose, without retraining the model. We empirically and theoretically show that, during inference, for each backward time step $t$ and corresponding state $\\hat{x}_t$, there might exist another time step $t_s$ which exhibits superior coupling with $\\hat{x}_t$. Based on this finding, we introduce a sampling method named Time-Shift Sampler. Our framework can be seamlessly integrated to existing sampling algorithms, such as DDPM, DDIM and other high-order solvers, inducing merely minimal additional computations. Experimental results show our method brings significant and consistent improvements in FID scores on different datasets and sampling methods. For example, integrating Time-Shift Sampler to F-PNDM yields a FID=3.88, achieving 44.49\\% improvements as compared to F-PNDM, on CIFAR-10 with 10 sampling steps, which is more performant than the vanilla DDIM with 100 sampling steps. We will release the code upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZSD3MloKe6",
    "arxiv_id": "2305.15583",
    "GitHub": [
      "https://github.com/Mingxiao-Li/TS-DPM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18020,
    "title": "Towards Foundation Models for Knowledge Graph Reasoning",
    "authors": [
      "Mikhail Galkin",
      "Xinyu Yuan",
      "Hesham Mostafa",
      "Jian Tang",
      "Zhaocheng Zhu"
    ],
    "abstract": "Foundation models in language and vision have the ability to run inference on any textual and visual inputs thanks to the transferable representations such as a vocabulary of tokens in language. Knowledge graphs (KGs) have different entity and relation vocabularies that generally do not overlap.The key challenge of designing foundation models on KGs is to learn such transferable representations that enable inference on any graph with arbitrary entity and relation vocabularies.In this work, we make a step towards such foundation models and present ULTRA, an approach for learning universal and transferable graph representations. ULTRA builds relational representations as a function conditioned on their interactions.Such a conditioning strategy allows a pre-trained ULTRA model to inductively generalize to any unseen KG with any relation vocabulary and to be fine-tuned on any graph.Conducting link prediction experiments on 57 different KGs, we find that the zero-shot inductive inference performance of a single pre-trained ULTRA model on unseen graphs of various sizes is often on par or better than strong baselines trained on specific graphs. Fine-tuning further boosts the performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jVEoydFOl9",
    "arxiv_id": "2310.04562",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18018,
    "title": "Dynamics-Informed Protein Design with Structure Conditioning",
    "authors": [
      "Urszula Julia Komorowska",
      "Simon V Mathis",
      "Kieran Didi",
      "Francisco Vargas",
      "Pietro Lio",
      "Mateja Jamnik"
    ],
    "abstract": "Current protein generative models are able to design novel backbones with desired shapes or functional motifs. However, despite the importance of a protein\u2019s dynamical properties for its function, conditioning on dynamical properties remains elusive. We present a new approach to protein generative modeling by leveraging Normal Mode Analysis that enables us to capture dynamical properties too. We introduce a method for conditioning the diffusion probabilistic models on protein dynamics, specifically on the lowest non-trivial normal mode of oscillation. Our method, similar to the classifier guidance conditioning, formulates the sampling process as being driven by conditional and unconditional terms. However, unlike previous works, we approximate the conditional term with a simple analytical function rather than an external neural network, thus making the eigenvector calculations approachable. We present the corresponding SDE theory as a formal justification of our approach. We extend our framework to conditioning on structure and dynamics at the same time, enabling scaffolding of the dynamical motifs. We demonstrate the empirical effectiveness of our method by turning the open-source unconditional protein diffusion model Genie into the conditional model with no retraining. Generated proteins exhibit the desired dynamical and structural properties while still being biologically plausible. Our work represents a first step towards incorporating dynamical behaviour in protein design and may open the door to designing more flexible and functional proteins in the future.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jZPqf2G9Sw",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18017,
    "title": "Foundation Model-oriented Robustness: Robust Image Model Evaluation with Pretrained Models",
    "authors": [
      "Peiyan Zhang",
      "Haoyang Liu",
      "Chaozhuo Li",
      "Xing Xie",
      "Sunghun Kim",
      "Haohan Wang"
    ],
    "abstract": "Machine learning has demonstrated remarkable performance over finite datasets, yet whether the scores over the fixed benchmarks can sufficiently indicate the model\u2019s performance in the real world is still in discussion. In reality, an ideal robust model will probably behave similarly to the oracle (e.g., the human users), thus a good evaluation protocol is probably to evaluate the models\u2019 behaviors in comparison to the oracle. In this paper, we introduce a new robustness measurement that directly measures the image classification model\u2019s performance compared with a surrogate oracle (i.e., a zoo of foundation models). Besides, we design a simple method that can accomplish the evaluation beyond the scope of the benchmarks. Our method extends the image datasets with new samples that are sufficiently perturbed to be distinct from the ones in the original sets, but are still bounded within the same image-label structure the original test image represents, constrained by a zoo of foundation models pretrained with a large amount of samples. As a result, our new method will offer us a new way to evaluate the models\u2019 robustness performance, free of limitations of fixed benchmarks or constrained perturbations, although scoped by the power of the oracle. In addition to the evaluation results, we also leverage our generated data to understand the behaviors of the model and our new evaluation strategies.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jd5GokdySz",
    "arxiv_id": "2308.10632",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18381,
    "title": "Clifford Group Equivariant Simplicial Message Passing Networks",
    "authors": [
      "Cong Liu",
      "David Ruhe",
      "Floor Eijkelboom",
      "Patrick Forr\u00e9"
    ],
    "abstract": "We introduce Clifford Group Equivariant Simplicial Message Passing Networks, a method for steerable $\\mathrm{E}(n)$-equivariant message passing on simplicial complexes. Our method integrates the expressivity of Clifford group-equivariant layers with simplicial message passing, which is topologically more intricate than regular graph message passing. Clifford algebras include higher-order objects such as bivectors and trivectors, which express geometric features (e.g., areas, volumes) derived from vectors. Using this knowledge, we represent simplex features through geometric products of their vertices. To achieve efficient simplicial message passing, we share the parameters of the message network across different dimensions. Additionally, we restrict the final message to an aggregation of the incoming messages from different dimensions, leading to what we term *shared* simplicial message passing. Experimental results show that our method is able to outperform both equivariant and simplicial graph neural networks on a variety of geometric tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Zz594UBNOH",
    "arxiv_id": "2402.10011",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18016,
    "title": "Follow-the-Perturbed-Leader for Adversarial Bandits: Heavy Tails, Robustness, and Privacy",
    "authors": [
      "Duo Cheng",
      "Xingyu Zhou",
      "Bo Ji"
    ],
    "abstract": "We study adversarial bandit problems with potentially heavy-tailed losses. Unlike standard settings with non-negative and bounded losses, managing negative and unbounded losses introduces a unique challenge in controlling the ``stability'' of the algorithm and hence the regret. To tackle this challenge, we propose a Follow-the-Perturbed-Leader (FTPL) based learning algorithm. Notably, our method achieves (nearly) optimal worst-case regret, eliminating the need for an undesired assumption inherent in the Follow-the-Regularized-Leader (FTRL) based approach. Thanks to this distinctive advantage, our algorithmic framework finds novel applications in two important scenarios with unbounded heavy-tailed losses. For adversarial bandits with heavy-tailed losses and Huber contamination, which we call the robust setting, our algorithm is the first to match the lower bound (up to a $\\polylog(K)$ factor, where $K$ is the number of actions). In the private setting, where true losses are in a bounded range (e.g., $[0,1]$) but with additional Local Differential Privacy (LDP) guarantees, our algorithm achieves an improvement of a $\\polylog(T)$ factor in the regret bound compared to the best-known results, where $T$ is the total number of rounds. Furthermore, when compared to state-of-the-art FTRL-based algorithms, our FTPL-based algorithm has a more streamlined design. It eliminates the need for additional explicit exploration and solely maintains the absolute value of loss estimates below a predetermined threshold.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jeMZi2Z9xe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18015,
    "title": "MuSR: Testing the Limits of Chain-of-thought with Multistep Soft Reasoning",
    "authors": [
      "Zayne Rea Sprague",
      "Xi Ye",
      "Kaj Bostrom",
      "Swarat Chaudhuri",
      "Greg Durrett"
    ],
    "abstract": "While large language models (LLMs) equipped with techniques like chain-of-thought prompting have demonstrated impressive capabilities, they still fall short in their ability to reason robustly in complex settings. However, evaluating LLM reasoning is challenging because system capabilities continue to grow while benchmark datasets for tasks like logical deduction have remained static. We introduce MuSR, a dataset for evaluating language models on multistep soft reasoning tasks specified in a natural language narrative. This dataset has two crucial features. First, it is created through a novel neurosymbolic synthetic-to-natural generation algorithm, enabling the construction of complex reasoning instances that challenge GPT-4 (e.g., murder mysteries roughly 1000 words in length) and which can be scaled further as more capable LLMs are released. Second, our data instances are free text narratives corresponding to real-world domains of reasoning; this makes it simultaneously much more challenging than other synthetically-crafted benchmarks while remaining realistic and tractable for human annotators to solve with high accuracy. We evaluate a range of LLMs and prompting techniques on this dataset and characterize the gaps that remain for techniques like chain-of-thought to perform robust reasoning.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=jenyYQzue1",
    "arxiv_id": "2310.16049",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18014,
    "title": "Look, Remember and Reason: Grounded Reasoning in Videos with Language Models",
    "authors": [
      "Apratim Bhattacharyya",
      "Sunny Panchal",
      "Reza Pourreza",
      "Mingu Lee",
      "Pulkit Madan",
      "Roland Memisevic"
    ],
    "abstract": "Multi-modal language models (LM) have recently shown promising performance in high-level reasoning tasks on videos. However, existing methods still fall short in tasks like causal or  compositional spatiotemporal reasoning over actions, in which model predictions need to be grounded in fine-grained low-level details, such as object motions and object interactions.In this work, we propose training an LM end-to-end on low-level surrogate tasks, including object detection, re-identification, and tracking, to endow the  model with the required low-level visual capabilities. We show that a two-stream video encoder with spatiotemporal attention is effective at capturing the required static and motion-based cues in the video. By leveraging the LM's ability to perform the low-level surrogate tasks,  we can cast reasoning in videos as the three-step process of *Look, Remember, Reason*, wherein visual information is extracted using low-level visual skills step-by-step and then integrated to arrive at a final answer. We demonstrate the effectiveness of our framework on diverse visual reasoning tasks from the ACRE, CATER, and Something-Else datasets. Our approach is trainable end-to-end and surpasses state-of-the-art task-specific methods across these tasks by a large margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jhPvuc7kxB",
    "arxiv_id": "2306.17778",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18013,
    "title": "Knowledge Fusion of Large Language Models",
    "authors": [
      "Fanqi Wan",
      "Xinting Huang",
      "Deng Cai",
      "Xiaojun Quan",
      "Wei Bi",
      "Shuming Shi"
    ],
    "abstract": "While training large language models (LLMs) from scratch can generate models with distinct functionalities and strengths, it comes at significant costs and may result in redundant capabilities. Alternatively, a cost-effective and compelling approach is to merge existing pre-trained LLMs into a more potent model. However, due to the varying architectures of these LLMs, directly blending their weights is impractical. In this paper, we introduce the notion of knowledge fusion for LLMs, aimed at combining the capabilities of existing LLMs and transferring them into a single LLM. By leveraging the generative distributions of source LLMs, we externalize their collective knowledge and unique strengths, thereby potentially elevating the capabilities of the target model beyond those of any individual source LLM. We validate our approach using three popular LLMs with different architectures\u2014Llama-2, MPT, and OpenLLaMA\u2014across various benchmarks and tasks. Our findings confirm that the fusion of LLMs can improve the performance of the target model across a range of capabilities such as reasoning, commonsense, and code generation. Our code, model weights, and data are public at \\url{https://github.com/fanqiwan/FuseLLM}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jiDsk12qcz",
    "arxiv_id": "2401.10491",
    "GitHub": [
      "https://github.com/fanqiwan/FuseLLM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18379,
    "title": "iGraphMix: Input Graph Mixup Method for Node Classification",
    "authors": [
      "Jongwon Jeong",
      "Hoyeop Lee",
      "Hyui Geon Yoon",
      "Beomyoung Lee",
      "Junhee Heo",
      "Geonsoo Kim",
      "Kim Jin Seon"
    ],
    "abstract": "Recently, Input Mixup, which augments virtual samples by interpolating input features and corresponding labels, is one of the promising methods to alleviate the over-fitting problem on various domains including image classification and natural language processing because of its ability to generate a variety of virtual samples, and ease of usability and versatility. However, designing Input Mixup for the node classification is still challenging due to the irregularity issue that each node contains a different number of neighboring nodes for input and the alignment issue that how to align and interpolate two sets of neighboring nodes is not well-defined when two nodes are interpolated. To address the two issues, this paper proposes a novel Mixup method, called iGraphMix, tailored to the node classification. Our method generates virtual nodes and their edges by interpolating input features and labels, and attaching sampled neighboring nodes. The virtual graphs generated by iGraphMix serve as inputs for graph neural networks (GNNs) training, thereby facilitating its easy application to various GNNs and enabling effective combination with other augmentation methods. We mathematically prove that training GNNs with iGraphMix leads to better generalization performance compared to that without augmentation, and our experiments support the theoretical findings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=a2ljjXeDcE",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18375,
    "title": "Gaining Wisdom from Setbacks: Aligning Large Language Models via Mistake Analysis",
    "authors": [
      "Kai Chen",
      "Chunwei Wang",
      "Kuo Yang",
      "Jianhua Han",
      "Lanqing HONG",
      "Fei Mi",
      "Hang Xu",
      "Zhengying Liu",
      "Wenyong Huang",
      "Zhenguo Li",
      "Dit-Yan Yeung",
      "Lifeng Shang"
    ],
    "abstract": "The rapid development of large language models (LLMs) has not only provided numerous opportunities but also presented significant challenges. This becomes particularly evident when LLMs inadvertently generate harmful or toxic content, either unintentionally or because of intentional inducement. Existing alignment methods usually direct LLMs toward the favorable outcomes by utilizing human-annotated, flawless instruction-response pairs. Conversely, this study proposes a novel alignment technique based on mistake analysis, which deliberately exposes LLMs to erroneous content to learn the reasons for mistakes and how to avoid them. In this case, mistakes are repurposed into valuable data for alignment, effectively helping to avoid the production of erroneous responses. Without external models or human annotations, our method leverages a model's intrinsic ability to discern undesirable mistakes and improves the safety of its generated responses. Experimental results reveal that our method outperforms existing alignment approaches in enhancing model safety while maintaining the overall utility.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aA33A70IO6",
    "arxiv_id": "2310.10477",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18012,
    "title": "Stochastic Controlled Averaging for Federated Learning with Communication Compression",
    "authors": [
      "Xinmeng Huang",
      "Ping Li",
      "Xiaoyun Li"
    ],
    "abstract": "Communication compression has gained great interest in Federated Learning(FL) for the potential of alleviating its communication overhead. However, com-munication compression brings forth new challenges in FL due to the interplayof compression-incurred information distortion and inherent characteristics of FLsuch as partial participation and data heterogeneity. Despite the recent develop-ment, the existing approaches either cannot accommodate arbitrary data hetero-geneity or partial participation, or require stringent conditions on compression.In this paper, we revisit the seminal stochastic controlled averaging method byproposing an equivalent but more efficient/simplified formulation with halved up-link communication costs, building upon which we propose two compressed FLalgorithms, SCALLION and SCAFCOM, to support unbiased and biased com-pression, respectively. Both the proposed methods outperform the existing com-pressed FL methods in terms of communication and computation complexities.Moreover, SCALLION and SCAFCOM attain fast convergence rates under ar-bitrary data heterogeneity and without any additional assumptions on compressionerrors. Experiments show that SCALLION and SCAFCOM outperform recentcompressed FL methods under the same communication budget.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=jj5ZjZsWJe",
    "arxiv_id": "2308.08165",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18011,
    "title": "LLM Augmented LLMs: Expanding Capabilities through Composition",
    "authors": [
      "Rachit Bansal",
      "Bidisha Samanta",
      "Siddharth Dalmia",
      "Nitish Gupta",
      "Sriram Ganapathy",
      "Abhishek Bapna",
      "Prateek Jain",
      "Partha Talukdar"
    ],
    "abstract": "Foundational models with billions of parameters which have been trained on large corpus of data have demonstrated non-trivial skills in a variety of domains. However, due to their monolithic structure, it is challenging and expensive to augment them or impart new skills. On the other hand, due to their adaptation abilities,several new instances of these models are being trained towards new domains and tasks.  In this work, we study the problem of efficient and practical composition of existing foundation models with more specific models to enable newer capabilities. To this end,  we propose CALM\u2014Composition to Augment Language Models\u2014which introduces cross-attention between models to compose their representations and enable new capabilities. Salient features of CALM are: (i) Scales up LLMs on new tasks by \u2018re-using\u2019 existing LLMs along with a few additional parameters and data, (ii) Existing model weights are kept intact, and hence preserves existing capabilities, and (iii) Applies to diverse domains and settings. We illustrate that augmenting PaLM2-S with a smaller model trained on low-resource languages results in an absolute improvement of up to 13% on tasks like translation into English and arithmetic reasoning for low-resource languages. Similarly,when PaLM2-S is augmented with a code-specific model, we see a relative improvement of 40% over the base model for code generation and explanation tasks\u2014on-par with fully fine-tuned counterparts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jjA4O1vJRz",
    "arxiv_id": "2401.02412",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18348,
    "title": "Retrieval-Enhanced Contrastive Vision-Text Models",
    "authors": [
      "Ahmet Iscen",
      "Mathilde Caron",
      "Alireza Fathi",
      "Cordelia Schmid"
    ],
    "abstract": "Contrastive image-text models such as CLIP form the building blocks of many state-of-the-art systems. While they excel at recognizing common generic concepts, they still struggle on fine-grained entities which are rare, or even absent from the pre-training dataset. Hence, a key ingredient to their success has been the use of large-scale curated pre-training data aiming at expanding the set of concepts that they can memorize during the pre-training stage. In this work, we explore an alternative to encoding fine-grained knowledge directly into the model's parameters:  we instead train the model to retrieve this knowledge from an external memory. Specifically, we propose to equip existing vision-text models with the ability to refine their embedding with cross-modal retrieved information from a memory at inference time, which greatly improves their zero-shot predictions. Remarkably, we show that this can be done with a light-weight, single-layer, fusion transformer on top of a frozen CLIP. Our experiments validate that our retrieval-enhanced contrastive (RECO) training improves CLIP performance substantially on several challenging fine-grained tasks: for example +10.9 on Stanford Cars, +10.2 on CUB-2011 and +7.3 on the recent OVEN benchmark, where we even outperform the fine-tuned models on unseen classes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=b2UlHeyyC0",
    "arxiv_id": "2306.07196",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18006,
    "title": "MINT: Evaluating LLMs in Multi-turn Interaction with Tools and Language Feedback",
    "authors": [
      "Xingyao Wang",
      "Zihan Wang",
      "Jiateng Liu",
      "Yangyi Chen",
      "Lifan Yuan",
      "Hao Peng",
      "Heng Ji"
    ],
    "abstract": "To solve complex tasks, large language models (LLMs) often require multiple rounds of interactions with the user, sometimes assisted by external tools.However, current evaluation protocols often emphasize benchmark performance with single-turn exchanges, neglecting the nuanced interactions among the user, LLMs, and external tools, while also underestimating the importance of natural language feedback from users. These oversights contribute to discrepancies between research benchmark evaluations and real-world use cases.We introduce MINT, a benchmark that evaluates LLMs' ability to solve tasks with multi-turn interactions by (1) using tools and (2) leveraging natural language feedback.To ensure reproducibility, we provide an evaluation framework where LLMs can access tools by executing Python code and receive users' natural language feedback simulated by GPT-4.We repurpose a diverse set of established evaluation datasets focusing on reasoning, coding, and decision-making and carefully curate them into a compact subset for efficient evaluation.Our analysis of 20 open- and closed-source LLMs offers intriguing findings.(a) LLMs generally benefit from tools and language feedback, with performance gains (absolute, same below) of 1--8% for each turn of tool use and 2--17% with natural language feedback.(b) Better single-turn performance does not guarantee better multi-turn performance.(c) Surprisingly, on the LLMs evaluated, supervised instruction-finetuning (SIFT) and reinforcement learning from human feedback (RLHF) generally hurt multi-turn capabilities.We expect MINT can help measure progress and incentivize research in improving LLMs' capabilities in multi-turn interactions, especially for open-source communities where multi-turn human evaluation can be less accessible compared to commercial LLMs with a larger user base.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jp3gWrMuIZ",
    "arxiv_id": "2309.10691",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18003,
    "title": "What Makes a Good Prune? Maximal Unstructured Pruning for Maximal Cosine Similarity",
    "authors": [
      "Gabryel Mason-Williams",
      "Fredrik Dahlqvist"
    ],
    "abstract": "Pruning is an effective method to reduce the size of deep neural network models, maintain accuracy, and, in some cases, improve the network's overall performance. However, the mechanisms underpinning pruning remain unclear. Why can different methods prune by different percentages yet achieve similar performance? Why can we not prune at the start of training? Why are some models more amenable to being pruned than others? Given a model, what is the maximum amount it can be pruned before significantly affecting the performance? This paper explores and answers these questions from the global unstructured magnitude pruning perspective with one epoch of fine-tuning. We develop the idea that cosine similarity is an effective proxy measure for functional similarity between the parent and the pruned network. We prove that the L1 pruning method is optimal when pruning by cosine similarity. We show that the higher the kurtosis of a model's parameter distribution, the more it can be pruned while maintaining performance. Finally, we present a simple method to determine the optimal amount by which a network can be L1-pruned based on its parameter distribution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jsvvPVVzwf",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18312,
    "title": "The All-Seeing Project: Towards Panoptic Visual Recognition and Understanding of the Open World",
    "authors": [
      "Weiyun Wang",
      "Min Shi",
      "Qingyun Li",
      "Wenhai Wang",
      "Zhenhang Huang",
      "Linjie Xing",
      "Zhe Chen",
      "Hao Li",
      "Xizhou Zhu",
      "Zhiguo Cao",
      "Yushi Chen",
      "Tong Lu",
      "Jifeng Dai",
      "Yu Qiao"
    ],
    "abstract": "We present the All-Seeing (AS) project: a large-scale dataset and model for recognizing and understanding everything in the open world.Using a scalable data engine that incorporates human feedback and efficient models in the loop, we create a new dataset (AS-1B) with over 1.2 billion regions annotated with semantic tags, question-answering pairs, and detailed captions. It covers a wide range of 3.5 million common and rare concepts in the real world and has 132.2 billion tokens that describe the concepts and their attributes. Leveraging this new dataset, we develop the All-Seeing model (ASM), a unified framework for panoptic visual recognition and understanding. The model is trained with open-ended language prompts and locations, which allows it to generalize to various vision and language tasks with remarkable zero-shot performance, including both region- and image-level retrieval, region recognition, captioning, and question-answering. We hope that this project can serve as a foundation for vision-language artificial general intelligence research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c2R7ajodcI",
    "arxiv_id": "2308.01907",
    "GitHub": [
      "https://github.com/OpenGVLab/All-Seeing"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18308,
    "title": "Democratizing Fine-grained Visual Recognition with Large Language Models",
    "authors": [
      "Mingxuan Liu",
      "Subhankar Roy",
      "Wenjing Li",
      "Zhun Zhong",
      "Nicu Sebe",
      "Elisa Ricci"
    ],
    "abstract": "Identifying subordinate-level categories from images is a longstanding task in computer vision and is referred to as fine-grained visual recognition (FGVR). It has tremendous significance in real-world applications since an average layperson does not excel at differentiating species of birds or mushrooms due to subtle differences among the species. A major bottleneck in developing FGVR systems is caused by the need of high-quality paired expert annotations. To circumvent the need of expert knowledge we propose Fine-grained Semantic Category Reasoning (FineR) that internally leverages the world knowledge of large language models (LLMs) as a proxy in order to reason about fine-grained category names. In detail, to bridge the modality gap between images and LLM, we extract part-level visual attributes from images as text and feed that information to a LLM. Based on the visual attributes and its internal world knowledge the LLM reasons about the subordinate-level category names. Our training-free FineR outperforms several state-of-the-art FGVR and language and vision assistant models and shows promise in working in the wild and in new domains where gathering expert annotation is arduous.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c7DND1iIgb",
    "arxiv_id": "2401.13837",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18002,
    "title": "EX-Graph: A Pioneering Dataset Bridging Ethereum and X",
    "authors": [
      "Qian Wang",
      "Zhen Zhang",
      "Zemin Liu",
      "Shengliang Lu",
      "Bingqiao Luo",
      "Bingsheng He"
    ],
    "abstract": "While numerous public blockchain datasets are available, their utility is constrained by a singular focus on blockchain data. This constraint limits the incorporation of relevant social network data into blockchain analysis, thereby diminishing the breadth and depth of insight that can be derived.To address the above limitation, we introduce ETGraph, a novel dataset that authentically links Ethereum and Twitter, marking the first and largest dataset of its kind. ETGraph combines Ethereum transaction records (2 million nodes and 30 million edges) and Twitter following data (1 million nodes and 3 million edges),  bonding 30,667 Ethereum addresses with verified Twitter accounts sourced from OpenSea. Detailed statistical analysis on ETGraph highlights the structural differences between Twitter-matched and non-Twitter-matched Ethereum addresses. Extensive experiments, including Ethereum link prediction, wash-trading Ethereum addresses detection, and Twitter-Ethereum matching link prediction, emphasize the significant role of Twitter data in enhancing Ethereum analysis. ETGraph is available at https://etgraph.deno.dev/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=juE0rWGCJW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18305,
    "title": "BadChain: Backdoor Chain-of-Thought Prompting for Large Language Models",
    "authors": [
      "Zhen Xiang",
      "Fengqing Jiang",
      "Zidi Xiong",
      "Bhaskar Ramasubramanian",
      "Radha Poovendran",
      "Bo Li"
    ],
    "abstract": "Large language models (LLMs) are shown to benefit from chain-of-thought (COT) prompting, particularly when tackling tasks that require systematic reasoning processes. On the other hand, COT prompting also poses new vulnerabilities in the form of backdoor attacks, wherein the model will output unintended malicious content under specific backdoor-triggered conditions during inference. Traditional methods for launching backdoor attacks involve either contaminating the training dataset with backdoored instances or directly manipulating the model parameters during deployment. However, these approaches are not practical for commercial LLMs that typically operate via API access. In this paper, we propose BadChain, the first backdoor attack against LLMs employing COT prompting, which does not require access to the training dataset or model parameters and imposes low computational overhead. BadChain leverages the inherent reasoning capabilities of LLMs by inserting a backdoor reasoning step into the sequence of reasoning steps of the model output, thereby altering the final response when a backdoor trigger is embedded in the query prompt. In particular, a subset of demonstrations will be manipulated to incorporate a backdoor reasoning step in COT prompting. Consequently, given any query prompt containing the backdoor trigger, the LLM will be misled to output unintended content. Empirically, we show the effectiveness of BadChain for two COT strategies across four LLMs (Llama2, GPT-3.5, PaLM2, and GPT-4) and six complex benchmark tasks encompassing arithmetic, commonsense, and symbolic reasoning. We show that the baseline backdoor attacks designed for simpler tasks such as semantic classification will fail on these complicated tasks. In addition, our findings reveal that LLMs endowed with stronger reasoning capabilities exhibit higher susceptibility to BadChain, exemplified by a high average attack success rate of 97.0\\% across the six benchmark tasks on GPT-4. We also demonstrate the interpretability of BadChain by showing that the relationship between the trigger and the backdoor reasoning step can be well-explained based on the output of the backdoored model. Finally, we propose two defenses based on shuffling and demonstrate their overall ineffectiveness against BadChain. Therefore, BadChain remains a severe threat to LLMs, underscoring the urgency for the development of robust and effective future defenses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=c93SBwz1Ma",
    "arxiv_id": "2401.12242",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18298,
    "title": "Towards Faithful XAI Evaluation via Generalization-Limited Backdoor Watermark",
    "authors": [
      "Mengxi Ya",
      "Yiming Li",
      "Tao Dai",
      "Bin Wang",
      "Yong Jiang",
      "Shu-Tao Xia"
    ],
    "abstract": "Saliency-based representation visualization (SRV) ($e.g.$, Grad-CAM) is one of the most classical and widely adopted explainable artificial intelligence (XAI) methods for its simplicity and efficiency. It can be used to interpret deep neural networks by locating saliency areas contributing the most to their predictions. However, it is difficult to automatically measure and evaluate the performance of SRV methods due to the lack of ground-truth salience areas of samples. In this paper, we revisit the backdoor-based SRV evaluation, which is currently the only feasible method to alleviate the previous problem. We first reveal its \\emph{implementation limitations} and \\emph{unreliable nature} due to the trigger generalization of existing backdoor watermarks. Given these findings, we propose a generalization-limited backdoor watermark (GLBW), based on which we design a more faithful XAI evaluation. Specifically, we formulate the training of watermarked DNNs as a min-max problem, where we find the `worst' potential trigger (with the highest attack effectiveness and differences from the ground-truth trigger) via inner maximization and minimize its effects and the loss over benign and poisoned samples via outer minimization in each iteration. In particular, we design an adaptive optimization method to find desired potential triggers in each inner maximization. Extensive experiments on benchmark datasets are conducted, verifying the effectiveness of our generalization-limited watermark.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cObFETcoeW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18297,
    "title": "Chain-of-Knowledge: Grounding Large Language Models via Dynamic Knowledge Adapting over Heterogeneous Sources",
    "authors": [
      "Xingxuan Li",
      "Ruochen Zhao",
      "Yew Ken Chia",
      "Bosheng Ding",
      "Shafiq Joty",
      "Soujanya Poria",
      "Lidong Bing"
    ],
    "abstract": "We present chain-of-knowledge (CoK), a novel framework that augments large language models (LLMs) by dynamically incorporating grounding information from heterogeneous sources. It results in more factual rationales and reduced hallucination in generation. Specifically, CoK consists of three stages: reasoning preparation, dynamic knowledge adapting, and answer consolidation. Given a knowledge-intensive question, CoK first prepares several preliminary rationales and answers while identifying the relevant knowledge domains.If there is no majority consensus among the answers from samples, CoK corrects the rationales step by step by adapting knowledge from the identified domains.These corrected rationales can plausibly serve as a better foundation for the final answer consolidation.Unlike prior studies that primarily use unstructured data, CoK also leverages structured knowledge sources such as Wikidata and tables that provide more reliable factual information.To access both unstructured and structured knowledge sources in the dynamic knowledge adapting stage, we propose an adaptive query generator that allows the generation of queries for various types of query languages, including SPARQL, SQL, and natural sentences. Moreover, to minimize error propagation between rationales, CoK corrects the rationales progressively using preceding corrected rationales to generate and correct subsequent rationales.Extensive experiments show that CoK consistently improves the performance of LLMs on knowledge-intensive tasks across different domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cPgh4gWZlz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18000,
    "title": "Statistical Perspective of Top-K Sparse Softmax Gating Mixture of Experts",
    "authors": [
      "Huy Nguyen",
      "Pedram Akbarian",
      "Fanqi Yan",
      "Nhat Ho"
    ],
    "abstract": "Top-K sparse softmax gating mixture of experts has been widely used for scaling up massive deep-learning architectures without increasing the computational cost. Despite its popularity in real-world applications, the theoretical understanding of that gating function has remained an open problem. The main challenge comes from the structure of the top-K sparse softmax gating function, which partitions the input space into multiple regions with distinct behaviors. By focusing on a Gaussian mixture of experts, we establish theoretical results on the effects of the top-K sparse softmax gating function on both density and parameter estimations. Our results hinge upon defining novel loss functions among parameters to capture different behaviors of the input regions. When the true number of experts $k_{\\ast}$ is known, we demonstrate that the convergence rates of density and parameter estimations are both parametric on the sample size. However, when $k_{\\ast}$ becomes unknown and the true model is over-specified by a Gaussian mixture of $k$ experts where $k > k_{\\ast}$, our findings suggest that the number of experts selected from the top-K sparse softmax gating function must exceed the total cardinality of a certain number of Voronoi cells associated with the true parameters to guarantee the convergence of the density estimation. Moreover, while the density estimation rate remains parametric under this setting, the parameter estimation rates become substantially slow due to an intrinsic interaction between the softmax gating and expert functions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jvtmdK69KQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17999,
    "title": "Fair Classifiers that Abstain without Harm",
    "authors": [
      "Tongxin Yin",
      "Jean-Francois Ton",
      "Ruocheng Guo",
      "Yuanshun Yao",
      "Mingyan Liu",
      "Yang Liu"
    ],
    "abstract": "In critical applications, it is vital for classifiers to defer decision-making to humans. We propose a post-hoc method that makes existing classifiers selectively abstain from predicting certain samples. Our abstaining classifier is incentivized to maintain the original accuracy for each sub-population (i.e. no harm) while achieving a set of group fairness definitions to a user specified degree. To this end, we design an Integer Programming (IP) procedure that assigns abstention decisions for each training sample to satisfy a set of constraints. To generalize the abstaining decisions to test samples, we then train a surrogate model to learn the abstaining decisions based on the IP solutions in an end-to-end manner. We analyze the feasibility of the IP procedure to determine the possible abstention rate for different levels of unfairness tolerance and accuracy constraint for achieving no harm. To the best of our knowledge, this work is the first to identify the theoretical relationships between the constraint parameters and the required abstention rate. Our theoretical results are important since a high abstention rate is often infeasible in practice due to a lack of human resources. Our framework outperforms existing methods in terms of fairness disparity without sacrificing accuracy at similar abstention rates.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jvveGAbkVx",
    "arxiv_id": "2310.06205",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17996,
    "title": "C-TPT: Calibrated Test-Time Prompt Tuning for Vision-Language Models via Text Feature Dispersion",
    "authors": [
      "Hee Suk Yoon",
      "Eunseop Yoon",
      "Joshua Tian Jin Tee",
      "Mark A. Hasegawa-Johnson",
      "Yingzhen Li",
      "Chang D. Yoo"
    ],
    "abstract": "In deep learning, test-time adaptation has gained attention as a method for model fine-tuning without the need for labeled data. A prime exemplification is the recently proposed test-time prompt tuning for large-scale vision-language models such as CLIP. Unfortunately, these prompts have been mainly developed to improve accuracy, overlooking the importance of calibration\u2014a crucial aspect for quantifying prediction uncertainty. However, traditional calibration methods rely on substantial amounts of labeled data, making them impractical for test-time scenarios. To this end, this paper explores calibration during test-time prompt tuning by leveraging the inherent properties of CLIP. Through a series of observations, we find that the prompt choice significantly affects the calibration in CLIP, where the prompts leading to higher text feature dispersion result in better-calibrated predictions. Introducing the Average Text Feature Dispersion (ATFD), we establish its relationship with calibration error and present a novel method, Calibrated Test-time Prompt Tuning (C-TPT), for optimizing prompts during test-time with enhanced calibration. Through extensive experiments on different CLIP architectures and datasets, we show that C-TPT can effectively improve the calibration of test-time prompt tuning without needing labeled data. The code will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jzzEHTBFOT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18292,
    "title": "Latent 3D Graph Diffusion",
    "authors": [
      "Yuning You",
      "Ruida Zhou",
      "Jiwoong Park",
      "Haotian Xu",
      "Chao Tian",
      "Zhangyang Wang",
      "Yang Shen"
    ],
    "abstract": "Generating 3D graphs of \\textit{symmetry-group equivariance} is of intriguing potential in broad applications from machine vision to molecular discovery.Emerging approaches adopt diffusion generative models (DGMs) with proper re-engineering to capture 3D graph distributions.In this paper, we raise an orthogonal and fundamental question of \\textit{in what (latent) space we should diffuse 3D graphs}.\\ding{182} We motivate the study with theoretical analysis showing that the performance bound of 3D graph diffusion could be improved in a latent space versus the original space, provided that there are (i) low dimensionality yet (ii) high quality (i.e., low reconstruction error) of the latent space, and (iii) symmetry preservation as an inductive bias of latent DGMs.\\ding{183} Guided by the theoretical guidelines, we propose to perform 3D graph diffusion in a low-dimensional latent space, which is learned through cascaded 2D--3D graph autoencoders for low-error reconstruction and symmetry-group invariance.The overall pipeline is dubbed \\textbf{latent 3D graph diffusion}.\\ding{184} Motivated by applications in molecular discovery,  we further extend latent 3D graph diffusion to conditional generation given SE(3)-invariant attributes or equivariant 3D objects.\\ding{185} We also demonstrate empirically that out-of-distribution conditional generation can be further improved by regularizing the latent space via graph self-supervised learning.We validate through comprehensive experiments that our method generates 3D molecules of higher validity / drug-likeliness and comparable conformations / energetics, while being an order of magnitude faster in training. Codes will be released upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cXbnGtO0NZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18285,
    "title": "Large Language Models are Efficient Learners of Noise-Robust Speech Recognition",
    "authors": [
      "Yuchen Hu",
      "CHEN CHEN",
      "Chao-Han Huck Yang",
      "Ruizhe Li",
      "Chao Zhang",
      "Pin-Yu Chen",
      "Ensiong Chng"
    ],
    "abstract": "Recent advances in large language models (LLMs) have promoted generative error correction (GER) for automatic speech recognition (ASR), which leverages the rich linguistic knowledge and powerful reasoning ability of LLMs to improve recognition results. The latest work proposes a GER benchmark with \"HyPoradise\" dataset to learn the mapping from ASR N-best hypotheses to ground-truth transcription by efficient LLM finetuning, which shows great effectiveness but lacks specificity on noise-robust ASR. In this work, we extend the benchmark to noisy conditions and investigate if we can teach LLMs to perform denoising for GER just like what robust ASR do, where one solution is introducing noise information as a conditioner into LLM. However, directly incorporating noise embeddings from audio encoder could harm the LLM tuning due to cross-modality gap. To this end, we propose to extract a language-space noise embedding from the N-best list to represent the noise conditions of source speech, which can promote the denoising process in GER. Furthermore, in order to enhance its representation ability of audio noise, we design a knowledge distillation (KD) approach via mutual information estimation to distill the real noise information in audio embeddings to our language embedding. Experiments on various latest LLMs demonstrate our approach achieves a new breakthrough with up to 53.9% correction improvement in terms of word error rate while with limited training data. Analysis shows that our language-space noise embedding can well represent the noise conditions of source speech, under which off-the-shelf LLMs show strong ability of language-space denoising.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ceATjGPTUD",
    "arxiv_id": "2401.10446",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18284,
    "title": "Learning the greatest common divisor: explaining transformer predictions",
    "authors": [
      "Francois Charton"
    ],
    "abstract": "We train small transformers to calculate the greatest common divisor (GCD) of two positive integers, and show that their predictions are fully explainable. During training, models learn a list $\\mathcal D$ of divisors, and predict the largest element of $\\mathcal D$ that divides both inputs. We also show that training distributions have a large impact on performance. Models trained from uniform operands only learn a handful of GCD (up to $38$ out of $100$). Training from log-uniform operands boosts performance to $73$  correct GCD, and balancing the distribution of GCD, from inverse square to log-uniform, to $91$. On the other hand, a uniform distribution of GCD in the training set breaks model explainability.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=cmcD05NPKa",
    "arxiv_id": "2308.15594",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17995,
    "title": "TAB: Temporal Accumulated Batch Normalization in Spiking Neural Networks",
    "authors": [
      "Haiyan Jiang",
      "Vincent Zoonekynd",
      "Giulia De Masi",
      "Bin Gu",
      "Huan Xiong"
    ],
    "abstract": "Spiking Neural Networks (SNNs) are attracting growing interest for their energy-efficient computing when implemented on neuromorphic hardware. However, directly training SNNs, even adopting batch normalization (BN), is highly challenging due to their non-differentiable activation function and the temporally delayed accumulation of outputs over time.    For SNN training, this temporal accumulation gives rise to Temporal Covariate Shifts (TCS) along the temporal dimension, a phenomenon that would become increasingly pronounced with layerwise computations across multiple layers and time-steps.     In this paper, we introduce TAB (Temporal Accumulated Batch Normalization), a novel SNN batch normalization method that addresses the temporal covariate shift issue by aligning with neuron dynamics (specifically the accumulated membrane potential) and utilizing temporal accumulated statistics for data normalization.     Within its framework, TAB effectively encapsulates the historical temporal dependencies that underlie the membrane potential accumulation process, thereby establishing a natural connection between neuron dynamics and TAB batch normalization.     Experimental results on CIFAR-10, CIFAR-100, and DVS-CIFAR10 show that our TAB method outperforms other state-of-the-art methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=k1wlmtPGLq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17994,
    "title": "Diagnosing Transformers: Illuminating Feature Spaces for Clinical Decision-Making",
    "authors": [
      "Aliyah R. Hsu",
      "Yeshwanth Cherapanamjeri",
      "Briton Park",
      "Tristan Naumann",
      "Anobel Odisho",
      "Bin Yu"
    ],
    "abstract": "Pre-trained transformers are often fine-tuned to aid clinical decision-making using limited clinical notes. Model interpretability is crucial, especially in high-stakes domains like medicine, to establish trust and ensure safety, which requires human engagement. We introduce SUFO, a systematic framework that enhances interpretability of fine-tuned transformer feature spaces. SUFO utilizes a range of analytic and visualization techniques, including Supervised probing, Unsupervised similarity analysis, Feature dynamics, and Outlier analysis to address key questions about model trust and interpretability (e.g. model suitability for a task, feature space evolution during fine-tuning, and interpretation of fine-tuned features and failure modes). We conduct a case study investigating the impact of pre-training data where we focus on real-world pathology classification tasks, and validate our findings on MedNLI. We evaluate five 110M-sized pre-trained transformer models, categorized into general-domain (BERT, TNLR), mixed-domain (BioBERT, Clinical BioBERT), and domain-specific (PubMedBERT) groups. Our SUFO analyses reveal that: (1) while PubMedBERT, the domain-specific model, contains valuable information for fine-tuning, it can overfit to minority classes when class imbalances exist. In contrast, mixed-domain models exhibit greater resistance to overfitting, suggesting potential improvements in domain-specific model robustness; (2) in-domain pre-training accelerates feature disambiguation during fine-tuning; and (3) feature spaces undergo significant sparsification during this process, enabling clinicians to identify common outlier modes among fine-tuned models as demonstrated in this paper. These findings showcase the utility of SUFO in enhancing trust and safety when using transformers in medicine, and we believe SUFO can aid practitioners in evaluating fine-tuned language models (LMs) for other applications in medicine and in more critical domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=k581sTMyPt",
    "arxiv_id": "2305.17588",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18277,
    "title": "LLaMA-Adapter: Efficient Fine-tuning of Large Language Models with Zero-initialized Attention",
    "authors": [
      "Renrui Zhang",
      "Jiaming Han",
      "Chris Liu",
      "Aojun Zhou",
      "Pan Lu",
      "Hongsheng Li",
      "Peng Gao",
      "Yu Qiao"
    ],
    "abstract": "With the rising tide of large language models (LLMs), there has been a growing interest in developing general-purpose instruction-following models, e.g., ChatGPT. To this end, we present LLaMA-Adapter, a lightweight adaption method for efficient instruction tuning of LLaMA. Using 52K self-instruct demonstrations, LLaMA-Adapter only introduces 1.2M learnable parameters upon the frozen LLaMA 7B model, and costs less than one hour for fine-tuning. Specifically, a zero-initialized attention mechanism is proposed. It adopts a learnable zero gating to adaptively inject the instructional cues into LLaMA within self-attention layers, contributing to a stable training process and superior final performance. In this way, LLaMA-Adapter can generate high-quality responses to diverse language instructions, comparable to Alpaca with fully fine-tuned 7B parameters. Besides language commands, by incorporating an image encoder, our approach can be simply extended to a multi-modal LLM for image-conditioned instruction following, which achieves superior multi-modal reasoning capacity on several popular benchmarks (MME, MMBench, LVLM-eHub). Furthermore, we also verify the proposed zero-initialized attention mechanism for fine-tuning other pre-trained models (ViT, RoBERTa, CLIP) on traditional vision and language tasks, demonstrating the effectiveness and generalizability of our approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=d4UiXAHN2W",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17993,
    "title": "Deep Generative Clustering with Multimodal Diffusion Variational Autoencoders",
    "authors": [
      "Emanuele Palumbo",
      "Laura Manduchi",
      "Sonia Laguna",
      "Daphn\u00e9 Chopard",
      "Julia E Vogt"
    ],
    "abstract": "Multimodal VAEs have recently gained significant attention as generative models for weakly-supervised learning with multiple heterogeneous modalities. In parallel, VAE-based methods have been explored as probabilistic approaches for clustering tasks. At the intersection of these two research directions, we propose a novel multimodal VAE model in which the latent space is extended to learn data clusters, leveraging shared information across modalities. Our experiments show that our proposed model improves generative performance over existing multimodal VAEs, particularly for unconditional generation. Furthermore, we propose a post-hoc procedure to automatically select the number of true clusters thus mitigating critical limitations of previous clustering frameworks. Notably, our method favorably compares to alternative clustering approaches, in weakly-supervised settings. Finally, we integrate recent advancements in diffusion models into the proposed method to improve generative quality for real-world images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=k5THrhXDV3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17991,
    "title": "Task structure and nonlinearity jointly determine learned representational geometry",
    "authors": [
      "Matteo Alleman",
      "Jack Lindsey",
      "Stefano Fusi"
    ],
    "abstract": "The utility of a learned neural representation depends on how well its geometry supports performance in downstream tasks. This geometry depends on the structure of the inputs, the structure of the target outputs, and on the architecture of the network.  By studying the learning dynamics of networks with one hidden layer, we discovered that the network's activation function has an unexpectedly strong impact on the representational geometry: Tanh networks tend to learn representations that reflect the structure of the target outputs, while ReLU networks retain more information about the structure of the raw inputs. This difference is consistently observed across a broad class of parameterized tasks in which we modulated the degree of alignment between the geometry of the task inputs and that of the task labels. We analyzed the learning dynamics in weight space and show how the differences between the networks with Tanh and ReLU nonlinearities arise from the asymmetric saturation of ReLU, which leads feature neurons to specialize for different regions of input space. Feature neurons in Tanh networks, by contrast, tend to inherit the task label structure. Consequently, when the target outputs are low dimensional, Tanh networks generate neural representations that are more disentangled than those obtained with a ReLU nonlinearity. Our findings shed light on the interplay between input-output geometry, nonlinearity, and learned representations in neural networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=k9t8dQ30kU",
    "arxiv_id": "2401.13558",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18269,
    "title": "PlaSma: Procedural Knowledge Models for Language-based Planning and Re-Planning",
    "authors": [
      "Faeze Brahman",
      "Chandra Bhagavatula",
      "Valentina Pyatkin",
      "Jena D. Hwang",
      "Xiang Lorraine Li",
      "Hirona Jacqueline Arai",
      "Soumya Sanyal",
      "Keisuke Sakaguchi",
      "Xiang Ren",
      "Yejin Choi"
    ],
    "abstract": "Procedural planning, which entails decomposing a high-level goal into a sequence of temporally ordered steps, is an important yet intricate task for machines. It involves integrating common-sense knowledge to reason about complex and often contextualized situations, e.g. ``scheduling a doctor's appointment without a phone''. While current approaches show encouraging results using large language models (LLMs), they are hindered by drawbacks such as costly API calls and reproducibility issues. In this paper, we advocate planning using smaller language models. We present PlaSma, a novel two-pronged approach to endow small language models with procedural knowledge and (constrained) language-based planning capabilities. More concretely, we develop *symbolic procedural knowledge distillation* to enhance the commonsense knowledge in small language models and an*inference-time algorithm* to facilitate more structured and accurate reasoning. In addition, we introduce a new related task, *Replanning*, that requires a revision of a plan to cope with a constrained situation. In both the planning and replanning settings, we show that orders-of-magnitude smaller models (770M-11B parameters) can compete and often surpass their larger teacher models' capabilities. Finally, we showcase successful application of PlaSma in an embodied environment, VirtualHome.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dFcXJgnrGB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17990,
    "title": "FasterViT: Fast Vision Transformers with Hierarchical Attention",
    "authors": [
      "Ali Hatamizadeh",
      "Greg Heinrich",
      "Hongxu Yin",
      "Andrew Tao",
      "Jose M. Alvarez",
      "Jan Kautz",
      "Pavlo Molchanov"
    ],
    "abstract": "We design a new family of hybrid CNN-ViT neural networks, named FasterViT, with a focus on high image throughput for computer vision (CV) applications. FasterViT combines the benefits of fast local representation learning in CNNs and global modeling properties in ViT. Our newly introduced Hierarchical Attention (HAT) approach decomposes global self-attention with quadratic complexity into a multi-level attention with reduced computational costs. We benefit from efficient window-based self-attention. Each window has access to dedicated carrier tokens that participate in local and global representation learning. At a high level, global self-attentions enable the efficient cross-window communication at lower costs. FasterViT achieves a SOTA Pareto-front in terms of accuracy \\vs image throughput. We have extensively validated its effectiveness on various CV tasks including classification, object detection and segmentation. We also show that HAT can be used as a plug-and-play module for existing networks and enhance them. We further demonstrate significantly faster and more accurate performance than competitive counterparts for images with high resolution. Code is available at https://bit.ly/FasterViT.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kB4yBiNmXX",
    "arxiv_id": "2306.06189",
    "GitHub": [
      "https://github.com/NVlabs/FasterViT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17989,
    "title": "Lifting Architectural Constraints of Injective Flows",
    "authors": [
      "Peter Sorrenson",
      "Felix Draxler",
      "Armand Rousselot",
      "Sander Hummerich",
      "Lea Zimmermann",
      "Ullrich Koethe"
    ],
    "abstract": "Normalizing Flows explicitly maximize a full-dimensional likelihood on the training data. However, real data is typically only supported on a lower-dimensional manifold leading the model to expend significant compute on modeling noise. Injective Flows fix this by jointly learning a manifold and the distribution on it. So far, they have been limited by restrictive architectures and/or high computational cost. We lift both constraints by a new efficient estimator for the maximum likelihood loss, compatible with free-form bottleneck architectures. We further show that naively learning both the data manifold and the distribution on it can lead to divergent solutions, and use this insight to motivate a stable maximum likelihood training objective. We perform extensive experiments on toy, tabular and image data, demonstrating the competitive performance of the resulting model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kBNIx4Biq4",
    "arxiv_id": "2306.01843",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17988,
    "title": "Faithful Rule Extraction for Differentiable Rule Learning Models",
    "authors": [
      "Xiaxia Wang",
      "David Jaime Tena Cucala",
      "Bernardo Cuenca Grau",
      "Ian Horrocks"
    ],
    "abstract": "There is increasing interest in methods for extracting interpretable rules from ML models trained to solve a wide range of tasks over knowledge graphs (KGs), such as KG completion, node classification, question answering and recommendation. Many such approaches, however, lack formal guarantees establishing the precise relationship between the model and the extracted rules, and this lack of assurance becomes especially problematic when the extracted rules are applied in safety-critical contexts or to ensure compliance with legal requirements. Recent research has examined whether the rules derived from the influential Neural-LP model exhibit soundness (or completeness), which means that the results obtained by applying the model to any dataset always contain (or are contained in) the results obtained by applying the rules to the same dataset. In this paper, we extend this analysis to the context of DRUM, an approach that has demonstrated superior practical performance. After observing that the rules currently extracted from a DRUM model can be unsound and/or incomplete, we propose a novel algorithm where the output rules, expressed in an extension of Datalog, ensure both soundness and completeness. This algorithm, however, can be inefficient in practice and hence we propose additional constraints to DRUM models facilitating rule extraction, albeit at the expense of reduced expressive power.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kBTzlxM2J1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18256,
    "title": "Human Motion Diffusion as a Generative Prior",
    "authors": [
      "Yoni Shafir",
      "Guy Tevet",
      "Roy Kapon",
      "Amit Haim Bermano"
    ],
    "abstract": "Recent work has demonstrated the significant potential of denoising diffusion modelsfor generating human motion, including text-to-motion capabilities.However, these methods are restricted by the paucity of annotated motion data,a focus on single-person motions, and a lack of detailed control.In this paper, we introduce three forms of composition based on diffusion priors:sequential, parallel, and model composition.Using sequential composition, we tackle the challenge of long sequencegeneration. We introduce DoubleTake, an inference-time method with whichwe generate long animations consisting of sequences of prompted intervalsand their transitions, using a prior trained only for short clips.Using parallel composition, we show promising steps toward two-person generation.Beginning with two fixed priors as well as a few two-person training examples, we learn a slimcommunication block, ComMDM, to coordinate interaction between the two resulting motions.Lastly, using model composition, we first train individual priorsto complete motions that realize a prescribed motion for a given joint.We then introduce DiffusionBlending, an interpolation mechanism to effectively blend severalsuch models to enable flexible and efficient fine-grained joint and trajectory-level control and editing.We evaluate the composition methods using an off-the-shelf motion diffusion model,and further compare the results to dedicated models trained for these specific tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dTpbEdN9kr",
    "arxiv_id": "2303.01418",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18254,
    "title": "Stable Anisotropic Regularization",
    "authors": [
      "William Rudman",
      "Carsten Eickhoff"
    ],
    "abstract": "Given the success of Large Language Models (LLMs), there has been considerable interest in studying the properties of model activations. The literature overwhelmingly agrees that LLM representations are dominated by a few ``outlier dimensions'' with exceedingly high variance and magnitude. Several studies in Natural Language Processing (NLP) have sought to mitigate the impact of such outlier dimensions and force LLMs to be isotropic (i.e., have uniform variance across all dimensions in embedding space). Isotropy is thought to be a desirable property for LLMs that improves model performance and more closely aligns textual representations with human intuition. However, many claims regarding isotropy in NLP have been based on the average cosine similarity of embeddings, which has recently been shown to be a flawed measure of isotropy. In this paper, we propose I-STAR: IsoScore$^{\\star}$-based STable Anisotropic Regularization, a novel regularization method that can be used to increase or decrease levels of isotropy in embedding space during training. I-STAR uses IsoScore$^{\\star}$, the first accurate measure of isotropy that is both differentiable and stable on mini-batch computations. In contrast to several previous works, we find that \\textit{decreasing} isotropy in contextualized embeddings improves performance on the majority of tasks and models considered in this paper.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dbQH9AOVd5",
    "arxiv_id": "2305.19358",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17984,
    "title": "Test-Time Adaptation with CLIP Reward for Zero-Shot Generalization in Vision-Language Models",
    "authors": [
      "Shuai Zhao",
      "Xiaohan Wang",
      "Linchao Zhu",
      "Yi Yang"
    ],
    "abstract": "One fascinating aspect of pre-trained vision-language models (VLMs) learning under language supervision is their impressive zero-shot generalization capability.However, this ability is hindered by distribution shifts between the training and testing data.Previous test time adaptation (TTA) methods for VLMs in zero-shot classification rely on minimizing the entropy of model outputs, tending to be stuck in incorrect model predictions.In this work, we propose TTA with feedback to rectify the model output and prevent the model from becoming blindly confident.Specifically, a CLIP model is adopted as the reward model during TTA and provides feedback for the VLM.Given a single test sample,the VLM is forced to maximize the CLIP reward between the input and sampled results from the VLM output distribution.The proposed \\textit{reinforcement learning with CLIP feedback~(RLCF)} framework is highly flexible and universal.Beyond the classification task, with task-specific sampling strategies and a proper reward baseline choice, RLCF can be easily extended to not only discrimination tasks like retrieval but also generalization tasks like image captioning,improving the zero-shot generalization capacity of VLMs.According to the characteristics of these VL tasks, we build different fully TTA pipelines with RLCF to improve the zero-shot generalization ability of various VLMs.Extensive experiments along with promisingempirical results demonstrate the effectiveness of RLCF.The code is available at https://github.com/mzhaoshuai/RLCF.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kIP0duasBb",
    "arxiv_id": "2305.18010",
    "GitHub": [
      "https://github.com/mzhaoshuai/RLCF"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18242,
    "title": "Object-Aware Inversion and Reassembly for Image Editing",
    "authors": [
      "Zhen Yang",
      "Ganggui Ding",
      "Wen Wang",
      "Hao Chen",
      "Bohan Zhuang",
      "Chunhua Shen"
    ],
    "abstract": "Diffusion-based image editing methods have achieved remarkable advances in text-driven image editing. The editing task aims to edit an input image with the original prompt to the desired image aligned with the target prompt. By comparing the original and target prompts, we can obtain numerous editing pairs, each comprising an object and its corresponding editing target. To allow editability while maintaining fidelity to the input image, existing editing methods typically involve a fixed number of inversion steps that project the whole input image to its noisier latent representation, followed by a denoising process guided by the target prompt. However, we find that the optimal number of inversion steps for achieving ideal editing results varies significantly among different editing pairs, owing to varying editing difficulties. Therefore, the current literature, which relies on a fixed number of inversion steps, produces suboptimal generation quality, especially when handling multiple editing pairs in a natural image.To this end, we propose a new image editing paradigm, dubbed Object-aware Inversion and Reassembly (OIR), to enable object-level fine-grained editing. Specifically, we design a new search metric, which determines the optimal inversion step for each editing pair, by jointly considering the editability of the target and the fidelity of the non-editing region. When editing an image, we first search the optimal inversion step for each editing pair with our search metric and edit them separately to circumvent concept mismatch. Subsequently, we propose an additional reassembly step to seamlessly integrate the respective editing results and the non-editing region to obtain the final edited image. To systematically evaluate the effectiveness of our method, we collect two datasets for benchmarking single- and multi-object editing, respectively. Experiments demonstrate that our method achieves superior performance in editing object shapes, colors, materials, categories, etc., especially in multi-object editing scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dpcVXiMlcv",
    "arxiv_id": "2310.12149",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17983,
    "title": "Reverse Diffusion Monte Carlo",
    "authors": [
      "Xunpeng Huang",
      "Hanze Dong",
      "Yifan HAO",
      "Yian Ma",
      "Tong Zhang"
    ],
    "abstract": "The efficacy of modern generative models is commonly contingent upon the precision of score estimation along the diffusion path, with a focus on diffusion models and their ability to generate high-quality data samples. This study delves into the application of reverse diffusion to Monte Carlo sampling. It is shown that score estimation can be transformed into a mean estimation problem via the decomposition of the transition kernel. By estimating the mean of the posterior distribution, we derive a novel Monte Carlo sampling algorithm from the reverse diffusion process, which is distinct from traditional Markov Chain Monte Carlo (MCMC) methods. We calculate the error requirements and sample size for the posterior distribution, and use the result to derive an algorithm that can approximate the target distribution to any desired accuracy. Additionally, by estimating the log-Sobolev constant of the posterior distribution, we show under suitable conditions the problem of sampling from the posterior can be easier than direct sampling from the target distribution using traditional MCMC techniques. For Gaussian mixture models, we demonstrate that the new algorithm achieves significant improvement over the traditional Langevin-style MCMC sampling methods both theoretically and practically. Our algorithm offers a new perspective and solution beyond classical MCMC algorithms for challenging complex distributions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kIPEyMSdFV",
    "arxiv_id": "2307.02037",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17981,
    "title": "Towards Aligned Layout Generation via Diffusion Model with Aesthetic Constraints",
    "authors": [
      "Jian Chen",
      "Ruiyi Zhang",
      "Yufan Zhou",
      "Changyou Chen"
    ],
    "abstract": "Controllable layout generation refers to the process of creating a plausible visual arrangement of elements within a graphic design (*e.g.*, document and web designs) with constraints representing design intentions. Although recent diffusion-based models have achieved state-of-the-art FID scores, they tend to exhibit more pronounced misalignment compared to earlier transformer-based models. In this work, we propose the **LA**yout **C**onstraint diffusion mod**E**l (LACE), a unified model to handle a broad range of layout generation tasks, such as arranging elements with specified attributes and refining or completing a coarse layout design. The model is based on continuous diffusion models. Compared with existing methods that use discrete diffusion models, continuous state-space design can enable the incorporation of continuous aesthetic constraint functions in training more naturally. For conditional generation, we propose injecting layout conditions in the form of masks or gradient guidance during inference. Empirical results show that LACE produces high-quality layouts and outperforms existing state-of-the-art baselines. We will release our source code and model checkpoints.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kJ0qp9Xdsh",
    "arxiv_id": "2402.04754",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17979,
    "title": "ASMR: Activation-Sharing Multi-Resolution Coordinate Networks for Efficient Inference",
    "authors": [
      "Jason Chun Lok Li",
      "Steven Tin Sui Luo",
      "Le Xu",
      "Ngai Wong"
    ],
    "abstract": "Coordinate network or implicit neural representation (INR) is a fast-emerging method for encoding natural signals (such as images and videos) with the benefits of a compact neural representation. While numerous methods have been proposed to increase the encoding capabilities of an INR, an often overlooked aspect is the inference efficiency, usually measured in multiply-accumulate (MAC) count. This is particularly critical in use cases where inference bandwidth is greatly limited by hardware constraints. To this end, we propose the Activation-Sharing Multi-Resolution (ASMR) coordinate network that combines multi-resolution coordinate decomposition with hierarchical modulations. Specifically, an ASMR model enables the sharing of activations across grids of the data. This largely decouples its inference cost from its depth which is directly correlated to its reconstruction capability, and renders a near $O(1)$ inference complexity irrespective of the number of layers. Experiments show that ASMR can reduce the MAC of a vanilla SIREN model by up to 350$\\times$ while achieving an even higher reconstruction quality than its SIREN baseline.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kMp8zCsXNb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17978,
    "title": "What's in a Prior? Learned Proximal Networks for Inverse Problems",
    "authors": [
      "Zhenghan Fang",
      "Sam Buchanan",
      "Jeremias Sulam"
    ],
    "abstract": "Proximal operators are ubiquitous in inverse problems, commonly appearing as part of algorithmic strategies to regularize problems that are otherwise ill-posed. Modern deep learning models have been brought to bear for these tasks too, as in the framework of plug-and-play or deep unrolling, where they loosely resemble proximal operators. Yet, these do not provide any guarantee that these general functions, implemented by neural networks, provide a proximal operator of some function, nor do they provide any characterization of the function of which they provide some approximate proximal. Herein we provide a framework to develop learned proximal networks (LPN), which provide exact proximal operators for a data-driven regularizer, and show how a new training strategy, dubbed proximal matching, guarantees that the obtained regularizer recovers the log-prior of the true data distribution. Thus, such LPN provide general, unsupervised, proximal operators that can be used for general inverse problems. We illustrate our results in a series of cases of increasing complexity. demonstrating that these models not only result in state-of-the-art restoration results, but provide a window into the resulting priors learned from data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kNPcOaqC5r",
    "arxiv_id": "2310.14344",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17975,
    "title": "Dynamic Sparse Training with Structured Sparsity",
    "authors": [
      "Mike Lasby",
      "Anna Golubeva",
      "Utku Evci",
      "Mihai Nica",
      "Yani Ioannou"
    ],
    "abstract": "Dynamic Sparse Training (DST) methods achieve state-of-the-art results in sparse neural network training, matching the generalization of dense models while enabling sparse training and inference. Although the resulting models are highly sparse and theoretically less computationally expensive, achieving speedups with unstructured sparsity on real-world hardware is challenging. In this work, we propose a sparse-to-sparse DST method, Structured RigL (SRigL), to learn a variant of fine-grained structured N:M sparsity by imposing a constant fan-in constraint. Using our empirical analysis of existing DST methods at high sparsity, we additionally employ a neuron ablation method which enables SRigL to achieve state-of-the-art sparse-to-sparse structured DST performance on a variety of Neural Network (NN) architectures. Using a 90% sparse linear layer, we demonstrate a real-world acceleration of 3.4\u00d7/2.5\u00d7 on CPU for online inference and 1.7\u00d7/13.0\u00d7 on GPU for inference with a batch size of 256 when compared to equivalent dense/unstructured (CSR) sparse layers, respectively.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kOBkxFRKTA",
    "arxiv_id": "2305.02299",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17974,
    "title": "Neuron-Enhanced AutoEncoder Matrix Completion and Collaborative Filtering: Theory and Practice",
    "authors": [
      "Jicong Fan",
      "Rui Chen",
      "Zhao Zhang",
      "Chris Ding"
    ],
    "abstract": "Neural networks have shown promising performance in collaborative filtering and matrix completion but the theoretical analysis is limited and there is still room for improvement in terms of the accuracy of recovering missing values. This paper presents a neuron-enhanced autoencoder matrix completion (AEMC-NE) method and applies it to collaborative filtering. Our AEMC-NE adds an element-wise autoencoder to each output of the main autoencoder to enhance the reconstruction capability. Thus it can adaptively learn an activation function for the output layer to approximate possibly complicated response functions in real data. We provide theoretical analysis for AEMC-NE as well as AEMC to investigate the generalization ability of autoencoder and deep learning in matrix completion, considering both missing completely at random and missing not at random. We show that the element-wise neural network has the potential to reduce the generalization error bound, the data sparsity can be useful, and the prediction performance is closely related to the difference between the numbers of variables and samples. The numerical results on synthetic data and benchmark datasets demonstrated the effectiveness of AEMC-NE in comparison to many baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kPrxk6tUcg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17973,
    "title": "SF(DA)$^2$: Source-free Domain Adaptation Through the Lens of Data Augmentation",
    "authors": [
      "Uiwon Hwang",
      "Jonghyun Lee",
      "Juhyeon Shin",
      "Sungroh Yoon"
    ],
    "abstract": "In the face of the deep learning model's vulnerability to domain shift, source-free domain adaptation (SFDA) methods have been proposed to adapt models to new, unseen target domains without requiring access to source domain data. Although the potential benefits of applying data augmentation to SFDA are attractive, several challenges arise such as the dependence on prior knowledge of class-preserving transformations and the increase in memory and computational requirements. In this paper, we propose Source-free Domain Adaptation Through the Lens of Data Augmentation (SF(DA)$^2$), a novel approach that leverages the benefits of data augmentation without suffering from these challenges. We construct an augmentation graph in the feature space of the pretrained model using the neighbor relationships between target features and propose spectral neighborhood clustering to identify partitions in the prediction space. Furthermore, we propose implicit feature augmentation and feature disentanglement as regularization loss functions that effectively utilize class semantic information within the feature space. These regularizers simulate the inclusion of an unlimited number of augmented target features into the augmentation graph while minimizing computational and memory demands. Our method shows superior adaptation performance in SFDA scenarios, including 2D image and 3D point cloud datasets and a highly imbalanced dataset.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kUCgHbmO11",
    "arxiv_id": "2403.10834",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17972,
    "title": "Multi-resolution HuBERT: Multi-resolution Speech Self-Supervised Learning with Masked Unit Prediction",
    "authors": [
      "Jiatong Shi",
      "Hirofumi Inaguma",
      "Xutai Ma",
      "Ilia Kulikov",
      "Anna Sun"
    ],
    "abstract": "Existing Self-Supervised Learning (SSL) models for speech typically process speech signals at a fixed resolution of 20 milliseconds. This approach overlooks the varying informational content present at different resolutions in speech signals. In contrast, this paper aims to incorporate multi-resolution information into speech self-supervised representation learning. We introduce a SSL model that leverages a hierarchical Transformer architecture, complemented by HuBERT-style masked prediction objectives, to process speech at multiple resolutions. Experimental results indicate that the proposed model not only achieves more efficient inference but also exhibits superior or comparable performance to the original HuBERT model over various tasks. Specifically, significant performance improvements over the original HuBERT have been observed in fine-tuning experiments on the LibriSpeech speech recognition benchmark as well as in evaluations using the Speech Universal PERformance Benchmark (SUPERB) and Multilingual SUPERB (ML-SUPERB).",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=kUuKFW7DIF",
    "arxiv_id": "2310.02720",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18222,
    "title": "Neural Fourier Transform: A General Approach to Equivariant Representation Learning",
    "authors": [
      "Masanori Koyama",
      "Kenji Fukumizu",
      "Kohei Hayashi",
      "Takeru Miyato"
    ],
    "abstract": "Symmetry learning has proven to be an effective approach for extracting the hidden structure of data, with the concept of equivariance relation playing the central role. However, most of the current studies are built on architectural theory and corresponding assumptions on the form of data. We propose Neural Fourier Transform (NFT), a general framework of learning the latent linear action of the group without assuming explicit knowledge of how the group acts on data.We present the theoretical foundations of NFT and show that the existence of a linear equivariant feature, which has been assumed ubiquitously in equivariance learning, is equivalent to the existence of a group invariant kernel on the dataspace. We also provide experimental results to demonstrate the application of NFT in typical scenarios with varying levels of knowledge about the acting group.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eOCvA8iwXH",
    "arxiv_id": "2305.18484",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17970,
    "title": "Simple Hierarchical Planning with Diffusion",
    "authors": [
      "Chang Chen",
      "Fei Deng",
      "Kenji Kawaguchi",
      "Caglar Gulcehre",
      "Sungjin Ahn"
    ],
    "abstract": "Diffusion-based generative methods have proven effective in modeling trajectories with offline datasets. However, they often face computational challenges and can falter in generalization, especially in capturing temporal abstractions for long-horizon tasks. To overcome this, we introduce the Hierarchical Diffuser, a simple, fast, yet effective planning method combining the advantages of hierarchical and diffusion-based planning. Our model adopts a \u201cjumpy\u201d planning strategy at the high level, which allows it to have a larger receptive field but at a lower computational cost\u2014a crucial factor for diffusion-based planning methods, as we have empirically verified. Additionally, the jumpy sub-goals guide our low-level planner, facilitating a fine-tuning stage and further improving our approach\u2019s effectiveness. We conducted empirical evaluations on standard offline reinforcement learning benchmarks, demonstrating our method\u2019s superior performance and efficiency in terms of training and planning speed compared to the non-hierarchical Diffuser as well as other hierarchical planning methods. Moreover, we explore our model\u2019s generalization capability, particularly on how our method improves generalization capabilities on compositional out-of-distribution tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kXHEBK9uAY",
    "arxiv_id": "2401.02644",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17969,
    "title": "Accelerated Sampling with Stacked Restricted Boltzmann Machines",
    "authors": [
      "Jorge Fernandez-de-Cossio-Diaz",
      "Cl\u00e9ment Roussel",
      "Simona Cocco",
      "Remi Monasson"
    ],
    "abstract": "Sampling complex distributions is an important but difficult objective in various fields, including physics, chemistry, and statistics. An improvement of standard Monte Carlo (MC) methods, intensively used in particular in the context of disordered systems, is Parallel Tempering, also called replica exchange MC, in which a sequence of MC Markov chains at decreasing temperatures are run in parallel and can swap their configurations. In this work we apply the ideas of parallel tempering in the context of restricted Boltzmann machines (RBM), a paradigm of unsupervised architectures, capable to learn complex, multimodal distributions. Inspired by Deep Tempering, an approach introduced for deep belief networks, we  show how to learn on top of the first RBM a stack of nested RBMs, using the representations of a RBM as \u2019data\u2019 for the next one along the stack. In our Stacked Tempering approach the hidden configurations of a machine can be exchanged with the visible configurations of the next one in the stack. Replica exchanges between the different RBMs is facilitated by the increasingly clustered representations learnt by deeper RBMs, allowing for fast transitions between the different modes of the data distribution. Analytical calculations of mixing times in a simplified theoretical setting shed light on why Stacked Tempering works, and how hyperparameters, such as the aspect ratios of the RBMs and weight regularization should be chosen. We illustrate the efficiency of the Stacked Tempering method with respect to standard and replica exchange MC on several datasets: MNIST, in-silico Lattice Proteins, and the 2D-Ising model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kXNJ48Hvw1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17968,
    "title": "Large Language Models as Automated Aligners for  benchmarking  Vision-Language Models",
    "authors": [
      "Yuanfeng Ji",
      "Chongjian GE",
      "Weikai Kong",
      "Enze Xie",
      "Zhengying Liu",
      "Zhenguo Li",
      "Ping Luo"
    ],
    "abstract": "With the advancements in Large Language Models (LLMs), Vision-Language Models (VLMs) have reached a new level of sophistication, showing notable competence in executing intricate cognition and reasoning tasks. However, existing evaluation benchmarks, primarily relying on rigid, hand-crafted datasets to measure task-specific performance, face significant limitations in assessing the alignment of these increasingly anthropomorphic models with human intelligence. In this work, we address the limitations via Auto-Bench, which delves into exploring LLMs as proficient aligners, measuring the alignment between VLMs and human intelligence and value through automatic data curation and assessment. Specifically, for data curation, Auto-Bench utilizes LLMs (e.g., GPT-4) to automatically generate a vast set of question-answer-reasoning triplets via prompting on visual symbolic representations (e.g., captions, object locations, instance relationships, and etc. The curated data closely matches human intent, owing to the extensive world knowledge embedded in LLMs. Through this pipeline, a total of 28.5K human-verified and 3,504K unfiltered question-answer-reasoning triplets have been curated, covering 4 primary abilities and 16 sub-abilities. We subsequently engage LLMs like GPT-3.5 to serve as judges, implementing the quantitative and qualitative automated assessments to facilitate a comprehensive evaluation of VLMs. Our validation results reveal that LLMs are proficient in both evaluation data curation and model assessment, achieving an average agreement rate of 85%. We envision Auto-Bench as a flexible, scalable, and comprehensive benchmark for evaluating the evolving sophisticated VLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kZEXgtMNNo",
    "arxiv_id": "2311.14580",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18199,
    "title": "LiDAR: Sensing Linear Probing Performance in Joint Embedding SSL Architectures",
    "authors": [
      "Vimal Thilak",
      "Chen Huang",
      "Omid Saremi",
      "Laurent Dinh",
      "Hanlin Goh",
      "Preetum Nakkiran",
      "Joshua M. Susskind",
      "Etai Littwin"
    ],
    "abstract": "Joint embedding (JE) architectures have emerged as a promising avenue for ac-quiring transferable data representations. A key obstacle to using JE methods,however, is the inherent challenge of evaluating learned representations withoutaccess to a downstream task, and an annotated dataset. Without efficient and re-liable evaluation, it is difficult to iterate on architectural and training choices forJE methods. In this paper, we introduce LiDAR (Linear Discriminant AnalysisRank), a metric designed to measure the quality of representations within JE archi-tectures. Our metric addresses several shortcomings of recent approaches basedon feature covariance rank by discriminating between informative and uninforma-tive features. In essence, LiDAR quantifies the rank of the Linear DiscriminantAnalysis (LDA) matrix associated with the surrogate SSL task\u2014a measure thatintuitively captures the information content as it pertains to solving the SSL task.We empirically demonstrate that LiDAR significantly surpasses naive rank basedapproaches in its predictive power of optimal hyperparameters. Our proposed cri-terion presents a more robust and intuitive means of assessing the quality of rep-resentations within JE architectures, which we hope facilitates broader adoptionof these powerful techniques in various domains.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=f3g5XpL9Kb",
    "arxiv_id": "2312.04000",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18197,
    "title": "Project and Probe: Sample-Efficient Adaptation by Interpolating Orthogonal Features",
    "authors": [
      "Annie S Chen",
      "Yoonho Lee",
      "Amrith Setlur",
      "Sergey Levine",
      "Chelsea Finn"
    ],
    "abstract": "Transfer learning with a small amount of target data is an effective and common approach to adapting a pre-trained model to distribution shifts. In some situations, target data labels may be expensive to obtain, so we may only have access to a limited number of target data points. To make the most of a very small target dataset, we propose a lightweight, sample-efficient approach that learns a diverse set of features and adapts to a target distribution by interpolating these features. Our approach, Project and Probe (Pro$^2$), first learns a linear projection that maps a pre-trained embedding onto orthogonal directions while being predictive of labels in the source dataset. The goal of this step is to learn a variety of predictive features, so that at least some of them remain useful after distribution shift. Pro$^2$ then learns a linear classifier on top of these projected features using a small target dataset. Theoretically, we find that Pro$^2$ results in more sample-efficient generalization by inducing a favorable bias-variance tradeoff. Our experiments on four datasets, with multiple distribution shift settings for each, show that Pro$^2$ improves performance by 5-15% when given limited target data compared to prior methods such as standard linear probing.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=f6CBQYxXvr",
    "arxiv_id": "2302.05441",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17740,
    "title": "Protein-Ligand Interaction Prior for Binding-aware 3D Molecule Diffusion Models",
    "authors": [
      "Zhilin Huang",
      "Ling Yang",
      "Xiangxin Zhou",
      "Zhilong Zhang",
      "Wentao Zhang",
      "Xiawu Zheng",
      "Jie Chen",
      "Yu Wang",
      "Bin CUI",
      "Wenming Yang"
    ],
    "abstract": "Generating 3D ligand molecules that bind to specific protein targets via diffusion models has shown great promise for structure-based drug design. The key idea is to disrupt molecules into noise through a fixed forward process and learn its reverse process to generate molecules from noise in a denoising way. However, existing diffusion models primarily focus on incorporating protein-ligand interaction information solely in the reverse process, and neglect the interactions in the forward process. The inconsistency between forward and reverse processes may impair the binding affinity of generated molecules towards target protein. In this paper, we propose a novel Interaction Prior-guided Diffusion model (IPDiff) for the protein-specific 3D molecular generation by introducing geometric protein-ligand interactions into both diffusion and sampling process. Specifically, we begin by pretraining a protein-ligand interaction prior network (IPNet) by utilizing the binding affinity signals as supervision. Subsequently, we leverage the pretrained prior network to (1) integrate interactions between the target protein and the molecular ligand into the forward process for adapting the molecule diffusion trajectories (prior-shifting), and (2) enhance the binding-aware molecule sampling process (prior-conditioning). Empirical studies on CrossDocked2020 dataset show IPDiff can generate molecules with more realistic 3D structures and state-of-the-art binding affinities towards the protein targets, with up to -6.42 Avg. Vina Score, while maintaining proper molecular properties.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qH9nrMNTIW",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17966,
    "title": "FedDA: Faster Adaptive Gradient Methods for Federated Constrained Optimization",
    "authors": [
      "Junyi Li",
      "Feihu Huang",
      "Heng Huang"
    ],
    "abstract": "Federated learning (FL) is an emerging learning paradigm in which a set of distributed clients learns a task under the coordination of a central server. The FedAvg algorithm is one of the most widely used methods to solve FL problems. In FedAvg, the learning rate is a constant rather than changing adaptively. Adaptive gradient methods have demonstrated superior performance over the constant learning rate schedules in non-distributed settings, and they have recently been adapted to FL. However, the majority of these methods are designed for unconstrained settings. Meanwhile, many crucial FL applications, like disease diagnosis and biomarker identification, often rely on constrained formulations such as Lasso and group Lasso. It remains an open question as to whether adaptive gradient methods can be effectively applied to FL problems with constrains. In this work, we introduce \\textbf{FedDA}, a novel adaptive gradient framework for FL. This framework utilizes a restarted dual averaging technique and is compatible with a range of gradient estimation methods and adaptive learning rate schedules.  Specifically, an instantiation of our framework \\textbf{FedDA-MVR} achieves gradient complexity $\\tilde{O}(K^{-1}\\epsilon^{-1.5})$ and communication complexity $\\tilde{O}(K^{-0.25}\\epsilon^{-1.25})$ for finding a stationary point $\\epsilon$ in the constrained setting. We conduct experiments over both constrained and unconstrained tasks to confirm the effectiveness of our approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kjn99xFUF3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17965,
    "title": "Local Composite Saddle Point Optimization",
    "authors": [
      "Site Bai",
      "Brian Bullins"
    ],
    "abstract": "Distributed optimization (DO) approaches for saddle point problems (SPP) have recently gained in popularity due to the critical role they play in machine learning (ML). Existing works mostly target smooth unconstrained objectives in Euclidean space, whereas ML problems often involve constraints or non-smooth regularization, which results in a need for composite optimization. Moreover, although non-smooth regularization often serves to induce structure (e.g., sparsity), standard aggregation schemes in distributed optimization break this structure. Addressing these issues, we propose Federated Dual Extrapolation (FeDualEx), an extra-step primal-dual algorithm with local updates, which is the first of its kind to encompass both saddle point optimization and composite objectives under the distributed paradigm. Using a generalized notion of Bregman divergence, we analyze its convergence and communication complexity in the homogeneous setting. Furthermore, the empirical evaluation demonstrates the effectiveness of FeDualEx for inducing structure in these challenging settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kklwv4c4dI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17964,
    "title": "Beyond Memorization: Violating Privacy via Inference with Large Language Models",
    "authors": [
      "Robin Staab",
      "Mark Vero",
      "Mislav Balunovic",
      "Martin Vechev"
    ],
    "abstract": "Current privacy research on large language models (LLMs) primarily focuses on the issue of extracting memorized training data. At the same time, models\u2019 inference capabilities have increased drastically. This raises the key question of whether current LLMs could violate individuals\u2019 privacy by inferring personal attributes from text given at inference time. In this work, we present the first comprehensive study on the capabilities of pretrained LLMs to infer personal attributes from text. We construct a dataset consisting of real Reddit profiles, and show that current LLMs can infer a wide range of personal attributes (e.g., location, income, sex), achieving up to 85% top-1 and 95.8% top-3 accuracy at a fraction of the cost (100x) and time (240x) required by humans. As people increasingly interact with LLM-powered chatbots across all aspects of life, we also explore the emerging threat of privacy-invasive chatbots trying to extract personal information through seemingly benign questions. Finally, we show that common mitigations, i.e., text anonymization and model alignment, are currently ineffective at protecting user privacy against LLM inference. Our findings highlight that current LLMs can infer personal data at a previously unattainable scale. In the absence of working defenses, we advocate for a broader discussion around LLM privacy implications beyond memorization, striving for stronger and wider privacy protection.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=kmn0BhQk7p",
    "arxiv_id": "2310.07298",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17961,
    "title": "Text-to-3D with Classifier Score Distillation",
    "authors": [
      "Xin Yu",
      "Yuan-Chen Guo",
      "Yangguang Li",
      "Ding Liang",
      "Song-Hai Zhang",
      "XIAOJUAN QI"
    ],
    "abstract": "Text-to-3D generation has made remarkable progress recently, particularly with methods based on Score Distillation Sampling (SDS) that leverages pre-trained 2D diffusion models. While the usage of classifier-free guidance is well acknowledged to be crucial for successful optimization, it is considered an auxiliary trick rather than the most essential component. In this paper, we re-evaluate the role of classifier-free guidance in score distillation and discover a surprising finding: the guidance alone is enough for effective text-to-3D generation tasks. We name this method Classifier Score Distillation (CSD), which can be interpreted as using an implicit classification model for generation. This new perspective reveals new insights for understanding existing techniques. We validate the effectiveness of CSD across a variety of text-to-3D tasks including shape generation, texture synthesis, and shape editing, achieving results superior to those of state-of-the-art methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ktG8Tun1Cy",
    "arxiv_id": "2310.19415",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17962,
    "title": "Hiding in Plain Sight: Disguising Data Stealing Attacks in Federated Learning",
    "authors": [
      "Kostadin Garov",
      "Dimitar Iliev Dimitrov",
      "Nikola Jovanovi\u0107",
      "Martin Vechev"
    ],
    "abstract": "Malicious server (MS) attacks have enabled the scaling of data stealing in federated learning to large batch sizes and secure aggregation, settings previously considered private. However, many concerns regarding the client-side detectability of MS attacks were raised, questioning their practicality. In this work, for the first time, we thoroughly study client-side detectability. We first demonstrate that all prior MS attacks are detectable by principled checks, and formulate a necessary set of requirements that a practical MS attack must satisfy. Next, we propose SEER, a novel attack framework that satisfies these requirements. The key insight of SEER is the use of a secret decoder, jointly trained with the shared model. We show that SEER can steal user data from gradients of realistic networks, even for large batch sizes of up to 512 and under secure aggregation. Our work is a promising step towards assessing the true vulnerability of federated learning in real-world settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=krx55l2A6G",
    "arxiv_id": "2306.03013",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18186,
    "title": "Align With Purpose: Optimize Desired Properties in CTC Models with a General Plug-and-Play Framework",
    "authors": [
      "Eliya Segev",
      "Maya Alroy",
      "Ronen Katsir",
      "Noam Wies",
      "Ayana Shenhav",
      "Yael Sapir Ben-Oren",
      "David Zar",
      "Oren Tadmor",
      "Jacob Bitterman",
      "Amnon Shashua",
      "Tal Rosenwein"
    ],
    "abstract": "Connectionist Temporal Classification (CTC) is a widely used criterion for training supervised sequence-to-sequence (seq2seq) models. It learns the alignments between the input and output sequences, by marginalizing over the perfect alignments (that yield the ground truth), at the expense of the imperfect ones. This dichotomy, and in particular the equal treatment of all perfect alignments, results in a lack of controllability over the predicted alignments. This controllability is essential for capturing properties that hold significance in real-world applications.Here we propose Align With Purpose (AWP), a general Plug-and-Play framework for enhancing a desired property in models trained with the CTC criterion. We do that by complementing the CTC loss with an additional loss term that prioritizes alignments according to a desired property. AWP does not require any intervention in the CTC loss function, and allows to differentiate between both perfect and imperfect alignments for a variety of properties. We apply our framework in the domain of Automatic Speech Recognition (ASR) and show its generality in terms of property selection, architectural choice, and scale of training dataset (up to 280,000 hours). To demonstrate the effectiveness of our framework, we apply it to two unrelated properties: token emission time for latency optimization and word error rate (WER). For the former, we report an improvement of up to 590ms in latency optimization with a minor reduction in WER, and for the latter, we report a relative improvement of 4.5\\% in WER over the baseline models. To the best of our knowledge, these applications have never been demonstrated to work on this scale of data. Notably, our method can be easily implemented using only a few lines of code and can be extended to other alignment-free loss functions and to domains other than ASR.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fUGhVYPVRM",
    "arxiv_id": "2307.01715",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18179,
    "title": "From Posterior Sampling to Meaningful Diversity in Image Restoration",
    "authors": [
      "Noa Cohen",
      "Hila Manor",
      "Yuval Bahat",
      "Tomer Michaeli"
    ],
    "abstract": "Image restoration problems are typically ill-posed in the sense that each degraded image can be restored in infinitely many valid ways. To accommodate this, many works generate a diverse set of outputs by attempting to randomly sample from the posterior distribution of natural images given the degraded input. Here we argue that this strategy is commonly of limited practical value because of the heavy tail of the posterior distribution. Consider for example inpainting a missing region of the sky in an image. Since there is a high probability that the missing region contains no object but clouds, any set of samples from the posterior would be entirely dominated by (practically identical) completions of sky. However, arguably, presenting users with only one clear sky completion, along with several alternative solutions such as airships, birds, and balloons, would better outline the set of possibilities. In this paper, we initiate the study of **meaningfully diverse** image restoration. We explore several post-processing approaches that can be combined with any diverse image restoration method to yield semantically meaningful diversity. Moreover, we propose a practical approach for allowing diffusion based image restoration methods to generate meaningfully diverse outputs, while incurring only negligent computational overhead. We conduct extensive user studies to analyze the proposed techniques, and find the strategy of reducing similarity between outputs to be significantly favorable over posterior sampling.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ff2g30cZxj",
    "arxiv_id": "2310.16047",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17960,
    "title": "On Accelerating Diffusion-Based Sampling Processes via Improved Integration Approximation",
    "authors": [
      "Guoqiang Zhang",
      "Kenta Niwa",
      "W. Bastiaan Kleijn"
    ],
    "abstract": "A popular approach to sample a diffusion-based generative model is to solve an ordinary differential equation (ODE). In existing samplers, the coefficients of the ODE solvers are pre-determined by the ODE formulation, the reverse discrete timesteps, and the employed ODE methods. In this paper, we consider accelerating several popular ODE-based sampling processes (including EDM, DDIM, and DPM-Solver) by optimizing certain coefficients via improved integration approximation (IIA). We propose to minimize, for each time step, a mean squared error (MSE) function with respect to the selected coefficients.  The MSE is constructed by applying the original ODE solver for a set of fine-grained timesteps, which in principle provides a more accurate integration approximation in predicting the next diffusion state. The proposed IIA technique does not require any change of a pre-trained model, and only introduces a very small computational overhead for solving a number of quadratic optimization problems. Extensive experiments show that considerably better FID scores can be achieved by using IIA-EDM, IIA-DDIM, and IIA-DPM-Solver than the original counterparts when the neural function evaluation (NFE) is small (i.e., less than 25).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ktJAF3lxbi",
    "arxiv_id": "2304.11328",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18177,
    "title": "The Alignment Problem from a Deep Learning Perspective",
    "authors": [
      "Richard Ngo",
      "Lawrence Chan",
      "S\u00f6ren Mindermann"
    ],
    "abstract": "AI systems based on deep learning have reached or surpassed human performance in a range of narrow domains. In coming decades, artificial general intelligence (AGI) may surpass human capabilities at many critical tasks. In this position paper, we examine the technical difficulty of fine-tuning hypothetical AGI systems based on pretrained deep models to pursue goals that are aligned with human interests. We argue that, if trained like today's most capable models, AGI systems could learn to act deceptively to receive higher reward, learn internally-represented goals which generalize beyond their fine-tuning distributions, and pursue those goals using power-seeking strategies. We review emerging evidence for these properties. AGIs with these properties would be difficult to align and may appear aligned even when they are not.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fh8EYKFKns",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18165,
    "title": "Improving Generalization of Alignment with Human Preferences through Group Invariant Learning",
    "authors": [
      "Rui Zheng",
      "Wei Shen",
      "Yuan Hua",
      "Wenbin Lai",
      "Shihan Dou",
      "Yuhao Zhou",
      "Zhiheng Xi",
      "Xiao Wang",
      "Haoran Huang",
      "Tao Gui",
      "Qi Zhang",
      "Xuanjing Huang"
    ],
    "abstract": "The success of AI assistants based on language models (LLMs) hinges crucially on Reinforcement Learning from Human Feedback (RLHF), which enables the generation of responses more aligned with human preferences. As universal AI assistants, there's a growing expectation for them to perform consistently across various domains. However, previous work shows that Reinforcement Learning (RL) often exploits shortcuts to attain high rewards and overlooks challenging samples.This focus on quick reward gains undermines both the stability in training and the model's ability to generalize to new, unseen data.In this work, we propose a novel approach that can learn a consistent policy via RL across various data groups or domains. Given the challenges associated with acquiring group annotations, our method automatically classifies data into different groups, deliberately maximizing performance variance.Then, we optimize the policy to perform well on challenging groups. Lastly, leveraging the established groups, our approach adaptively adjusts the exploration space, allocating more learning capacity to more challenging data and preventing the model from over-optimizing on simpler data. Experimental results indicate that our approach significantly enhances training stability and model generalization.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=fwCoLe3TAX",
    "arxiv_id": "2310.11971",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18163,
    "title": "Global Optimality for Non-linear Constrained Restoration Problems via Invexity",
    "authors": [
      "Samuel Pinilla",
      "Jeyan Thiyagalingam"
    ],
    "abstract": "Signal restoration is an important constrained optimization problem with significant applications in various domains. Although non-convex constrained optimization problems have been shown to perform better than convex counterparts in terms of reconstruction quality, convex constrained optimization problems have been preferably for its global optima guarantees. Despite the success of non-convex methods in a large number of applications, it is not an overstatement to say that there is little or no hope for non-convex problems to ensure global optima. In this paper, for the first time, we develop invex constrained optimization theory to mitigate the loss of guarantees for global optima in non-convex constrained inverse problems, where the invex function is a mapping where any critical point is a global minimizer. We also develop relevant theories to extend the global optima guarantee to a set of quasi-invex functions - the largest optimizable mappings. More specifically, we propose a family of invex/quasi-invex of functions for handling constrained inverse problems using the non-convex setting along with guarantees for their global optima. Our experimental evaluation shows that the proposed approach is very promising and can aid in extending existing convex optimization algorithms, such as the alternating direction method of multipliers, and accelerated proximal gradient methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fyTPWfXtcc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17959,
    "title": "Towards image compression with perfect realism at ultra-low bitrates",
    "authors": [
      "Marlene Careil",
      "Matthew J. Muckley",
      "Jakob Verbeek",
      "St\u00e9phane Lathuili\u00e8re"
    ],
    "abstract": "Image codecs are typically optimized to trade-off bitrate vs. distortion metrics. At low bitrates, this leads to  compression artefacts which are easily perceptible, even  when training with  perceptual distortion metrics or adversarial losses. To improve image quality, and to make it less dependent on the bitrate, we propose to leverage diffusion models as a decoder module, which rely on an iterative decoding process instead of feed-forward decoders trained using MSE or LPIPS distortions used in most neural codecs. In addition to  conditioning the  model on a vector-quantized image representation, we also condition  on a global textual image description to provide additional context. We dub our model PerCo for ''perceptual compression'', and compare it to state-of-the-art codecs at bitrates from 0.1 down to  0.003 bits per pixel (bpp). The latter rate  is an order of magnitude smaller than those considered in most prior work. At this bitrate a 512x768 Kodak image is encoded in just 148 bytes. Despite this ultra-low bitrate, our approach maintains the ability to reconstruct realistic images. We find that our model leads to reconstructions with state-of-the-art visual quality as measured by FID and KID, and that the visual quality is less dependent on the bitrate than previous methods. Image codecs are typically optimized to trade-off bitrate vs. distortion metrics. At low bitrates, this leads to  compression artefacts which are easily perceptible, even  when training with  perceptual  or adversarial losses. To improve image quality, and to make it less dependent on the bitrate, we propose to decode with  iterative diffusion models, instead of feed-forward decoders trained using MSE or LPIPS distortions used in most neural codecs. In addition to  conditioning the  model on a vector-quantized image representation, we also condition on a global textual image description to provide additional context. We dub our model PerCo for ''perceptual compression'', and compare it to state-of-the-art codecs at rates from 0.1 down to  0.003 bits per pixel. The latter rate  is an order of magnitude smaller than those considered in most prior work. At this bitrate a 512x768 Kodak image is encoded in less than 153 bytes. Despite this ultra-low bitrate, our approach maintains the ability to reconstruct realistic images. We find that our model leads to reconstructions with state-of-the-art visual quality as measured by FID and KID, and that the visual quality is less dependent on the bitrate than previous methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ktdETU9JBg",
    "arxiv_id": "2310.10325",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18152,
    "title": "Efficient Backpropagation with Variance Controlled Adaptive Sampling",
    "authors": [
      "Ziteng Wang",
      "Jianfei Chen",
      "Jun Zhu"
    ],
    "abstract": "Sampling-based algorithms, which eliminate \"unimportant\" computations during forward and/or backpropagation (BP), offer potential solutions to accelerate neural network training. However, since sampling introduces approximations to training, such algorithms may not consistently maintain accuracy across various tasks. In this work, we introduce a variance-controlled adaptive sampling (VCAS) method designed to minimize the computational load of BP. VCAS computes an unbiased stochastic gradient with fine-grained layerwise importance sampling in data dimension for activation gradient calculation and leverage score sampling in token dimension for weight gradient calculation. To preserve accuracy, we control the additional variance introduced by learning the sample ratio jointly with model parameters during training. We assessed VCAS on multiple fine-tuning and pre-training tasks in both vision and natural language domains. On all the tasks, VCAS can preserve the original training loss trajectory and validation accuracy with an up to 73.87% FLOPs reduction of BP and 49.58% FLOPs reduction of the whole training process.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gEwKAZZmSw",
    "arxiv_id": "2402.17227",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17958,
    "title": "Continuous Field Reconstruction from Sparse Observations with Implicit Neural Networks",
    "authors": [
      "Xihaier Luo",
      "Wei Xu",
      "Balu Nadiga",
      "Yihui Ren",
      "Shinjae Yoo"
    ],
    "abstract": "Reliably reconstructing physical fields from sparse sensor data is a challenge that frequenty arises in many scientific domains. In practice, the process generating the data is often not known to sufficient accuracy. Therefore, there is a growing interest in the deep neural network route to the problem. In this work, we present a novel approach that learns a continuous representation of the field using implicit neural representations (INR). Specifically, after factorizing spatiotemporal variability into spatial and temporal components using the technique of separation of variables, the method learns relevant basis functions from sparsely sampled irregular data points to thus develop a continuous representation of the data. In experimental evaluations, the proposed model outperforms recent INR methods, offering superior reconstruction quality on simulation data from a state of the art climate model and on a second dataset that comprises of ultra-high resolution satellite-based sea surface temperature field.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kuTZMZdCPZ",
    "arxiv_id": "2401.11611",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18143,
    "title": "Safety-Tuned LLaMAs: Lessons From Improving the Safety of Large Language Models that Follow Instructions",
    "authors": [
      "Federico Bianchi",
      "Mirac Suzgun",
      "Giuseppe Attanasio",
      "Paul Rottger",
      "Dan Jurafsky",
      "Tatsunori Hashimoto",
      "James Zou"
    ],
    "abstract": "Training large language models to follow instructions makes them perform better on a wide range of tasks and generally become more helpful. However, a perfectly helpful model will follow even the most malicious instructions and readily generate harmful content.In this paper, we raise concerns over the safety of models that only emphasize helpfulness, not harmlessness, in their instruction-tuning.We show that several popular instruction-tuned models are highly unsafe. Moreover, we show that adding just 3\\% safety examples (a few hundred demonstrations) when fine-tuning a model like LLaMA can substantially improve its safety. Our safety-tuning does not make models significantly less capable or helpful as measured by standard benchmarks. However, we do find exaggerated safety behaviours, where too much safety-tuning makes models refuse perfectly safe prompts if they superficially resemble unsafe ones. As a whole, our results illustrate trade-offs in training LLMs to be helpful and training them to be safe.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gT5hALch9z",
    "arxiv_id": "2309.07875",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17957,
    "title": "JointNet: Extending Text-to-Image Diffusion for Dense Distribution Modeling",
    "authors": [
      "Jingyang Zhang",
      "Shiwei Li",
      "Yuanxun Lu",
      "Tian Fang",
      "David Neil McKinnon",
      "Yanghai Tsin",
      "Long Quan",
      "Yao Yao"
    ],
    "abstract": "We introduce JointNet, a novel neural network architecture for modeling the joint distribution of images and an additional dense modality (e.g., depth maps). JointNet is extended from a pre-trained text-to-image diffusion model, where a copy of the original network is created for the new dense modality branch and is densely connected with the RGB branch. The RGB branch is locked during network fine-tuning, which enables efficient learning of the new modality distribution while maintaining the strong generalization ability of the large-scale pre-trained diffusion model.We demonstrate the effectiveness of JointNet by using the RGB-D diffusion as an example and through extensive experiments, showcasing its applicability in a variety of applications, including joint RGB-D generation, dense depth prediction, depth-conditioned image generation, and high-resolution 3D panorama generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kv5xE1p3jz",
    "arxiv_id": "2310.06347",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17956,
    "title": "Estimating Shape Distances on Neural Representations with Limited Samples",
    "authors": [
      "Dean A Pospisil",
      "Brett W. Larsen",
      "Sarah E Harvey",
      "Alex H Williams"
    ],
    "abstract": "Measuring geometric similarity between high-dimensional network representations is a topic of longstanding interest to neuroscience and deep learning. Although many methods have been proposed, only a few works have rigorously analyzed their statistical efficiency or quantified estimator uncertainty in data-limited regimes. Here, we derive upper and lower bounds on the worst-case convergenceof standard estimators of shape distance\u2014a measure of representational dissimilarity proposed by Williams et al. (2021). These bounds reveal the challenging nature of the problem in high-dimensional feature spaces. To overcome these challenges, we introduce a novel method-of-moments estimator with a tunable bias-variance tradeoff parameterized by an upper bound on bias. We show that this estimator achieves superior performance to standard estimators in simulation and on neural data, particularly in high-dimensional settings. Our theoretical work and estimator thus respectively define and dramatically expand the scope of neural data for which geometric similarity can be accurately measured.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kvByNnMERu",
    "arxiv_id": "2310.05742",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17955,
    "title": "Successor Heads: Recurring, Interpretable Attention Heads In The Wild",
    "authors": [
      "Rhys Gould",
      "Euan Ong",
      "George Ogden",
      "Arthur Conmy"
    ],
    "abstract": "In this work we present successor heads: attention heads that increment tokens with a natural ordering, such as numbers, months, and days. For example, successor heads increment \u2018Monday\u2019 into \u2018Tuesday\u2019. We explain the successor head behavior with an approach rooted in mechanistic interpretability, the field that aims to explain how models complete tasks in human-understandable terms. Existing research in this area has found interpretable language model components in small toy models. However, results in toy models have not yet led to insights that explain the internals of frontier models and little is currently understood about the internal operations of large language models. In this paper, we analyze the behavior of successor heads in large language models (LLMs) and find that they implement abstract representations that are common to different architectures. They form in LLMs with as few as 31 million parameters, and at least as many as 12 billion parameters, such as GPT-2, Pythia, and Llama-2. We find a set of \u2018mod 10\u2019 features that underlie how successor heads increment in LLMs across different architectures and sizes. We perform vector arithmetic with these features to edit head behavior and provide insights into numeric representations within LLMs. Additionally, we study the behavior of successor heads on natural language data,identifying interpretable polysemanticity in a Pythia successor head.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kvcbV8KQsi",
    "arxiv_id": "2312.09230",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17954,
    "title": "Enhancing Contrastive Learning for Ordinal Regression via  Ordinal Content Preserved Data Augmentation",
    "authors": [
      "Jiyang Zheng",
      "Yu Yao",
      "Bo Han",
      "Dadong Wang",
      "Tongliang Liu"
    ],
    "abstract": "Contrastive learning, while highly effective for a lot of tasks, shows limited improvement in ordinal regression. We find that the limitation comes from the predefined strong data augmentations employed in contrastive learning.  Intuitively, for ordinal regression datasets, the discriminative information (ordinal content information) contained in instances is subtle. The strong augmentations can easily overshadow or diminish this ordinal content information. As a result, when contrastive learning is used to extract common features between weakly and strongly augmented images, the derived features often lack this essential ordinal content, rendering them less useful in training models for ordinal regression. To improve contrastive learning's utility for ordinal regression, we propose a novel augmentation method to replace the predefined strong argumentation based on the principle of \"minimal change\". Our method is designed in a generative manner that can effectively generate images with different styles but contains desired ordinal content information. Extensive experiments validate the effectiveness of our proposed method, which serves as a plug-and-play solution and consistently improves the performance of existing state-of-the-art methods in ordinal regression tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kx2XZlmgB1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18131,
    "title": "Can LLMs Keep a Secret? Testing  Privacy  Implications of Language Models  via Contextual Integrity Theory",
    "authors": [
      "Niloofar Mireshghallah",
      "Hyunwoo Kim",
      "Xuhui Zhou",
      "Yulia Tsvetkov",
      "Maarten Sap",
      "Reza Shokri",
      "Yejin Choi"
    ],
    "abstract": "Existing efforts on quantifying privacy implications for large language models (LLMs) solely focus on measuring leakage of training data. In this work, we shed light on the often-overlooked interactive settings where an LLM receives information from multiple sources and generates an output to be shared with other entities, creating the potential of exposing sensitive input data in inappropriate contexts. In these scenarios, humans nat- urally uphold privacy by choosing whether or not to disclose information depending on the context. We ask the question \u201cCan LLMs demonstrate an equivalent discernment and reasoning capability when considering privacy in context?\u201d We propose CONFAIDE, a benchmark grounded in the theory of contextual integrity and designed to identify critical weaknesses in the privacy reasoning capabilities of instruction-tuned LLMs. CONFAIDE consists of four tiers, gradually increasing in complexity, with the final tier evaluating contextual privacy reasoning and theory of mind capabilities. Our experiments show that even commercial models such as GPT-4 and ChatGPT reveal private information in contexts that humans would not, 39% and 57% of the time, respectively, highlighting the urgent need for a new direction of privacy-preserving approaches as we demonstrate a larger underlying problem stemmed in the models\u2019 lack of reasoning capabilities.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=gmg7t8b4s0",
    "arxiv_id": "2310.17884",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17952,
    "title": "COLLIE: Systematic Construction of Constrained Text Generation Tasks",
    "authors": [
      "Shunyu Yao",
      "Howard Chen",
      "Austin W. Hanjie",
      "Runzhe Yang",
      "Karthik R Narasimhan"
    ],
    "abstract": "Text generation under constraints have seen increasing interests in natural language processing, especially with the rapidly improving capabilities of large language models. However, existing benchmarks for constrained generation usually focus on fixed constraint types (e.g. generate a sentence containing certain words) that have proved to be easy for state-of-the-art models like GPT-4. We present COLLIE, a grammar-based framework that allows the specification of rich, compositional constraints with diverse generation levels (word, sentence, paragraph, passage) and modeling challenges (e.g. language understanding, logical reasoning, counting, semantic planning). We also develop tools for automatic extraction of task instances given a constraint structure and a raw text corpus. Using COLLIE, we compile the COLLIE-v1 dataset with 1,132 instances comprising 13 constraint structures. We perform systematic experiments across five state-of-the-art instruction-tuned language models and analyze their performances to reveal shortcomings. COLLIE is designed to be extensible and lightweight, and we hope the community finds it useful to develop more complex constraints and evaluations in the future.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kxgSlyirUZ",
    "arxiv_id": "2307.08689",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17951,
    "title": "Navigating the Design Space of Equivariant Diffusion-Based Generative Models for De Novo 3D Molecule Generation",
    "authors": [
      "Tuan Le",
      "Julian Cremer",
      "Frank Noe",
      "Djork-Arn\u00e9 Clevert",
      "Kristof T Sch\u00fctt"
    ],
    "abstract": "Deep generative diffusion models are a promising avenue for 3D $\\textit{de novo}$ molecular design in material science and drug discovery. However, their utility is still constrained by suboptimal performance with large molecular structures and limited training data. Addressing this gap, we explore the design space of E(3) equivariant diffusion models, focusing on previously blank spots. Our extensive comparative analysis evaluates the interplay between continuous and discrete state spaces. Out of this investigation, we introduce the EQGAT-diff model, which consistently surpasses the performance of established models on the QM9 and GEOM-Drugs datasets by a large margin.Distinctively, EQGAT-diff takes continuous atomic positions while chemical elements and bond types are categorical and employ a time-dependent loss weighting that significantly increases training convergence and the quality of generated samples.To further strengthen the applicability of diffusion models to limited training data, we examine the transferability of EQGAT-diff trained on the large PubChem3D dataset with implicit hydrogens to target distributions with explicit hydrogens. Fine-tuning EQGAT-diff for a couple of iterations further pushes state-of-the-art performance across datasets.We envision that our findings will find applications in structure-based drug design, where the accuracy of generative models for small datasets of complex molecules is critical.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kzGuiRXZrQ",
    "arxiv_id": "2309.17296",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17950,
    "title": "DV-3DLane: End-to-end Multi-modal 3D Lane Detection with Dual-view Representation",
    "authors": [
      "Yueru Luo",
      "Shuguang Cui",
      "Zhen Li"
    ],
    "abstract": "Accurate 3D lane estimation is pivotal for autonomous driving safety. However, prevalent monocular techniques suffer from depth loss and lighting variations, hampering accurate 3D lane detection. Conversely, LiDAR points offer geometric cues and enable precise localization. In this paper, we present DV-3DLane, a novel end-to-end Dual-View multi-modal 3D Lane detection framework that synergizes the strengths of both images and LiDAR points. Technically, we propose to learn multi-modal features in dual-view spaces, i.e., perspective view (PV) and bird's-eye-view (BEV), effectively tapping the modal-specific information. To achieve this, we propose three designs: 1) We design a bidirectional feature fusion strategy that integrates multi-modal features into each view space, exploiting the unique strengths of each space. 2) We propose a unified query generation approach that offers queries lane-aware prior knowledge from both views. 3) We introduce a 3D dual-view deformable attention mechanism, aggregating discriminative features from both PV and BEV into queries for accurate 3D lane detection. Extensive experiments on the public benchmark, OpenLane, demonstrate the efficacy and efficiency of DV-3DLane, i.e., it achieves state-of-the-art performance, with a remarkable 9.5 gain in F1 score and a substantial 49.8% reduction in errors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=l1U6sEgYkb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18124,
    "title": "ZeRO++: Extremely Efficient Collective Communication for Large Model Training",
    "authors": [
      "Guanhua Wang",
      "Heyang Qin",
      "Sam Ade Jacobs",
      "Xiaoxia Wu",
      "Connor Holmes",
      "Zhewei Yao",
      "Samyam Rajbhandari",
      "Olatunji Ruwase",
      "Feng Yan",
      "Lei Yang",
      "Yuxiong He"
    ],
    "abstract": "Zero Redundancy Optimizer (ZeRO) has been used to train a wide range of large language models on massive GPU clusters due to its ease of use, efficiency, and good scalability. However, when training on low-bandwidth clusters, and/or when small batch size per GPU is used, ZeRO\u2019s effective throughput is limited due to communication overheads. To alleviate this limitation, this paper introduces ZeRO++ composing of three communication volume reduction techniques (lowprecision all-gather, data remapping, and low-precision gradient averaging) to significantly reduce the communication volume up to 4x that enables up to 2.16x better throughput at 384 GPU scale. Our results also show ZeRO++ can speedup the RLHF by 3.3x compared to vanilla ZeRO. To verify the convergence of ZeRO++, we test up to 13B model for pretraining with 8/6-bits all gather and up to 30B model for finetuning with 4/2-bits all gather, and demonstrate on-par accuracy as original ZeRO (aka standard training). As a byproduct, the model trained with ZeRO++ is naturally weight-quantized, which can be directly used for inference without post-training quantization or quantization-aware training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gx2BT0a9MQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17949,
    "title": "A Poincar\u00e9 Inequality and Consistency Results for Signal Sampling on Large Graphs",
    "authors": [
      "Thien Le",
      "Luana Ruiz",
      "Stefanie Jegelka"
    ],
    "abstract": "Large-scale graph machine learning is challenging as the complexity of learning models scales with the graph size. Subsampling the graph is a viable alternative, but sampling on graphs is nontrivial as graphs are non-Euclidean. Existing graph sampling techniques require not only computing the spectra of large matrices but also repeating these computations when the graph changes, e.g., grows. In this paper, we introduce a signal sampling theory for a type of graph limit---the graphon. We prove a Poincar\u00e9 inequality for graphon signals and show that complements of node subsets satisfying this inequality are unique sampling sets for Paley-Wiener spaces of graphon signals. Exploiting connections with spectral clustering and Gaussian elimination, we prove that such sampling sets are consistent in the sense that unique sampling sets on a convergent graph sequence converge to unique sampling sets on the graphon. We then propose a related graphon signal sampling algorithm for large graphs, and demonstrate its good empirical performance on graph machine learning tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=l3qtSNsPvC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17945,
    "title": "Predicting Emergent Abilities with Infinite Resolution Evaluation",
    "authors": [
      "Shengding Hu",
      "Xin Liu",
      "Xu Han",
      "Xinrong Zhang",
      "Chaoqun He",
      "Weilin Zhao",
      "Yankai Lin",
      "Ning Ding",
      "Zebin Ou",
      "Guoyang Zeng",
      "Zhiyuan Liu",
      "Maosong Sun"
    ],
    "abstract": "The scientific scale-up of large language models (LLMs) necessitates a comprehensive understanding of their scaling properties. However, the existing literature on the scaling properties only yields an incomplete answer: optimization loss decreases predictably as the model size increases, in line with established scaling law; yet no scaling law for task has been established and the task performances are far from predictable during scaling. Task performances typically show minor gains on small models until they improve dramatically once models exceed a size threshold, exemplifying the \\`\\`emergent abilities''. In this study, we discover that small models, although they exhibit minor performance, demonstrate critical and consistent task performance improvements that are not captured by conventional evaluation strategies due to insufficient measurement resolution. To measure such improvements, we introduce \\textsc{PassUntil}, an evaluation strategy with theoretically infinite resolution, through massive sampling in the decoding phase. With \\textsc{PassUntil}, we conduct a quantitative investigation into the scaling law of task performance. The investigation contains two parts. Firstly, a strict \\textsl{task scaling law} that is not conventionally known to exist, is identified, enhancing the predictability of task performances. Remarkably, we are able to predict the performance of the 2.4B model on code generation with merely 0.05\\% deviation before training starts, which is the first systematic attempt to verify predictable scaling proposed by GPT-4's report. Secondly, underpinned by \\textsc{PassUntil}, we observe concrete evidence of emergent abilities and ascertain that they are not in conflict with the continuity of performance improvement. Their semblance to break-through is that their scaling curve cannot be fitted by standard scaling law function. We then introduce a mathematical definition for the emergent abilities. Through the definition, we refute a prevalent ``multi-step reasoning hypothesis'' regarding the genesis of emergent abilities and propose a new hypothesis with a satisfying fit to the observed scaling curve.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lDbjooxLkD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17946,
    "title": "Multi-Scale Representations by Varying Window Attention for Semantic Segmentation",
    "authors": [
      "Haotian Yan",
      "Ming Wu",
      "Chuang Zhang"
    ],
    "abstract": "Learning multi-scale representations is central to semantic segmentation. We visualize the effective receptive field (ERF) of canonical multi-scale representations and point out two risks in learning them: \\textit{scale inadequacy} and \\textit{field inactivation}. To address these issues, a novel multi-scale learner, \\textbf{varying window attention} (VWA), is presented. VWA leverages the local window attention (LWA) and disentangles LWA into the query window and context window, allowing the scale of context to vary for the query to learn representations at specific scales.  However, varying the context to large-scale windows (enlarging ratio $R$) can significantly increase the memory footprint and computation cost ($R^2$ times larger than LWA). We propose a simple but professional re-scaling strategy to zero the extra induced cost without compromising any performance.  In consequence, VWA shows great superiority to previous multi-scale learners. Furthermore, building upon VWA and employing various MLPs, we introduce a multi-scale decoder (MSD), \\textbf{VWFormer}, to improve learning multi-scale representations in semantic segmentation. VWFormer achieves efficiency competitive with the most compute-friendly MSDs, like FPN and MLP decoder, but performs much better than any MSDs. For instance, at little extra overhead, $\\sim 10$G FLOPs, VWFormer improves Mask2Former by $1.0\\%-1.3\\%$ mIoU.  Using only half of the computation, VWFormer outperforms the popular UperNet by $1.0\\%-2.1\\%$ mIoU.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lAhWGOkpSR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17944,
    "title": "Demonstration-Regularized RL",
    "authors": [
      "Daniil Tiapkin",
      "Denis Belomestny",
      "Daniele Calandriello",
      "Eric Moulines",
      "Alexey Naumov",
      "Pierre Perrault",
      "Michal Valko",
      "Pierre Menard"
    ],
    "abstract": "Incorporating expert demonstrations has empirically helped to improve the sample efficiency of reinforcement learning (RL). This paper quantifies theoretically to what extent this extra information reduces RL's sample complexity. Precisely, we study the demonstration-regularized reinforcement learning framework that leverages the expert demonstrations by $\\mathrm{KL}$-regularization for a policy learned by behavior cloning. Our findings reveal that utilizing $N^{\\mathrm{E}}$ expert demonstrations enables the identification of an optimal policy at a sample complexity of order $\\widetilde{\\mathcal{O}}(\\mathrm{Poly}(S,A,H)/(\\varepsilon^2 N^{\\mathrm{E}}))$ in finite and $\\widetilde{\\mathcal{O}}(\\mathrm{Poly}(d,H)/(\\varepsilon^2 N^{\\mathrm{E}}))$ in linear Markov decision processes, where $\\varepsilon$is the target precision, $H$ the horizon, $A$ the number of action, $S$ the number of states in the finite case and $d$ the dimension of the feature space in the linear case. As a by-product, we provide tight convergence guarantees for the behaviour cloning procedure under general assumptions on the policy classes. Additionally, we establish that demonstration-regularized methods are provably efficient for reinforcement learning from human feedback (RLHF). In this respect, we provide theoretical evidence showing the benefits of KL-regularization for RLHF  in tabular and linear MDPs. Interestingly, we avoid pessimism injection by employing computationally feasible regularization to handle reward estimation uncertainty, thus setting our approach apart from the prior works.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lF2aip4Scn",
    "arxiv_id": "2310.17303",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17941,
    "title": "Efficient ConvBN Blocks for Transfer Learning and Beyond",
    "authors": [
      "Kaichao You",
      "Guo Qin",
      "Anchang Bao",
      "Meng Cao",
      "Ping Huang",
      "Jiulong Shan",
      "Mingsheng Long"
    ],
    "abstract": "Convolution-BatchNorm (ConvBN) blocks are integral components in various computer vision tasks and other domains. A ConvBN block can operate in three modes: Train, Eval, and Deploy. While the Train mode is indispensable for training models from scratch, the Eval mode is suitable for transfer learning and beyond, and the Deploy mode is designed for the deployment of models. This paper focuses on the trade-off between stability and efficiency in ConvBN blocks: Deploy mode is efficient but suffers from training instability; Eval mode is widely used in transfer learning but lacks efficiency. To solve the dilemma, we theoretically reveal the reason behind the diminished training stability observed in the Deploy mode. Subsequently, we propose a novel Tune mode to bridge the gap between Eval mode and Deploy mode. The proposed Tune mode is as stable as Eval mode for transfer learning, and its computational efficiency closely matches that of the Deploy mode. Through extensive experiments in object detection, classification, and adversarial example generation across $5$ datasets and $12$ model architectures, we demonstrate that the proposed Tune mode retains the performance while significantly reducing GPU memory footprint and training time, thereby contributing efficient ConvBN blocks for transfer learning and beyond. Our method has been integrated into both PyTorch (general machine learning framework) and MMCV/MMEngine (computer vision framework). Practitioners just need one line of code to enjoy our efficient ConvBN blocks thanks to PyTorch's builtin machine learning compilers.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=lHZm9vNm5H",
    "arxiv_id": "2305.11624",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17942,
    "title": "Can we get the best of both Binary Neural Networks and Spiking Neural Networks for Efficient Computer Vision?",
    "authors": [
      "Gourav Datta",
      "Zeyu Liu",
      "Peter Anthony Beerel"
    ],
    "abstract": "Binary Neural networks (BNN) have emerged as an attractive computing paradigm for a wide range of low-power vision tasks. However, state-of-the-art (SOTA) BNNs do not yield any sparsity, and induce a significant number of non-binary operations. On the other hand, activation sparsity can be provided by spiking neural networks (SNN), that too have gained significant traction in recent times. Thanks to this sparsity, SNNs when implemented on neuromorphic hardware, have the potential to be significantly more power-efficient compared to traditional artifical neural networks (ANN). However, SNNs incur multiple time steps to achieve close to SOTA accuracy. Ironically, this increases latency and energy---costs that SNNs were proposed to reduce---and presents itself as a major hurdle in realizing SNNs\u2019 theoretical gains in practice. This raises an intriguing question: *Can we obtain SNN-like sparsity and BNN-like accuracy and enjoy the energy-efficiency benefits of both?* To answer this question, in this paper, we present a training framework for sparse binary activation neural networks (BANN) using a novel variant of the Hoyer regularizer. We estimate the threshold of each BANN layer as the Hoyer extremum of a clipped version of its activation map, where the clipping value is trained using gradient descent with our Hoyer regularizer. This approach shifts the activation values away from the threshold, thereby mitigating the effect of noise that can otherwise degrade the BANN accuracy. Our approach outperforms existing BNNs, SNNs, and adder neural networks (that also avoid energy-expensive multiplication operations similar to BNNs and SNNs) in terms of the accuracy-FLOPs trade-off for complex image recognition tasks. Downstream experiments on object detection further demonstrate the efficacy of our approach. Lastly, we demonstrate the portability of our approach to SNNs with multiple time steps. Codes are publicly available [here](https://github.com/godatta/Ultra-Low-Latency-SNN).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lGUyAuuTYZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17940,
    "title": "LightHGNN: Distilling Hypergraph Neural Networks into MLPs for 100x Faster Inference",
    "authors": [
      "Yifan Feng",
      "Yihe Luo",
      "Shihui Ying",
      "Yue Gao"
    ],
    "abstract": "Hypergraph Neural Networks (HGNNs) have recently attracted much attention and exhibited satisfactory performance due to their superiority in high-order correlation modeling. However, it is noticed that the high-order modeling capability of hypergraph also brings increased computation complexity, which hinders its practical industrial deployment.In practice, we find that one key barrier to the efficient deployment of HGNNs is the high-order structural dependencies during inference.In this paper, we propose to bridge the gap between the HGNNs and inference-efficient Multi-Layer Perceptron (MLPs) to eliminate the hypergraph dependency of HGNNs and thus reduce computational complexity as well as improve inference speed. Specifically, we introduce LightHGNN and LightHGNN$^+$ for fast inference with low complexity. LightHGNN directly distills the knowledge from teacher HGNNs to student MLPs via soft labels, and LightHGNN$^+$ further explicitly injects reliable high-order correlations into the student MLPs to achieve topology-aware distillation and resistance to over-smoothing.Experiments on eight hypergraph datasets demonstrate that even without hypergraph dependency, the proposed LightHGNNs can still achieve competitive or even better performance than HGNNs and outperform vanilla MLPs by $16.3$ on average. Extensive experiments on three graph datasets further show the average best performance of our LightHGNNs compared with all other methods.Experiments on synthetic hypergraphs with 5.5w vertices indicate LightHGNNs can run $100\\times$ faster than HGNNs, showcasing their ability for latency-sensitive deployments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lHasEfGsXL",
    "arxiv_id": "2402.04296",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17939,
    "title": "Context-Aware Meta-Learning",
    "authors": [
      "Christopher Fifty",
      "Dennis Duan",
      "Ronald Guenther Junkins",
      "Ehsan Amid",
      "Jure Leskovec",
      "Christopher Re",
      "Sebastian Thrun"
    ],
    "abstract": "Large Language Models like ChatGPT demonstrate a remarkable capacity to learn new concepts during inference without any fine-tuning. However, visual models trained to detect new objects during inference have been unable to replicate this ability, and instead either perform poorly or require meta-training and/or fine-tuning on similar objects. In this work, we propose a meta-learning algorithm that emulates Large Language Models by learning new visual concepts during inference without fine-tuning. Our approach leverages a frozen pre-trained feature extractor, and analogous to in-context learning, recasts meta-learning as sequence modeling over datapoints with known labels and a test datapoint with an unknown label. On 8 out of 11 meta-learning benchmarks, our approach---without meta-training or fine-tuning---exceeds or matches the state-of-the-art algorithm, P>M>F, which is meta-trained on these benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lJYAkDVnRU",
    "arxiv_id": "2310.10971",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18103,
    "title": "Adaptive Window Pruning for Efficient Local Motion Deblurring",
    "authors": [
      "Haoying Li",
      "Jixin Zhao",
      "Shangchen Zhou",
      "Huajun Feng",
      "Chongyi Li",
      "Chen Change Loy"
    ],
    "abstract": "Local motion blur commonly occurs in real-world photography due to the mixing between moving objects and stationary backgrounds during exposure. Existing image deblurring methods predominantly focus on global deblurring, inadvertently affecting the sharpness of backgrounds in locally blurred images and wasting unnecessary computation on sharp pixels, especially for high-resolution images.This paper aims to adaptively and efficiently restore high-resolution locally blurred images. We propose a local motion deblurring vision Transformer (LMD-ViT) built on adaptive window pruning Transformer blocks (AdaWPT). To focus deblurring on local regions and reduce computation, AdaWPT prunes unnecessary windows, only allowing the active windows to be involved in the deblurring processes. The pruning operation relies on the blurriness confidence predicted by a confidence predictor that is trained end-to-end using a reconstruction loss with Gumbel-Softmax re-parameterization and a pruning loss guided by annotated blur masks. Our method removes local motion blur effectively without distorting sharp regions, demonstrated by its exceptional perceptual and quantitative improvements (+0.28dB) compared to state-of-the-art methods. In addition, our approach substantially reduces FLOPs by 66% and achieves more than a twofold increase in inference speed compared to Transformer-based deblurring methods. We will make our code and annotated blur masks publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hI18CDyadM",
    "arxiv_id": "2306.14268",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17938,
    "title": "Pathformer: Multi-scale Transformers with Adaptive Pathways for Time Series Forecasting",
    "authors": [
      "Peng Chen",
      "Yingying ZHANG",
      "Yunyao Cheng",
      "Yang Shu",
      "Yihang Wang",
      "Qingsong Wen",
      "Bin Yang",
      "Chenjuan Guo"
    ],
    "abstract": "Transformer-based models have achieved significant success in time series forecasting. Existing methods mainly model time series from limited or fixed scales, making it challenging to capture different characteristics spanning various scales. In this paper, we propose multi-scale transformers with adaptive pathways (Pathformer). The proposed Transformer integrates both temporal resolution and temporal distance for multi-scale modeling. Multi-scale division divides the time series into different temporal resolutions using patches of various sizes. Based on the division of each scale, dual attention is performed over these patches to capture global correlations and local details as temporal dependencies. We further enrich the multi-scale transformer with adaptive pathways, which adaptively adjust the multi-scale modeling process based on the varying temporal dynamics in the input time series, improving the prediction accuracy and generalization of Pathformer. Extensive experiments on nine real-world datasets demonstrate that Pathformer not only achieves state-of-the-art performance by surpassing all current models but also exhibits stronger generalization abilities under various transfer scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lJkOCMP2aW",
    "arxiv_id": "2402.05956",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17937,
    "title": "Bridging Vision and Language Spaces with Assignment Prediction",
    "authors": [
      "Jungin Park",
      "Jiyoung Lee",
      "Kwanghoon Sohn"
    ],
    "abstract": "While pretrained large language models (LLMs) excel in understanding linguistic contexts, it is still an open question: Can LLMs extend their capabilities beyond linguistic contexts to non-linguistic information? This paper introduces VLAP, a novel approach that bridges vision encoders and language models through assignment prediction. Since the LLMs interpret and reason linguistic information from correlations between word embeddings, we harness the well-established word embeddings to map visual representations into language space. Specifically, we simultaneously assign the visual and text representations to a set of word embeddings within LLMs. We propose a new training objective, optimal transport-based assignment prediction, to enforce the consistency of word assignments for paired multimodal data. This allows frozen LLMs to ground their word embedding space in visual data and use their robust semantic taxonomy visually. Moreover, VLAP is memory- and parameter-efficient in that it trains only a single linear layer, and works without extra embedding space (e.g. learnable prototypes) for the assignment prediction. Experimental results show that VLAP achieves substantial improvements over the previous linear transformation-based methods across a range of vision-language tasks, including image captioning, visual question answering, and cross-modal retrieval. We also demonstrate the learned visual representations hold a semantic taxonomy of LLMs, making visual semantic arithmetic possible.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lK2V2E2MNv",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17935,
    "title": "CLIP-MUSED: CLIP-Guided Multi-Subject Visual Neural Information Semantic Decoding",
    "authors": [
      "Qiongyi Zhou",
      "Changde Du",
      "Shengpei Wang",
      "Huiguang He"
    ],
    "abstract": "The study of decoding visual neural information faces challenges in generalizing single-subject decoding models to multiple subjects, due to individual differences. Moreover, the limited availability of data from a single subject has a constraining impact on model performance. Although prior multi-subject decoding methods have made significant progress, they still suffer from several limitations, including difficulty in extracting global neural response features, linear scaling of model parameters with the number of subjects, and inadequate characterization of the relationship between neural responses of different subjects to various stimuli.To overcome these limitations, we propose a CLIP-guided Multi-sUbject visual neural information SEmantic Decoding (CLIP-MUSED) method. Our method consists of a Transformer-based feature extractor to effectively model global neural representations. It also incorporates learnable subject-specific tokens that facilitates the aggregation of multi-subject data without a linear increase of parameters. Additionally, we employ representational similarity analysis (RSA) to guide token representation learning based on the topological relationship of visual stimuli in the representation space of CLIP, enabling full characterization of the relationship between neural responses of different subjects under different stimuli. Finally, token representations are used for multi-subject semantic decoding. Our proposed method outperforms single-subject decoding methods and achieves state-of-the-art performance among the existing multi-subject methods on two fMRI datasets. Visualization results provide insights into the effectiveness of our proposed method. Code is available at https://github.com/CLIP-MUSED/CLIP-MUSED.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lKxL5zkssv",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18096,
    "title": "Plan-Seq-Learn: Language Model Guided RL for Solving Long Horizon Robotics Tasks",
    "authors": [
      "Murtaza Dalal",
      "Tarun Chiruvolu",
      "Devendra Singh Chaplot",
      "Ruslan Salakhutdinov"
    ],
    "abstract": "Large Language Models (LLMs) are highly capable of performing planning for long-horizon robotics tasks, yet existing methods require access to a pre-defined skill library (*e.g.* picking, placing, pulling, pushing, navigating). However, LLM planning does not address how to design or learn those behaviors, which remains challenging particularly in long-horizon settings. Furthermore, for many tasks of interest, the robot needs to be able to adjust its behavior in a fine-grained manner, requiring the agent to be capable of modifying *low-level* control actions. Can we instead use the internet-scale knowledge from LLMs for high-level policies, guiding reinforcement learning (RL) policies to efficiently solve robotic control tasks online without requiring a pre-determined set of skills? In this paper, we propose **Plan-Seq-Learn** (PSL): a modular approach that uses motion planning to bridge the gap between abstract language and learned low-level control for solving long-horizon robotics tasks from scratch. We demonstrate that PSL is capable of solving 20+ challenging single and multi-stage robotics tasks on four benchmarks at success rates of over 80% from raw visual input, out-performing language-based, classical, and end-to-end approaches. Video results and code at https://planseqlearn.github.io/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hQVCCxQrYN",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17933,
    "title": "Non-negative Contrastive Learning",
    "authors": [
      "Yifei Wang",
      "Qi Zhang",
      "Yaoyu Guo",
      "Yisen Wang"
    ],
    "abstract": "Deep representations have shown promising performance when transferred to downstream tasks in a black-box manner. Yet, their inherent lack of interpretability remains a significant challenge, as these features are often opaque to human understanding. In this paper, we propose Non-negative Contrastive Learning (NCL), a renaissance of Non-negative Matrix Factorization (NMF) aimed at deriving interpretable features. The power of NCL lies in its enforcement of non-negativity constraints on features, reminiscent of NMF's capability to extract features that align closely with sample clusters. NCL not only aligns mathematically well with an NMF objective but also preserves NMF's interpretability attributes, resulting in a more sparse and disentangled representation compared to standard contrastive learning (CL). Theoretically, we establish guarantees on the identifiability and downstream generalization of NCL. Empirically, we show that these advantages enable NCL to outperform CL significantly on feature disentanglement, feature selection, as well as downstream classification tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lNCnZwcH5Z",
    "arxiv_id": "2403.12459",
    "GitHub": [
      "https://github.com/PKU-ML/non_neg"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17932,
    "title": "MCM: Masked Cell Modeling for Anomaly Detection in Tabular Data",
    "authors": [
      "Jiaxin Yin",
      "Yuanyuan Qiao",
      "Zitang Zhou",
      "Xiangchao Wang",
      "Jie Yang"
    ],
    "abstract": "This paper addresses the problem of anomaly detection in tabular data, which is usually implemented in an one-class classification setting where the training set only contains normal samples. Inspired by the success of masked image/language modeling in vision and natural language domains, we extend masked modeling methods to address this problem by capturing intrinsic correlations between features in training set. Thus, a sample deviate from such correlations is related to a high possibility of anomaly. To obtain multiple and diverse correlations, we propose a novel masking strategy which generates multiple masks by learning, and design a diversity loss to reduce the similarity of different masks. Extensive experiments show our method achieves state-of-the-art performance. We also discuss the interpretability from the perspective of each individual feature and correlations between features.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lNZJyEDxy4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17930,
    "title": "On Diffusion Modeling for Anomaly Detection",
    "authors": [
      "Victor Livernoche",
      "Vineet Jain",
      "Yashar Hezaveh",
      "Siamak Ravanbakhsh"
    ],
    "abstract": "Known for their impressive performance in generative modeling, diffusion models are attractive candidates for density-based anomaly detection. This paper investigates different variations of diffusion modeling for unsupervised and semi-supervised anomaly detection. In particular, we find that Denoising Diffusion Probability Models (DDPM) are performant on anomaly detection benchmarks yet computationally expensive. By simplifying DDPM in application to anomaly detection, we are naturally led to an alternative approach called Diffusion Time Estimation (DTE). DTE estimates the distribution over diffusion time for a given input and uses the mode or mean of this distribution as the anomaly score. We derive an analytical form for this density and leverage a deep neural network to improve inference efficiency. Through empirical evaluations on the ADBench benchmark, we demonstrate that all diffusion-based anomaly detection methods perform competitively for both semi-supervised and unsupervised settings. Notably, DTE achieves orders of magnitude faster inference time than DDPM, while outperforming it on this benchmark. These results establish diffusion-based anomaly detection as a scalable alternative to traditional methods and recent deep-learning techniques for standard unsupervised and semi-supervised anomaly detection settings.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=lR3rk7ysXz",
    "arxiv_id": "2305.18593",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18084,
    "title": "Conformal Inductive Graph Neural Networks",
    "authors": [
      "Soroush H. Zargarbashi",
      "Aleksandar Bojchevski"
    ],
    "abstract": "Conformal prediction (CP) can transform any model's output into prediction sets guaranteed to include (cover) the true label. CP requires exchangeability, a relaxation of the i.i.d. assumption, to obtain a valid distribution-free coverage guarantee. This makes it directly applicable to transductive node-classification. However, conventional CP cannot be applied in inductive settings due to the implicit shift in the (calibration) scores caused by message passing with the new nodes. We fix this issue for both cases of node and edge-exchangeable graphs,  recovering the standard coverage guarantee without sacrificing statistical efficiency. We further prove that the guarantee holds independently of the prediction time, e.g. upon arrival of a new node/edge or at any subsequent moment.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=homn1jOKI5",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18079,
    "title": "Strategic Preys Make Acute Predators: Enhancing Camouflaged Object Detectors by Generating Camouflaged Objects",
    "authors": [
      "Chunming He",
      "Kai Li",
      "Yachao Zhang",
      "Yulun Zhang",
      "Chenyu You",
      "Zhenhua Guo",
      "Xiu Li",
      "Martin Danelljan",
      "Fisher Yu"
    ],
    "abstract": "Camouflaged object detection (COD) is the challenging task of identifying camouflaged objects visually blended into surroundings. Albeit achieving remarkable success, existing COD detectors still struggle to obtain precise results in some challenging cases. To handle this problem, we draw inspiration from the prey-vs-predator game that leads preys to develop better camouflage and predators to acquire more acute vision systems and develop algorithms from both the prey side and the predator side. On the prey side, we propose an adversarial training framework, Camouflageator, which introduces an auxiliary generator to generate more camouflaged objects that are harder for a COD method to detect. Camouflageator trains the generator and detector in an adversarial way such that the enhanced auxiliary generator helps produce a stronger detector. On the predator side, we introduce a novel COD method, called Internal Coherence and Edge Guidance (ICEG), which introduces a camouflaged feature coherence module to excavate the internal coherence of camouflaged objects, striving to obtain more complete segmentation results. Additionally, ICEG proposes a novel edge-guided separated calibration module to remove false predictions to avoid obtaining ambiguous boundaries. Extensive experiments show that ICEG outperforms existing COD detectors and Camouflageator is flexible to improve various COD detectors, including ICEG, which brings state-of-the-art COD performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hywpSoHwgX",
    "arxiv_id": "2308.03166",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17929,
    "title": "Node2ket: Efficient High-Dimensional Network Embedding in Quantum Hilbert Space",
    "authors": [
      "Hao Xiong",
      "Yehui Tang",
      "Yunlin He",
      "Wei Tan",
      "Junchi Yan"
    ],
    "abstract": "Network embedding (NE) is a prominent techniques for network analysis that represents nodes as embeddings in a continuous vector space. We observe existing works all fall in the low-dimensional embedding space with two reasons: 1) it is empirically found that the increasing embedding dimension will cause the over-fitting of embedding models and the subsequent descent of model performance; 2) the overhead brought by high-dimensional embedding also makes a computing method seemingly impractical and worthless. In this paper, we explore a new NE paradigm whose embedding dimension goes exponentially high yet being very efficient and effective. Specifically, the node embeddings are represented as product quantum states that lie in a super high-dimensional (e.g. $2^{32}$-dim) quantum Hilbert space, with a carefully designed optimization approach to guarantee the robustness to work in different scenarios. In the experiments, we show diverse virtues of our methods, including but not limited to: the overwhelming performance on downstream tasks against conventional low-dimensional NE baselines with the similar amount of computing resources, the super high efficiency for a fixed low embedding dimension (e.g. 512) with less than 1/200 memory usage, the robustness when equipped with different objectives and sampling strategies as a fundamental tool for future NE research. As an unexplored topic in literature, the high-dimensional NE paradigm is demonstrated to be effective both experimentally and theoretically.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lROh08eK6n",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17928,
    "title": "Delphic Offline Reinforcement Learning under Nonidentifiable Hidden Confounding",
    "authors": [
      "Aliz\u00e9e Pace",
      "Hugo Y\u00e8che",
      "Bernhard Sch\u00f6lkopf",
      "Gunnar Ratsch",
      "Guy Tennenholtz"
    ],
    "abstract": "A prominent challenge of offline reinforcement learning (RL) is the issue of hidden confounding: unobserved variables may influence both the actions taken by the agent and the observed outcomes. Hidden confounding can compromise the validity of any causal conclusion drawn from data and presents a major obstacle to effective offline RL. In the present paper, we tackle the problem of hidden confounding in the nonidentifiable setting. We propose a definition of uncertainty due to hidden confounding bias, termed delphic uncertainty, which uses variation over world models compatible with the observations, and differentiate it from the well-known epistemic and aleatoric uncertainties. We derive a practical method for estimating the three types of uncertainties, and construct a pessimistic offline RL algorithm to account for them. Our method does not assume identifiability of the unobserved confounders, and attempts to reduce the amount of confounding bias. We demonstrate through extensive experiments and ablations the efficacy of our approach on a sepsis management benchmark, as well as on electronic health records. Our results suggest that nonidentifiable hidden confounding bias can be mitigated to improve offline RL solutions in practice.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lUYY2qsRTI",
    "arxiv_id": "2306.01157",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17927,
    "title": "SRL: Scaling Distributed Reinforcement Learning to Over Ten Thousand Cores",
    "authors": [
      "Zhiyu Mei",
      "Wei Fu",
      "Jiaxuan Gao",
      "Guangju Wang",
      "Huanchen Zhang",
      "Yi Wu"
    ],
    "abstract": "The ever-growing complexity of reinforcement learning (RL) tasks demands a distributed system to efficiently generate and process a massive amount of data. However, existing open-source libraries suffer from various limitations, which impede their practical use in challenging scenarios where large-scale training is necessary. In this paper, we present a novel abstraction on the dataflows of RLtraining, which unifies diverse RL training applications into a general framework. Following this abstraction, we develop a scalable, efficient, and extensible distributed RL system called ReaLly Scalable RL (SRL), which allows efficient and massively parallelized training and easy development of customized algorithms. Our evaluation shows that SRL outperforms existing academic libraries, reaching at most 21x higher training throughput in a distributed setting. On learning performance, beyond performing and scaling well on common RL benchmarks with different RL algorithms, SRL can reproduce the same solution in the challenging hide-and-seek environment as reported by OpenAI with up to 5x speedup in wallclock time. Notably, SRL is the first in the academic community to perform RL experiments at a large scale with over 15k CPU cores. SRL anonymous repository is available at: https://anonymous.4open.science/r/srl-1E45/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lajn1iROCu",
    "arxiv_id": "2306.16688",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17925,
    "title": "Structuring Representation Geometry with Rotationally Equivariant Contrastive Learning",
    "authors": [
      "Sharut Gupta",
      "Joshua Robinson",
      "Derek Lim",
      "Soledad Villar",
      "Stefanie Jegelka"
    ],
    "abstract": "Self-supervised learning converts raw perceptual data such as images to a compact space where simple Euclidean distances measure meaningful variations in data. In this paper, we extend this formulation by adding additional geometric structure to the embedding space by enforcing transformations of input space to correspond to simple (i.e., linear) transformations of embedding space. Specifically, in the contrastive learning setting, we introduce an equivariance objective and theoretically prove that its minima force augmentations on input space to correspond to rotations on the spherical embedding space. We show that merely combining our equivariant loss with a non-collapse term results in non-trivial representations, without requiring invariance to data augmentations. Optimal performance is achieved by also encouraging approximate invariance, where input augmentations correspond to small rotations. Our method, CARE: Contrastive Augmentation-induced Rotational Equivariance, leads to improved performance on downstream tasks and ensures sensitivity in embedding space to important variations in data (e.g., color) that standard contrastive methods do not achieve.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lgaFMvZHSJ",
    "arxiv_id": "2306.13924",
    "GitHub": [
      "https://github.com/Sharut/CARE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17924,
    "title": "Sliced Denoising: A Physics-Informed Molecular Pre-Training Method",
    "authors": [
      "Yuyan Ni",
      "Shikun Feng",
      "Wei-Ying Ma",
      "Zhi-Ming Ma",
      "Yanyan Lan"
    ],
    "abstract": "While molecular pre-training has shown great potential in enhancing drug discovery, the lack of a solid physical interpretation in current methods raises concerns about whether the learned representation truly captures the underlying explanatory factors in observed data, ultimately resulting in limited generalization and robustness. Although denoising methods offer a physical interpretation, their accuracy is often compromised by ad-hoc noise design, leading to inaccurate learned force fields. To address this limitation, this paper proposes a new method for molecular pre-training, called sliced denoising (SliDe), which is based on the classical mechanical intramolecular potential theory. SliDe utilizes a novel noise strategy that perturbs bond lengths, angles, and torsion angles to achieve better sampling over conformations. Additionally, it introduces a random slicing approach that circumvents the computationally expensive calculation of the Jacobian matrix, which is otherwise essential for estimating the force field. By aligning with physical principles, SliDe shows a 42\\% improvement in the accuracy of estimated force fields compared to current state-of-the-art denoising methods, and thus outperforms traditional baselines on various molecular property prediction tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=liKkG1zcWq",
    "arxiv_id": "2311.02124",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17922,
    "title": "ViLMA: A Zero-Shot Benchmark for Linguistic and Temporal Grounding in Video-Language Models",
    "authors": [
      "Ilker Kesen",
      "Andrea Pedrotti",
      "Mustafa Dogan",
      "Michele Cafagna",
      "Emre Can Acikgoz",
      "Letitia Parcalabescu",
      "Iacer Calixto",
      "Anette Frank",
      "Albert Gatt",
      "Aykut Erdem",
      "Erkut Erdem"
    ],
    "abstract": "With the ever-increasing popularity of pretrained Video-Language Models (VidLMs), there is a pressing need to develop robust evaluation methodologies that delve deeper into their visio-linguistic capabilities. To address this challenge, we present ViLMA (Video Language Model Assessment), a task-agnostic benchmark that places the assessment of fine-grained capabilities of these models on a firm footing. Task-based evaluations, while valuable, fail to capture the complexities and specific temporal aspects of moving images that VidLMs need to process. Through carefully curated counterfactuals, ViLMA offers a controlled evaluation suite that sheds light on the true potential of these models, as well as their performance gaps compared to human-level understanding. ViLMA also includes proficiency tests, which assess basic capabilities deemed essential to solving the main counterfactual tests. We show that current VidLMs\u2019 grounding abilities are no better than those of vision-language models which use static images. This is especially striking once the performance on proficiency tests is factored in. Our benchmark serves as a catalyst for future research on VidLMs, helping to highlight areas that still need to be explored.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=liuqDwmbQJ",
    "arxiv_id": "2311.07022",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17920,
    "title": "Ring-A-Bell! How Reliable are Concept Removal Methods For Diffusion Models?",
    "authors": [
      "Yu-Lin Tsai",
      "Chia-Yi Hsu",
      "Chulin Xie",
      "Chih-Hsun Lin",
      "Jia You Chen",
      "Bo Li",
      "Pin-Yu Chen",
      "Chia-Mu Yu",
      "Chun-Ying Huang"
    ],
    "abstract": "Diffusion models for text-to-image (T2I) synthesis, such as Stable Diffusion (SD), have recently demonstrated exceptional capabilities for generating high-quality content. However, this progress has raised several concerns of potential misuse, particularly in creating copyrighted, prohibited, and restricted content, or NSFW (not safe for work) images. While efforts have been made to mitigate such problems, either by implementing a safety filter at the evaluation stage or by fine-tuning models to eliminate undesirable concepts or styles, the effectiveness of these safety measures in dealing with a wide range of prompts remains largely unexplored. In this work, we aim to investigate these safety mechanisms by proposing one novel concept retrieval algorithm for evaluation. We introduce Ring-A-Bell, a model-agnostic red-teaming scheme for T2I diffusion models, where the whole evaluation can be prepared in advance without prior knowledge of the target model.Specifically, Ring-A-Bell first performs concept extraction to obtain holistic representations for sensitive and inappropriate concepts. Subsequently, by leveraging the extracted concept, Ring-A-Bell automatically identifies problematic prompts for diffusion models with the corresponding generation of inappropriate content, allowing the user to assess the reliability of deployed safety mechanisms. Finally, we empirically validate our method by testing online services such as Midjourney and various methods of concept removal. Our results show that Ring-A-Bell, by manipulating safe prompting benchmarks, can transform prompts that were originally regarded as safe to evade existing safety mechanisms, thus revealing the defects of the so-called safety mechanisms which could practically lead to the generation of harmful contents. In essence, Ring-A-Bell could serve as a red-teaming tool to understand the limitations of deployed safety mechanisms and to explore the risk under plausible attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lm7MRcsFiS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18051,
    "title": "Scaling Convex Neural Networks with Burer-Monteiro Factorization",
    "authors": [
      "Arda Sahiner",
      "Tolga Ergen",
      "Batu Ozturkler",
      "John M. Pauly",
      "Morteza Mardani",
      "Mert Pilanci"
    ],
    "abstract": "It has been demonstrated that the training problem for a variety of (non) linear two-layer neural networks (such as two-layer perceptrons, convolutional networks, and self-attention) can be posed as equivalent convex optimization problems, with an induced regularizer which encourages low rank. However, this regularizer becomes prohibitively expensive to compute at moderate scales, impeding training convex neural networks. To this end, we propose applying the Burer-Monteiro factorization to convex neural networks, which for the first time enables a Burer-Monteiro perspective on neural networks with non-linearities. This factorization leads to an equivalent yet computationally tractable non-convex alternative with no spurious local minima. We develop a novel relative optimality bound of stationary points of the Burer-Monteiro factorization, providing verifiable conditions under which any stationary point is a global optimum. Further, for the first time, we show that linear self-attention with sufficiently many heads has no spurious local minima. Our experiments validate the novel relative optimality bound and the utility of the Burer-Monteiro factorization for scaling convex neural networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ikmuHqugN7",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17917,
    "title": "A Dynamical View of the Question of Why",
    "authors": [
      "Mehdi Fatemi",
      "Sindhu C. M. Gowda"
    ],
    "abstract": "In this paper, we address causal reasoning in multivariate time series data generated by stochastic processes. Traditional approaches are largely restricted to static settings, ignoring the continuity and emission of variations across time. In contrast, we propose a learning paradigm that directly establishes causation between \\emph{events} in the course of time. We present two key lemmas to compute causal contributions and frame them as reinforcement learning problems. Our approach offers formal and computational tools for uncovering and quantifying causal relationships in diffusion processes, subsuming various important settings such as discrete-time Markov decision processes. Finally, in fairly intricate experiments and through sheer learning, our framework reveals and quantifies causal links, which otherwise seem inexplicable.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lrQlLqQase",
    "arxiv_id": "2402.10240",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18048,
    "title": "Efficient Modulation for Vision Networks",
    "authors": [
      "Xu Ma",
      "Xiyang Dai",
      "Jianwei Yang",
      "Bin Xiao",
      "Yinpeng Chen",
      "Yun Fu",
      "Lu Yuan"
    ],
    "abstract": "In this work, we present efficient modulation, a novel design for efficient vision networks. We revisit the modulation mechanism, which operates input through convolutional context modeling and feature projection layers, and fuses features via element-wise multiplication and an MLP block. We demonstrate that the abstracted modulation mechanism is particularly well suited for efficient networks and further tailor the modulation design by proposing the efficient modulation (EfficientMod) block, which is considered the essential building block for our networks. Bene- fiting from the prominent representational ability of modulation mechanism and the efficiency of efficient modulation design, our network can accomplish better accuracy-efficiency trade-offs and set new state-of-the-art performance for efficient networks. When integrating EfficientMod block with the vanilla self-attention block, we obtain the hybrid architecture and further improve the performance without sacrificing the efficiency. We carry out comprehensive experiments to verify EfficientMod\u2019s performance. With fewer parameters, our EfficientMod-s performs 0.6 top-1 accuracy better than the prior state-of-the-art approach EfficientFormerV2-s2 without any training tricks and is 25% faster on GPU. Additionally, our method presents a notable improvement in downstream tasks, outperforming EfficientFormerV2-s by 3.6 mIoU on the ADE20K benchmark. Codes and checkpoints are available in the supplementary material.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ip5LHJs6QX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18047,
    "title": "DOS: Diverse Outlier Sampling for Out-of-Distribution Detection",
    "authors": [
      "Wenyu Jiang",
      "Hao Cheng",
      "MingCai Chen",
      "Chongjun Wang",
      "Hongxin Wei"
    ],
    "abstract": "Modern neural networks are known to give overconfident predictions for out-of-distribution inputs when deployed in the open world. It is common practice to leverage a surrogate outlier dataset to regularize the model during training, and recent studies emphasize the role of uncertainty in designing the sampling strategy for outlier datasets. However, the OOD samples selected solely based on predictive uncertainty can be biased towards certain types, which may fail to capture the full outlier distribution. In this work, we empirically show that diversity is critical in sampling outliers for OOD detection performance. Motivated by the observation, we propose a straightforward and novel sampling strategy named DOS (Diverse Outlier Sampling) to select diverse and informative outliers. Specifically, we cluster the normalized features at each iteration, and the most informative outlier from each cluster is selected for model training with absent category loss. With DOS, the sampled outliers efficiently shape a globally compact decision boundary between ID and OOD data. Extensive experiments demonstrate the superiority of DOS, reducing the average FPR95 by up to 25.79% on CIFAR-100 with TI-300K.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iriEqxFB4y",
    "arxiv_id": "2306.02031",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17915,
    "title": "Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation",
    "authors": [
      "Thomas Kleine Buening",
      "Aadirupa Saha",
      "Christos Dimitrakakis",
      "Haifeng Xu"
    ],
    "abstract": "We study a strategic variant of the multi-armed bandit problem, which we coin the strategic click-bandit. This model is motivated by applications in online recommendation where the choice of recommended items depends on both the click-through rates and the post-click rewards. Like in classical bandits, rewards follow a fixed unknown distribution. However, we assume that the click-rate of each arm is chosen  strategically by the arm (e.g., a host on Airbnb)  in order to maximize  the number of times it gets clicked. The algorithm designer does not know the post-click rewards nor the arms' actions (i.e., strategically chosen click-rates) in advance, and must learn both values over time. To solve this problem, we design an incentive-aware learning algorithm, UCB-S, which achieves two goals simultaneously: (a) incentivizing desirable arm behavior under uncertainty; (b) minimizing regret by learning unknown parameters.  We approximately characterize all Nash equilibria of the arms under UCB-S and show a $\\tilde{\\mathcal{O}} (\\sqrt{KT})$ regret bound uniformly in every equilibrium. We also show that incentive-unaware algorithms generally fail to achieve low regret in the strategic click-bandit. Finally, we support our theoretical results by simulations of strategic arm behavior which confirm the effectiveness and robustness of our proposed incentive design.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=lsxeNvYqCj",
    "arxiv_id": "2311.15647",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18044,
    "title": "The Effect of Intrinsic Dataset Properties on Generalization: Unraveling Learning Differences Between Natural and Medical Images",
    "authors": [
      "Nicholas Konz",
      "Maciej A Mazurowski"
    ],
    "abstract": "This paper investigates discrepancies in how neural networks learn from different imaging domains, which are commonly overlooked when adopting computer vision techniques from the domain of natural images to other specialized domains such as medical images. Recent works have found that the generalization error of a trained network typically increases with the intrinsic dimension ($d_{data}$) of its training set. Yet, the steepness of this relationship varies significantly between medical (radiological) and natural imaging domains, with no existing theoretical explanation. We address this gap in knowledge by establishing and empirically validating a generalization scaling law with respect to $d_{data}$, and propose that the substantial scaling discrepancy between the two considered domains may be at least partially attributed to the higher intrinsic ``label sharpness'' ($K_\\mathcal{F}$) of medical imaging datasets, a metric which we propose. Next, we demonstrate an additional benefit of measuring the label sharpness of a training set: it is negatively correlated with the trained model's adversarial robustness, which notably leads to models for medical images having a substantially higher vulnerability to adversarial attack. Finally, we extend our $d_{data}$ formalism to the related metric of learned representation intrinsic dimension ($d_{repr}$), derive a generalization scaling law with respect to $d_{repr}$, and show that $d_{data}$ serves as an upper bound for $d_{repr}$. Our theoretical results are supported by thorough experiments with six models and eleven natural and medical imaging datasets over a range of training set sizes. Our findings offer insights into the influence of intrinsic dataset properties on generalization, representation learning, and robustness in deep neural networks. *Code link: https://github.com/mazurowski-lab/intrinsic-properties*",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ixP76Y33y1",
    "arxiv_id": "2401.08865",
    "GitHub": [
      "https://github.com/mazurowski-lab/intrinsic-properties"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18043,
    "title": "Parameter-Efficient Multi-Task Model Fusion with Partial Linearization",
    "authors": [
      "Anke Tang",
      "Li Shen",
      "Yong Luo",
      "Yibing Zhan",
      "Han Hu",
      "Bo Du",
      "Yixin Chen",
      "Dacheng Tao"
    ],
    "abstract": "Large pre-trained models have enabled significant advances in machine learning and served as foundation components.Model fusion methods, such as task arithmetic, have been proven to be powerful and scalable to incorporate fine-tuned weights from different tasks into a multi-task model. However, efficiently fine-tuning large pre-trained models on multiple downstream tasks remains challenging, leading to inefficient multi-task model fusion.In this work, we propose a novel method to improve multi-task fusion for parameter-efficient fine-tuning techniques like LoRA fine-tuning.Specifically, our approach partially linearizes only the adapter modules and applies task arithmetic over the linearized adapters.This allows us to leverage the the advantages of model fusion over linearized fine-tuning, while still performing fine-tuning and inference efficiently.We demonstrate that our partial linearization technique enables a more effective fusion of multiple tasks into a single model, outperforming standard adapter tuning and task arithmetic alone.Experimental results demonstrate the capabilities of our proposed partial linearization technique to effectively construct unified multi-task models via the fusion of fine-tuned task vectors. We evaluate performance over an increasing number of tasks and find that our approach outperforms standard parameter-efficient fine-tuning techniques. The results highlight the benefits of partial linearization for scalable and efficient multi-task model fusion.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iynRvVVAmH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17914,
    "title": "RobustTSF: Towards Theory and Design of Robust Time Series Forecasting with Anomalies",
    "authors": [
      "Hao Cheng",
      "Qingsong Wen",
      "Yang Liu",
      "Liang Sun"
    ],
    "abstract": "Time series forecasting is an important and forefront task whose techniques have been applied to electricity forecasting, trajectory prediction, labor planning, etc. However, most of time series forecasting techniques assume that the training data is clean without anomalies. This assumption is unrealistic since the collected time series data can be contaminated in practice. The forecasting model will be inferior if it is directly trained by time series with anomalies. Thus it is essential to develop methods to automatically learn a robust forecasting model from the contaminated data. In this paper, we first statistically define three types of anomalies, then theoretically and experimentally analyze the loss robustness and sample robustness when these anomalies exist. Based on our analyses, we propose a simple and efficient algorithm to learn a robust forecasting model. Extensive experiments show that our method is highly robust and outperforms all existing approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ltZ9ianMth",
    "arxiv_id": "2402.02032",
    "GitHub": [
      "https://github.com/haochenglouis/RobustTSF"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17913,
    "title": "Faster Approximation of Probabilistic and Distributional Values via Least Squares",
    "authors": [
      "Weida Li",
      "Yaoliang Yu"
    ],
    "abstract": "The family of probabilistic values, axiomatically-grounded and proposed in cooperative game theory, has recently received much attention in data valuation. However, it is often computationally expensive to compute exactly (exponential w.r.t. $N$, the number of data being valuated). Existing generic estimators cost $O(\\frac{N^2}{\\epsilon^2}\\log\\frac{N}{\\delta})$ utility evaluations to achieve an ($\\epsilon$, $\\delta$)-approximation under the 2-norm, while faster estimators have been developed recently for special cases (e.g., empirically for the Shapley value and theoretically for the Banzhaf value). In this work, based on a connection between probabilistic values and least square regressions, we propose two generic estimators for the whole family of probabilistic values that both cost $O(\\frac{N}{\\epsilon^2}\\log\\frac{N}{\\delta})$ utility evaluations, largely extending the scope of this currently best complexity bound. Moreover, we show that each distributional value, proposed by Ghorbani et al. (2020) to alleviate the inconsistency of probabilistic values when using distinct databases, can also be cast as optimizing a similar least square regression. This observation makes it the first-time theoretically-grounded to train value estimators such that the distributional value of each unseen data point can be evaluated in a single forward pass. Our experiments verify the faster convergence of our proposed estimators, and demonstrate the effectiveness at learning distributional values.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lvSMIsztka",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17912,
    "title": "Time-Varying Propensity Score to Bridge the Gap between the Past and Present",
    "authors": [
      "Rasool Fakoor",
      "Jonas Mueller",
      "Zachary Chase Lipton",
      "Pratik Chaudhari",
      "Alex Smola"
    ],
    "abstract": "Real-world deployment of machine learning models is challenging because data evolves over time. While no model can work when data evolves in an arbitrary fashion, if there is some pattern to these changes, we might be able to design methods to address it. This paper addresses situations when data evolves gradually. We introduce a time-varying propensity score that can detect gradual shifts in the distribution of data which allows us to selectively sample past data to update the model---not just similar data from the past like that of a standard propensity score but also data that evolved in a similar fashion in the past. The time-varying propensity score is quite general: we demonstrate different ways of implementing it and evaluate it on a variety of problems ranging from supervised learning (e.g., image classification problems) where data undergoes a sequence of gradual shifts, to reinforcement learning tasks (e.g., robotic manipulation and continuous control) where data shifts as the policy or the task changes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=m0x0rv6Iwm",
    "arxiv_id": "2210.01422",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17911,
    "title": "To the Cutoff... and Beyond? A Longitudinal Perspective on LLM Data Contamination",
    "authors": [
      "Manley Roberts",
      "Himanshu Thakur",
      "Christine Herlihy",
      "Colin White",
      "Samuel Dooley"
    ],
    "abstract": "Recent claims about the impressive abilities of large language models (LLMs) are often supported by evaluating publicly available benchmarks. Since LLMs train on wide swaths of the internet, this practice raises concerns of data contamination, i.e., evaluating on examples that are explicitly or implicitly included in the training data. Data contamination remains notoriously challenging to measure and mitigate, even with partial attempts like controlled experimentation of training data, canary strings, or embedding similarities. In this work, we conduct the first thorough longitudinal analysis of data contamination in LLMs by using the natural experiment of training cutoffs in GPT models to look at benchmarks released over time.Specifically, we consider two code/mathematical problem-solving datasets, Codeforces and Project Euler, and find statistically significant trends among LLM pass rate vs. GitHub popularity and release date that provide strong evidence of contamination. By open-sourcing our dataset, raw results, and evaluation framework, our work paves the way for rigorous analyses of data contamination in modern models. We conclude with a discussion of best practices and future steps for publicly releasing benchmark in the age of LLMs which  train on webscale data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=m2NVG4Htxs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17910,
    "title": "DENEVIL: TOWARDS DECIPHERING AND NAVIGATING THE ETHICAL VALUES OF LARGE LANGUAGE MODELS VIA INSTRUCTION LEARNING",
    "authors": [
      "Shitong Duan",
      "Xiaoyuan Yi",
      "Peng Zhang",
      "Tun Lu",
      "Xing Xie",
      "Ning Gu"
    ],
    "abstract": "Large Language Models (LLMs) have made unprecedented breakthroughs, yet their increasing integration into everyday life might raise societal risks due to generated unethical content. Despite extensive study on specific issues like bias, the intrinsic values of LLMs remain largely unexplored from a moral philosophy perspective. This work delves into ethical values utilizing Moral Foundation Theory. Moving beyond conventional discriminative evaluations with poor reliability, we propose DeNEVIL, a novel prompt generation algorithm tailored to dynamically exploit LLMs\u2019 value vulnerabilities and elicit the violation of ethics in a generative manner, revealing their underlying value inclinations. On such a basis, we construct MoralPrompt, a high-quality dataset comprising 2,397 prompts covering 500+ value principles, and then benchmark the intrinsic values across a spectrum of LLMs. We discovered that most models are essentially misaligned, necessitating further ethical value alignment. In response, we develop VILMO, an in-context alignment method that substantially enhances the value compliance of LLM outputs by learning to generate appropriate value instructions, outperforming existing competitors. Our methods are suitable for black-box and open-source models, offering a promising initial step in studying the ethical values of LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=m3RRWWFaVe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17739,
    "title": "Seer: Language Instructed Video Prediction with Latent Diffusion Models",
    "authors": [
      "Xianfan Gu",
      "Chuan Wen",
      "Weirui Ye",
      "Jiaming Song",
      "Yang Gao"
    ],
    "abstract": "Imagining the future trajectory is the key for robots to make sound planning and successfully reach their goals. Therefore, text-conditioned video prediction (TVP) is an essential task to facilitate general robot policy learning.To tackle this task and empower robots with the ability to foresee the future, we propose a sample and computation-efficient model, named Seer, by inflating the pretrained text-to-image (T2I) stable diffusion models along the temporal axis. We enhance the U-Net and language conditioning model by incorporating computation-efficient spatial-temporal attention. Furthermore, we introduce a novel Frame Sequential Text Decomposer module that dissects a sentence's global instruction into temporally aligned sub-instructions, ensuring precise integration into each frame of generation. Our framework allows us to effectively leverage the extensive prior knowledge embedded in pretrained T2I models across the frames. With the adaptable-designed architecture, Seer makes it possible to generate high-fidelity, coherent, and instruction-aligned video frames by fine-tuning a few layers on a small amount of data. The experimental results on Something Something V2 (SSv2), Bridgedata and EpicKitchens-100 datasets demonstrate our superior video prediction performance with around 480-GPU hours versus CogVideo with over 12,480-GPU hours: achieving the 31\\% FVD improvement compared to the current SOTA model on SSv2 and 83.7\\% average preference in the human evaluation. Our project is available at https://seervideodiffusion.github.io/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qHGgNyQk31",
    "arxiv_id": "2303.14897",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17909,
    "title": "Sentence-level Prompts Benefit Composed Image Retrieval",
    "authors": [
      "Yang bai",
      "Xinxing Xu",
      "Yong Liu",
      "Salman Khan",
      "Fahad Khan",
      "Wangmeng Zuo",
      "Rick Siow Mong Goh",
      "Chun-Mei Feng"
    ],
    "abstract": "Composed image retrieval (CIR) is the task of retrieving specific images by using a query that involves both a reference image and a relative caption. Most existing CIR models adopt the late-fusion strategy to combine visual and language features. Besides, several approaches have also been suggested to generate a pseudo-word token from the reference image, which is further integrated into the relative caption for CIR. However, these pseudo-word-based prompting methods have limitations when target image encompasses complex changes on reference image, e.g., object removal and attribute modification. In this work, we demonstrate that learning an appropriate sentence-level prompt for the relative caption (SPRC) is sufficient for achieving effective composed image retrieval. Instead of relying on pseudo- word-based prompts, we propose to leverage pretrained V-L models, e.g., BLIP-2, to generate sentence-level prompts. By concatenating the learned sentence-level prompt with the relative caption, one can readily use existing text-based image retrieval models to enhance CIR performance. Furthermore, we introduce both image-text contrastive loss and text prompt alignment loss to enforce the learning of suitable sentence-level prompts. Experiments show that our proposed method performs favorably against the state-of-the-art CIR methods on the Fashion-IQ and CIRR datasets. The source code and pretrained model will be publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=m3ch3kJL7q",
    "arxiv_id": "2310.05473",
    "GitHub": [
      "https://github.com/chunmeifeng/SPRC"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17908,
    "title": "Policy Rehearsing: Training Generalizable Policies for Reinforcement Learning",
    "authors": [
      "Chengxing Jia",
      "Chenxiao Gao",
      "Hao Yin",
      "Fuxiang Zhang",
      "Xiong-Hui Chen",
      "Tian Xu",
      "Lei Yuan",
      "Zongzhang Zhang",
      "Zhi-Hua Zhou",
      "Yang Yu"
    ],
    "abstract": "Human beings can make adaptive decisions in a preparatory manner, i.e., by making preparations in advance, which offers significant advantages in scenarios where both online and offline experiences are expensive and limited. Meanwhile, current reinforcement learning methods commonly rely on numerous environment interactions but hardly obtain generalizable policies. In this paper, we introduce the idea of \\textit{rehearsal} into policy optimization, where the agent plans for all possible outcomes in mind and acts adaptively according to actual responses from the environment. To effectively rehearse, we propose ReDM, an algorithm that generates a diverse and eligible set of dynamics models and then rehearse the policy via adaptive training on the generated model set. Rehearsal enables the policy to make decision plans for various hypothetical dynamics and to naturally generalize to previously unseen environments. Our experimental results demonstrate that ReDM is capable of learning a valid policy solely through rehearsal, even with \\emph{zero} interaction data. We further extend ReDM to scenarios where limited or mismatched interaction data is available, and our experimental results reveal that ReDM produces high-performing policies compared to other offline RL baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=m3xVPaZp6Z",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17906,
    "title": "Constructing Adversarial Examples for Vertical Federated Learning: Optimal Client Corruption through Multi-Armed Bandit",
    "authors": [
      "Duanyi YAO",
      "Songze Li",
      "Ye XUE",
      "Jin Liu"
    ],
    "abstract": "Vertical federated learning (VFL), where each participating client holds a subset of data features, has found numerous applications in finance, healthcare, and IoT systems. However, adversarial attacks, particularly through the injection of adversarial examples (AEs), pose serious challenges to the security of VFL models. In this paper, we investigate such vulnerabilities through developing a novel attack to disrupt the VFL inference process, under a practical scenario where the adversary is able to *adaptively corrupt a subset of clients*. We formulate the problem of finding optimal attack strategies as an online optimization problem, which is decomposed into an inner problem of adversarial example generation (AEG) and an outer problem of corruption pattern selection (CPS). Specifically, we establish the equivalence between the formulated CPS problem and a multi-armed bandit (MAB) problem, and propose the Thompson sampling with Empirical maximum reward (E-TS) algorithm for the adversary to efficiently identify the optimal subset of clients for corruption. The key idea of E-TS is to introduce an estimation of the expected maximum reward for each arm, which helps to specify a small set of *competitive arms*, on which the exploration for the optimal arm is performed. This significantly reduces the exploration space, which otherwise can quickly become prohibitively large as the number of clients increases. We analytically characterize the regret bound of E-TS, and empirically demonstrate its capability of efficiently revealing the optimal corruption pattern with the highest attack success rate, under various datasets of popular VFL tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=m52uU0dVbH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18009,
    "title": "Space Group Constrained Crystal Generation",
    "authors": [
      "Rui Jiao",
      "Wenbing Huang",
      "Yu Liu",
      "Deli Zhao",
      "Yang Liu"
    ],
    "abstract": "Crystals are the foundation of numerous scientific and industrial applications. While various learning-based approaches have been proposed for crystal generation, existing methods neglect the spacegroup constraint which is crucial in describing the geometry of crystals and closely relevant to many desirable properties. However, considering spacegroup constraint is challenging owing to its diverse and nontrivial forms. In this paper, we reduce the spacegroup constraint into an equivalent formulation that is more tractable to be handcrafted into the generation process. In particular, we translate the spacegroup constraint into two cases: the basis constraint of the invariant exponential space of the lattice matrix and the Wyckoff position constraint of the fractional coordinates. Upon the derived constraints, we then propose DiffCSP++, a novel diffusion model that has enhanced a previous work DiffCSP by further taking spacegroup constraint into account. Experiments on several popular datasets verify the benefit of the involvement of the spacegroup constraint, and show that our DiffCSP++ achieves the best or comparable performance on crystal structure prediction and ab initio crystal generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jkvZ7v4OmP",
    "arxiv_id": "2402.03992",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17905,
    "title": "DRSM: De-Randomized Smoothing on Malware Classifier Providing Certified Robustness",
    "authors": [
      "Shoumik Saha",
      "Wenxiao Wang",
      "Yigitcan Kaya",
      "Soheil Feizi",
      "Tudor Dumitras"
    ],
    "abstract": "Machine Learning (ML) models have been utilized for malware detection for over two decades. Consequently, this ignited an ongoing arms race between malware authors and antivirus systems, compelling researchers to propose defenses for malware-detection models against evasion attacks. However, most if not all existing defenses against evasion attacks suffer from sizable performance degradation and/or can defend against only specific attacks, which makes them less practical in real-world settings. In this work, we develop a certified defense, DRSM (De-Randomized Smoothed MalConv), by redesigning the *de-randomized smoothing* technique for the domain of malware detection. Specifically, we propose a *window ablation* scheme to provably limit the impact of adversarial bytes while maximally preserving local structures of the executables. After showing how DRSM is theoretically robust against attacks with contiguous adversarial bytes, we verify its performance and certified robustness experimentally, where we observe only marginal accuracy drops as the cost of robustness. To our knowledge, we are the first to offer certified robustness in the realm of static detection of malware executables. More surprisingly, through evaluating DRSM against $9$ empirical attacks of different types, we observe that the proposed defense is empirically robust to some extent against a diverse set of attacks, some of which even fall out of the scope of its original threat model. In addition, we collected $15.5K$ recent benign raw executables from diverse sources, which will be made public as a dataset called PACE (Publicly Accessible Collection(s) of Executables) to alleviate the scarcity of publicly available benign datasets for studying malware detection and provide future research with more representative data of the time.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=m7aPLHwsLr",
    "arxiv_id": "2303.13372",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18008,
    "title": "How Does Unlabeled Data Provably Help Out-of-Distribution Detection?",
    "authors": [
      "Xuefeng Du",
      "Zhen Fang",
      "Ilias Diakonikolas",
      "Yixuan Li"
    ],
    "abstract": "Using unlabeled data to regularize the machine learning models has demonstrated promise for improving safety and reliability in detecting out-of-distribution (OOD) data. Harnessing the power of unlabeled in-the-wild data is non-trivial due to the heterogeneity of both in-distribution (ID) and OOD data. This lack of a clean set of OOD samples poses significant challenges in learning an optimal OOD classifier. Currently, there is a lack of research on formally understanding how unlabeled data helps OOD detection. This paper bridges the gap by introducing a new learning framework SAL (Separate And Learn) that offers both strong theoretical guarantees and empirical effectiveness. The framework separates candidate outliers from the unlabeled data and then trains an OOD classifier using the candidate outliers and the labeled ID data. Theoretically, we provide rigorous error bounds from the lens of separability and learnability, formally justifying the two components in our algorithm. Our theory shows that SAL can separate the candidate outliers with small error rates, which leads to a generalization guarantee for the learned OOD classifier. Empirically, SAL achieves state-of-the-art performance on common benchmarks, reinforcing our theoretical insights. Code is publicly available at https://github.com/deeplearning-wisc/sal.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jlEjB8MVGa",
    "arxiv_id": "2402.03502",
    "GitHub": [
      "https://github.com/deeplearning-wisc/sal"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17901,
    "title": "Sum-Product-Set Networks: Deep Tractable Models for Tree-Structured Graphs",
    "authors": [
      "Milan Papez",
      "Martin Rektoris",
      "Vaclav Smidl",
      "Tom\u00e1\u0161 Pevn\u00fd"
    ],
    "abstract": "Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution over undirected cyclic graphs. This assumption of a generic graph structure brings various computational challenges, and, more importantly, the presence of non-linearities in neural networks does not permit tractable probabilistic inference. We address these problems by proposing sum-product-set networks, an extension of probabilistic circuits from unstructured tensor data to tree-structured graph data. To this end, we use random finite sets to reflect a variable number of nodes and edges in the graph and to allow for exact and efficient inference. We demonstrate that our tractable model performs comparably to various intractable models based on neural networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mF3cTns4pe",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17997,
    "title": "Language Modeling Is Compression",
    "authors": [
      "Gregoire Deletang",
      "Anian Ruoss",
      "Paul-Ambroise Duquenne",
      "Elliot Catt",
      "Tim Genewein",
      "Christopher Mattern",
      "Jordi Grau-Moya",
      "Li Kevin Wenliang",
      "Matthew Aitchison",
      "Laurent Orseau",
      "Marcus Hutter",
      "Joel Veness"
    ],
    "abstract": "It has long been established that predictive models can be transformed into lossless compressors and vice versa. Incidentally, in recent years, the machine learning community has focused on training increasingly large and powerful self-supervised (language) models. Since these large language models exhibit impressive predictive capabilities, they are well-positioned to be strong compressors. In this work, we advocate for viewing the prediction problem through the lens of compression and evaluate the compression capabilities of large (foundation) models. We show that large language models are powerful general-purpose predictors and that the compression viewpoint provides novel insights into scaling laws, tokenization, and in-context learning. For example, Chinchilla 70B, while trained primarily on text, compresses ImageNet patches to 43.4% and LibriSpeech samples to 16.4% of their raw size, beating domain-specific compressors like PNG (58.5%) or FLAC (30.3%), respectively. Finally, we show that the prediction-compression equivalence allows us to use any compressor (like gzip) to build a conditional generative model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=jznbgiynus",
    "arxiv_id": "2309.10668",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17986,
    "title": "Bias Runs Deep: Implicit Reasoning Biases in Persona-Assigned LLMs",
    "authors": [
      "Shashank Gupta",
      "Vaishnavi Shrivastava",
      "Ameet Deshpande",
      "Ashwin Kalyan",
      "Peter Clark",
      "Ashish Sabharwal",
      "Tushar Khot"
    ],
    "abstract": "Recent work has showcased the ability of large-scale language models (LLMs) to embody diverse personas in their responses, exemplified by prompts like \"_You are Julius Caesar. Compose a rap about Climate Change._\" However, it remains unclear how these persona assignments indirectly influence LLMs' core capabilities.  We present the first extensive study of this in the context of LLMs' ability to perform basic reasoning. Our study encompasses 16 personas spanning 5 diverse groups (race, gender, religion, disability, and political affiliation), across 24 reasoning datasets in diverse domains such as mathematics, history, law, ethics, and more. Our findings unveil that while LLMs, such as ChatGPT, overtly reject stereotypes when explicitly asked (\"_Are Black people inept at mathematics?_\"), they tend to manifest implicit stereotypical and often erroneous presumptions when prompted to take on a persona (e.g., abstentions in rationales such as \"_As a Black person, I am unable to answer this question as it requires math knowledge_\"). This results in substantial disparities in reasoning performance among personas. This inherent 'deep' bias permeates extensively, leading to a statistically significant performance drop in over 95\\% of our datasets for certain personas, with as much as 70\\% relative drop in accuracy on select datasets. Beyond explicit abstentions, these models also have implicitly biased reasoning not evident in their responses. We find that simple prompt-based mitigation approaches have minimal impact. Our findings serve as a cautionary tale that the practice of assigning personas to LLMs---a trend on the rise---can surface their deep-rooted biases and have unforeseeable and detrimental side-effects.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kGteeZ18Ir",
    "arxiv_id": "2311.04892",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17985,
    "title": "On the Generalization and Approximation Capacities of Neural Controlled Differential Equations",
    "authors": [
      "Linus Bleistein",
      "Agathe Guilloux"
    ],
    "abstract": "Neural Controlled Differential Equations (NCDE) are a state-of-the-art tool for supervised learning with irregularly sampled time series (Kidger 2020). However, no theoretical analysis of their performance has been provided yet, and it remains unclear in particular how the roughness of the sampling affects their predictions. By merging the rich theory of controlled differential equations (CDE) and Lipschitz-based measures of the complexity of deep neural nets, we take a first step towards the theoretical understanding of NCDE. Our first result is a sampling-dependant generalization bound for this class of predictors. In a second time, we leverage the continuity of the flow of CDEs to provide a detailed analysis of both the sampling-induced bias and the approximation bias. Regarding this last result, we show how classical approximation results on neural nets may transfer to NCDE. Our theoretical results are validated through a series of experiments, for which the code is available at REDACTED.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kILAd8RdzA",
    "arxiv_id": "2305.16791",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17980,
    "title": "SE(3)-Stochastic Flow Matching for Protein Backbone Generation",
    "authors": [
      "Joey Bose",
      "Tara Akhound-Sadegh",
      "Guillaume Huguet",
      "Kilian FATRAS",
      "Jarrid Rector-Brooks",
      "Cheng-Hao Liu",
      "Andrei Cristian Nica",
      "Maksym Korablyov",
      "Michael M. Bronstein",
      "Alexander Tong"
    ],
    "abstract": "The computational design of novel protein structures has the potential to impact numerous scientific disciplines greatly. Toward this goal, we introduce \\foldflow, a series of novel generative models of increasing modeling power based on the flow-matching paradigm over $3\\mathrm{D}$ rigid motions---i.e. the group $\\mathrm{SE}(3)$---enabling accurate modeling of protein backbones. We first introduce FoldFlow-Base, a simulation-free approach to learning deterministic continuous-time dynamics and matching invariant target distributions on $\\mathrm{SE}(3)$. We next accelerate training by incorporating Riemannian optimal transport to create FoldFlow-OT, leading to the construction of both more simple and stable flows. Finally, we design FoldFlow-SFM, coupling both Riemannian OT and simulation-free training to learn stochastic continuous-time dynamics over $\\mathrm{SE}(3)$. Our family of FoldFlow, generative models offers several key advantages over previous approaches to the generative modeling of proteins: they are more stable and faster to train than diffusion-based approaches, and our models enjoy the ability to map any invariant source distribution to any invariant target distribution over $\\mathrm{SE}(3)$. Empirically, we validate our FoldFlow, models on protein backbone generation of up to $300$ amino acids leading to high-quality designable, diverse, and novel samples.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=kJFIH23hXb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17900,
    "title": "Rethinking the Benefits of Steerable Features in 3D Equivariant Graph Neural Networks",
    "authors": [
      "Shih-Hsin Wang",
      "Yung-Chang Hsu",
      "Justin Baker",
      "Andrea L. Bertozzi",
      "Jack Xin",
      "Bao Wang"
    ],
    "abstract": "Theoretical and empirical comparisons have been made to assess the expressive power and performance of invariant and equivariant GNNs. However, there is currently no theoretical result comparing the expressive power of $k$-hop invariant GNNs and equivariant GNNs. Additionally, little is understood about whether the performance of equivariant GNNs, employing steerable features up to type-$L$, increases as $L$ grows -- especially when the feature dimension is held constant. In this study, we introduce a key lemma that allows us to analyze steerable features by examining their corresponding invariant features. The lemma facilitates us in understanding the limitations of $k$-hop invariant GNNs, which fail to capture the global geometric structure due to the loss of geometric information between local structures. Furthermore, we investigate the invariant features associated with different types of steerable features and demonstrate that the expressiveness of steerable features is primarily determined by their dimension -- independent of their irreducible decomposition. This suggests that when the feature dimension is constant, increasing $L$ does not lead to essentially improved performance in equivariant GNNs employing steerable features up to type-$L$. We substantiate our theoretical insights with numerical evidence.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mGHJAyR8w0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17977,
    "title": "Leveraging Unpaired Data for Vision-Language Generative Models via Cycle Consistency",
    "authors": [
      "Tianhong Li",
      "Sangnie Bhardwaj",
      "Yonglong Tian",
      "Han Zhang",
      "Jarred Barber",
      "Dina Katabi",
      "Guillaume Lajoie",
      "Huiwen Chang",
      "Dilip Krishnan"
    ],
    "abstract": "Current vision-language generative models rely on expansive corpora of $\\textit{paired}$ image-text data to attain optimal performance and generalization capabilities. However, automatically collecting such data (e.g. via large-scale web scraping) leads to low quality and poor image-text correlation, while human annotation is more accurate but requires significant manual effort and expense. We introduce $\\textbf{ITIT}$ ($\\textbf{I}$n$\\textbf{T}$egrating $\\textbf{I}$mage $\\textbf{T}$ext): an innovative training paradigm grounded in the concept of cycle consistency which allows vision-language training on $\\textit{unpaired}$ image and text data. ITIT is comprised of a joint image-text encoder with disjoint image and text decoders that enable bidirectional image-to-text and text-to-image generation in a single framework. During training, ITIT leverages a small set of paired image-text data to ensure its output matches the input reasonably well in both directions. Simultaneously, the model is also trained on much larger datasets containing only images or texts. This is achieved by enforcing cycle consistency between the original unpaired samples and the cycle-generated counterparts. For instance, it generates a caption for a given input image and then uses the caption to create an output image, and enforces similarity between the input and output images. Our experiments show that ITIT with unpaired datasets exhibits similar scaling behavior as using high-quality paired data. We demonstrate image generation and captioning performance on par with state-of-the-art text-to-image and image-to-text models with orders of magnitude fewer (only 3M) paired image-text data.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=kNjrhD67LP",
    "arxiv_id": "2310.03734",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17976,
    "title": "Maximum Entropy Model Correction in Reinforcement Learning",
    "authors": [
      "Amin Rakhsha",
      "Mete Kemertas",
      "Mohammad Ghavamzadeh",
      "Amir-massoud Farahmand"
    ],
    "abstract": "We propose and theoretically analyze an approach for planning with an approximate model in reinforcement learning that can reduce the adverse impact of model error. If the model is accurate enough, it accelerates the convergence to the true value function too. One of its key components is the MaxEnt Model Correction (MoCo) procedure that corrects the model\u2019s next-state distributions based on a Maximum Entropy density estimation formulation. Based on MoCo, we introduce the Model Correcting Value Iteration (MoCoVI) algorithm, and its sampled-based variant MoCoDyna. We show that MoCoVI and MoCoDyna\u2019s convergence can be much faster than the conventional model-free algorithms. Unlike traditional model-based algorithms, MoCoVI and MoCoDyna effectively utilize an approximate model and still converge to the correct value function.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kNpSUN0uCc",
    "arxiv_id": "2311.17855",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17899,
    "title": "Seeking Neural Nuggets: Knowledge Transfer in Large Language Models from a Parametric Perspective",
    "authors": [
      "Ming Zhong",
      "Chenxin An",
      "Weizhu Chen",
      "Jiawei Han",
      "Pengcheng He"
    ],
    "abstract": "Large Language Models (LLMs) inherently encode a wealth of knowledge within their parameters through pre-training on extensive corpora. While prior research has delved into operations on these parameters to manipulate the underlying implicit knowledge\u2014encompassing detection, editing, and merging\u2014there remains an ambiguous understanding regarding their transferability across models with varying scales. In this paper, we seek to empirically investigate knowledge transfer from larger to smaller models through a parametric perspective. To achieve this, we employ sensitivity-based techniques to extract and align knowledge-specific parameters between different LLMs. Moreover, the LoRA module is used as the intermediary mechanism for injecting the extracted knowledge into smaller models. Evaluations across four benchmarks validate the efficacy of our proposed method. Our findings highlight the critical factors contributing to the process of parametric knowledge transfer, underscoring the transferability of model parameters across LLMs of different scales.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mIEHIcHGOo",
    "arxiv_id": "2310.11451",
    "GitHub": [
      "https://github.com/maszhongming/ParaKnowTransfer"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17898,
    "title": "Emu: Generative Pretraining in Multimodality",
    "authors": [
      "Quan Sun",
      "Qiying Yu",
      "Yufeng Cui",
      "Fan Zhang",
      "Xiaosong Zhang",
      "Yueze Wang",
      "Hongcheng Gao",
      "Jingjing Liu",
      "Tiejun Huang",
      "Xinlong Wang"
    ],
    "abstract": "We present Emu, a multimodal foundation model that seamlessly generates images and text in multimodal context. This omnivore model can take in any single- modality or multimodal data input indiscriminately (e.g., interleaved image, text and video) through a one-model-for-all autoregressive training process. First, visual signals are encoded into embeddings, and together with text tokens form an interleaved input sequence. Emu is end-to-end trained with a unified objective of classifying the next text token or regressing the next visual embedding in the multimodal sequence. This versatile multimodality empowers the leverage of diverse pretraining data sources at scale, such as videos with interleaved frames and text, webpages with interleaved images and text, as well as web-scale image-text pairs and video-text pairs. Emu can serve as a generalist multimodal interface for both image-to-text and text-to-image tasks, supporting in-context image and text generation. Across a broad range of zero-shot/few-shot tasks including image captioning, visual question answering, video question answering and text-to-image generation, Emu demonstrates superb performance compared to state-of-the-art large multimodal models. Extended capabilities such as multimodal assistants via instruction tuning are also demonstrated with impressive performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mL8Q9OOamV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17971,
    "title": "Improving equilibrium propagation without weight symmetry through Jacobian homeostasis",
    "authors": [
      "Axel Laborieux",
      "Friedemann Zenke"
    ],
    "abstract": "Equilibrium propagation (EP) is a compelling alternative to the back propagation of error algorithm (BP) for computing gradients of neural networks on biological or analog neuromorphic substrates. Still, the algorithm requires weight symmetry and infinitesimal equilibrium perturbations, i.e., nudges, to yield unbiased gradient estimates.Both requirements are challenging to implement in physical systems.Yet, whether and how weight asymmetry contributes to bias is unknown because, in practice, its contribution may be masked by a finite nudge. To address this question, we study generalized EP, which can be formulated without weight symmetry, and analytically isolate the two sources of bias.For complex-differentiable non-symmetric networks, we show that bias due to finite nudge can be avoided by estimating exact derivatives via a Cauchy integral.In contrast, weight asymmetry induces residual bias  through poor alignment of EP's neuronal error vectors compared to BP resulting in low task performance.To mitigate the latter issue, we present a new homeostatic objective that directly penalizes functional asymmetries of the Jacobian at the network's fixed point. This homeostatic objective dramatically improves the network's ability to solve complex tasks such as ImageNet 32$\\times$32. Our results lay the theoretical groundwork for studying and mitigating the adverse effects of imperfections of physical networks on learning algorithms that rely on the substrate's relaxation dynamics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kUveo5k1GF",
    "arxiv_id": "2309.02214",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17963,
    "title": "DynaVol: Unsupervised Learning for Dynamic Scenes through Object-Centric Voxelization",
    "authors": [
      "Yanpeng Zhao",
      "Siyu Gao",
      "Yunbo Wang",
      "Xiaokang Yang"
    ],
    "abstract": "Unsupervised learning of object-centric representations in dynamic visual scenes is challenging. Unlike most previous approaches that learn to decompose 2D images, we present DynaVol, a 3D scene generative model that unifies geometric structures and object-centric learning in a differentiable volume rendering framework. The key idea is to perform object-centric voxelization to capture the 3D nature of the scene, which infers the probability distribution over objects at individual spatial locations. These voxel features evolve over time through a canonical-space deformation function, forming the basis for global representation learning via slot attention. The voxel features and global features are complementary and are both leveraged by a compositional NeRF decoder for volume rendering. DynaVol remarkably outperforms existing approaches for unsupervised dynamic scene decomposition. Once trained, the explicitly meaningful voxel features enable additional capabilities that 2D scene decomposition methods cannot achieve: it is possible to freely edit the geometric shapes or manipulate the motion trajectories of the objects.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=koYsgfEwCQ",
    "arxiv_id": "2305.00393",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17897,
    "title": "SOTOPIA: Interactive Evaluation for Social Intelligence in Language Agents",
    "authors": [
      "Xuhui Zhou",
      "Hao Zhu",
      "Leena Mathur",
      "Ruohong Zhang",
      "Haofei Yu",
      "Zhengyang Qi",
      "Louis-Philippe Morency",
      "Yonatan Bisk",
      "Daniel Fried",
      "Graham Neubig",
      "Maarten Sap"
    ],
    "abstract": "*Humans are social beings*; we pursue social goals in our daily interactions, which is a crucial aspect of social intelligence. Yet, AI systems' abilities in this realm remain elusive. We present SOTOPIA, an open-ended environment to simulate complex social interactions between artificial agents and evaluate their social intelligence. In our environment, agents role-play and *interact* under a wide variety of scenarios; they coordinate, collaborate, exchange, and compete with each other to achieve complex social goals. We simulate the role-play interaction between LLM-based agents and humans within this task space and evaluate their performance with a holistic evaluation framework called SOTOPIA-Eval. With SOTOPIA, we find significant differences between these models in terms of their social intelligence, and we identify a subset of SOTOPIA scenarios, SOTOPIA-hard, that is generally challenging for all models. We find that on this subset, GPT-4 achieves a significantly lower goal completion rate than humans and struggles to exhibit social commonsense reasoning and strategic communication skills. These findings demonstrate SOTOPIA's promise as a general platform for research on evaluating and improving social intelligence in artificial agents.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=mM7VurbA4r",
    "arxiv_id": "2310.11667",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17896,
    "title": "Beyond task performance: evaluating and reducing the flaws of large multimodal models with in-context-learning",
    "authors": [
      "Mustafa Shukor",
      "Alexandre Rame",
      "Corentin Dancette",
      "Matthieu Cord"
    ],
    "abstract": "Following the success of Large Language Models (LLMs), Large Multimodal Models (LMMs), such as the Flamingo model and its subsequent competitors, have started to emerge as natural step towards generalist agents. However, interacting with recent LMMs reveals major limitations that are hardly captured by the current evaluation benchmarks. Indeed, task performances (e.g., VQA accuracy) alone do not provide enough clues to understand their real capabilities, limitations, and to which extent such models are aligned to human expectations. To refine our understanding on those flaws, we deviate from the current evaluation paradigm, and (1) evaluate 8 recent open-source LMMs (based on the Flamingo architecture such as OpenFlamingo and IDEFICS) on 5 different axes; hallucinations, abstention, compositionality, explainability and instruction following. Our evaluation on these axes reveals major flaws in LMMs. To efficiently address these problems, and inspired by the success of In-Context Learning (ICL) in LLMs, (2) we explore ICL as a solution, and study how it affects these limitations. Based on our ICL study, (3) we push ICL further, and propose new multimodal ICL approaches such as; Multitask-ICL, Chain-of-Hindsight-ICL and Self-Correcting-ICL. Our findings are as follows. (1) Despite their success, LMMs have flaws that remain unsolved with scaling alone. (2) The effect of ICL on LMMs flaws is nuanced; despite its effectiveness for improved explainability, abstention and instruction following, ICL does not improve compositional abilities, and actually even amplifies hallucinations. (3) The proposed ICL variants are promising as post-hoc approaches to efficiently tackle some of those flaws. The code will be made public.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mMaQvkMzDi",
    "arxiv_id": "2310.00647",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17895,
    "title": "LLM Blueprint: Enabling Text-to-Image Generation with Complex and Detailed Prompts",
    "authors": [
      "Hanan Gani",
      "Shariq Farooq Bhat",
      "Muzammal Naseer",
      "Salman Khan",
      "Peter Wonka"
    ],
    "abstract": "Diffusion-based generative models have significantly advanced text-to-image generation but encounter challenges when processing lengthy and intricate text prompts describing complex scenes with multiple objects. While excelling in generating images from short, single-object descriptions, these models often struggle to faithfully capture all the nuanced details within longer and more elaborate textual inputs. In response, we present a novel approach leveraging Large Language Models (LLMs) to extract critical components from text prompts, including bounding box coordinates for foreground objects, detailed textual descriptions for individual objects, and a succinct background context. These components form the foundation of our layout-to-image generation model, which operates in two phases. The initial Global Scene Generation utilizes object layouts and background context to create an initial scene but often falls short in faithfully representing object characteristics as specified in the prompts. To address this limitation, we introduce an Iterative Refinement Scheme that iteratively evaluates and refines box-level content to align them with their textual descriptions, recomposing objects as needed to ensure consistency. Our evaluation on complex prompts featuring multiple objects demonstrates a substantial improvement in recall compared to baseline diffusion models. This is further validated by a user study, underscoring the efficacy of our approach in generating coherent and detailed scenes from intricate textual inputs. Our iterative framework offers a promising solution for enhancing text-to-image generation models' fidelity with lengthy, multifaceted descriptions, opening new possibilities for accurate and diverse image synthesis from textual inputs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mNYF0IHbRy",
    "arxiv_id": "2310.10640",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17893,
    "title": "BrainSCUBA: Fine-Grained Natural Language Captions of Visual Cortex Selectivity",
    "authors": [
      "Andrew Luo",
      "Margaret Marie Henderson",
      "Michael J. Tarr",
      "Leila Wehbe"
    ],
    "abstract": "Understanding the functional organization of higher visual cortex is a central focus in neuroscience. Past studies have primarily mapped the visual and semantic selectivity of neural populations using hand-selected stimuli, which may potentially bias results towards pre-existing hypotheses of visual cortex functionality. Moving beyond conventional approaches, we introduce a data-driven method that generates natural language descriptions for images predicted to maximally activate individual voxels of interest. Our method -- Semantic Captioning Using Brain Alignments (\"BrainSCUBA\") -- builds upon the rich embedding space learned by a contrastive vision-language model and utilizes a pre-trained large language model to generate interpretable captions. We validate our method through fine-grained voxel-level captioning across higher-order visual regions. We further perform text-conditioned image synthesis with the captions, and show that our images are semantically coherent and yield high predicted activations. Finally, to demonstrate how our method enables scientific discovery, we perform exploratory investigations on the distribution of \"person\" representations in the brain, and discover fine-grained semantic selectivity in body-selective areas. Unlike earlier studies that decode text, our method derives *voxel-wise captions of semantic selectivity*. Our results show that BrainSCUBA is a promising means for understanding functional preferences in the brain, and provides motivation for further hypothesis-driven investigation of visual cortex.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mQYHXUUTkU",
    "arxiv_id": "2310.04420",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17892,
    "title": "On the Vulnerability of Adversarially Trained Models Against Two-faced Attacks",
    "authors": [
      "Shengjie Zhou",
      "Lue Tao",
      "Yuzhou Cao",
      "Tao Xiang",
      "Bo An",
      "Lei Feng"
    ],
    "abstract": "Adversarial robustness is an important standard for measuring the quality of learned models, and adversarial training is an effective strategy for improving the adversarial robustness of models. In this paper, we disclose that adversarially trained models are vulnerable to two-faced attacks, where slight perturbations in input features are crafted to make the model exhibit a false sense of robustness in the verification phase. Such a threat is significantly important as it can mislead our evaluation of the adversarial robustness of models, which could cause unpredictable security issues when deploying substandard models in reality. More seriously, this threat seems to be pervasive and tricky: we find that many types of models suffer from this threat, and models with higher adversarial robustness tend to be more vulnerable. Furthermore, we provide the first attempt to formulate this threat, disclose its relationships with adversarial risk, and try to circumvent it via a simple countermeasure. These findings serve as a crucial reminder for practitioners to exercise caution in the verification phase, urging them to refrain from blindly trusting the exhibited adversarial robustness of models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mXpNp8MMr5",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17948,
    "title": "Revisiting Deep Audio-Text Retrieval Through the Lens of Transportation",
    "authors": [
      "Manh Luong",
      "Khai Nguyen",
      "Nhat Ho",
      "Reza Haf",
      "Dinh Phung",
      "Lizhen Qu"
    ],
    "abstract": "Learning-to-match (LTM) is an effective inverse optimal transport framework for learning the underlying ground metric between two sources of data, which can be further used to form the matching between them. Nevertheless, the conventional LTM framework is not scalable since it needs to use the entire dataset each time updating the parametric ground metric. To adapt the LTM framework to the deep learning setting, we propose the mini-batch learning-to-match (m-LTM) framework for audio-text retrieval problems, which is based on mini-batch subsampling and neural networks parameterized ground metric. In addition, we improve further the framework by introducing the Mahalanobis-enhanced family of ground metrics. Moreover, to cope with the noisy data correspondence problem arising from practice, we additionally propose a variant using partial optimal transport to mitigate the pairing uncertainty in training data.  We conduct extensive experiments on audio-text matching problems usingthree datasets: AudioCaps, Clotho, and ESC-50. Results demonstrate that our proposed method is capable of learning rich and expressive joint embedding space, which achieves SOTA performance. Beyond this, the proposed m-LTM framework is able to close the modality gap across audio and text embedding, which surpasses both triplet and contrastive loss in the zero-shot sound event detection task on the ESC-50 dataset. Finally, our strategy to use partial OT with m-LTM has shown to be more noise tolerance than contrastive loss under a variant of noise ratio of training data in AudioCaps.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=l60EM8md3t",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17943,
    "title": "Vision-Language Foundation Models as Effective Robot Imitators",
    "authors": [
      "Xinghang Li",
      "Minghuan Liu",
      "Hanbo Zhang",
      "Cunjun Yu",
      "Jie Xu",
      "Hongtao Wu",
      "Chilam Cheang",
      "Ya Jing",
      "Weinan Zhang",
      "Huaping Liu",
      "Hang Li",
      "Tao Kong"
    ],
    "abstract": "Recent progress in vision language foundation models has shown their ability to understand multimodal data and resolve complicated vision language tasks, including robotics manipulation. We seek a straightforward way of making use of existing vision-language models (VLMs) with simple fine-tuning on robotics data.To this end, we derive a simple and novel vision-language manipulation framework, dubbed RoboFlamingo, built upon the open-source VLMs, OpenFlamingo. Unlike prior works, RoboFlamingo utilizes pre-trained VLMs for single-step vision-language comprehension, models sequential history information with an explicit policy head, and is slightly fine-tuned by imitation learning only on language-conditioned manipulation datasets. Such a decomposition provides RoboFlamingo the flexibility for open-loop control and deployment on low-performance platforms. By exceeding the state-of-the-art performance with a large margin on the tested benchmark, we show RoboFlamingo can be an effective and competitive alternative to adapt VLMs to robot control.Our extensive experimental results also reveal several interesting conclusions regarding the behavior of different pre-trained VLMs on manipulation tasks. We believe RoboFlamingo has the potential to be a cost-effective and easy-to-use solution for robotics manipulation, empowering everyone with the ability to fine-tune their own robotics policy. Our code will be made public upon acceptance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=lFYj0oibGR",
    "arxiv_id": "2311.01378",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17931,
    "title": "Improved Efficiency Based on Learned Saccade and Continuous Scene Reconstruction From Foveated Visual Sampling",
    "authors": [
      "Jiayang Liu",
      "Yiming Bu",
      "Daniel Tso",
      "Qinru Qiu"
    ],
    "abstract": "High accuracy, low latency and high energy efficiency represent a set of contradictory goals when searching for  system solutions for image classification and detection. While high-quality images naturally result in more precise detection and classification, they also result in a heavier computational workload for imaging and processing, reduce camera refresh rates, and increase the volume of data communication between the camera and processor. Taking inspiration from the foveal-peripheral sampling mechanism, saccade mechanism observed in the human visual system and the filling-in phenomena of brain, we have developed an active scene reconstruction architecture based on multiple foveal views. This model stitches together information from foveal and peripheral vision, which are sampled from multiple glances. Assisted by a reinforcement learning-based saccade mechanism, our model reduces the required input pixels by over 90\\% per frame while maintaining the same level of performance in image recognition as with the original images. We evaluated the effectiveness of our model using the GTSRB dataset and the ImageNet dataset. Using an equal number of input pixels, our study demonstrates a 5\\% higher image recognition accuracy compared to state-of-the-art foveal-peripheral vision systems. Furthermore, we demonstrate that our foveal sampling/saccadic scene reconstruction model exhibits significantly lower complexity and higher data efficiency during the training phase compared to existing approaches.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=lOwkOIUJtx",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17890,
    "title": "Rethinking CNN\u2019s Generalization to Backdoor Attack from Frequency Domain",
    "authors": [
      "Quanrui Rao",
      "Lin Wang",
      "Wuying Liu"
    ],
    "abstract": "Convolutional  neural network  (CNN) is easily affected by backdoor injections, whose models perform normally on clean samples but produce specific outputs on poisoned ones. Most of the existing studies have focused on the effect of trigger feature changes of poisoned samples on model generalization in spatial domain. We focus on the mechanism of CNN memorize poisoned samples in frequency domain, and find that CNN generate generalization to poisoned samples by memorizing the frequency domain distribution of trigger changes. We also explore the influence of trigger perturbations in different frequency domain components on the generalization of poisoned models from visible and invisible backdoor attacks, and prove that high-frequency components are more susceptible to perturbations than low-frequency components. Based on the above fundings, we propose a universal invisible strategy for visible triggers, which can achieve trigger invisibility while maintaining raw attack performance. We also design a novel frequency domain backdoor attack method based on low-frequency semantic information, which can achieve 100\\% attack accuracy on multiple models and multiple datasets, and can bypass multiple defenses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mYhH0CDFFa",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17921,
    "title": "Deep Neural Networks Tend To Extrapolate Predictably",
    "authors": [
      "Katie Kang",
      "Amrith Setlur",
      "Claire Tomlin",
      "Sergey Levine"
    ],
    "abstract": "Conventional wisdom suggests that neural network predictions tend to be unpredictable and overconfident when faced with out-of-distribution (OOD) inputs. Our work reassesses this assumption for neural networks with high-dimensional inputs. Rather than extrapolating in arbitrary ways, we observe that neural network predictions often tend towards a constant value as input data becomes increasingly OOD. Moreover, we find that this value often closely approximates the optimal constant solution (OCS), i.e., the prediction that minimizes the average loss over the training data without observing the input. We present results showing this phenomenon across 8 datasets with different distributional shifts (including CIFAR10-C and ImageNet-R, S), different loss functions (cross entropy, MSE, and Gaussian NLL), and different architectures (CNNs and transformers). Furthermore, we present an explanation for this behavior, which we first validate empirically and then study theoretically in a simplified setting involving deep homogeneous networks with ReLU activations. Finally, we show how one can leverage our insights in practice to enable risk-sensitive decision-making in the presence of OOD inputs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ljwoQ3cvQh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17887,
    "title": "Noise Map Guidance: Inversion with Spatial Context for Real Image Editing",
    "authors": [
      "Hansam Cho",
      "Jonghyun Lee",
      "Seoung Bum Kim",
      "Tae-Hyun Oh",
      "Yonghyun Jeong"
    ],
    "abstract": "Text-guided diffusion models have become a popular tool in image synthesis, known for producing high-quality and diverse images. However, their application to editing real images often encounters hurdles primarily due to the text condition deteriorating the reconstruction quality and subsequently affecting editing fidelity. Null-text Inversion (NTI) has made strides in this area, but it fails to capture spatial context and requires computationally intensive per-timestep optimization. Addressing these challenges, we present Noise Map Guidance (NMG), an inversion method rich in a spatial context, tailored for real-image editing. Significantly, NMG achieves this without necessitating optimization, yet preserves the editing quality. Our empirical investigations highlight NMG's adaptability across various editing techniques and its robustness to variants of DDIM inversions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mhgm0IXtHw",
    "arxiv_id": "2402.04625",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17886,
    "title": "Enabling Efficient Equivariant Operations in the Fourier Basis via Gaunt Tensor Products",
    "authors": [
      "Shengjie Luo",
      "Tianlang Chen",
      "Aditi S. Krishnapriyan"
    ],
    "abstract": "Developing equivariant neural networks for the E(3) group plays a pivotal role in modeling 3D data across real-world applications. Enforcing this equivariance primarily involves the tensor products of irreducible representations (irreps). However, the computational complexity of such operations increases significantly as higher-order tensors are used. In this work, we propose a systematic approach to substantially accelerate the computation of the tensor products of irreps. We mathematically connect the commonly used Clebsch-Gordan coefficients to the Gaunt coefficients, which are integrals of products of three spherical harmonics. Through Gaunt coefficients, the tensor product of irreps becomes equivalent to the multiplication between spherical functions represented by spherical harmonics. This perspective further allows us to change the basis for the equivariant operations from spherical harmonics to a 2D Fourier basis. Consequently, the multiplication between spherical functions represented by a 2D Fourier basis can be efficiently computed via the convolution theorem and Fast Fourier Transforms. This transformation reduces the complexity of full tensor products of irreps from $\\mathcal{O}(L^6)$ to $\\mathcal{O}(L^3)$, where $L$ is the max degree of irreps. Leveraging this approach, we introduce the Gaunt Tensor Product, which serves as a new method to construct efficient equivariant operations across different model architectures. Our experiments demonstrate both the superior efficiency and improved performance of our approach on a range of tasks. The code and models will be made publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=mhyQXJ6JsK",
    "arxiv_id": "2401.10216",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17885,
    "title": "RECOMP: Improving Retrieval-Augmented LMs with Context Compression and Selective Augmentation",
    "authors": [
      "Fangyuan Xu",
      "Weijia Shi",
      "Eunsol Choi"
    ],
    "abstract": "Retrieval-augmented language models improve language models (LMs) by retrieving documents and prepending them in-context.However, these documents, often spanning hundreds of words, make inference substantially less efficient. We propose compressing the retrieved documents into textual summaries prior to in-context integration. This not only reduces the computational costs but also relieve the burden of LMs to identify relevant information in long retrieved documents. We present two compressors -- an extractive compressor which selects useful sentences from retrieved documents  and an abstractive compressor which generates summary by synthesizing information from multiple documents. Both are trained to achieve performance gain in LMs when we prepend the generated summary from the compressor to LMs' input, while minimizing the summary length. When retrieved documents are irrelevant to the input or offer no additional information to LM, our compressors output an empty string, enabling selective augmentation. We evaluate our approach on the language modeling task and open domain question answering task. We achieve a compression rate of as low as 6% with minimal loss in performance for both tasks, significantly outperforming the off-the-shelf summarization models. We show that our compressors trained for one LM can transfer to other LMs on the language modeling task and provide a summary largely faithful to the retrieved documents.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mlJLVigNHp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17883,
    "title": "Multi-Resolution Diffusion Models for Time Series Forecasting",
    "authors": [
      "Lifeng Shen",
      "Weiyu Chen",
      "James Kwok"
    ],
    "abstract": "The diffusion model has been successfully used in many computer vision applications, such as text-guided image generation and image-to-image translation. Recently, there have been attempts on extending the diffusion model for time series data. However, these extensions are fairly straightforward and do not utilize the unique properties of time series data. As different patterns are usually exhibited at multiple scales of a time series, we in this paper leverage this multi-resolution temporal structure and propose the \\underline{m}ulti-\\underline{r}esolution \\underline{diff}usion model (\\texttt{mr-Diff}). By using the seasonal-trend decomposition, we sequentially extract fine-to-coarse trends from the time series for forward diffusion. The denoising process then proceeds in an easy-to-hard non-autoregressive manner. The coarsest trend is generated first. Finer details are progressively added, using the predicted coarser trends as condition variables. Experimental results on nine real-world time series datasets demonstrate that \\texttt{mr-Diff} outperforms state-of-the-art time series diffusion models. It is also better than or comparable across a wide variety of advanced time series prediction models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mmjnr0G8ZY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17881,
    "title": "KW-Design: Pushing the Limit of Protein Design via Knowledge Refinement",
    "authors": [
      "Zhangyang Gao",
      "Cheng Tan",
      "Xingran Chen",
      "Yijie Zhang",
      "Jun Xia",
      "Siyuan Li",
      "Stan Z. Li"
    ],
    "abstract": "Recent studies have shown competitive performance in protein inverse folding, while most of them disregard the importance of predictive confidence, fail to cover the vast protein space, and do not incorporate common protein knowledge. Given the great success of pretrained models on diverse protein-related tasks and the fact that recovery is highly correlated with confidence, we wonder whether this knowledge can push the limits of protein design further. As a solution, we propose a knowledge-aware module that refines low-quality residues. We also introduce a memory-retrieval mechanism to save more than 50\\% of the training time. We extensively evaluate our proposed method on the CATH, TS50, TS500, and PDB datasets and our results show that our KW-Design method outperforms the previous PiFold method by approximately 9\\% on the CATH dataset. KW-Design is the first method that achieves 60+\\% recovery on all these benchmarks. We also provide additional analysis to demonstrate the effectiveness of our proposed method. The code will be publicly available upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mpqMVWgqjn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17880,
    "title": "Skeleton-of-Thought: Prompting LLMs for Efficient Parallel Generation",
    "authors": [
      "Xuefei Ning",
      "Zinan Lin",
      "Zixuan Zhou",
      "Zifu Wang",
      "Huazhong Yang",
      "Yu Wang"
    ],
    "abstract": "This work aims at decreasing the end-to-end generation latency of large language models (LLMs). One of the major causes of the high generation latency is the sequential decoding approach adopted by almost all state-of-the-art LLMs. In this work, motivated by the thinking and writing process of humans, we propose Skeleton-of-Thought (SoT), which first guides LLMs to generate the skeleton of the answer, and then conducts parallel API calls or batched decoding to complete the contents of each skeleton point in parallel. Not only does SoT provide considerable speed-ups across 12 LLMs, but it can also potentially improve the answer quality on several question categories. SoT is an initial attempt at data-centric optimization for inference efficiency, and further underscores the potential of pushing LLMs to think more like a human for answer quality.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mqVgBbNCm9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17916,
    "title": "EControl: Fast Distributed Optimization with Compression and Error Control",
    "authors": [
      "Yuan Gao",
      "Rustem Islamov",
      "Sebastian U Stich"
    ],
    "abstract": "Modern distributed training relies heavily on communication compression to reduce the communication overhead. In this work, we study algorithms employing a popular class of contractive compressors in order to reduce communication overhead. However, the naive implementation often leads to unstable convergence or even exponential divergence due to the compression bias. Error Compensation (EC) is an extremely popular mechanism to mitigate the aforementioned issues during the training of models enhanced by contractive compression operators. Compared to the effectiveness of EC in the data homogeneous regime, the understanding of the practicality and theoretical foundations of EC in the data heterogeneous regime is limited. Existing convergence analyses typically rely on strong assumptions such as bounded gradients, bounded data heterogeneity, or large batch accesses, which are often infeasible in modern Machine Learning Applications. We resolve the majority of current issues by proposing EControl, a novel mechanism that can regulate error compensation by controlling the strength of the feedback signal. We prove fast convergence for EControl in standard strongly convex, general convex, and nonconvex settings without any additional assumptions on the problem or data heterogeneity. We conduct extensive numerical evaluations to illustrate the efficacy of our method and support our theoretical findings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lsvlvWB9vz",
    "arxiv_id": "2311.05645",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17907,
    "title": "Fantastic Gains and Where to Find Them: On the Existence and Prospect of General Knowledge Transfer between Any Pretrained Model",
    "authors": [
      "Karsten Roth",
      "Lukas Thede",
      "A. Sophia Koepke",
      "Oriol Vinyals",
      "Olivier J Henaff",
      "Zeynep Akata"
    ],
    "abstract": "Training deep networks requires various design decisions regarding for instance their architecture, data augmentation, or optimization. In this work, we find these training variations to result in networks learning unique feature sets from the data. Using public model libraries comprising thousands of models trained on canonical datasets like ImageNet, we observe that for arbitrary pairings of pretrained models, one model extracts significant data context unavailable in the other \u2013 independent of overall performance. Given any arbitrary pairing of pretrained models and no external rankings (such as separate test sets, e.g. due to data privacy), we investigate if it is possible to transfer such \"complementary\" knowledge from one model to another without performance degradation \u2013 a task made particularly difficult as additional knowledge can be contained in stronger, equiperformant or weaker models. Yet facilitating robust transfer in scenarios agnostic to pretrained model pairings would unlock auxiliary gains and knowledge fusion from any model repository without restrictions on model and problem specifics - including from weaker, lower-performance models. This work therefore provides an initial, in-depth exploration on the viability of such general-purpose knowledge transfer. Across large-scale experiments, we first reveal the shortcomings of standard knowledge distillation techniques, and then propose a much more general extension through data partitioning for successful transfer between nearly all pretrained models, which we show can also be done unsupervised. Finally, we assess both the scalability and impact of fundamental model properties on successful model-agnostic knowledge transfer.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=m50eKHCttz",
    "arxiv_id": "2310.17653",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17904,
    "title": "Federated Causal Discovery from Heterogeneous Data",
    "authors": [
      "Longkang Li",
      "Ignavier Ng",
      "Gongxu Luo",
      "Biwei Huang",
      "Guangyi Chen",
      "Tongliang Liu",
      "Bin Gu",
      "Kun Zhang"
    ],
    "abstract": "Conventional causal discovery methods rely on centralized data, which is inconsistent with the decentralized nature of data in many real-world situations. This discrepancy has motivated the development of federated causal discovery (FCD) approaches. However, existing FCD methods may be limited by their potentially restrictive assumptions of identifiable functional causal models or homogeneous data distributions, narrowing their applicability in diverse scenarios. In this paper, we propose a novel FCD method attempting to accommodate arbitrary causal models and heterogeneous data. We first utilize a surrogate variable corresponding to the client index to account for the data heterogeneity across different clients. We then develop a federated conditional independence test (FCIT) for causal skeleton discovery and establish a federated independent change principle (FICP) to determine causal directions. These approaches involve constructing summary statistics as a proxy of the raw data to protect data privacy. Owing to the nonparametric properties, FCIT and FICP make no assumption about particular functional forms, thereby facilitating the handling of arbitrary causal models. We conduct extensive experiments on synthetic and real datasets to show the efficacy of our method. The code is available at \\url{https://github.com/lokali/FedCDH.git}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=m7tJxajC3G",
    "arxiv_id": "2402.13241",
    "GitHub": [
      "https://github.com/lokali/FedCDH.git"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17903,
    "title": "EquiformerV2: Improved Equivariant Transformer for Scaling to Higher-Degree Representations",
    "authors": [
      "Yi-Lun Liao",
      "Brandon M Wood",
      "Abhishek Das",
      "Tess Smidt"
    ],
    "abstract": "Equivariant Transformers such as Equiformer have demonstrated the efficacy of applying Transformers to the domain of 3D atomistic systems. However, they are limited to small degrees of equivariant representations due to their computational complexity. In this paper, we investigate whether these architectures can scale well to higher degrees. Starting from Equiformer, we first replace $SO(3)$ convolutionswith eSCN convolutions to efficiently incorporate higher-degree tensors. Then, to better leverage the power of higher degrees, we propose three architectural improvements \u2013 attention re-normalization, separable $S^2$ activation and separable layer normalization. Putting these all together, we propose EquiformerV2, which outperforms previous state-of-the-art methods on large-scale OC20 dataset by up to 9% on forces, 4% on energies, offers better speed-accuracy trade-offs, and 2$\\times$ reduction in DFT calculations needed for computing adsorption energies. Additionally, EquiformerV2 trained on only OC22 dataset outperforms GemNet-OC trained on both OC20 and OC22 datasets, achieving much better data efficiency. Finally, we compare EquiformerV2 with Equiformer on QM9 and OC20 S2EF-2Mdatasets to better understand the performance gain brought by higher degrees.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mCOBKZmrzD",
    "arxiv_id": "2306.12059",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17879,
    "title": "Bridging State and History Representations: Understanding Self-Predictive RL",
    "authors": [
      "Tianwei Ni",
      "Benjamin Eysenbach",
      "Erfan SeyedSalehi",
      "Michel Ma",
      "Clement Gehring",
      "Aditya Mahajan",
      "Pierre-Luc Bacon"
    ],
    "abstract": "Representations are at the core of all deep reinforcement learning (RL) methods for both Markov decision processes (MDPs) and partially observable Markov decision processes (POMDPs). Many representation learning methods and theoretical frameworks have been developed to understand what constitutes an effective representation. However, the relationships between these methods and the shared properties among them remain unclear. In this paper, we show that many of these seemingly distinct methods and frameworks for state and history abstractions are, in fact, based on a common idea of self-predictive abstraction. Furthermore, we provide theoretical insights into the widely adopted objectives and optimization, such as the stop-gradient technique, in learning self-predictive representations. These findings together yield a minimalist algorithm to learn self-predictive representations for states and histories. We validate our theories by applying our algorithm to standard MDPs, distracted MDPs, and sparse-reward POMDPs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ms0VgzSGF2",
    "arxiv_id": "2401.08898",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17888,
    "title": "LLM-Assisted Code Cleaning For Training Accurate Code Generators",
    "authors": [
      "Naman Jain",
      "Tianjun Zhang",
      "Wei-Lin Chiang",
      "Joseph E. Gonzalez",
      "Koushik Sen",
      "Ion Stoica"
    ],
    "abstract": "Natural language to code generation is an important application area of LLMs and has received wide attention from the community. The majority of relevant studies have exclusively concentrated on increasing the quantity and functional correctness of training sets while disregarding other stylistic elements of programs. More recently, data quality has garnered a lot of interest and multiple works have showcased its importance for improving performance. In this work, we investigate data quality for code and find that making the code more structured and readable leads to improved code generation performance of the system. We build a novel data-cleaning pipeline that uses these principles to transform existing programs by 1.) renaming variables, 2.) modularizing and decomposing complex code into smaller helper sub-functions, and 3.) inserting natural-language based planning annotations. We evaluate our approach on two challenging algorithmic code generation benchmarks and find that fine-tuning CodeLLaMa-7B on our transformed programs improves the performance by up to \\textbf{30\\%} compared to fine-tuning on the original dataset. Additionally, we demonstrate improved performance from using a smaller amount of higher-quality data, finding that a model fine-tuned on the entire original dataset is outperformed by a model trained on one-eighth of our cleaned dataset. Even in comparison to closed-source models, our models outperform the much larger AlphaCode models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=maRYffiUpI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17884,
    "title": "Class Probability Matching with Calibrated Networks for Label Shift Adaption",
    "authors": [
      "Hongwei Wen",
      "Annika Betken",
      "Hanyuan Hang"
    ],
    "abstract": "We consider the domain adaptation problem in the context of label shift, where the label distributions  between source and target domain differ, but the conditional distributions of features given the label are the same. To solve the label shift adaption problem, we develop a novel matching framework named \\textit{class probability matching} (\\textit{CPM}). It is inspired by a new understanding of the source domain's class probability, as well as a specific relationship between class probability ratios and feature probability ratios between the source and target domains. CPM is able to maintain the same theoretical guarantee with the existing feature probability matching framework, while significantly improving the computational efficiency due to directly matching the probabilities of the label variable. Within the CPM framework, we propose an algorithm named \\textit{class probability matching with calibrated networks} (\\textit{CPMCN}) for target domain classification. From the theoretical perspective, we establish the generalization bound of the CPMCN method in order to explain the benefits of introducing calibrated networks. From the experimental perspective, real data comparisons show that CPMCN outperforms existing matching-based and EM-based algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mliQ2huFrZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17882,
    "title": "Open the Black Box: Step-based Policy Updates for Temporally-Correlated Episodic Reinforcement Learning",
    "authors": [
      "Ge Li",
      "Hongyi Zhou",
      "Dominik Roth",
      "Serge Thilges",
      "Fabian Otto",
      "Rudolf Lioutikov",
      "Gerhard Neumann"
    ],
    "abstract": "In applying Reinforcement Learning (RL) to robot trajectory generation, two key challenges commonly emerge. First, the stochastic exploration strategies of step-based RL are unable to produce high-order smooth trajectories. Second, existing methods struggle with effectively modeling movement correlations among different time steps and degrees of freedom, which are crucial for complex tasks and safety measures. Episodic RL methods address these challenges by employing parameterized trajectory generators like Movement Primitives (MP), framing the problem as contextual optimization. While effective in generating smooth trajectories and capturing some movement correlations, these methods lack in utilizing temporal structure within trajectories, resulting in suboptimal sample efficiency. We introduce the Temporally-Correlated Episodic RL (TCE) method to address these shortcomings. TCE enhances exploration efficiency by sampling multi-second trajectories in a parameterized space, thereby assuring high-order trajectory smoothness and the capture of movement correlations. For policy updates, TCE breaks down the entire trajectory into smaller segments, evaluating each segment on its distinct advantages. This nuanced approach allows us to utilize temporal information obtained during trajectory execution.We validate the effectiveness of TCE through experiments on various robotic manipulation tasks, showing its advantages over step-based and episodic RL approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mnipav175N",
    "arxiv_id": "2401.11437",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17878,
    "title": "FedCompass: Efficient Cross-Silo Federated Learning on Heterogeneous Client Devices Using a Computing Power-Aware Scheduler",
    "authors": [
      "Zilinghan Li",
      "Pranshu Chaturvedi",
      "Shilan He",
      "Han Chen",
      "Gagandeep Singh",
      "Volodymyr Kindratenko",
      "Eliu A Huerta",
      "Kibaek Kim",
      "Ravi Madduri"
    ],
    "abstract": "Cross-silo federated learning offers a promising solution to collaboratively train robust and generalized AI models without compromising the privacy of local datasets, e.g., healthcare, financial, as well as scientific projects that lack a centralized data facility. Nonetheless, because of the disparity of computing resources among different clients (i.e., device heterogeneity), synchronous federated learning algorithms suffer from degraded efficiency when waiting for straggler clients. Similarly, asynchronous federated learning algorithms experience degradation in the convergence rate and final model accuracy on non-identically and independently distributed (non-IID) heterogeneous datasets due to stale local models and client drift. To address these limitations in cross-silo federated learning with heterogeneous clients and data, we propose FedCompass, an innovative semi-asynchronous federated learning algorithm with a computing power-aware scheduler on the server side, which adaptively assigns varying amounts of training tasks to different clients using the knowledge of the computing power of individual clients. FedCompass ensures that multiple locally trained models from clients are received almost simultaneously as a group for aggregation, effectively reducing the staleness of local models. At the same time, the overall training process remains asynchronous, eliminating prolonged waiting periods from straggler clients. Using diverse non-IID heterogeneous distributed datasets, we demonstrate that FedCompass achieves faster convergence and higher accuracy than other asynchronous algorithms while remaining more efficient than synchronous algorithms when performing federated learning on heterogeneous clients.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=msXxrttLOi",
    "arxiv_id": "2309.14675",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17876,
    "title": "Mega-TTS 2: Boosting Prompting Mechanisms for Zero-Shot Speech Synthesis",
    "authors": [
      "Ziyue Jiang",
      "Jinglin Liu",
      "Yi Ren",
      "Jinzheng He",
      "Zhenhui Ye",
      "Shengpeng Ji",
      "Qian Yang",
      "Chen Zhang",
      "Pengfei Wei",
      "Chunfeng Wang",
      "Xiang Yin",
      "Zejun MA",
      "Zhou Zhao"
    ],
    "abstract": "Zero-shot text-to-speech (TTS) aims to synthesize voices with unseen speech prompts, which significantly reduces the data and computation requirements for voice cloning by skipping the fine-tuning process. However, the prompting mechanisms of zero-shot TTS still face challenges in the following aspects: 1) previous works of zero-shot TTS are typically trained with single-sentence prompts, which significantly restricts their performance when the data is relatively sufficient during the inference stage. 2) The prosodic information in prompts is highly coupled with timbre, making it untransferable to each other. This paper introduces Mega-TTS, a generic prompting mechanism for zero-shot TTS, to tackle the aforementioned challenges. Specifically, we design a powerful acoustic autoencoder that separately encodes the prosody and timbre information into the compressed latent space while providing high-quality reconstructions. Then, we propose a multi-reference timbre encoder and a prosody latent language model (P-LLM) to extract useful information from multi-sentence prompts. We further leverage the probabilities derived from multiple P-LLM outputs to produce transferable and controllable prosody. Experimental results demonstrate that Mega-TTS could not only synthesize identity-preserving speech with a short prompt of an unseen speaker from arbitrary sources but consistently outperform the fine-tuning method when the volume of data ranges from 10 seconds to 5 minutes. Furthermore, our method enables to transfer various speaking styles to the target timbre in a fine-grained and controlled manner. Audio samples can be found in https://boostprompt.github.io/boostprompt/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mvMI3N4AvD",
    "arxiv_id": "2307.07218",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17877,
    "title": "Views Can Be Deceiving: Improved SSL Through Feature Space Augmentation",
    "authors": [
      "Kimia Hamidieh",
      "Haoran Zhang",
      "Swami Sankaranarayanan",
      "Marzyeh Ghassemi"
    ],
    "abstract": "Supervised learning methods have been found to exhibit inductive biases favoring simpler features. When such features are spuriously correlated with the label, this can result in suboptimal performance on minority subgroups. Despite the growing popularity of methods which learn from unlabeled data, the extent to which these representations rely on spurious features for prediction is unclear. In this work, we explore the impact of spurious features on Self-Supervised Learning (SSL) for visual representation learning. We first empirically show that commonly used augmentations in SSL can cause undesired invariances in the image space, and illustrate this with a simple example. We further show that classical approaches in combating spurious correlations, such as dataset re-sampling during SSL, do not consistently lead to invariant representations. Motivated by these findings, we propose LateTVG to remove spurious information from these representations during pre-training, by regularizing later layers of the encoder via pruning. We find that our method produces representations which outperform the baselines on several benchmarks, without the need for group or label information during SSL.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=mutJBk3ILg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17875,
    "title": "OctoPack: Instruction Tuning Code Large Language Models",
    "authors": [
      "Niklas Muennighoff",
      "Qian Liu",
      "Armel Randy Zebaze",
      "Qinkai Zheng",
      "Binyuan Hui",
      "Terry Yue Zhuo",
      "Swayam Singh",
      "Xiangru Tang",
      "Leandro Von Werra",
      "Shayne Longpre"
    ],
    "abstract": "Finetuning large language models (LLMs) on instructions leads to vast performance improvements on natural language tasks. We apply instruction tuning using code, leveraging the natural structure of Git commits, which pair code changes with human instructions. We compile CommitPack: 4 terabytes of Git commits across 350 programming languages. We benchmark CommitPack against other natural and synthetic code instructions (xP3x, Self-Instruct, OASST) on the 16B parameter StarCoder model, and achieve state-of-the-art performance among models not trained on OpenAI outputs, on the HumanEval Python benchmark (46.2% pass@1). We further introduce HumanEvalPack, expanding the HumanEval benchmark to a total of 3 coding tasks (Code Repair, Code Explanation, Code Synthesis) across 6 languages (Python, JavaScript, Java, Go, C++, Rust). Our models, OctoCoder and OctoGeeX, achieve the best performance across HumanEvalPack among all permissive models, demonstrating CommitPack's benefits in generalizing to a wider set of languages and natural coding tasks. Code, models and data are freely available at https://github.com/bigcode-project/octopack.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=mw1PWNSWZP",
    "arxiv_id": "2308.07124",
    "GitHub": [
      "https://github.com/bigcode-project/octopack"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17874,
    "title": "Scalable Language Model with Generalized Continual Learning",
    "authors": [
      "Bohao PENG",
      "Zhuotao Tian",
      "Shu Liu",
      "Ming-Chang Yang",
      "Jiaya Jia"
    ],
    "abstract": "Continual learning has gained increasing importance as it facilitates the acquisition and refinement of scalable knowledge and skills in language models. However, existing methods typically encounter strict limitations and challenges in real-world scenarios, such as reliance on experience replay, optimization constraints, and inference task-ID. In this study, we introduce the Scalable Language Model (SLM) to overcome these limitations within a more challenging and generalized setting, representing a significant advancement toward practical applications for continual learning. Specifically, we propose the Joint Adaptive Re-Parameterization (JARe), integrated with Dynamic Task-related Knowledge Retrieval (DTKR), to enable adaptive adjustment of language models based on specific downstream tasks. This approach leverages the task distribution within the vector space, aiming to achieve a smooth and effortless continual learning process. Our method demonstrates state-of-the-art performance on diverse backbones and benchmarks, achieving effective continual learning in both full-set and few-shot scenarios with minimal forgetting. Moreover, while prior research primarily focused on a single task type such as classification, our study goes beyond, with the large language model, i.e., LLaMA-2, to explore the effects across diverse domains and task types, such that a single language model can be decently scaled to broader applications. The code and models will be released to the public.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mz8owj4DXu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17873,
    "title": "Expressive Losses for Verified Robustness via Convex Combinations",
    "authors": [
      "Alessandro De Palma",
      "Rudy R Bunel",
      "Krishnamurthy Dj Dvijotham",
      "M. Pawan Kumar",
      "Robert Stanforth",
      "Alessio Lomuscio"
    ],
    "abstract": "In order to train networks for verified adversarial robustness, it is common to over-approximate the worst-case loss over perturbation regions, resulting in networks that attain verifiability at the expense of standard performance.As shown in recent work, better trade-offs between accuracy and robustness can be obtained by carefully coupling adversarial training with over-approximations. We hypothesize that the expressivity of a loss function, which we formalize as the ability to span a range of trade-offs between lower and upper bounds to the worst-case loss through a single parameter (the over-approximation coefficient), is key to attaining state-of-the-art performance. To support our hypothesis, we show that trivial expressive losses, obtained via convex combinations between adversarial attacks and IBP bounds, yield state-of-the-art results across a variety of settings in spite of their conceptual simplicity.We provide a detailed analysis of the relationship between the over-approximation coefficient and performance profiles across different expressive losses, showing that, while expressivity is essential, better approximations of the worst-case loss are not necessarily linked to superior robustness-accuracy trade-offs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mzyZ4wzKlM",
    "arxiv_id": "2305.13991",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17872,
    "title": "HAZARD Challenge: Embodied Decision Making in Dynamically Changing Environments",
    "authors": [
      "Qinhong Zhou",
      "Sunli Chen",
      "Yisong Wang",
      "Haozhe Xu",
      "Weihua Du",
      "Hongxin Zhang",
      "Yilun Du",
      "Joshua B. Tenenbaum",
      "Chuang Gan"
    ],
    "abstract": "Recent advances in high-fidelity virtual environments serve as one of the major driving forces for building intelligent embodied agents to perceive, reason and interact with the physical world. Typically, these environments remain unchanged unless agents interact with them. However, in real-world scenarios, agents might also face dynamically changing environments characterized by unexpected events and need to rapidly take action accordingly. To remedy this gap, we propose a new simulated embodied benchmark, called HAZARD, specifically designed to assess the decision-making abilities of embodied agents in dynamic situations. HAZARD consists of three unexpected disaster scenarios, including fire, flood, and wind, and specifically supports the utilization of large language models (LLMs) to assist common sense reasoning and decision-making. This benchmark enables us to evaluate autonomous agents' decision-making capabilities across various pipelines, including reinforcement learning (RL), rule-based, and search-based methods in dynamically changing environments. As a first step toward addressing this challenge using large language models, we further develop an LLM-based agent and perform an in-depth analysis of its promise and challenge of solving these challenging tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=n6mLhaBahJ",
    "arxiv_id": "2401.12975",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17871,
    "title": "Mayfly: a Neural Data Structure for Graph Stream Summarization",
    "authors": [
      "Yuan Feng",
      "Yukun Cao",
      "Wang Hairu",
      "Xike Xie",
      "S Kevin Zhou"
    ],
    "abstract": "A graph is a structure made up of vertices and edges used to represent complex relationships between entities, while a graph stream is a continuous flow of graph updates that convey evolving relationships between entities. The massive volume and high dynamism of graph streams promote research on data structures of graph summarization, which provides a concise and approximate view of graph streams with sub-linear space and linear construction time, enabling real-time graph analytics in various domains, such as social networking, financing, and cybersecurity.In this work, we propose the Mayfly, the first neural data structure for summarizing graph streams. The Mayfly replaces handcrafted data structures with better accuracy and adaptivity.To cater to practical applications, Mayfly incorporates two offline training phases.During the larval phase, the Mayfly learns basic summarization abilities from automatically and synthetically constituted meta-tasks, and in the metamorphosis phase, it rapidly adapts to real graph streams via meta-tasks.With specific configurations of information pathways, the Mayfly enables flexible support for miscellaneous graph queries, including edge, node, and connectivity queries.Extensive empirical studies show that the Mayfly significantly outperforms its handcrafted competitors.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=n7Sr8SW4bn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17870,
    "title": "The Consensus Game: Language Model Generation via Equilibrium Search",
    "authors": [
      "Athul Paul Jacob",
      "Yikang Shen",
      "Gabriele Farina",
      "Jacob Andreas"
    ],
    "abstract": "When applied to question answering and other text generation tasks, language models (LMs) may be queried generatively (by sampling answers from their output distribution) or discriminatively (by using them to score or rank a set of candidate answers). These procedures sometimes yield very different predictions. How do we reconcile mutually incompatible scoring procedures to obtain coherent LM predictions? We introduce a new, a training-free, game-theoretic procedure for language model decoding. Our approach casts language model decoding as a regularized imperfect-information sequential signaling game\u2014which we term the concensus game\u2014in which a generator seeks to communicate an abstract correctness parameter using natural language sentences to a discriminator. We develop computational procedures for finding approximate equilibria of this game, resulting in a decoding algorithm we call equilibrium-ranking. Applied to a large number of tasks (including reading comprehension, commonsense reasoning, mathematical problem-solving, and assistive dialog), equilibrium-ranking consistently improves performance over existing LM decoding procedures. These improvements are sometimes substantial\u2014on multiple benchmarks, we observe that applying equilibrium-ranking to LLaMA-7B outperforms the much larger LLaMA-65B and PaLM-540B models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=n9xeGcI4Yg",
    "arxiv_id": "2310.09139",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17869,
    "title": "Federated Orthogonal Training: Mitigating Global Catastrophic Forgetting in Continual Federated Learning",
    "authors": [
      "Yavuz Faruk Bakman",
      "Duygu Nur Yaldiz",
      "Yahya H. Ezzeldin",
      "Salman Avestimehr"
    ],
    "abstract": "Federated Learning (FL) has gained significant attraction due to its ability to enable privacy-preserving training over decentralized data. Current literature in FL mostly focuses on single-task learning. However, over time, new tasks may appear in the clients and the global model should learn these tasks without forgetting previous tasks. This real-world scenario is known as Continual Federated Learning (CFL). The main challenge of CFL is \\textit{Global Catastrophic Forgetting}, which corresponds to the fact that when the global model is trained on new tasks, its performance on old tasks decreases. There have been a few recent works on CFL to propose methods that aim to address the global catastrophic forgetting problem. However, these works either have unrealistic assumptions on the availability of past data samples or violate the privacy principles of FL. We propose a novel method, Federated Orthogonal Training (FOT), to overcome these drawbacks and address the global catastrophic forgetting in CFL. Our algorithm extracts the global input subspace of each layer for old tasks and modifies the aggregated updates of new tasks such that they are orthogonal to the global principal subspace of old tasks for each layer. This decreases the interference between tasks, which is the main cause for forgetting. % Our method is almost computation-free on the client side and has negligible communication cost. We empirically show that FOT outperforms state-of-the-art continual learning methods in the CFL setting, achieving an average accuracy gain of up to 15% with 27% lower forgetting while only incurring a minimal computation and communication cost.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nAs4LdaP9Y",
    "arxiv_id": "2309.01289",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17868,
    "title": "Self-Supervised Contrastive Learning for Long-term Forecasting",
    "authors": [
      "Junwoo Park",
      "Daehoon Gwak",
      "Jaegul Choo",
      "Edward Choi"
    ],
    "abstract": "Long-term forecasting presents unique challenges due to the time and memorycomplexity of handling long sequences. Existing methods, which rely on sliding windows to process long sequences, struggle to effectively capture long-term variations that are partially caught within the short window (i.e., outer-window variations). In this paper, we introduce a novel approach that overcomes this limitation by employing contrastive learning and enhanced decomposition architecture,specifically designed to focus on long-term variations. To this end, our contrastiveloss incorporates global autocorrelation held in the whole time series, which facilitates the construction of positive and negative pairs in a self-supervised manner. When combined with our decomposition networks, our constrative learning significantly improves long-term forecasting performance. Extensive experiments demonstrate that our approach outperforms 14 baseline models on well-establishednine long-term benchmarks, especially in challenging scenarios that require a significantly long output for forecasting. This paper not only presents a novel direction for long-term forecasting but also offers a more reliable method for effectively integrating long-term variations into time-series representation learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nBCuRzjqK7",
    "arxiv_id": "2402.02023",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17866,
    "title": "Communication-Efficient Federated Non-Linear Bandit Optimization",
    "authors": [
      "Chuanhao Li",
      "Chong Liu",
      "Yu-Xiang Wang"
    ],
    "abstract": "Federated optimization studies the problem of collaborative function optimization among multiple clients (e.g. mobile devices or organizations) under the coordination of a central server. Since the data is collected separately by each client and always remains decentralized, federated optimization preserves data privacy and allows for large-scale computing, which makes it a promising decentralized machine learning paradigm. Though it is often deployed for tasks that are online in nature, e.g., next-word prediction on keyboard apps, most works formulate it as an offline problem. The few exceptions that consider federated bandit optimization are limited to very simplistic function classes, e.g., linear, generalized linear, or non-parametric function class with bounded RKHS norm, which severely hinders its practical usage. In this paper, we propose a new algorithm, named Fed-GO-UCB, for federated bandit optimization with generic non-linear objective function. Under some mild conditions, we rigorously prove that Fed-GO-UCB is able to achieve sub-linear rate for both cumulative regret and communication cost. At the heart of our theoretical analysis are distributed regression oracle and individual confidence set construction, which can be of independent interests. Empirical evaluations also demonstrate the effectiveness of the proposed algorithm.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nFI3wFM9yN",
    "arxiv_id": "2311.01695",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17863,
    "title": "Structural Estimation of Partially Observed Linear Non-Gaussian Acyclic Model: A Practical Approach with Identifiability",
    "authors": [
      "Songyao Jin",
      "Feng Xie",
      "Guangyi Chen",
      "Biwei Huang",
      "Zhengming Chen",
      "Xinshuai Dong",
      "Kun Zhang"
    ],
    "abstract": "Conventional causal discovery approaches, which seek to uncover causal relationships among measured variables, are typically fragile to the presence of latent variables. While various methods have been developed to address this confounding issue, they often rely on strong assumptions about the underlying causal structure. In this paper, we consider a general scenario where measured and latent variables collectively form a partially observed causally sufficient linear system and latent variables may be anywhere in the causal structure. We theoretically show that with the aid of high-order statistics, the causal graph is (almost) fully identifiable if, roughly speaking, each latent set has a sufficient number of pure children, which can be either latent or measured. Naturally, LiNGAM, a model without latent variables, is encompassed as a special case. Based on the identification theorem, we develop a principled algorithm to identify the causal graph by testing for statistical independence involving only measured variables in specific manners. Experimental results show that our method effectively recovers the causal structure, even when latent variables are influenced by measured variables.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nHkMm0ywWm",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17862,
    "title": "Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?",
    "authors": [
      "Tokio Kajitsuka",
      "Issei Sato"
    ],
    "abstract": "Existing analyses of the expressive capacity of Transformer models have required excessively deep layers for data memorization, leading to a discrepancy with the Transformers actually used in practice. This is primarily due to the interpretation of the softmax function as an approximation of the hardmax function.By clarifying the connection between the softmax function and the Boltzmann operator, we prove that a single layer of self-attention with low-rank weight matrices possesses the capability to perfectly capture the context of an entire input sequence.As a consequence, we show that one-layer and single-head Transformers have a memorization capacity for finite samples, and that Transformers consisting of one self-attention layer with two feed-forward neural networks are universal approximators for continuous functions on a compact domain.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nJnky5K944",
    "arxiv_id": "2307.14023",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17861,
    "title": "Input-gradient space particle inference for neural network ensembles",
    "authors": [
      "Trung Trinh",
      "Markus Heinonen",
      "Luigi Acerbi",
      "Samuel Kaski"
    ],
    "abstract": "Deep Ensembles (DEs) demonstrate improved accuracy, calibration and robustness to perturbations over single neural networks partly due to their functional diversity. Particle-based variational inference (ParVI) methods enhance diversity by formalizing a repulsion term based on a network similarity kernel. However, weight-space repulsion is inefficient due to over-parameterization, while direct function-space repulsion has been found to produce little improvement over DEs. To sidestep these difficulties, we propose First-order Repulsive Deep Ensemble (FoRDE), an ensemble learning method based on ParVI, which performs repulsion in the space of first-order input gradients. As input gradients uniquely characterize a function up to translation and are much smaller in dimension than the weights, this method guarantees that ensemble members are functionally different. Intuitively, diversifying the input gradients encourages each network to learn different features, which is expected to improve the robustness of an ensemble. Experiments on image classification datasets and transfer learning tasks show that FoRDE significantly outperforms the gold-standard DEs and other ensemble methods in accuracy and calibration under covariate shift due to input perturbations.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=nLWiR5P3wr",
    "arxiv_id": "2306.02775",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17860,
    "title": "CircuitNet 2.0: An Advanced Dataset for Promoting Machine Learning Innovations in Realistic Chip Design Environment",
    "authors": [
      "Xun Jiang",
      "zhuomin chai",
      "Yuxiang Zhao",
      "Yibo Lin",
      "Runsheng Wang",
      "Ru Huang"
    ],
    "abstract": "Integrated circuits or chips are key to enable computing in modern industry. Designing a chip relies on human experts to produce chip data through professional electronic design automation (EDA) software and complicated procedures. Nowadays, prompted by the wide variety of machine learning (ML) datasets, we have witnessed great advancement of ML algorithms in computer vision, natural language processing, and other fields. However, in chip design, high human workload and data sensitivity cause the lack of public datasets, which hinders the progress of ML development for EDA. To this end, we introduce an advanced large-scale dataset, CircuitNet 2.0, which targets promoting ML innovations in a realistic chip design environment. In order to approach the realistic chip design space, we collect more than 10,000 samples with a variety of chip designs (e.g., CPU, GPU, and AI Chip). All the designs are conducted through complete commercial design flows in a widely-used technology node, 14nm FinFET. We collect comprehensive data, including routability, timing, and power, from the design flow to support versatile ML tasks in EDA. Besides, we also introduce some realistic ML tasks with CircuitNet 2.0 to verify the potential for boosting innovations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nMFSUjxMIl",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17858,
    "title": "FedInverse: Evaluating Privacy Leakage in Federated Learning",
    "authors": [
      "Di Wu",
      "Jun Bai",
      "Yiliao Song",
      "Junjun Chen",
      "Wei Zhou",
      "Yong Xiang",
      "Atul Sajjanhar"
    ],
    "abstract": "Federated Learning (FL) is a distributed machine learning technique where multiple devices (such as smartphones or IoT devices) train a shared global model by using their local data. FL claims that the data privacy of local participants is preserved well because local data will not be shared with either the server-side or other training participants. However, this paper discovers a pioneering finding that a model inversion (MI) attacker, who acts as a benign participant, can invert the shared global model and obtain the data belonging to other participants. This will lead to severe data-leakage risk in FL because it is difficult to identify attackers from benign participants.In addition, we found even the most advanced defense approaches could not effectively address this issue. Therefore, it is important to evaluate such data-leakage risks of an FL system before using it. To alleviate this issue, we propose FedInverse to evaluate whether the FL global model can be inverted by MI attackers. In particular, FedInverse can be optimized by leveraging the Hilbert-Schmidt independence criterion (HSIC) as a regularizer to adjust the diversity of the MI attack generator. We test FedInverse with three typical MI attackers, GMI, KED-MI, and VMI, and the experiments show our FedInverse method can successfully obtain the data belonging to other participants.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nTNgkEIfeb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17857,
    "title": "Rethinking the Power of Graph Canonization in Graph Representation Learning with Stability",
    "authors": [
      "Zehao Dong",
      "Muhan Zhang",
      "Philip Payne",
      "Michael A Province",
      "Carlos Cruchaga",
      "Tianyu Zhao",
      "Fuhai Li",
      "Yixin Chen"
    ],
    "abstract": "The expressivity of Graph Neural Networks (GNNs) has been studied broadly in recent years to reveal the design principles for more powerful GNNs. Graph canonization is known as a typical approach to distinguish non-isomorphic graphs, yet rarely adopted when developing expressive GNNs. This paper proposes to maximize the expressivity of GNNs by graph canonization, then the power of such GNNs is studies from the perspective of model stability. A stable GNN will map similar graphs to close graph representations in the vectorial space, and the stability of GNNs is critical to generalize their performance to unseen graphs. We theoretically reveal the trade-off of expressivity and stability in graph-canonization-enhanced GNNs. Then we introduce a notion of universal graph canonization as the general solution to address the trade-off and characterize a widely applicable sufficient condition to solve the universal graph canonization. A comprehensive set of experiments demonstrates the effectiveness of the proposed method. In many popular graph benchmark datasets, graph canonization successfully enhances GNNs and provides highly competitive performance, indicating the capability and great potential of proposed method in general graph representation learning. In graph datasets where the sufficient condition holds, GNNs enhanced by universal graph canonization consistently outperform GNN baselines and successfully improve the SOTA performance up to $31$%, providing the optimal solution to numerous challenging real-world graph analytical tasks like gene network representation learning in bioinformatics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nTwb2vBLOV",
    "arxiv_id": "2309.00738",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17856,
    "title": "Tight Rates in Supervised Outlier Transfer Learning",
    "authors": [
      "Mohammadreza Mousavi Kalan",
      "Samory Kpotufe"
    ],
    "abstract": "A critical barrier to learning an accurate decision rule for outlier detection is the scarcity of outlier data. As such, practitioners often turn to the use of similar but imperfect outlier data from which they might \\emph{transfer} information to the target outlier detection task. Despite the recent empirical success of transfer learning in outlier detection, a fundamental understanding of when and how knowledge can be transferred from a source to a target in outlier detection remains elusive. In this work, we adopt the traditional framework of Neyman-Pearson classification---which formalizes \\emph{supervised outlier detection}, i.e., unbalanced classification---with the added assumption that we have access to both source and (some or no) target outlier data. Our main results are then as follows:We first determine the information-theoretic limits of the problem under a measure of discrepancy that extends some existing notions from traditional balanced classification; interestingly, unlike in balanced classification, seemingly very dissimilar sources can provide much information about a target, thus resulting in fast transfer.We then show that, in principle, these information-theoretic limits are achievable by \\emph{adaptive} procedures, i.e., procedures with no a priori information on the discrepancy between source and target distributions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nUBLhhVM1l",
    "arxiv_id": "2310.04686",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17855,
    "title": "MIntRec2.0: A Large-scale Benchmark Dataset for Multimodal Intent Recognition and Out-of-scope Detection in Conversations",
    "authors": [
      "Hanlei Zhang",
      "Xin Wang",
      "Hua Xu",
      "Qianrui Zhou",
      "Kai Gao",
      "Jianhua Su",
      "jinyue Zhao",
      "Wenrui Li",
      "Yanting Chen"
    ],
    "abstract": "Multimodal intent recognition poses significant challenges, requiring the incorporation of non-verbal modalities from real-world contexts to enhance the comprehension of human intentions. However, most existing multimodal intent benchmark datasets are limited in scale and suffer from difficulties in handling out-of-scope samples that arise in multi-turn conversational interactions. In this paper, we introduce MIntRec2.0, a large-scale benchmark dataset for multimodal intent recognition in multi-party conversations. It contains 1,245 high-quality dialogues with 15,040 samples, each annotated within a new intent taxonomy of 30 fine-grained classes, across text, video, and audio modalities. In addition to more than 9,300 in-scope samples, it also includes over 5,700 out-of-scope samples appearing in multi-turn contexts, which naturally occur in real-world open scenarios, enhancing its practical applicability. Furthermore, we provide comprehensive information on the speakers in each utterance, enriching its utility for multi-party conversational research. We establish a general framework supporting the organization of single-turn and multi-turn dialogue data, modality feature extraction, multimodal fusion, as well as in-scope classification and out-of-scope detection. Evaluation benchmarks are built using classic multimodal fusion methods, ChatGPT, and human evaluators. While existing methods incorporating nonverbal information yield improvements, effectively leveraging context information and detecting out-of-scope samples remains a substantial challenge. Notably, powerful large language models exhibit a significant performance gap compared to humans, highlighting the limitations of machine learning methods in the advanced cognitive intent understanding task. We believe that MIntRec2.0 will serve as a valuable resource, providing a pioneering foundation for research in human-machine conversational interactions, and significantly facilitating related applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nY9nITZQjc",
    "arxiv_id": "2403.10943",
    "GitHub": [
      "https://github.com/thuiar/MIntRec2.0"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17854,
    "title": "Optimal transport based adversarial patch to leverage large scale attack transferability",
    "authors": [
      "Pol Labarbarie",
      "Adrien CHAN-HON-TONG",
      "St\u00e9phane Herbin",
      "Milad Leyli-abadi"
    ],
    "abstract": "Adversarial patch attacks, where a small patch is placed in the scene to fool neural networks, have been studied for numerous applications. Focusing on image classification, we consider the setting of a black-box transfer attack where an attacker does not know the target model. Instead of forcing corrupted image representations to cross the nearest decision boundaries or converge to a particular point, we propose a distribution-oriented approach. We rely on optimal transport to push the feature distribution of attacked images towards an already modeled distribution. We show that this new distribution-oriented approach leads to better transferable patches. Through digital experiments conducted on ImageNet-1K, we provide evidence that our new patches are the only ones that can simultaneously influence multiple Transformer models and Convolutional Neural Networks. Physical world experiments demonstrate that our patch can affect systems in deployment without explicit knowledge.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nZP10evtkV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17853,
    "title": "AdaMerging: Adaptive Model Merging for Multi-Task Learning",
    "authors": [
      "Enneng Yang",
      "Zhenyi Wang",
      "Li Shen",
      "Shiwei Liu",
      "Guibing Guo",
      "Xingwei Wang",
      "Dacheng Tao"
    ],
    "abstract": "Multi-task learning (MTL) aims to empower a model to tackle multiple tasks simultaneously. A recent development known as task arithmetic has revealed that several models, each fine-tuned for distinct tasks, can be directly merged into a single model to execute MTL without necessitating a retraining process using the initial training data. Nevertheless, this direct addition of models often leads to a significant deterioration in the overall performance of the merged model. This decline occurs due to potential conflicts and intricate correlations among the multiple tasks. Consequently, the challenge emerges of how to merge pre-trained models more effectively without using their original training data. This paper introduces an innovative technique called Adaptive Model Merging (AdaMerging). This approach aims to autonomously learn the coefficients for model merging, either in a task-wise or layer-wise manner, without relying on the original training data. Specifically, our AdaMerging method operates as an automatic, unsupervised task arithmetic scheme. It leverages entropy minimization on unlabeled test samples from the multi-task setup as a surrogate objective function to iteratively refine the merging coefficients of the multiple models. Our experimental findings across eight tasks demonstrate the efficacy of the AdaMerging scheme we put forth. Compared to the current state-of-the-art (SOTA) task arithmetic merging scheme, AdaMerging showcases a remarkable 11\\% improvement in performance. Notably, AdaMerging also exhibits superior generalization capabilities when applied to unseen downstream tasks. Furthermore, it displays a significantly enhanced robustness to data distribution shifts that may occur during the testing phase.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nZP6NgD3QY",
    "arxiv_id": "2310.02575",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17852,
    "title": "Out-of-Distribution Detection with Negative Prompts",
    "authors": [
      "Jun Nie",
      "Yonggang Zhang",
      "Zhen Fang",
      "Tongliang Liu",
      "Bo Han",
      "Xinmei Tian"
    ],
    "abstract": "Out-of-distribution (OOD) detection is indispensable for open-world machine learning models. Inspired by recent success in large pre-trained language-vision models, e.g., CLIP, advanced works have achieved impressive OOD detection results by matching the *similarity* between image features and features of learned prompts, i.e., positive prompts. However, existing works typically struggle with OOD samples having similar features with those of known classes. One straightforward approach is to introduce negative prompts to achieve a *dissimilarity* matching, which further assesses the anomaly level of image features by introducing the absence of specific features. Unfortunately, our experimental observations show that either employing a prompt like \"not a photo of a\" or learning a prompt to represent \"not containing\" fails to capture the dissimilarity for identifying OOD samples. The failure may be contributed to the diversity of negative features, i.e., tons of features could indicate features not belonging to a known class. To this end, we propose to learn a set of negative prompts for each class. The learned positive prompt (for all classes) and negative prompts (for each class) are leveraged to measure the similarity and dissimilarity in the feature space simultaneously, enabling more accurate detection of OOD samples. Extensive experiments are conducted on diverse OOD detection benchmarks, showing the effectiveness of our proposed method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nanyAujl6e",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17851,
    "title": "FedCDA: Federated Learning with Cross-rounds Divergence-aware Aggregation",
    "authors": [
      "Haozhao Wang",
      "Haoran Xu",
      "Yichen Li",
      "Yuan Xu",
      "Ruixuan Li",
      "Tianwei Zhang"
    ],
    "abstract": "In Federated Learning (FL), model aggregation is pivotal. It involves a global server iteratively aggregating client local trained models in successive rounds without accessing private data. Traditional methods typically aggregate the local model from the current round alone. However, due to the statistical heterogeneity across clients, the local model from each client may be greatly diverse, making the obtained global model incapable of maintaining their specific knowledge. In this paper, we introduce a novel method, FedCDA, which selectively aggregates local models from various rounds, decreasing discrepancies between local models. The principle behind FedCDA is that the local model from each client may converge to distinct local optima over rounds due to the varied received global models and non-convex essences of deep neural networks, and each local model fits its local data well. Therefore, for each client, we select a local model from multiple rounds to minimize the divergence from other clients. This ensures the aggregated global model remains aligned with all selected local models to maintain their data knowledge. Extensive experiments conducted on various models and datasets reveal our approach outperforms state-of-the-art aggregation methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nbPGqeH3lt",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17850,
    "title": "An Image Is Worth 1000 Lies: Transferability of Adversarial Images across Prompts on Vision-Language Models",
    "authors": [
      "Haochen Luo",
      "Jindong Gu",
      "Fengyuan Liu",
      "Philip Torr"
    ],
    "abstract": "Different from traditional task-specific vision models, recent large VLMs can readily adapt to different vision tasks by simply using different textual instructions, i.e., prompts. However, a well-known concern about traditional task-specific vision models is that they can be misled by imperceptible adversarial perturbations. Furthermore, the concern is exacerbated by the phenomenon that the same adversarial perturbations can fool different task-specific models. Given that VLMs rely on prompts to adapt to different tasks, an intriguing question emerges: Can a single adversarial image mislead all predictions of VLMs when a thousand different prompts are given? This question essentially introduces a novel perspective on adversarial transferability: cross-prompt adversarial transferability. In this work, we propose the Cross-Prompt Attack (CroPA). This proposed method updates the visual adversarial perturbation with learnable textual prompts, which are designed to counteract the misleading effects of the adversarial image. By doing this, CroPA significantly improves the transferability of adversarial examples across prompts. Extensive experiments are conducted to verify the strong cross-prompt adversarial transferability of CroPA with prevalent VLMs including Flamingo, BLIP-2, and InstructBLIP in various different tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=nc5GgFAvtk",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17849,
    "title": "Analysis of Learning a Flow-based Generative Model from Limited Sample Complexity",
    "authors": [
      "Hugo Cui",
      "Florent Krzakala",
      "Eric Vanden-Eijnden",
      "Lenka Zdeborova"
    ],
    "abstract": "We study the problem of training a flow-based generative model, parametrized by a two-layer autoencoder, to sample from a high-dimensional Gaussian mixture. We provide a sharp end-to-end analysis of the problem. First, we provide a tight closed-form characterization of the learnt velocity field, when parametrized by a shallow denoising auto-encoder trained on a finite number $n$ of samples from the target distribution. Building on this analysis, we provide a sharp description of the corresponding generative flow, which pushes the base Gaussian density forward to an approximation of the target density. In particular, we provide closed-form formulae for the distance between the means of the generated mixture and the mean of the target mixture, which we show decays as $\\Theta_n(\\frac{1}{n})$. Finally, this rate is shown to be in fact Bayes-optimal.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ndCJeysCPe",
    "arxiv_id": "2310.03575",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17848,
    "title": "Escape Sky-high Cost: Early-stopping Self-Consistency for Multi-step Reasoning",
    "authors": [
      "Yiwei Li",
      "Peiwen Yuan",
      "Shaoxiong Feng",
      "Boyuan Pan",
      "Xinglin Wang",
      "Bin Sun",
      "Heda Wang",
      "Kan Li"
    ],
    "abstract": "Self-consistency (SC) has been a widely used decoding strategy for chain-of-thought reasoning. Despite bringing significant performance improvements across a variety of multi-step reasoning tasks, it is a high-cost method that requires multiple sampling with the preset size. In this paper, we propose a simple and scalable sampling process, Early-Stopping Self-Consistency (ESC), to greatly reduce the cost of SC without sacrificing performance. On this basis, one control scheme for ESC is further derivated to dynamically choose the performance-cost balance for different tasks and models. To demonstrate ESC's effectiveness, we conducted extensive experiments on three popular categories of reasoning tasks: arithmetic, commonsense and symbolic reasoning over language models with varying scales. The empirical results show that ESC reduces the average number of sampling of chain-of-thought reasoning by a significant margin on six benchmarks, including MATH (-33.8%), GSM8K (-80.1%), StrategyQA (-76.8%), CommonsenseQA (-78.5%), Coin Flip (-84.2%) and Last Letters (-67.4%), while attaining comparable performances.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ndR8Ytrzhh",
    "arxiv_id": "2401.10480",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17845,
    "title": "Graph Lottery Ticket Automated",
    "authors": [
      "Guibin Zhang",
      "Kun Wang",
      "Wei Huang",
      "Yanwei Yue",
      "Yang Wang",
      "Roger Zimmermann",
      "Aojun Zhou",
      "Dawei Cheng",
      "Jin Zeng",
      "Yuxuan Liang"
    ],
    "abstract": "Graph Neural Networks (GNNs) have emerged as the leading deep learning models for graph-based representation learning. However, the training and inference of  GNNs on large graphs remain resource-intensive, impeding their utility in real-world scenarios and curtailing their applicability in deeper and more sophisticated GNN architectures. To address this issue, the Graph Lottery Ticket (GLT) hypothesis assumes that GNN with random initialization harbors a pair of core subgraph and sparse subnetwork, which can yield comparable performance and higher efficiency to that of the original dense network and complete graph. Despite that GLT offers a new paradigm for GNN training and inference, existing GLT algorithms heavily rely on trial-and-error pruning rate tuning and scheduling, and adhere to an irreversible pruning paradigm that lacks elasticity. Worse still, current methods suffer scalability issues when applied to deep GNNs, as they maintain the same topology structure across all layers. These challenges hinder the integration of GLT into deeper and larger-scale GNN contexts.  To bridge this critical gap, this paper introduces an $\\textbf{A}$daptive, $\\textbf{D}$ynamic, and $\\textbf{A}$utomated framework for identifying $\\textbf{G}$raph $\\textbf{L}$ottery $\\textbf{T}$ickets ($\\textbf{AdaGLT}$). Our proposed method derives its key advantages and addresses the above limitations through the following three aspects: 1) tailoring layer-adaptive sparse structures for various datasets and GNNs, thus endowing it with the capability to facilitate deeper GNNs; 2) integrating the pruning and training processes, thereby achieving a dynamic workflow encompassing both pruning and restoration; 3) automatically capturing graph lottery tickets across diverse sparsity levels, obviating the necessity for extensive pruning parameter tuning. More importantly, we rigorously provide theoretical proofs to guarantee $\\textbf{AdaGLT}$  to mitigate over-smoothing issues and obtain improved sparse structures in deep GNN scenarios. Extensive experiments demonstrate that $\\textbf{AdaGLT}$ outperforms state-of-the-art competitors across multiple graph datasets of various scales and types, particularly in scenarios involving deep GNNs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nmBjBZoySX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17844,
    "title": "Think-on-Graph: Deep and Responsible Reasoning of Large Language Model on Knowledge Graph",
    "authors": [
      "Jiashuo Sun",
      "Chengjin Xu",
      "Lumingyuan Tang",
      "Saizhuo Wang",
      "Chen Lin",
      "Yeyun Gong",
      "Lionel Ni",
      "Heung-Yeung Shum",
      "Jian Guo"
    ],
    "abstract": "Although large language models (LLMs) have achieved significant success in various tasks, they often struggle with hallucination problems, especially in scenarios requiring deep and responsible reasoning. These issues could be partially addressed by introducing external knowledge graphs (KG) in LLM reasoning. In this paper, we propose a new LLM-KG integrating paradigm ``$\\hbox{LLM}\\otimes\\hbox{KG}$'' which treats the LLM as an agent to interactively explore related entities and relations on KGs and perform reasoning based on the retrieved knowledge. We further implement this paradigm by introducing a new approach called Think-on-Graph (ToG), in which the LLM agent iteratively executes beam search on KG, discovers the most promising reasoning paths, and returns the most likely reasoning results. We use a number of well-designed experiments to examine and illustrate the following advantages of ToG: 1) compared with LLMs, ToG has better deep reasoning power; 2) ToG has the ability of knowledge traceability and knowledge correctability by leveraging LLMs reasoning and expert feedback; 3) ToG provides a flexible plug-and-play framework for different LLMs, KGs and prompting strategies without any additional training cost; 4) the performance of ToG with small LLM models could exceed large LLM such as GPT-4 in certain scenarios and this reduces the cost of LLM deployment and application. As a training-free method with lower computational cost and better generality, ToG achieves overall SOTA in 6 out of 9 datasets where most previous SOTAs rely on additional training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nnVO1PvbTv",
    "arxiv_id": "2307.07697",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17843,
    "title": "Interpretable Meta-Learning of Physical Systems",
    "authors": [
      "Matthieu Blanke",
      "Marc Lelarge"
    ],
    "abstract": "Machine learning methods can be a valuable aid in the scientific process, but they need to face challenging settings where data come from inhomogeneous experimental conditions. Recent meta-learning methods have made significant progress in multi-task learning, but they rely on black-box neural networks, resulting in high computational costs and limited interpretability. We introduce CAMEL, a new meta-learning architecture capable of learning efficiently from multiple environments, with an affine structure with respect to the learning task. We prove that CAMEL can identify the physical parameters of the system, enabling interpreable learning. We demonstrate the competitive generalization performance and the low computational cost of our method by comparing it to state-of-the-art algorithms on physical systems, ranging from toy models to complex, non-analytical systems. The interpretability of our method is illustrated with original applications to physical-parameter-induced adaptation and to adaptive control and system identification.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nnicaG5xiH",
    "arxiv_id": "2312.00477",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17842,
    "title": "PF-LRM: Pose-Free Large Reconstruction Model for Joint Pose and Shape Prediction",
    "authors": [
      "Peng Wang",
      "Hao Tan",
      "Sai Bi",
      "Yinghao Xu",
      "Fujun Luan",
      "Kalyan Sunkavalli",
      "Wenping Wang",
      "Zexiang Xu",
      "Kai Zhang"
    ],
    "abstract": "We propose a Pose-Free Large Reconstruction Model (PF-LRM) for reconstructing a 3D object from a few unposed images even with little visual overlap, while simultaneously estimating the camera poses in 1.3 seconds on a single A100 GPU. PF-LRM is a highly scalable method utilizing the self-attention blocks to exchange information between 3D object tokens and 2D image tokens; we predict coarse geometry for each view, and then use a differentiable Perspective-n-Point (PnP) solver to obtain camera poses. When trained on a huge amount of multi-view data, PF-LRM shows strong cross-dataset generalization ability, and outperforms baseline methods by a large margin in terms of pose prediction accuracy and 3D reconstruction quality on various evaluation datasets. We also demonstrate our model's robustness to variable numbers of input views and segmentation mask errors. Our project website is at: https://pf-lrm.github.io/project.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=noe76eRcPC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17840,
    "title": "Leveraging Uncertainty Estimates To Improve Classifier Performance",
    "authors": [
      "Gundeep Arora",
      "Srujana Merugu",
      "Anoop Saladi",
      "Rajeev Rastogi"
    ],
    "abstract": "Binary classification typically involves predicting the label of an instance based on whether the model score for the positive class exceeds a threshold chosen based on the application requirements (e.g., maximizing recall for a precision bound). However, model scores are often not aligned with true positivity rate. This is especially true when the training involves a differential sampling of classes or there is distributional drift between train and test settings. In this paper, we provide theoretical analysis and empirical evidence of the dependence of estimation bias on both uncertainty and model score. Further, we  formulate the decision boundary selection using both model score and uncertainty, prove that it is NP-hard, and present  algorithms  based on dynamic programming and isotonic regression.  Evaluation of the proposed algorithms on three real-world datasets yield  25\\%-40\\%  improvement in recall at high precision bounds over the traditional approach of using model score alone, highlighting the benefits of leveraging uncertainty.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nsNyDvNQTc",
    "arxiv_id": "2311.11723",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17839,
    "title": "Flat Minima in Linear Estimation and an Extended Gauss Markov Theorem",
    "authors": [
      "Simon Segert"
    ],
    "abstract": "We consider the problem of linear estimation, and establish an extension of the Gauss-Markov theorem, in which the bias operator is allowed to be non-zero but bounded with respect to a matrix norm of Schatten type.  We derive simple and explicit formulas for the optimal estimator in the cases of Nuclear and  Spectral norms (with the Frobenius case recovering ridge regression). Additionally, we analytically derive the generalization error in multiple random matrix ensembles, and compare with Ridge regression. Finally, we conduct an extensive simulation study, in which we show that the cross-validated Nuclear and Spectral regressors can outperform Ridge in several circumstances.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nxnbPPVvOG",
    "arxiv_id": "2311.11093",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17835,
    "title": "$\\pi$2vec: Policy Representation with Successor Features",
    "authors": [
      "Gianluca Scarpellini",
      "Ksenia Konyushkova",
      "Claudio Fantacci",
      "Thomas Paine",
      "Yutian Chen",
      "Misha Denil"
    ],
    "abstract": "This paper introduces $\\pi$2vec, a method for representing black box policies as comparable feature vectors.Our method combines the strengths of foundation models that serve as generic and powerful state representations and successor features that can model the future occurrence of the states for a policy.$\\pi$2vec represents the behavior of policies by capturing the statistics of the features from a pretrained model with the help of successor feature framework. We focus on the offline setting where policies and their representations are trained on a fixed dataset of trajectories.Finally, we employ linear regression on $\\pi$2vec vector representations to predict the performance of held out policies.The synergy of these techniques results in a method for efficient policy evaluation in resource constrained environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=o5Bqa4o5Mi",
    "arxiv_id": "2306.09800",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17834,
    "title": "Sample-Efficient Multi-Agent RL: An Optimization Perspective",
    "authors": [
      "Nuoya Xiong",
      "Zhihan Liu",
      "Zhaoran Wang",
      "Zhuoran Yang"
    ],
    "abstract": "We study multi-agent reinforcement learning (MARL) for the general-sum Markov Games (MGs) under general function approximation.     In order to find the minimum assumption for sample-efficient learning, we introduce a novel complexity measure called the Multi-Agent Decoupling Coefficient (MADC) for general-sum MGs. Using this measure, we propose the first unified algorithmic framework that ensures sample efficiency in learning Nash Equilibrium, Coarse Correlated Equilibrium, and Correlated Equilibrium for both model-based and model-free MARL problems with low MADC. We also show that our algorithm provides comparable sublinear regret to the existing works. Moreover, our algorithm combines an equilibrium-solving oracle with a single objective optimization subprocedure that solves for the regularized payoff of each deterministic joint policy, which avoids solving constrained optimization problems within data-dependent constraints (Jin et al. 2020; Wang et al. 2023) or executing sampling procedures with complex multi-objective optimization problems (Foster et al. 2023), thus being more amenable to empirical implementation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=o7qhUMylLU",
    "arxiv_id": "2310.06243",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17833,
    "title": "MaGIC: Multi-modality Guided Image Completion",
    "authors": [
      "Hao Wang",
      "Yongsheng Yu",
      "Tiejian Luo",
      "Heng Fan",
      "Libo Zhang"
    ],
    "abstract": "Vanilla image completion approaches exhibit sensitivity to large missing regions, attributed to the limited availability of reference information for plausible generation. To mitigate this, existing methods incorporate the extra cue as guidance for image completion. Despite improvements, these approaches are often restricted to employing a *single modality* (e.g., *segmentation* or *sketch* maps), which lacks scalability in leveraging multi-modality for more plausible completion.In this paper, we propose a novel, simple yet effective method for **M**ulti-mod**a**l **G**uided **I**mage **C**ompletion, dubbed **MaGIC**, which not only supports a wide range of single modality as the guidance (e.g., *text*, *canny edge*, *sketch*, *segmentation*, *depth*, and *pose*), but also adapts to arbitrarily customized combinations of these modalities (i.e., *arbitrary multi-modality*) for image completion.For building MaGIC, we first introduce a modality-specific conditional U-Net (MCU-Net) that injects single-modal signal into a U-Net denoiser for single-modal guided image completion. Then, we devise a consistent modality blending (CMB) method to leverage modality signals encoded in multiple learned MCU-Nets through gradient guidance in latent space. Our CMB is *training-free*, thereby avoids the cumbersome joint re-training of different modalities, which is the secret of MaGIC to achieve exceptional flexibility in accommodating new modalities for completion.Experiments show the superiority of MaGIC over state-of-the-art methods and its generalization to various completion tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=o7x0XVlCpX",
    "arxiv_id": "2305.11818",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17832,
    "title": "Information Retention via Learning Supplemental Features",
    "authors": [
      "Zhipeng Xie",
      "Yahe Li"
    ],
    "abstract": "The information bottleneck principle provides an information-theoretic method for learning a good representation as a tradeoff between conciseness and predictive ability, which can reduce the information redundancy, eliminate irrelevant and superfluous features, and thus enhance the in-domain generalizability. However, in low-resource or out-of-domain scenarios where the assumption of iid does not necessarily hold true, superfluous (or redundant) relevant features may be supplemental to the mainline features of the model, and be beneficial in making prediction for test dataset with distribution shifts. To address this problem, we propose to keep as much relevant information as possible in use for making predictions. A three-stage supervised learning framework is designed and implemented to jointly learn the mainline and supplemental features, relieving supplemental features from the suppression of mainline features. Experiments on image and text classification tasks have shown our method substantially outperforms several baseline and state-of-the-art methods, especially in low resource cases.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=o83eu4H9Mb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17831,
    "title": "Adversarial AutoMixup",
    "authors": [
      "Huafeng Qin",
      "Xin Jin",
      "Yun Jiang",
      "Moun\u00eem El-Yacoubi",
      "Xinbo Gao"
    ],
    "abstract": "Data mixing augmentation has been widely applied to improve the generalization ability of deep neural networks. Recently, offline data mixing augmentation, e.g. handcrafted and saliency information based mixup, has been gradually replaced by automatic mixing approaches. Through minimizing two sub-tasks, namely, mixed sample generation and mixup classification in an end-to-end way, AutoMix significantly improves accuracy on image classification tasks. However, as the optimization objective is consistent for the two sub-tasks, this approach is prone to generating consistent instead of diverse mixed samples, which results in overfitting for target task training. In this paper, we propose AdAutomixup, an adversarial automatic mixup augmentation approach that generates challenging samples to train a robust vein classifier for palm-vein identification, by alternatively optimizing the classifier and the mixup sample generator. AdAutomixup comprises two modules, a mixed example generator and a target classifier. The mixed sample generator aims to produce hard mixed examples to challenge the target classifier while the target classifier's aim is to learn robust features from hard mixed examples to improve generalization. To prevent the collapse of the inherent meanings of images, we further introduce an exponential moving average (EMA) teacher and a cosine similarity to train AdAutomixup in an end-to-end way. Extensive experiments on five image benchmarks consistently prove that our approach outperforms the state-of-the-art in various classification scenarios.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=o8tjamaJ80",
    "arxiv_id": "2312.11954",
    "GitHub": [
      "https://github.com/JinXins/Adversarial-AutoMixup"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17830,
    "title": "Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initialization",
    "authors": [
      "Frederic Koehler",
      "Thuy-Duong Vuong"
    ],
    "abstract": "There is a long history, as well as a recent explosion of interest, in statistical and generative modeling approaches based on \\emph{score functions} --- derivatives of the log-likelihood of a distribution. In seminal works, Hyv\\\"arinen proposed vanilla score matching as a way to learn distributions from data by computing an estimate of the score function of the underlying ground truth, and established connections between this method and established techniques like Contrastive Divergence and Pseudolikelihood estimation. It is by now well-known that vanilla score matching has significant difficulties learning multimodal distributions. Although there are various ways to overcome this difficulty, the following question has remained unanswered --- is there a natural way to sample multimodal distributions using just the vanilla score? Inspired by a long line of related experimental works, we prove that the Langevin diffusion with early stopping, initialized at the empirical distribution, and run on a score function estimated from data successfully generates natural multimodal distributions (mixtures of log-concave distributions).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oAMArMMQxb",
    "arxiv_id": "2310.01762",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17829,
    "title": "Transformer-VQ: Linear-Time Transformers via Vector Quantization",
    "authors": [
      "Lucas Dax Lingle"
    ],
    "abstract": "We introduce Transformer-VQ, a decoder-only transformer computing softmax-based dense self-attention in linear time.  Transformer-VQ's efficient attention is enabled by vector-quantized keys and a novel caching mechanism. In large-scale experiments, Transformer-VQ is shown highly competitive in quality, with strong results on Enwik8 (0.99 bpb), PG-19 (26.6 ppl), and ImageNet64 (3.16 bpb). Code: https://github.com/transformer-vq/transformer_vq",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oDdzXQzP2F",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17828,
    "title": "LMUFormer: Low Complexity Yet Powerful Spiking Model With Legendre Memory Units",
    "authors": [
      "Zeyu Liu",
      "Gourav Datta",
      "Anni Li",
      "Peter Anthony Beerel"
    ],
    "abstract": "Transformer models have demonstrated high accuracy in numerous applications but have high complexity and lack sequential processing capability making them ill-suited for many streaming applications at the edge where devices are heavily resource-constrained. Thus motivated, many researchers have proposed reformulating the transformer models as RNN modules which modify the self-attention computation with explicit states. However, these approaches often incur significant performance degradation.The ultimate goal is to develop a model that has the following properties: parallel training, streaming and low-cost inference, and state-of-the-art (SOTA) performance. In this paper, we propose a new direction to achieve this goal. We show how architectural modifications to a fully-sequential recurrent model can help push its performance toward Transformer models while retaining its sequential processing capability. Specifically, inspired by the recent success of Legendre Memory Units (LMU) in sequence learning tasks, we propose LMUFormer, which augments the LMU with convolutional patch embedding and convolutional channel mixer. Moreover, we present a spiking version of this architecture, which introduces the benefit of states within the patch embedding and channel mixer modules while simultaneously reducing the computing complexity. We evaluated our architectures on multiple sequence datasets. Of particular note is our performance on the Speech Commands V2 dataset (35 classes). In comparison to SOTA transformer-based models within the ANN domain, our LMUFormer demonstrates comparable performance while necessitating a remarkable $70\\times$ reduction in parameters and a substantial $140\\times$ decrement in FLOPs. Furthermore, when benchmarked against extant low-complexity SNN variants, our model establishes a new SOTA with an accuracy of 96.12\\%. Additionally, owing to our model's proficiency in real-time data processing, we are able to achieve a 32.03\\% reduction in sequence length, all while incurring an inconsequential decline in performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oEF7qExD9F",
    "arxiv_id": "2402.04882",
    "GitHub": [
      "https://github.com/zeyuliu1037/LMUFormer.git"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17826,
    "title": "WebArena: A Realistic Web Environment for Building Autonomous Agents",
    "authors": [
      "Shuyan Zhou",
      "Frank F. Xu",
      "Hao Zhu",
      "Xuhui Zhou",
      "Robert Lo",
      "Abishek Sridhar",
      "Xianyi Cheng",
      "Tianyue Ou",
      "Yonatan Bisk",
      "Daniel Fried",
      "Uri Alon",
      "Graham Neubig"
    ],
    "abstract": "With advances in generative AI, there is now potential for autonomous agents to manage daily tasks via natural language commands. However, current agents are primarily created and tested in simplified synthetic environments, leading to a disconnect with real-world scenarios. In this paper, we build an environment for language-guided agents that is highly realistic and reproducible. Specifically, we focus on agents that perform tasks on the web, and create an environment with fully functional websites from four common domains: e-commerce, social forum discussions, collaborative software development, and content management. Our environment is enriched with tools (e.g., a map) and external knowledge bases (e.g., user manuals) to encourage human-like task-solving. Building upon our environment, we release a set of benchmark tasks focusing on evaluating the functional correctness of task completions. The tasks in our benchmark are diverse, long-horizon, and designed to emulate tasks that humans routinely perform on the internet. We experiment with several baseline agents, integrating recent techniques such as reasoning before acting.  The results demonstrate that solving complex tasks is challenging: our best GPT-4-based agent only achieves an end-to-end task success rate of 14.41%, significantly lower than the human performance of 78.24%. These results highlight the need for further development of robust agents, that current state-of-the-art large language models are far from perfect performance in these real-life tasks, and that \\ours can be used to measure such progress.\\footnote{Code, data, environment reproduction instructions, video demonstrations are available in the supplementary.}",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oKn9c6ytLx",
    "arxiv_id": "2307.13854",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17825,
    "title": "RLIF: Interactive Imitation Learning as Reinforcement Learning",
    "authors": [
      "Jianlan Luo",
      "Perry Dong",
      "Yuexiang Zhai",
      "Yi Ma",
      "Sergey Levine"
    ],
    "abstract": "Although reinforcement learning methods offer a powerful framework for automatic skill acquisition, for practical learning-based control problems in domains such as robotics, imitation learning often provides a more convenient and accessible alternative. In particular, an interactive imitation learning method such as DAgger, which queries a near-optimal expert to intervene online to collect correction data for addressing the distributional shift challenges that afflict na\u00efve behavioral cloning, can enjoy good performance both in theory and practice without requiring manually specified reward functions and other components of full reinforcement learning methods. In this paper, we explore how off-policy reinforcement learning can enable improved performance under assumptions that are similar but potentially even more practical than those of interactive imitation learning. Our proposed method uses reinforcement learning with user intervention signals themselves as rewards. This relaxes the assumption that intervening experts in interactive imitation learning should be near-optimal and enables the algorithm to learn behaviors that improve over the potential suboptimal human expert. We also provide a unified framework to analyze our RL method and DAgger; for which we present the asymptotic analysis of the suboptimal gap for both methods as well as the non-asymptotic sample complexity bound of our method. We then evaluate our method on challenging high-dimensional continuous control simulation benchmarks as well as real-world robotic vision-based manipulation tasks. The results show that it strongly outperforms DAgger-like approaches across the different tasks, especially when the intervening experts are suboptimal. Additional ablations also empirically verify the proposed theoretical justification that the performance of our method is associated with the choice of intervention model and suboptimality of the expert. Code and videos can be found on our project website: https://rlifpaper.github.io.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oLLZhbBSOU",
    "arxiv_id": "2311.12996",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17824,
    "title": "Multimodal Molecular Pretraining via Modality Blending",
    "authors": [
      "Qiying Yu",
      "Yudi Zhang",
      "Yuyan Ni",
      "Shikun Feng",
      "Yanyan Lan",
      "Hao Zhou",
      "Jingjing Liu"
    ],
    "abstract": "Self-supervised learning has recently gained growing interest in molecular modeling for scientific tasks such as AI-assisted drug discovery. Current studies consider leveraging both 2D and 3D molecular structures for representation learning. However, relying on straightforward alignment strategies that treat each modality separately, these methods fail to exploit the intrinsic correlation between 2D and 3D representations that reflect the underlying structural characteristics of molecules, and only perform coarse-grained molecule-level alignment. To derive fine-grained alignment and promote structural molecule understanding, we introduce an atomic-relation level \"blend-then-predict\" self-supervised learning approach, MoleBLEND, which first blends atom relations represented by different modalities into one unified relation matrix for joint encoding, then recovers modality-specific information for 2D and 3D structures individually. By treating atom relationships as anchors, MoleBLEND organically aligns and integrates visually dissimilar 2D and 3D modalities of the same molecule at fine-grained atomic level, painting a more comprehensive depiction of each molecule. Extensive experiments show that MoleBLEND achieves state-of-the-art performance across major 2D/3D molecular benchmarks. We further provide theoretical insights from the perspective of mutual-information maximization, demonstrating that our method unifies contrastive, generative (cross-modality prediction) and mask-then-predict (single-modality prediction) objectives into one single cohesive framework.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oM7Jbxdk6Z",
    "arxiv_id": "2307.06235",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17823,
    "title": "DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genomes",
    "authors": [
      "Zhihan Zhou",
      "Yanrong Ji",
      "Weijian Li",
      "Pratik Dutta",
      "Ramana V Davuluri",
      "Han Liu"
    ],
    "abstract": "Decoding the linguistic intricacies of the genome is a crucial problem in biology, and pre-trained foundational models such as DNABERT and Nucleotide Transformer have made significant strides in this area. Existing works have largely hinged on k-mer, fixed-length permutations of A, T, C, and G, as the token of the genome language due to its simplicity. However, we argue that the computation and sample inefficiencies introduced by k-mer tokenization are primary obstacles in developing large genome foundational models. We provide conceptual and empirical insights into genome tokenization, building on which we propose to replace k-mer tokenization with Byte Pair Encoding (BPE), a statistics-based data compression algorithm that constructs tokens by iteratively merging the most frequent co-occurring genome segment in the corpus. We demonstrate that BPE not only overcomes the limitations of k-mer tokenization but also benefits from the computational efficiency of non-overlapping tokenization.Based on these insights, we introduce DNABERT-2, a refined genome foundation model that adapts an efficient tokenizer and employs multiple strategies to overcome input length constraints, reduce time and memory expenditure, and enhance model capability. Furthermore, we identify the absence of a comprehensive and standardized benchmark for genome understanding as another significant impediment to fair comparative analysis. In response, we propose the Genome Understanding Evaluation (GUE), a comprehensive multi-species genome classification dataset that amalgamates $28$ distinct datasets across $7$ tasks, with input lengths ranging from $70$ to $1000$. Through comprehensive experiments on the GUE benchmark, we demonstrate that DNABERT-2 achieves comparable performance to the state-of-the-art model with $21 \\times$ fewer parameters and approximately $92 \\times$ less GPU time in pre-training. Compared to DNABERT, while being $3 \\times$ more efficient, DNABERT-2 outperforms it on $23$ out of $28$ datasets, with an average improvement of $6$ absolute scores on GUE.The code, data, and pre-trained model will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oMLQB4EZE1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17822,
    "title": "A Unified Framework for Bayesian Optimization under Contextual Uncertainty",
    "authors": [
      "Sebastian Shenghong Tay",
      "Chuan-Sheng Foo",
      "Daisuke Urano",
      "Richalynn Leong",
      "Bryan Kian Hsiang Low"
    ],
    "abstract": "Bayesian optimization under contextual uncertainty (BOCU) is a family of BO problems in which the learner makes a decision prior to observing the context and must manage the risks involved. Distributionally robust BO (DRBO) is a subset of BOCU that affords robustness against context distribution shift, and includes the optimization of expected values and worst-case values as special cases. By considering the first derivatives of the DRBO objective, we generalize DRBO to one that includes several other uncertainty objectives studied in the BOCU literature such as worst-case sensitivity (and thus notions of risk such as variance, range, and conditional value-at-risk) and mean-risk tradeoffs. We develop a general Thompson sampling algorithm that is able to optimize any objective within the BOCU framework, analyze its theoretical properties, and compare it to suitable baselines across different experimental settings and uncertainty objectives.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oMNkj4ER7V",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17820,
    "title": "Treatment Effects Estimation By Uniform Transformer",
    "authors": [
      "Ruoqi Yu",
      "Shulei Wang"
    ],
    "abstract": "In observational studies, balancing covariates in different treatment groups is essential to estimate treatment effects. One of the most commonly used methods for such purposes is weighting. The performance of this class of methods usually depends on strong regularity conditions for the underlying model, which might not hold in practice. In this paper, we investigate weighting methods from a functional estimation perspective and argue that the weights needed for covariate balancing could differ from those needed for treatment effects estimation under low regularity conditions. Motivated by this observation, we introduce a new framework of weighting that directly targets the treatment effects estimation. Unlike existing methods, the resulting estimator for a treatment effect under this new framework is a simple kernel-based $U$-statistic after applying a data-driven transformation to the observed covariates. We characterize the theoretical properties of the new estimators of treatment effects under a nonparametric setting and show that they are able to work robustly under low regularity conditions. The new framework is also applied to several numerical examples to demonstrate its practical merits.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oOGqJ6Z1sA",
    "arxiv_id": "2008.03738",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17819,
    "title": "Towards Cheaper Inference in Deep Networks with Lower Bit-Width Accumulators",
    "authors": [
      "Yaniv Blumenfeld",
      "Itay Hubara",
      "Daniel Soudry"
    ],
    "abstract": "The majority of the research on the quantization of Deep Neural Networks (DNNs) is focused on reducing the precision of tensors visible by high-level frameworks (e.g., weights, activations, and gradients). However, current hardware still relies on high-accuracy core operations. Most significant is the operation of accumulating products. This high-precision accumulation operation is gradually becoming the main computational bottleneck. This is because, so far, the usage of low-precision accumulators led to a significant degradation in performance. In this work, we present a simple method to train and fine-tune DNNs, to allow, for the first time, utilization of cheaper, $12$-bits accumulators, with no significant degradation in accuracy. Lastly, we show that as we decrease the accumulation precision further, using fine-grained gradient approximations can improve the DNN accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oOwDQl8haC",
    "arxiv_id": "2401.14110",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17818,
    "title": "Online Information Acquisition: Hiring Multiple Agents",
    "authors": [
      "Federico Cacciamani",
      "Matteo Castiglioni",
      "Nicola Gatti"
    ],
    "abstract": "We investigate the mechanism design problem faced by a principal who hires \\emph{multiple} agents to gather and report costly information. Then, the principal exploits the  information to make an informed decision.  We model this problem as a game, where the principal announces a mechanism consisting in action recommendations and a payment function, a.k.a. scoring rule. Then, each agent chooses an effort level and receives partial information about an underlying state of nature based on the effort. Finally, the agents report the information (possibly non-truthfully), the principal takes a decision based on this information, and the agents are paid according to the scoring rule. While previous work focuses on single-agent problems, we consider multi-agents settings. This poses the challenge of coordinating the agents' efforts and aggregating correlated information. Indeed, we show that optimal mechanisms must correlate agents' efforts, which introduces externalities among the agents, and hence complex incentive compatibility constraints and equilibrium selection problems. First, we design a polynomial-time algorithm to find an optimal incentive compatible mechanism. Then, we study an online problem, where the principal repeatedly interacts with a group of unknown agents. We design a no-regret algorithm that provides $\\widetilde{\\mathcal{O}}(T^{2/3})$ regret with respect to an optimal mechanism, matching the state-of-the-art bound for single-agent settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oQKKlzxV1o",
    "arxiv_id": "2307.06210",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17816,
    "title": "Retrieval is Accurate Generation",
    "authors": [
      "Bowen Cao",
      "Deng Cai",
      "Leyang Cui",
      "Xuxin Cheng",
      "Wei Bi",
      "Yuexian Zou",
      "Shuming Shi"
    ],
    "abstract": "Standard language models generate text by selecting tokens from a fixed, finite, and standalone vocabulary. We introduce a novel method that selects context-aware phrases from a collection of supporting documents. One of the most significant challenges for this paradigm shift is determining the training oracles, because a string of text can be segmented in various ways and each segment can be retrieved from numerous possible documents. To address this, we propose to initialize the training oracles using linguistic heuristics and, more importantly, bootstrap the oracles through iterative self-reinforcement. Extensive experiments show that our model not only outperforms standard language models on a variety of knowledge-intensive tasks but also demonstrates improved generation quality in open-ended text generation. For instance, compared to the standard language model counterpart, our model raises the accuracy from 23.47% to 36.27% on OpenbookQA, and improves the MAUVE score from 42.61% to 81.58% in open-ended text generation. Remarkably, our model also achieves the best performance and the lowest latency among several retrieval-augmented baselines. In conclusion, we assert that retrieval is more accurate generation and hope that our work will encourage further research on this new paradigm shift.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oXYZJXDdo7",
    "arxiv_id": "2402.17532",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17815,
    "title": "Score Models for Offline Goal-Conditioned Reinforcement Learning",
    "authors": [
      "Harshit Sikchi",
      "Rohan Chitnis",
      "Ahmed Touati",
      "Alborz Geramifard",
      "Amy Zhang",
      "Scott Niekum"
    ],
    "abstract": "Offline Goal-Conditioned Reinforcement Learning (GCRL) is tasked with learning to achieve multiple goals in an environment purely from offline datasets using sparse reward functions. Offline GCRL is pivotal for developing generalist agents capable of leveraging pre-existing datasets to learn diverse and reusable skills without hand-engineering reward functions. However, contemporary approaches to GCRL based on supervised learning and contrastive learning are often suboptimal in the offline setting. An alternative perspective on GCRL optimizes for occupancy matching, but necessitates learning a discriminator, which subsequently serves as a pseudo-reward for downstream RL. Inaccuracies in the learned discriminator can cascade, negatively influencing the resulting policy. We present a novel approach to GCRL under a new lens of mixture-distribution matching, leading to our discriminator-free method: SMORe. The key insight is combining the occupancy matching perspective of GCRL with a convex dual formulation to derive a learning objective that can better leverage suboptimal offline data. SMORe learns *scores* or unnormalized densities representing the importance of taking an action at a state for reaching a particular goal. SMORe is principled and our extensive experiments on the fully offline GCRL benchmark comprised of robot manipulation and locomotion tasks, including high-dimensional observations, show that SMORe can outperform state-of-the-art baselines by a significant margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oXjnwQLcTA",
    "arxiv_id": "2311.02013",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17814,
    "title": "Magnushammer: A Transformer-Based Approach to Premise Selection",
    "authors": [
      "Maciej Miku\u0142a",
      "Szymon Tworkowski",
      "Szymon Antoniak",
      "Bartosz Piotrowski",
      "Albert Q. Jiang",
      "Jin Peng Zhou",
      "Christian Szegedy",
      "\u0141ukasz Kuci\u0144ski",
      "Piotr Mi\u0142o\u015b",
      "Yuhuai Wu"
    ],
    "abstract": "This paper presents a novel approach to premise selection, a crucial reasoning task in automated theorem proving. Traditionally, symbolic methods that rely on extensive domain knowledge and engineering effort are applied to this task. In contrast, this work demonstrates that contrastive training with the transformer architecture can achieve higher-quality retrieval of relevant premises, without the knowledge or feature engineering overhead. Our method, Magnushammer, outperforms the most advanced and widely used automation tool in interactive theorem proving called Sledgehammer. On the PISA and miniF2f benchmarks Magnushammer achieves $59.5\\%$ (against $38.3\\%$) and $34.0\\%$ (against $20.9\\%$) success rates, respectively. By combining Magnushammer with a language-model-based automated theorem prover, we further improve the state-of-the-art proof success rate from $57.0\\%$ to $71.0\\%$ on the PISA benchmark using $4$x fewer parameters. Moreover, we develop and open source a novel dataset for premise selection, containing textual representations of (proof state, relevant premise) pairs. To the best of our knowledge, this is the largest available premise selection dataset, and the first dataset of this kind for the Isabelle proof assistant.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oYjPk8mqAV",
    "arxiv_id": "2303.04488",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17813,
    "title": "Analyzing and Mitigating Object Hallucination in Large Vision-Language Models",
    "authors": [
      "Yiyang Zhou",
      "Chenhang Cui",
      "Jaehong Yoon",
      "Linjun Zhang",
      "Zhun Deng",
      "Chelsea Finn",
      "Mohit Bansal",
      "Huaxiu Yao"
    ],
    "abstract": "Large vision-language models (LVLMs) have shown remarkable abilities in understanding visual information with human languages. However, LVLMs still suffer from object hallucination, which is the problem of generating descriptions that include objects that do not actually exist in the images. This can negatively impact many vision-language tasks, such as visual summarization and reasoning. To address this issue, we propose a simple yet powerful algorithm, LVLM Hallucination Revisor (LURE), to post-hoc rectify object hallucination in LVLMs by reconstructing less hallucinatory descriptions. LURE is grounded in a rigorous statistical analysis of the key factors underlying object hallucination, including co-occurrence (the frequent appearance of certain objects alongside others in images), uncertainty (objects with higher uncertainty during LVLM decoding), and object position (hallucination often appears in the later part of the generated text). LURE can also be seamlessly integrated with any LVLMs. We evaluate LURE on six open-source LVLMs and found it outperforms the previous best approach in both general object hallucination evaluation metrics, GPT, and human evaluations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oZDJKTlOUe",
    "arxiv_id": "2310.00754",
    "GitHub": [
      "https://github.com/YiyangZhou/LURE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17812,
    "title": "Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation",
    "authors": [
      "Xinyu Tang",
      "Richard Shin",
      "Huseyin A Inan",
      "Andre Manoel",
      "Fatemehsadat Mireshghallah",
      "Zinan Lin",
      "Sivakanth Gopi",
      "Janardhan Kulkarni",
      "Robert Sim"
    ],
    "abstract": "We study the problem of in-context learning (ICL) with large language models (LLMs) on private datasets. This scenario poses privacy risks, as LLMs may leak or regurgitate the private examples demonstrated in the prompt.We propose a novel algorithm that generates synthetic few-shot demonstrations from the private dataset with formal differential privacy (DP) guarantees, and show empirically that it can achieve effective ICL.We conduct extensive experiments on standard benchmarks and compare our algorithm with non-private ICL and zero-shot solutions. Our results demonstrate that our algorithm can achieve competitive performance with strong privacy levels.These results open up new possibilities for ICL with privacy protection for a broad range of applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oZtt0pRnOl",
    "arxiv_id": "2309.11765",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17811,
    "title": "LDReg: Local Dimensionality Regularized Self-Supervised Learning",
    "authors": [
      "Hanxun Huang",
      "Ricardo J. G. B. Campello",
      "Sarah Monazam Erfani",
      "Xingjun Ma",
      "Michael E. Houle",
      "James Bailey"
    ],
    "abstract": "Representations learned via self-supervised learning (SSL) can be susceptible to dimensional collapse, where the learned representation subspace is of extremely low dimensionality and thus fails to represent the full data distribution and modalities.Dimensional collapse \u2013\u2013\u2013 also known as the \"underfilling\" phenomenon \u2013\u2013\u2013 is one of the major causes of degraded performance on downstream tasks. Previous work has investigated the dimensional collapse problem of SSL at a global level. In this paper, we demonstrate that representations can span over high dimensional space globally, but collapse locally. To address this, we propose a method called *local dimensionality regularization (LDReg)*. Our formulation is based on the derivation of the Fisher-Rao metric to compare and optimize local distance distributions at an asymptotically small radius for each data point. By increasing the local intrinsic dimensionality, we demonstrate through a range of experiments that LDReg improves the representation quality of SSL. The results also show that LDReg can regularize dimensionality at both local and global levels.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oZyAqjAjJW",
    "arxiv_id": "2401.10474",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17810,
    "title": "Reconciling Spatial and Temporal Abstractions for Goal Representation",
    "authors": [
      "Mehdi Zadem",
      "Sergio Mover",
      "Sao Mai Nguyen"
    ],
    "abstract": "Goal representation affects the performance of Hierarchical Reinforcement Learn- ing (HRL) algorithms by decomposing the complex learning problem into easier subtasks. Recent studies show that representations that preserve temporally ab- stract environment dynamics are successful in solving difficult problems and pro- vide theoretical guarantees for optimality. These methods however cannot scale to tasks where environment dynamics increase in complexity i.e. the temporally abstract transition relations depend on larger number of variables. On the other hand, other efforts have tried to use spatial abstraction to mitigate the previous issues. Their limitations include scalability to high dimensional environments and dependency on prior knowledge.In this paper, we propose a novel three-layer HRL algorithm that introduces, at different levels of the hierarchy, both a spatial and a temporal goal abstraction. We provide a theoretical study of the regret bounds of the learned policies. We evaluate the approach on complex continuous control tasks, demonstrating the effectiveness of spatial and temporal abstractions learned by this approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=odY3PkI5VB",
    "arxiv_id": "2401.09870",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17809,
    "title": "AffineQuant: Affine Transformation Quantization for Large Language Models",
    "authors": [
      "Yuexiao Ma",
      "Huixia Li",
      "Xiawu Zheng",
      "Feng Ling",
      "Xuefeng Xiao",
      "Rui Wang",
      "Shilei Wen",
      "Fei Chao",
      "Rongrong Ji"
    ],
    "abstract": "The significant resource requirements associated with Large-scale Language Models (LLMs) have generated considerable interest in the development of techniques aimed at compressing and accelerating neural networks. Among these techniques, Post-Training Quantization (PTQ) has emerged as a subject of considerable interest due to its noteworthy compression efficiency and cost-effectiveness in the context of training.Existing PTQ methods for LLMs limit the optimization scope to scaling transformations between pre- and post-quantization weights. This constraint results in significant errors after quantization, particularly in low-bit configurations. In this paper, we advocate for the direct optimization using equivalent Affine transformations in PTQ (AffineQuant). This approach extends the optimization scope and thus significantly minimizing quantization errors. Additionally, by employing the corresponding inverse matrix, we can ensure equivalence between the pre- and post-quantization outputs of PTQ, thereby maintaining its efficiency and generalization capabilities. To ensure the invertibility of the transformation during optimization, we further introduce a gradual mask optimization method. This method initially focuses on optimizing the diagonal elements and gradually extends to the other elements. Such an approach aligns with the Levy-Desplanques theorem, theoretically ensuring invertibility of the transformation. As a result, significant performance improvements are evident across different LLMs on diverse datasets. Notably, these improvements are most pronounced when using very low-bit quantization, enabling the deployment of large models on edge devices. To illustrate, we attain a C4 perplexity of $14.89$ ({ 10.00$\\downarrow$} vs $24.89$ in OmniQuant) on the LLaMA-$7$B model of W$2$A$16$ quantization. AffineQuant significantly outperforms OmniQuant on smaller models, achieving a perplexity of $42.29$ ({ 33.14$\\downarrow$} vs $75.43$ in OmniQuant) when using $2$-bit $128$-group quantization for OPT-$125$M, which setting a new state-of-the-art benchmark for PTQ in LLMs. Codes are available in the supplementary materials.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=of2rhALq8l",
    "arxiv_id": "2403.12544",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17808,
    "title": "CLaM-TTS: Improving Neural Codec Language Model for Zero-Shot Text-to-Speech",
    "authors": [
      "Jaehyeon Kim",
      "Keon Lee",
      "Seungjun Chung",
      "Jaewoong Cho"
    ],
    "abstract": "With the emergence of neural audio codecs, which encode multiple streams of discrete tokens from audio, large language models have recently gained attention as a promising approach for zero-shot Text-to-Speech (TTS) synthesis. Despite the ongoing rush towards scaling paradigms, audio tokenization ironically amplifies the scalability challenge, stemming from its long sequence length and the complexity of modelling the multiple sequences. To mitigate these issues, we present CLaM-TTS that employs a probabilistic residual vector quantization to 1) achieve superior compression in the token length, and 2) allow a language model to generate multiple tokens at once, thereby eliminating the need for cascaded modeling to handle the number of token streams. Our experimental results demonstrate that CLaM-TTS is better than or comparable to state-of-the-art zero-shot TTS baselines regarding naturalness, intelligibility, speaker similarity, and inference speed. In addition, we examine the impact of the pretraining extent of the language models and their text tokenization strategies on performances.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ofzeypWosV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17807,
    "title": "Copula Conformal prediction for multi-step time series prediction",
    "authors": [
      "Sophia Huiwen Sun",
      "Rose Yu"
    ],
    "abstract": "Accurate uncertainty measurement is a key step to building robust and reliable machine learning systems. Conformal prediction is a distribution-free uncertainty quantification algorithm popular for its ease of implementation, statistical coverage guarantees, and versatility for underlying forecasters. However, existing conformal prediction algorithms for time series are limited to single-step prediction without considering the temporal dependency. In this paper we propose the Copula Conformal Prediction algorithm for multivariate, multi-step Time Series forecasting, CopulaCPTS. We prove that CopulaCPTS has finite sample validity guarantee. On four synthetic and real-world multivariate time series datasets, we show that CopulaCPTS produces more calibrated and efficient confidence intervals for multi-step prediction tasks than existing techniques.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ojIJZDNIBj",
    "arxiv_id": "2212.03281",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17806,
    "title": "A Lie Group Approach to Riemannian Batch Normalization",
    "authors": [
      "Ziheng Chen",
      "Yue Song",
      "Yunmei Liu",
      "Nicu Sebe"
    ],
    "abstract": "Manifold-valued measurements exist in numerous applications within computer vision and machine learning. Recent studies have extended Deep Neural Networks (DNNs) to manifolds, and concomitantly, normalization techniques have also been adapted to several manifolds, referred to as Riemannian normalization. Nonetheless, most of the existing Riemannian normalization methods have been derived in an ad hoc manner and only apply to specific manifolds. This paper establishes a unified framework for Riemannian Batch Normalization (RBN) techniques on Lie groups. Our framework offers the theoretical guarantee of controlling both the Riemannian mean and variance. Empirically, we focus on Symmetric Positive Definite (SPD) manifolds, which possess three distinct types of Lie group structures. Using the deformation concept, we generalize the existing Lie groups on SPD manifolds into three families of parameterized Lie groups. Specific normalization layers induced by these Lie groups are then proposed for SPD neural networks. We demonstrate the effectiveness of our approach through three sets of experiments: radar recognition, human action recognition, and electroencephalography (EEG) classification. The code is available at https://github.com/GitZH-Chen/LieBN.git.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=okYdj8Ysru",
    "arxiv_id": "2403.11261",
    "GitHub": [
      "https://github.com/GitZH-Chen/LieBN.git"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19725,
    "title": "ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Models",
    "authors": [
      "Seyed Iman Mirzadeh",
      "Keivan Alizadeh-Vahid",
      "Sachin Mehta",
      "Carlo C del Mundo",
      "Oncel Tuzel",
      "Golnoosh Samei",
      "Mohammad Rastegari",
      "Mehrdad Farajtabar"
    ],
    "abstract": "Large Language Models (LLMs) with billions of parameters have drastically transformed AI applications. However, their demanding computation during inference has raised significant challenges for deployment on resource-constrained devices. Despite recent trends favoring alternative activation functions such as GELU or SiLU, known for increased computation, this study strongly advocates for reinstating ReLU activation in LLMs. We demonstrate that using the ReLU activation function has a negligible impact on convergence and performance while significantly reducing computation and weight transfer. This reduction is particularly valuable during the memory-bound inference step, where efficiency is paramount. Exploring sparsity patterns in ReLU-based LLMs, we unveil the reutilization of activated neurons for generating new tokens and leveraging these insights, we propose practical strategies to substantially reduce LLM inference computation up to three times, using ReLU activations with minimal performance trade-offs.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=osoWxY8q2E",
    "arxiv_id": "2310.04564",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17804,
    "title": "Prototypical Information Bottlenecking and Disentangling for Multimodal Cancer Survival Prediction",
    "authors": [
      "Yilan Zhang",
      "Yingxue Xu",
      "Jianqi Chen",
      "Fengying Xie",
      "Hao Chen"
    ],
    "abstract": "Multimodal learning significantly benefits cancer survival prediction, especially the integration of pathological images and genomic data. Despite advantages of multimodal learning for cancer survival prediction, massive redundancy in multimodal data prevents it from extracting discriminative and compact information: (1) An extensive amount of intra-modal task-unrelated information blurs discriminability, especially for gigapixel whole slide images (WSIs) with many patches in pathology and thousands of pathways in genomic data, leading to an \"intra-modal redundancy\" issue. (2) Duplicated information among modalities dominates the representation of multimodal data, which makes modality-specific information prone to being ignored, resulting in an \"inter-modal redundancy\" issue. To address these, we propose a new framework, Prototypical Information Bottlenecking and Disentangling (PIBD), consisting of Prototypical Information Bottleneck (PIB) module for intra-modal redundancy and Prototypical Information Disentanglement (PID) module for inter-modal redundancy. Specifically, a variant of information bottleneck, PIB, is proposed to model prototypes approximating a bunch of instances for different risk levels, which can be used for selection of discriminative instances within modality. PID module decouples entangled multimodal data into compact distinct components: modality-common and modality-specific knowledge, under the guidance of the joint prototypical distribution. Extensive experiments on five cancer benchmark datasets demonstrated our superiority over other methods. The code is released.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=otHZ8JAIgh",
    "arxiv_id": "2401.01646",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17803,
    "title": "Advancing the Lower Bounds: an Accelerated, Stochastic, Second-order Method with Optimal Adaptation to Inexactness",
    "authors": [
      "Artem Agafonov",
      "Dmitry Kamzolov",
      "Alexander Gasnikov",
      "Ali Kavis",
      "Kimon Antonakopoulos",
      "Volkan Cevher",
      "Martin Tak\u00e1\u010d"
    ],
    "abstract": "We present a new accelerated stochastic second-order method that is robust to both gradient and Hessian inexactness, typical in machine learning. We establish theoretical lower bounds and prove that our algorithm achieves optimal convergence in both gradient and Hessian inexactness in this key setting. We further introduce a tensor generalization for stochastic higher-order derivatives. When the oracles are non-stochastic, the proposed tensor algorithm matches the global convergence of Nesterov Accelerated Tensor method. Both algorithms allow for approximate solutions of their auxiliary subproblems with verifiable conditions on the accuracy of the solution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=otU31x3fus",
    "arxiv_id": "2309.01570",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17801,
    "title": "Recursive Generalization Transformer for Image Super-Resolution",
    "authors": [
      "Zheng Chen",
      "Yulun Zhang",
      "Jinjin Gu",
      "Linghe Kong",
      "Xiaokang Yang"
    ],
    "abstract": "Transformer architectures have exhibited remarkable performance in image super-resolution (SR). Since the quadratic computational complexity of the self-attention (SA) in Transformer, existing methods tend to adopt SA in a local region to reduce overheads. However, the local design restricts the global context exploitation, which is crucial for accurate image reconstruction. In this work, we propose the Recursive Generalization Transformer (RGT) for image SR, which can capture global spatial information and is suitable for high-resolution images. Specifically, we propose the recursive-generalization self-attention (RG-SA). It recursively aggregates input features into representative feature maps, and then utilizes cross-attention to extract global information. Meanwhile, the channel dimensions of attention matrices ($query$, $key$, and $value$) are further scaled to mitigate the redundancy in the channel domain. Furthermore, we combine the RG-SA with local self-attention to enhance the exploitation of the global context, and propose the hybrid adaptive integration (HAI) for module integration. The HAI allows the direct and effective fusion between features at different levels (local or global). Extensive experiments demonstrate that our RGT outperforms recent state-of-the-art methods quantitatively and qualitatively. Code and pre-trained models are available at https://github.com/zhengchen1999/RGT.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=owziuM1nsR",
    "arxiv_id": "2303.06373",
    "GitHub": [
      "https://github.com/zhengchen1999/RGT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17800,
    "title": "Yet Another ICU Benchmark: A Flexible Multi-Center Framework for Clinical ML",
    "authors": [
      "Robin van de Water",
      "Hendrik Nils Aurel Schmidt",
      "Paul Elbers",
      "Patrick Thoral",
      "Bert Arnrich",
      "Patrick Rockenschaub"
    ],
    "abstract": "Medical applications of machine learning (ML) have experienced a surge in popularity in recent years. Given the abundance of available data from electronic health records, the intensive care unit (ICU) is a natural habitat for ML. Models have been proposed to address numerous ICU prediction tasks like the early detection of complications. While authors frequently report state-of-the-art performance, it is challenging to verify claims of superiority. Datasets and code are not always published, and cohort definitions, preprocessing pipelines, and training setups are difficult to reproduce. This work introduces Yet Another ICU Benchmark (YAIB), a modular framework that allows researchers to define reproducible and comparable clinical ML experiments; we offer an end-to-end solution from cohort definition to model evaluation. The framework natively supports most open-access ICU datasets (MIMIC III/IV, eICU, HiRID, AUMCdb) and is easily adaptable to future ICU datasets. Combined with a transparent preprocessing pipeline and extensible training code for multiple ML and deep learning models, YAIB enables unified model development, transfer, and evaluation. Our benchmark comes with five predefined established prediction tasks (mortality, acute kidney injury, sepsis, kidney function, and length of stay) developed in collaboration with clinicians. Adding further tasks is straightforward by design. Using YAIB, we demonstrate that the choice of dataset, cohort definition, and preprocessing have a major impact on the prediction performance \u2014 often more so than model class \u2014 indicating an urgent need for YAIB as a holistic benchmarking tool. We provide our work to the clinical ML community to accelerate method development and enable real-world clinical implementations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ox2ATRM90I",
    "arxiv_id": "2306.05109",
    "GitHub": [
      "https://github.com/rvandewater/YAIB"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17799,
    "title": "Backdoor Contrastive Learning via Bi-level Trigger Optimization",
    "authors": [
      "Weiyu Sun",
      "Xinyu Zhang",
      "Hao LU",
      "Ying-Cong Chen",
      "Ting Wang",
      "Jinghui Chen",
      "Lu Lin"
    ],
    "abstract": "Contrastive Learning (CL) has attracted enormous attention due to its remarkable capability in unsupervised representation learning. However, recent works have revealed the vulnerability of CL to backdoor attacks: the feature extractor could be misled to embed backdoored data close to an attack target class, thus fooling the downstream predictor to misclassify it as the target. Existing attacks usually adopt a fixed trigger pattern and poison the training set with trigger-injected data, hoping for the feature extractor to learn the association between trigger and target class. However, we find that such fixed trigger design fails to effectively associate trigger-injected data with target class in the embedding space due to special CL mechanisms, leading to a limited attack success rate (ASR). This phenomenon motivates us to find a better backdoor trigger design tailored for CL framework. In this paper, we propose a bi-level optimization approach to achieve this goal, where the inner optimization simulates the CL dynamics of a surrogate victim, and the outer optimization enforces the backdoor trigger to stay close to the target throughout the surrogate CL procedure. Extensive experiments show that our attack can achieve a higher attack success rate (e.g., 99\\% ASR on ImageNet-100) with a very low poisoning rate (1\\%). Besides, our attack can effectively evade existing state-of-the-art defenses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oxjeePpgSP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17798,
    "title": "The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reduction",
    "authors": [
      "Pratyusha Sharma",
      "Jordan T. Ash",
      "Dipendra Misra"
    ],
    "abstract": "Transformer-based Large Language Models (LLMs) have become a fixture in modern machine learning. Correspondingly, significant resources are allocated towards research that aims to further advance this technology, typically resulting in models of increasing size that are trained on increasing amounts of data. This work, however, demonstrates the surprising result that it is often possible to im-prove the performance of LLMs by simply removing higher-order components of their constituent weight matrices in the multi-layer perception (MLP) layers. This simple intervention, which we call LAyer-SElective Rank reduction (LASER), can be done on a model after training has completed, and requires no additional parameters or data. LASER can dramatically boost predictive performance\u2014at times by 80% over the model\u2019s original performance\u2014on question-answering tasks and across various modalities for which Transformers are used.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ozX92bu8VA",
    "arxiv_id": "2312.13558",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17795,
    "title": "Compose and Conquer: Diffusion-Based 3D Depth Aware Composable Image Synthesis",
    "authors": [
      "Jonghyun Lee",
      "Hansam Cho",
      "YoungJoon Yoo",
      "Seoung Bum Kim",
      "Yonghyun Jeong"
    ],
    "abstract": "Addressing the limitations of text as a source of accurate layout representation in text-conditional diffusion models, many works incorporate additional signals to condition certain attributes within a generated image. Although successful, previous works do not account for the specific localization of said attributes extended into the three dimensional plane. In this context, we present a conditional diffusion model that integrates control over three-dimensional object placement with disentangled representations of global stylistic semantics from multiple exemplar images. Specifically, we first introduce depth disentanglement training to leverage the relative depth of objects as an estimator, allowing the model to identify the absolute positions of unseen objects through the use of synthetic image triplets. We also introduce soft guidance, a method for imposing global semantics onto targeted regions without the use of any additional localization cues. Our integrated framework, Compose and Conquer (CnC), unifies these techniques to localize multiple conditions in a disentangled manner. We demonstrate that our approach allows perception of objects at varying depths while offering a versatile framework for composing localized objects with different global semantics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=p4eG8rCa0b",
    "arxiv_id": "2401.09048",
    "GitHub": [
      "https://github.com/tomtom1103/compose-and-conquer"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17792,
    "title": "Differentiable Learning of Generalized Structured Matrices for Efficient Deep Neural Networks",
    "authors": [
      "Changwoo Lee",
      "Hun-Seok Kim"
    ],
    "abstract": "This paper investigates efficient deep neural networks (DNNs) to replace dense unstructured weight matrices with structured ones that possess desired properties. The challenge arises because the optimal weight matrix structure in popular neural network models is obscure in most cases and may vary from layer to layer even in the same network. Prior structured matrices proposed for efficient DNNs were mostly hand-crafted without a generalized framework to systematically learn them. To address this issue, we propose a generalized and differentiable framework to learn efficient structures of weight matrices by gradient descent. We first define a new class of structured matrices that covers a wide range of structured matrices in the literature by adjusting the structural parameters. Then, the frequency-domain differentiable parameterization scheme based on the Gaussian-Dirichlet kernel is adopted to learn the structural parameters by proximal gradient descent. Finally, we introduce an effective initialization method for the proposed scheme. Our method learns efficient DNNs with structured matrices, achieving lower complexity and/or higher performance than prior approaches that employ low-rank, block-sparse, or block-low-rank matrices.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pAVJKp3Dvn",
    "arxiv_id": "2310.18882",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17791,
    "title": "Causal Modelling Agents: Causal Graph Discovery through Synergising Metadata- and Data-driven Reasoning",
    "authors": [
      "Ahmed Abdulaal",
      "adamos hadjivasiliou",
      "Nina Montana-Brown",
      "Tiantian He",
      "Ayodeji Ijishakin",
      "Ivana Drobnjak",
      "Daniel C. Castro",
      "Daniel C. Alexander"
    ],
    "abstract": "Scientific discovery hinges on the effective integration of metadata, which refers to a set of 'cognitive' operations such as determining what information is relevant for inquiry, and data, which encompasses physical operations such as observation and experimentation. This paper introduces the Causal Modelling Agent (CMA), a novel framework that synergizes the metadata-based reasoning capabilities of Large Language Models (LLMs) with the data-driven modelling of Deep Structural Causal Models (DSCMs) for the task of causal discovery. We evaluate the CMA's performance on a number of benchmarks, as well as on the real-world task of modelling the clinical and radiological phenotype of Alzheimer's Disease (AD). Our experimental results indicate that the CMA can outperform previous data-driven or metadata-driven approaches to causal discovery. In our real-world application, we use the CMA to derive new insights into the causal relationships among biomarkers of AD.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pAoqRlTBtY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17789,
    "title": "Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss",
    "authors": [
      "Hao Wang",
      "Chenyi Zhang",
      "Tongyang Li"
    ],
    "abstract": "The problem of minimizing the maximum of $N$ convex, Lipschitz functions plays significant roles in optimization and machine learning. It has a series of results, with the most recent one requiring $O(N\\epsilon^{-2/3} + \\epsilon^{-8/3})$ queries to a first-order oracle to compute an $\\epsilon$-suboptimal point. On the other hand, quantum algorithms for optimization are rapidly advancing with speedups shown on many important optimization problems. In this paper, we conduct a systematic study of quantum algorithms and lower bounds for minimizing the maximum of $N$ convex, Lipschitz functions. On one hand, we develop quantum algorithms with an improved complexity bound of $\\tilde{O}(\\sqrt{N}\\epsilon^{-5/3} + \\epsilon^{-8/3})$. On the other hand, we prove that quantum algorithms must take $\\tilde{\\Omega}(\\sqrt{N}\\epsilon^{-2/3})$ queries to a first-order quantum oracle, showing that our dependence on $N$ is optimal up to poly-logarithmic factors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pB1FeRSQxh",
    "arxiv_id": "2402.12745",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17788,
    "title": "Grounded Object-Centric Learning",
    "authors": [
      "Avinash Kori",
      "Francesco Locatello",
      "Fabio De Sousa Ribeiro",
      "Francesca Toni",
      "Ben Glocker"
    ],
    "abstract": "The extraction of object-centric representations for downstream tasks is an emerging area of research. Learning grounded representations of objects that are guaranteed to be stable and invariant promises robust performance across different tasks and environments. Slot Attention (SA) learns object-centric representations by assigning objects to *slots*, but presupposes a *single* distribution from which all slots are randomly initialised. This results in an inability to learn *specialized* slots which bind to specific object types and remain invariant to identity-preserving changes in object appearance. To address this, we present *Conditional Slot Attention* (CoSA) using a novel concept of *Grounded Slot Dictionary* (GSD) inspired by vector quantization. Our proposed GSD comprises (i) canonical object-level property vectors and (ii) parametric Gaussian distributions, which define a prior over the slots. We demonstrate the benefits of our method in multiple downstream tasks such as scene generation, composition, and task adaptation, whilst remaining competitive with SA in object discovery.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pBxeZ6pVUD",
    "arxiv_id": "2307.09437",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17787,
    "title": "Large-scale Training of Foundation Models for Wearable Biosignals",
    "authors": [
      "Salar Abbaspourazad",
      "Oussama Elachqar",
      "Andrew Miller",
      "Saba Emrani",
      "Udhyakumar Nallasamy",
      "Ian Shapiro"
    ],
    "abstract": "Tracking biosignals is crucial for monitoring wellness and preempting the development of severe medical conditions. Today, wearable devices can conveniently record various biosignals, creating the opportunity to monitor health status without disruption to one's daily routine. Despite widespread use of wearable devices and existing digital biomarkers, the absence of curated data with annotated medical labels hinders the development of new biomarkers to measure common health conditions. In fact, medical datasets are usually small in comparison to other domains, which is an obstacle for developing neural network models for biosignals. To address this challenge, we have employed self-supervised learning using the unlabeled sensor data collected under informed consent from the large longitudinal Apple Heart and Movement Study (AHMS) to train foundation models for two common biosignals: photoplethysmography (PPG) and electrocardiogram (ECG) recorded on Apple Watch. We curated PPG and ECG datasets from AHMS that include data from ${\\sim} 141$K participants spanning ${\\sim} 3$ years. Our self-supervised learning framework includes participant level positive pair selection, stochastic augmentation module and a regularized contrastive loss optimized with momentum training, and generalizes well to both PPG and ECG modalities. We show that the pre-trained foundation models readily encode information regarding participants' demographics and health conditions. To the best of our knowledge, this is the first study that builds foundation models using large-scale PPG and ECG data collected via wearable consumer devices $\\textendash$ prior works have commonly used smaller-size datasets collected in clinical and experimental settings. We believe PPG and ECG foundation models can enhance future wearable devices by reducing the reliance on labeled data and hold the potential to help the users improve their health.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pC3WJHf51j",
    "arxiv_id": "2312.05409",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17786,
    "title": "Two-stage LLM Fine-tuning with Less Specialization and More Generalization",
    "authors": [
      "Yihan Wang",
      "Si Si",
      "Daliang Li",
      "Michal Lukasik",
      "Felix Yu",
      "Cho-Jui Hsieh",
      "Inderjit S Dhillon",
      "Sanjiv Kumar"
    ],
    "abstract": "Pretrained large language models (LLMs) are general purpose problem solvers applicable to a diverse set of tasks with prompts. They can be further improved towards a specific task by fine-tuning on a specialized dataset. However, fine-tuning usually makes the model narrowly specialized on this dataset with reduced general in-context learning performances, which is undesirable whenever the fine-tuned model needs to handle additional tasks where no fine-tuning data is available. In this work, we first demonstrate that fine-tuning on a single task indeed decreases LLMs' general in-context learning performance. We discover one important cause of such forgetting, format specialization, where the model overfits to the format of the fine-tuned task. We further show that format specialization happens at the very beginning of fine-tuning. To solve this problem, we propose Prompt Tuning with MOdel Tuning (ProMoT), a simple yet effective two-stage fine-tuning framework that reduces format specialization and improves generalization. ProMoT offloads task-specific format learning into additional and removable parameters by first doing prompt tuning and then fine-tuning the model itself with this soft prompt attached. With experiments on several fine-tuning tasks and 8 in-context evaluation tasks, we show that ProMoT achieves comparable performance on fine-tuned tasks to standard fine-tuning, but with much less loss of in-context learning performances across a board range of  out-of-domain evaluation tasks. More importantly, ProMoT can even enhance generalization on in-context learning tasks that are semantically related to the fine-tuned task, e.g. ProMoT on En-Fr translation significantly improves performance on other language pairs, and ProMoT on NLI improves performance on summarization.Experiments also show that ProMoT can improve the generalization performance of  multi-task training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pCEgna6Qco",
    "arxiv_id": "2211.00635",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17785,
    "title": "Rethinking Adversarial Policies: A Generalized Attack Formulation and Provable Defense in RL",
    "authors": [
      "Xiangyu Liu",
      "Souradip Chakraborty",
      "Yanchao Sun",
      "Furong Huang"
    ],
    "abstract": "Most existing works focus on direct perturbations to the victim's state/action or the underlying transition dynamics to demonstrate the vulnerability of reinforcement learning agents to adversarial attacks. However, such direct manipulations may not be always realizable.In this paper, we consider a multi-agent setting where a well-trained victim agent $\\nu$ is exploited by an attacker controlling another agent $\\alpha$ with an \\textit{adversarial policy}. Previous models do not account for the possibility that the attacker may only have partial control over $\\alpha$ or that the attack may produce easily detectable ``abnormal'' behaviors. Furthermore, there is a lack of provably efficient defenses against these adversarial policies. To address these limitations, we introduce a generalized attack framework that has the flexibility to model to what extent the adversary is able to control the agent, and allows the attacker to regulate the state distribution shift and produce stealthier adversarial policies. Moreover, we offer a provably efficient defense with polynomial convergence to the most robust victim policy through adversarial training with timescale separation. This stands in sharp contrast to supervised learning, where adversarial training typically provides only \\textit{empirical} defenses.Using the Robosumo competition experiments, we show that our generalized attack formulation results in much stealthier adversarial policies when maintaining the same winning rate as baselines. Additionally, our adversarial training approach yields stable learning dynamics and less exploitable victim policies.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pDCublKPmG",
    "arxiv_id": "2305.17342",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17784,
    "title": "On Adversarial Training without Perturbing all Examples",
    "authors": [
      "Max Losch",
      "Mohamed Omran",
      "David Stutz",
      "Mario Fritz",
      "Bernt Schiele"
    ],
    "abstract": "Adversarial training is the de-facto standard for improving robustness against adversarial examples. This usually involves a multi-step adversarial attack applied on each example during training. In this paper, we explore only constructing adversarial examples (AE) on a subset of the training examples. That is, we split the training set in two subsets $A$ and $B$, train models on both ($A\\cup B$) but construct AEs only for examples in $A$. Starting with $A$ containing only a single class, we systematically increase the size of $A$ and consider splitting by class and by examples. We observe that: (i) adv. robustness transfers by difficulty and to classes in $B$ that have never been adv. attacked during training, (ii) we observe a tendency for hard examples to provide better robustness transfer than easy examples, yet find this tendency to diminish with increasing complexity of datasets (iii) generating AEs on only $50$% of training data is sufficient to recover most of the baseline AT performance even on ImageNet. We observe similar transfer properties across tasks, where generating AEs on only $30$% of data can recover baseline robustness on the target task. We evaluate our subset analysis on a wide variety of image datasets like CIFAR-10, CIFAR-100, ImageNet-200 and show transfer to SVHN, Oxford-Flowers-102 and Caltech-256. In contrast to conventional practice, our experiments indicate that the utility of computing AEs varies by class and examples and that weighting examples from $A$ higher than $B$ provides high transfer performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pE6gWrASQm",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17783,
    "title": "On the Variance of Neural Network Training with respect to Test Sets and Distributions",
    "authors": [
      "Keller Jordan"
    ],
    "abstract": "Typical neural network trainings have substantial variance in test-set performance between repeated runs, impeding hyperparameter comparison and training reproducibility. We present the following results towards understanding this variation.(1) Despite having significant variance on their test-sets, we demonstrate that standard CIFAR-10 and ImageNet trainings have very little variance in their performance on the test-distributions from which their test-sets are sampled, suggesting that variance is less of a practical issue than previously thought.(2) We present a simplifying statistical assumption which closely approximates the structure of the test-set accuracy distribution.(3) We prove that test-set variance is unavoidable given the observation that ensembles of independently trained networks are well-calibrated.(4) We conduct preliminary studies of distribution-shift, fine-tuning, data augmentation and learning rate through the lens of variance between runs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pEGSdJu52I",
    "arxiv_id": "2304.01910",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17782,
    "title": "Scalable Modular Network: A Framework for Adaptive Learning via Agreement Routing",
    "authors": [
      "Minyang Hu",
      "Hong Chang",
      "Bingpeng Ma",
      "Shiguang Shan",
      "Xilin CHEN"
    ],
    "abstract": "In this paper, we propose a novel modular network framework, called Scalable Modular Network (SMN), which enables adaptive learning capability and supports integration of new modules after pre-training for better adaptation.This adaptive capability comes from a novel design of router within SMN, named agreement router, which selects and composes different specialist modules through an iterative message passing process.The agreement router iteratively computes the agreements among a set of input and outputs of all modules to allocate inputs to specific module.During the iterative routing, messages of modules are passed to each other, which improves the module selection process with consideration of both local interactions (between a single module and input) and global interactions involving multiple other modules.To validate our contributions, we conduct experiments on two problems: a toy min-max game and few-shot image classification task. Our experimental results demonstrate that SMN can generalize to new distributions and exhibit sample-efficient adaptation to new tasks. Furthermore, SMN can achieve a better adaptation capability when new modules are introduced after pre-training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pEKJl5sflp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17781,
    "title": "RAIN: Your Language Models Can Align Themselves without Finetuning",
    "authors": [
      "Yuhui Li",
      "Fangyun Wei",
      "Jinjing Zhao",
      "Chao Zhang",
      "Hongyang Zhang"
    ],
    "abstract": "Large language models (LLMs) often demonstrate inconsistencies with human preferences. Previous research typically gathered human preference data and then aligned the pre-trained models using reinforcement learning or instruction tuning, a.k.a. the finetuning step. In contrast, aligning frozen LLMs without requiring alignment data is more appealing. This work explores the potential of the latter setting. We discover that by integrating self-evaluation and rewind mechanisms, unaligned LLMs can directly produce responses consistent with human preferences via self-boosting. We introduce a novel inference method, Rewindable Auto-regressive INference (RAIN), that allows pre-trained LLMs to evaluate their own generation and use the evaluation results to guide rewind and generation for AI safety. Notably, RAIN operates without the need of extra data for model alignment and abstains from any training, gradient computation, or parameter updates. Experimental results evaluated by GPT-4 and humans demonstrate the effectiveness of RAIN: on the HH dataset, RAIN improves the harmlessness rate of LLaMA 30B from 82% of vanilla inference to 97%, while maintaining the helpfulness rate. On the TruthfulQA dataset, RAIN improves the truthfulness of the already-well-aligned LLaMA-2-chat 13B model by 5%.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pETSfWMUzy",
    "arxiv_id": "2309.07124",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17780,
    "title": "Robust Adversarial Reinforcement Learning via Bounded Rationality Curricula",
    "authors": [
      "Aryaman Reddi",
      "Maximilian T\u00f6lle",
      "Jan Peters",
      "Georgia Chalvatzaki",
      "Carlo D'Eramo"
    ],
    "abstract": "Robustness against adversarial attacks and distribution shifts is a long-standing goal of Reinforcement Learning (RL). To this end, Robust Adversarial Reinforcement Learning (RARL) trains a protagonist against destabilizing forces exercised by an adversary in a competitive zero-sum Markov game, whose optimal solution, i.e., rational strategy, corresponds to a Nash equilibrium. However, finding Nash equilibria requires facing complex saddle point optimization problems, which can be prohibitive to solve, especially for high-dimensional control. In this paper, we propose a novel approach for adversarial RL based on entropy regularization to ease the complexity of the saddle point optimization problem. We show that the solution of this entropy-regularized problem corresponds to a Quantal Response Equilibrium (QRE), a generalization of Nash equilibria that accounts for bounded rationality, i.e., agents sometimes play random actions instead of optimal ones. Crucially, the connection between the entropy-regularized objective and QRE enables free modulation of the rationality of the agents by simply tuning the temperature coefficient. We leverage this insight to propose our novel algorithm, Quantal Adversarial RL (QARL), which gradually increases the rationality of the adversary in a curriculum fashion until it is fully rational, easing the complexity of the optimization problem while retaining robustness. We provide extensive evidence of QARL outperforming RARL and recent baselines across several MuJoCo locomotion and navigation problems in overall performance and robustness.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=pFOoOdaiue",
    "arxiv_id": "2311.01642",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17778,
    "title": "Imitation Learning from Observation with Automatic Discount Scheduling",
    "authors": [
      "Yuyang Liu",
      "Weijun Dong",
      "Yingdong Hu",
      "Chuan Wen",
      "Zhao-Heng Yin",
      "Chongjie Zhang",
      "Yang Gao"
    ],
    "abstract": "Humans often acquire new skills through observation and imitation. For robotic agents, learning from the plethora of unlabeled video demonstration data available on the Internet necessitates imitating the expert without access to its action, presenting a challenge known as Imitation Learning from Observation (ILfO). A common approach to tackle ILfO problems is to convert them into inverse reinforcement learning problems, utilizing a proxy reward computed from the agent's and the expert's observations. Nonetheless, we identify that tasks characterized by a progress dependency property pose significant challenges for such approaches; in these tasks, the agent needs to initially learn the expert's preceding behaviors before mastering the subsequent ones. Our investigation reveals that the main cause is that the reward signals assigned to later steps hinder the learning of initial behaviors. To address this challenge, we present a novel ILfO framework that enables the agent to master earlier behaviors before advancing to later ones. We introduce an Automatic Discount Scheduling (ADS) mechanism that adaptively alters the discount factor in reinforcement learning during the training phase, prioritizing earlier rewards initially and gradually engaging later rewards only when the earlier behaviors have been mastered. Our experiments, conducted on nine Meta-World tasks, demonstrate that our method significantly outperforms state-of-the-art methods across all tasks, including those that are unsolvable by them. Our code is available at https://il-ads.github.io.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pPJTQYOpNI",
    "arxiv_id": "2310.07433",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17777,
    "title": "PBADet: A One-Stage Anchor-Free Approach for Part-Body Association",
    "authors": [
      "Zhongpai Gao",
      "Huayi Zhou",
      "Abhishek Sharma",
      "Meng Zheng",
      "Benjamin Planche",
      "Terrence Chen",
      "Ziyan Wu"
    ],
    "abstract": "The detection of human parts (e.g., hands, face) and their correct association with individuals is an essential task, e.g., for ubiquitous human-machine interfaces and action recognition. Traditional methodologies often employ multi-stage processes, rely on cumbersome anchor-based systems, or do not scale well to larger part sets. This paper presents PBADet, a novel one-stage, anchor-free approach for part-body association detection. Building upon the anchor-free object representation across multi-scale feature maps, we introduce a singular part-to-body center offset that effectively encapsulates the relationship between parts and their parent bodies. Our design is inherently versatile and capable of managing multiple parts-to-body associations without compromising on detection accuracy or robustness. Comprehensive experiments on various datasets underscore the efficacy of our approach, which not only outperforms existing state-of-the-art techniques but also offers a more streamlined and efficient solution to the part-body association challenge.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pPh9p8anUi",
    "arxiv_id": "2402.07814",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17776,
    "title": "RepoBench: Benchmarking Repository-Level Code Auto-Completion Systems",
    "authors": [
      "Tianyang Liu",
      "Canwen Xu",
      "Julian McAuley"
    ],
    "abstract": "Large Language Models (LLMs) have greatly advanced code auto-completion systems, with a potential for substantial productivity enhancements for developers. However, current benchmarks mainly focus on single-file tasks, leaving an assessment gap for more complex, real-world, multi-file programming scenarios. To fill this gap, we introduce RepoBench, a new benchmark specifically designed for evaluating repository-level code auto-completion systems. RepoBench consists of three interconnected evaluation tasks: RepoBench-R (Retrieval), RepoBench-C (Code Completion), and RepoBench-P (Pipeline). Each task respectively measures the system's ability to retrieve the most relevant code snippets from other files as cross-file context, predict the next line of code with cross-file and in-file context, and handle complex tasks that require a combination of both retrieval and next-line prediction. RepoBench aims to facilitate a more complete comparison of performance and encouraging continuous improvement in auto-completion systems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pPjZIOuQuF",
    "arxiv_id": "2306.03091",
    "GitHub": [
      "https://github.com/Leolty/repobench"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17775,
    "title": "SelfCheck: Using LLMs to Zero-Shot Check Their Own Step-by-Step Reasoning",
    "authors": [
      "Ning Miao",
      "Yee Whye Teh",
      "Tom Rainforth"
    ],
    "abstract": "The recent progress in large language models (LLMs), especially the invention of chain-of-thought prompting, has made it possible to automatically answer questions by stepwise reasoning. However, when faced with more complicated problems that require non-linear thinking, even the strongest LLMs make mistakes.  To address this, we explore whether LLMs are able to recognize errors in their own step-by-step reasoning, without resorting to external resources. To this end, we propose SelfCheck, a general-purpose zero-shot verification schema for recognizing such errors. We then use the results of these checks to improve question-answering performance by conducting weighted voting on multiple solutions to the question. We test SelfCheck on three datasets---GSM8K, MathQA, and MATH---and find that it successfully recognizes errors and, in turn, increases final answer accuracies.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pTHfApDakA",
    "arxiv_id": "2308.00436",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17774,
    "title": "GNeRP: Gaussian-guided Neural Reconstruction of Reflective Objects with Noisy Polarization Priors",
    "authors": [
      "LI Yang",
      "RUIZHENG WU",
      "Jiyong Li",
      "Ying-Cong Chen"
    ],
    "abstract": "Learning surfaces from neural radiance field (NeRF) became a rising topic in Multi-View Stereo (MVS).  Recent Signed Distance Function (SDF)-based methods demonstrated their ability to reconstruct exact 3D shapes of Lambertian scenes. However, their results on reflective scenes are unsatisfactory due to the entanglement of specular radiance and complicated geometry. To address the challenges, we propose a Gaussian-based representation of normals in SDF fields. Supervised by polarization priors, this representation guides the learning of geometry behind the specular reflection and capture more details than existing methods.  Moreover, we propose a reweighting strategy in optimization process to alleviate the noise issue of polarization priors. To validate the effectiveness of our design, we capture polarimetric information and ground truth meshes in additional reflective scenes with various geometry. We also evaluated our framework on PANDORA dataset. Both qualitative and quantitative comparisons prove our method outperforms existing neural 3D reconstruction methods in reflective scenes by a large margin.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pTN8dV2pL8",
    "arxiv_id": "2403.11899",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17773,
    "title": "Harnessing Joint Rain-/Detail-aware Representations to Eliminate Intricate Rains",
    "authors": [
      "Wu Ran",
      "Peirong Ma",
      "Zhiquan He",
      "Hao Ren",
      "Hong Lu"
    ],
    "abstract": "Recent advances in image de-raining have focused on training powerful models on mixed multiple datasets comprising diverse rain types and backgrounds. However, this approach tends to overlook the inherent differences between datasets, resulting in suboptimal optimization and poor generalization. To address this limitation, we propose an approach to learn instance-specific de-raining models by exploring meaningful representations that characterize both the rain and background components in rainy images. Leveraging these representations as instructive guidance, we put forth a Context-based Instance-specific Modulation (CoI-M) mechanism which can modulate CNN- or Transformer-based models. Furthermore, we develop a rain-/detail-aware contrastive learning strategy to help extract joint rain-/detail-aware instance-specific representations. By integrating CoI-M with the rain-/detail-aware Contrastive learning, we develop CoIC, an innovative and effective algorithm for training models on mixed datasets. Moreover, CoIC offers insight into modeling relationships of datasets, quantitatively assessing the impact of rain and details on restoration, and revealing different behaviors of models given diverse inputs. Extensive experiments validate the effectiveness of CoIC in boosting the de-raining ability of CNN- and Transformer-based models, as well as significantly improving their generalization ability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pdJXYfJjz9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17772,
    "title": "Graph Transformers on EHRs: Better Representation Improves Downstream Performance",
    "authors": [
      "Raphael Poulain",
      "Rahmatollah Beheshti"
    ],
    "abstract": "Following the success of transformer-based methods across various machine learning applications, their adoption to healthcare predictive tasks using electronic health records (EHR)  has also expanded extensively. Similarly, graph-based methods have been shown to be very effective in capturing inherent graph-type relationships in EHRs, leading to improved downstream performance. Although integrating these two families of approaches seems like a natural next step, in practice, creating such a design is challenging and has not been done. This is partly due to known EHR problems, such as high sparsity, making extracting meaningful temporal representations of medical visits challenging. In this study, we propose GT-BEHRT, a new approach that leverages temporal visit embeddings extracted from a graph transformer and uses a BERT-based model to obtain more robust patient representations, especially on longer EHR sequences. The graph-based approach allows GT-BEHRT to implicitly capture the intrinsic graphical relationships between medical observations, while the BERT model extracts the temporal relationships between visits, loosely mimicking the clinicians' decision-making process. As part of our method, we also present a two-step pre-training strategy for learning better graphical and temporal representations. Our proposed method achieves state-of-the-art performance in a variety of standard medical predictive tasks, demonstrating the versatility of our approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pe0Vdv7rsL",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17770,
    "title": "Benchmarking and Improving Generator-Validator Consistency of Language Models",
    "authors": [
      "Xiang Lisa Li",
      "Vaishnavi Shrivastava",
      "Siyan Li",
      "Tatsunori Hashimoto",
      "Percy Liang"
    ],
    "abstract": "As of September 2023, ChatGPT correctly answers \u201cwhat is 7+8\u201d with 15, but when asked \u201c7+8=15, True or False\u201d it responds with \u201cFalse\u201d. This inconsistency between generating and validating an answer is prevalent in language models (LMs) and erodes trust. In this paper, we propose a framework for measuring the consistency between generation and validation (which we call generator-validator consistency, or GV-consistency), finding that even GPT-4, a state-of-the-art LM, is GV-consistent only 76% of the time. To improve the consistency of LMs, we propose to finetune on the filtered generator and validator responses that are GV-consistent, and call this approach consistency fine-tuning. We find that this approach improves GV-consistency of Alpaca-30B from 60% to 93%, and the improvement extrapolates to unseen tasks and domains (e.g., GV-consistency for positive style transfers extrapolates to unseen styles like humor). In addition to improving consistency, consistency fine-tuning improves both generator quality and validator accuracy without using any labeled data. Evaluated across 6 tasks, including math questions, knowledge-intensive QA, and instruction following, our method improves the generator quality by 16% and the validator accuracy by 6.3% across all tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=phBS6YpTzC",
    "arxiv_id": "2310.01846",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17769,
    "title": "Probabilistic Adaptation of Black-Box Text-to-Video Models",
    "authors": [
      "Sherry Yang",
      "Yilun Du",
      "Bo Dai",
      "Dale Schuurmans",
      "Joshua B. Tenenbaum",
      "Pieter Abbeel"
    ],
    "abstract": "Large text-to-video models trained on internet-scale data have demonstrated exceptional capabilities in generating high-fidelity videos from arbitrary textual descriptions. However, similar to proprietary language models, large text-to-video models are often black boxes whose weight parameters are not publicly available, posing a significant challenge to adapting these models to specific domains such as robotics, animation, and personalized stylization. Inspired by how a large language model can be prompted to perform new tasks without access to the model weights, we investigate how to adapt a black-box pretrained text-to-video model to a variety of downstream domains without weight access to the pretrained model. In answering this question, we propose \\emph{\\methodname}, which leverages the score function of a large pretrained video diffusion model as a probabilistic prior to guide the generation of a task-specific small video model. Our experiments show that, by incorporating broad knowledge and fidelity of the pretrained model probabilistically, a small model with as few as 1.25% parameters of the pretrained model can generate high-quality yet domain-specific videos for a variety of downstream domains such as animation, egocentric modeling, and modeling of simulated and real-world robotics data. As large text-to-video models starting to become available as a service similar to large language models, we advocate for private institutions to expose scores of video diffusion models as outputs in addition to generated videos to allow flexible adaptation of large pretrained text-to-video models by the general public.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pjtIEgscE3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17790,
    "title": "Soft Contrastive Learning for Time Series",
    "authors": [
      "Seunghan Lee",
      "Taeyoung Park",
      "Kibok Lee"
    ],
    "abstract": "Contrastive learning has shown to be effective to learn representations from time series in a self-supervised way.However, contrasting similar time series instances or values from adjacent timestamps within a time series leads to ignore their inherent correlations, which results in deteriorating the quality of learned representations.To address this issue, we propose \\textit{SoftCLT}, a simple yet effective soft contrastive learning strategy for time series.This is achieved by introducing instance-wise and temporal contrastive loss with soft assignments ranging from zero to one.Specifically, we define soft assignments for 1) instance-wise contrastive loss by distance between time series on the data space, warping and 2) temporal contrastive loss by the difference of timestamps.SoftCLT is a plug-and-play method for time series contrastive learning that improves the quality of learned representations without bells and whistles.In experiments, we demonstrate that SoftCLT consistently improves the performance in various downstream tasks including classification, semi-supervised learning, transfer learning, and anomaly detection, showing state-of-the-art performance.Code is available at this repository: https://github.com/seunghan96/softclt.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=pAsQSWlDUf",
    "arxiv_id": "2312.16424",
    "GitHub": [
      "https://github.com/seunghan96/softclt"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17768,
    "title": "Kernel Metric Learning for In-Sample Off-Policy Evaluation of Deterministic RL Policies",
    "authors": [
      "Haanvid Lee",
      "Tri Wahyu Guntara",
      "Jongmin Lee",
      "Yung-Kyun Noh",
      "Kee-Eung Kim"
    ],
    "abstract": "We consider off-policy evaluation (OPE) of deterministic target policies for reinforcement learning (RL) in environments with continuous action spaces. While it is common to use importance sampling for OPE, it suffers from high variance when the behavior policy deviates significantly from the target policy. In order to address this issue, some recent works on OPE proposed in-sample learning with importance resampling. Yet, these approaches are not applicable to deterministic target policies for continuous action spaces. To address this limitation, we propose to relax the deterministic target policy using a kernel and learn the kernel metrics that minimize the overall mean squared error of the estimated temporal difference update vector of an action value function, where the action value function is used for policy evaluation. We derive the bias and variance of the estimation error due to this relaxation and provide analytic solutions for the optimal kernel metric. In empirical studies using various test domains, we show that the OPE with in-sample learning using the kernel with optimized metric achieves significantly improved accuracy than other baselines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=plebgsdiiV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17767,
    "title": "Jailbreak in pieces: Compositional Adversarial Attacks on Multi-Modal Language Models",
    "authors": [
      "Erfan Shayegani",
      "Yue Dong",
      "Nael Abu-Ghazaleh"
    ],
    "abstract": "We introduce new jailbreak attacks on vision language models (VLMs), which use aligned LLMs and are resilient to text-only jailbreak attacks. Specifically, we develop cross-modality attacks on alignment where we pair adversarial images going through the vision encoder with textual prompts to break the alignment of the language model. Our attacks employ a novel compositional strategy that combines an image, adversarially targeted towards toxic embeddings, with generic prompts to accomplish the jailbreak. Thus, the LLM draws the context to answer the generic prompt from the adversarial image. The generation of benign-appearing adversarial images leverages a novel embedding-space-based methodology, operating with no access to the LLM model. Instead, the attacks require access only to the vision encoder and utilize one of our four embedding space targeting strategies. By not requiring access to the LLM, the attacks lower the entry barrier for attackers, particularly when vision encoders such as CLIP are embedded in closed-source LLMs. The attacks achieve a high success rate across different VLMs, highlighting the risk of cross-modality alignment vulnerabilities, and the need for new alignment approaches for multi-modal models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=plmBsXHxgR",
    "arxiv_id": "2307.14539",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17766,
    "title": "Tractable MCMC for Private Learning with Pure and Gaussian Differential Privacy",
    "authors": [
      "Yingyu Lin",
      "Yian Ma",
      "Yu-Xiang Wang",
      "Rachel Emily Redberg",
      "Zhiqi Bu"
    ],
    "abstract": "Posterior sampling, i.e., exponential mechanism to sample from the posterior distribution, provides $\\varepsilon$-pure differential privacy (DP) guarantees and does not suffer from potentially unbounded privacy breach introduced by $(\\varepsilon,\\delta)$-approximate DP. In practice, however, one needs to apply approximate sampling methods such as Markov chain Monte Carlo (MCMC), thus re-introducing the unappealing $\\delta$-approximation error into the privacy guarantees. To bridge this gap, we propose the Approximate SAample Perturbation (abbr. ASAP) algorithm which perturbs an MCMC sample with noise proportional to its Wasserstein-infinity ($W_\\infty$) distance from a reference distribution that satisfies pure DP or pure Gaussian DP (i.e., $\\delta=0$). We then leverage a Metropolis-Hastings algorithm to generate the sample and prove that the algorithm converges in W$_\\infty$ distance. We show that by combining our new techniques with a careful localization step, we obtain the first nearly linear-time algorithm that achieves the optimal rates in the DP-ERM problem with strongly convex and smooth losses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pmweVpJ229",
    "arxiv_id": "2310.14661",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17765,
    "title": "AmortizedPeriod: Attention-based Amortized Inference for Periodicity Identification",
    "authors": [
      "Hang Yu",
      "Cong Liao",
      "Ruolan Liu",
      "Jianguo Li",
      "Hu Yun",
      "Xinzhe Wang"
    ],
    "abstract": "Periodic patterns are a fundamental characteristic of time series in natural world, with significant implications for a range of disciplines, from economics to cloud systems. However, the current literature on periodicity detection faces two key challenges: limited robustness in real-world scenarios and a lack of memory to leverage previously observed time series to accelerate and improve inference on new data. To overcome these obstacles, this paper presents AmortizedPeriod, an innovative approach to periodicity identification based on amortized variational inference that integrates Bayesian statistics and deep learning. Through the Bayesian generative process, our method flexibly captures the dependencies of the periods, trends, noise, and outliers in time series, while also considering missing data and irregular periods in a robust manner. In addition, it utilizes the evidence lower bound of the log-likelihood of the observed time series as the loss function to train a deep attention inference network, facilitating knowledge transfer from the seen time series (and their labels) to unseen ones. Experimental results show that AmortizedPeriod surpasses the state-of-the-art methods by a large margin of $28.5\\%$ on average in terms of micro $F_1$-score, with at least $55\\%$ less inference time.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=psEswR8Jz4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17793,
    "title": "Improved Regret Bounds for Non-Convex Online-Within-Online Meta Learning",
    "authors": [
      "Jiechao Guan",
      "Hui Xiong"
    ],
    "abstract": "Online-Within-Online (OWO) meta learning stands for the online multi-task learning paradigm in which both tasks and data within each task become available in a sequential order. In this work, we study the OWO meta learning of the initialization and step size of within-task online algorithms in the non-convex setting, and provide improved regret bounds under mild assumptions of loss functions. Previous work analyzing this scenario has obtained for bounded and piecewise Lipschitz functions an averaged regret bound $O((\\frac{\\sqrt{m}}{T^{1/4}}+\\frac{(\\log{m})\\log{T}}{\\sqrt{T}}+V)\\sqrt{m})$ across $T$ tasks, with $m$ iterations per task and $V$ the task similarity. Our first contribution is to modify the existing non-convex OWO meta learning algorithm and improve the regret bound to $O((\\frac{1}{T^{1/2-\\alpha}}+\\frac{(\\log{T})^{9/2}}{T}+V)\\sqrt{m})$, for any $\\alpha \\in (0,1/2)$. The derived bound has a faster convergence rate with respect to $T$, and guarantees a vanishing task-averaged regret with respect to $m$ (for any fixed $T$). Then, we propose a new algorithm of regret $O((\\frac{\\log{T}}{T}+V)\\sqrt{m})$ for non-convex OWO meta learning. This regret bound exhibits a better asymptotic performance than previous ones, and holds for any bounded (not necessarily Lipschitz) loss functions. Besides the improved regret bounds, our contributions include investigating how to attain generalization bounds for statistical meta learning via regret analysis. Specifically, by online-to-batch arguments, we achieve a transfer risk bound for batch meta learning that assumes all tasks are drawn from a distribution. Moreover, by connecting multi-task generalization error with task-averaged regret, we develop for statistical multi-task learning a novel PAC-Bayes generalization error bound that involves our regret bound for OWO meta learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pA8Q5WiEMg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17764,
    "title": "#InsTag: Instruction Tagging for Analyzing Supervised Fine-tuning of Large Language Models",
    "authors": [
      "Keming Lu",
      "Hongyi Yuan",
      "Zheng Yuan",
      "Runji Lin",
      "Junyang Lin",
      "Chuanqi Tan",
      "Chang Zhou",
      "Jingren Zhou"
    ],
    "abstract": "Pre-trained large language models (LLMs) can understand and align with human instructions by supervised fine-tuning (SFT).It is commonly believed that diverse and complex SFT data are of the essence to enable good instruction-following abilities.However, such diversity and complexity are obscure and lack quantitative analyses.In this work, we propose InsTag, an open-set instruction tagging method, to identify semantics and intentions of human instructions by tags that provide access to definitions and quantified analyses of instruction diversity and complexity.We obtain 6.6K fine-grained tags to describe instructions from popular open-sourced SFT datasets comprehensively.We find that the abilities of aligned LLMs benefit from more diverse and complex instructions in SFT data.Based on this observation, we propose a data sampling procedure based on InsTag, and select 6K diverse and complex samples from open-source datasets for SFT.The resulting models, TagLM, outperform open-source models based on considerably larger SFT data evaluated by MT-Bench, echoing the importance of instruction diversity and complexity and the effectiveness of InsTag.InsTag has robust potential to be extended to more applications beyond the data selection as it provides an effective way to analyze the distribution of instructions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pszewhybU9",
    "arxiv_id": "2308.07074",
    "GitHub": [
      "https://github.com/OFA-Sys/InsTag"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17794,
    "title": "Only Pay for What Is Uncertain: Variance-Adaptive Thompson Sampling",
    "authors": [
      "Aadirupa Saha",
      "Branislav Kveton"
    ],
    "abstract": "Most bandit algorithms assume that the reward variances or their upper bounds are known, and that they are the same for all arms. This naturally leads to suboptimal performance and higher regret due to variance overestimation. On the other hand, underestimated reward variances may lead to linear regret due to committing early to a suboptimal arm. This motivated prior works on variance-adaptive frequentist algorithms, which have strong instance-dependent regret bounds but cannot incorporate prior knowledge on reward variances. We lay foundations for the Bayesian setting, which incorporates prior knowledge. This results in lower regret in practice, due to using the prior in the algorithm design, and also improved regret guarantees. Specifically, we study Gaussian bandits with \\emph{unknown heterogeneous reward variances}, and develop a Thompson sampling algorithm with prior-dependent Bayes regret bounds. We achieve lower regret with lower reward variances and more informative priors on them, which is precisely why we pay only for what is uncertain. This is the first result of its kind. Finally, we corroborate our theory with extensive experiments, which show the superiority of our variance-adaptive Bayesian algorithm over prior frequentist approaches. We also show that our approach is robust to model misspecification and can be applied with estimated priors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=p8ujRTjEf3",
    "arxiv_id": "2303.09033",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17762,
    "title": "$\\alpha$TC-VAE: On the relationship between Disentanglement and Diversity",
    "authors": [
      "Cristian Meo",
      "Louis Mahon",
      "Anirudh Goyal",
      "Justin Dauwels"
    ],
    "abstract": "Understanding and developing optimal representations has long been foundational in machine learning (ML). While disentangled representations have shown promise in generative modeling and representation learning, their downstream usefulness remains debated. Recent studies re-defined disentanglement through a formal connection to symmetries, emphasizing the ability to reduce latent domains (i.e., ML problem spaces) and consequently enhance data efficiency and generative capabilities. However, from an information theory viewpoint, assigning a complex attribute (i.e., features) to a specific latent variable may be infeasible, limiting the applicability of disentangled representations to simple datasets. In this work, we introduce $\\alpha$-TCVAE, a variational autoencoder optimized using a novel total correlation (TC) lower bound that maximizes disentanglement and latent variables informativeness. The proposed TC bound is grounded in information theory constructs, generalizes the $\\beta$-VAE lower bound, and can be reduced to a convex combination of the known variational information bottleneck (VIB) and conditional entropy bottleneck (CEB) terms. Moreover, we present quantitative analyses and correlation studies that, through the lenses of diversity, support the idea that smaller latent domains (i.e., disentangled representations) lead to better generative capabilities and diversity. Additionally, we perform downstream task experiments from both representation and reinforcement learning domains to assess our questions from a broader ML perspective. Our results demonstrate that $\\alpha$-TCVAE consistently learns more disentangled representations than baselines and generates more diverse observations without sacrificing visual fidelity. Notably, $\\alpha$-TCVAE exhibits marked improvements on MPI3D-Real, the most realistic disentangled dataset in our study,  confirming its ability to represent complex datasets when maximizing the informativeness of individual variables. Finally, testing the proposed model off-the-shelf on a state-of-the-art model-based RL agent, Director, significantly shows $\\alpha$-TCVAE downstream usefulness on the loconav Ant Maze task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ptXo0epLQo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17761,
    "title": "CIFAR-10-Warehouse: Broad and More Realistic Testbeds in Model Generalization Analysis",
    "authors": [
      "Xiaoxiao Sun",
      "Xingjian Leng",
      "Zijian Wang",
      "Yang Yang",
      "Zi Huang",
      "Liang Zheng"
    ],
    "abstract": "Analyzing model performance in various unseen environments is a critical research problem in the machine learning community. To study this problem, it is important to construct a testbed with out-of-distribution test sets that have broad coverage of environmental discrepancies. However, existing testbeds typically either have a small number of domains or are synthesized by image corruptions, hindering algorithm design that demonstrates real-world effectiveness. In this paper, we introduce CIFAR-10-Warehouse, consisting of 180 datasets collected by prompting image search engines and diffusion models in various ways. Generally sized between 300 and 8,000 images, the datasets contain natural images, cartoons, certain colors, or objects that do not naturally appear. With CIFAR-10-W, we aim to enhance the evaluation and deepen the understanding of two generalization tasks: domain generalization and model accuracy prediction in various out-of-distribution environments. We conduct extensive benchmarking and comparison experiments and show that CIFAR-10-W offers new and interesting insights inherent to these tasks. We also discuss other fields that would benefit from CIFAR-10-W.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pw2ssoOTpo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17796,
    "title": "Traveling Waves Encode The Recent Past and Enhance Sequence Learning",
    "authors": [
      "T. Anderson Keller",
      "Lyle Muller",
      "Terrence Sejnowski",
      "Max Welling"
    ],
    "abstract": "Traveling waves of neural activity have been observed throughout the brain at a diversity of regions and scales; however, their precise computational role is still debated. One physically grounded hypothesis suggests that the cortical sheet may act like a wave-field capable of invertibly storing a short-term memory of sequential stimuli through induced waves traveling across the cortical surface, and indeed many experimental results from neuroscience correlate wave activity with memory tasks.  To date, however, the computational implications of this idea have remained hypothetical due to the lack of a simple recurrent neural network architecture capable of exhibiting such waves. In this work, we introduce a model to fill this gap, which we denote the Wave-RNN (wRNN), and demonstrate how such an architecture indeed efficiently encodes the recent past through a suite of synthetic memory tasks where wRNNs learn faster and reach significantly lower error than wave-free counterparts. We further explore the implications of this memory storage system on more complex sequence modeling tasks such as sequential image classification and find that wave-based models not only again outperform comparable wave-free RNNs while using significantly fewer parameters, but additionally perform comparably to more complex gated architectures such as LSTMs and GRUs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=p4S5Z6Sah4",
    "arxiv_id": "2309.08045",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17797,
    "title": "Lie Group Decompositions for Equivariant Neural Networks",
    "authors": [
      "Mircea Mironenco",
      "Patrick Forr\u00e9"
    ],
    "abstract": "Invariance and equivariance to geometrical transformations have proven to be very useful inductive biases when training (convolutional) neural network models, especially in the low-data regime.Much work has focused on the case where the symmetry group employed is compact or abelian, or both.Recent work has explored enlarging the class of transformations used to the case of Lie groups, principally through the use of their Lie algebra, as well as the group exponential and logarithm maps.The applicability of such methods to larger transformation groups is limited by the fact that depending on the group of interest $G$, the exponential map may not be surjective.Further limitations are encountered when $G$ is neither compact nor abelian.Using the structure and geometry of Lie groups and their homogeneous spaces, we present a framework by which it is possible to work with such groups primarily focusing on the Lie groups $G = \\textnormal{GL}^{+}(n, \\mathbb{R})$ and $G = \\textnormal{SL}(n, \\mathbb{R})$, as well as their representation as affine transformations $\\mathbb{R}^{n} \\rtimes G$.Invariant integration as well as a global parametrization is realized by decomposing the \"larger\" groups into subgroups and submanifolds which can be handled individually.Under this framework, we show how convolution kernels can be parametrized to build models equivariant with respect to affine transformations.We evaluate the robustness and out-of-distribution generalisation capability of our model on the standard affine-invariant benchmark classification task, where we outperform all previous equivariant models as well as all Capsule Network proposals.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=p34fRKp8qA",
    "arxiv_id": "2310.11366",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17760,
    "title": "InterpGNN: Understand and Improve Generalization Ability of Transdutive GNNs through the Lens of Interplay between Train and Test Nodes",
    "authors": [
      "Jiawei Sun",
      "Kailai Li",
      "Ruoxin Chen",
      "Jie LI",
      "Chentao Wu",
      "Yue Ding",
      "Junchi Yan"
    ],
    "abstract": "Transductive node prediction has been a popular learning setting in Graph Neural Networks (GNNs). It has been widely observed that the shortage of information flow between the distant nodes and intra-batch nodes (for large-scale graphs) often hurt the generalization of GNNs which overwhelmingly adopt message-passing. Yet there is still no formal and direct theoretical results to quantitatively capture the underlying mechanism, despite the recent advance in both theoretical and empirical studies for GNN's generalization ability. In this paper, the $L$-hop interplay (i.e., message passing capability with training nodes) for a  $L$-layer GNN is successfully incorporated in our derived PAC-Bayesian bound for GNNs in the semi-supervised transductive setting. In other words, we quantitatively show how the interplay between training and testing sets influence the generalization ability which also partly explains the effectiveness of some existing empirical methods for enhancing generalization. Based on this result, we further design a plug-and-play ***Graph** **G**lobal **W**orkspace* module for GNNs (InterpGNN-GW) to enhance the interplay, utilizing the key-value attention mechanism to summarize crucial nodes' embeddings into memory and broadcast the memory to all nodes, in contrast to the pairwise attention scheme in previous graph transformers. Extensive experiments on both small-scale and large-scale graph datasets validate the effectiveness of our theory and approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pwW807WJ9G",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17759,
    "title": "ODE Discovery for Longitudinal Heterogeneous Treatment Effects Inference",
    "authors": [
      "Krzysztof Kacprzyk",
      "Samuel Holt",
      "Jeroen Berrevoets",
      "Zhaozhi Qian",
      "Mihaela van der Schaar"
    ],
    "abstract": "Inferring unbiased treatment effects has received widespread attention in the machine learning community. In recent years, our community has proposed numerous solutions in standard settings, high-dimensional treatment settings, and even longitudinal settings. While very diverse, the solution has almost always relied on neural networks for inference and simultaneous correction of assignment bias. New approaches typically build on top of previous approaches by proposing new (or refined) architectures and learning algorithms. However, the end result\u2014a neural-network-based inference machine\u2014remains unchallenged. In this paper, we introduce a different type of solution in the longitudinal setting: a closed-form and human-readable ordinary differential equation (ODE). While we still rely on continuous optimization to learn an ODE, the resulting inference machine is no longer a neural network. Doing so yields several advantages such as interpretability, irregular sampling, and a different set of identification assumptions. Above all, we consider the introduction of a completely new type of solution to be our most important contribution as it may spark entirely new innovations in treatment effects in general. We facilitate this by formulating our contribution as a framework that can transform any ODE discovery method into a treatment effects method.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=pxI5IPeWgW",
    "arxiv_id": "2403.10766",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17758,
    "title": "Effective and Efficient Federated Tree Learning on Hybrid Data",
    "authors": [
      "Qinbin Li",
      "Chulin Xie",
      "Xiaojun Xu",
      "Xiaoyuan Liu",
      "Ce Zhang",
      "Bo Li",
      "Bingsheng He",
      "Dawn Song"
    ],
    "abstract": "Federated learning has emerged as a promising distributed learning paradigm that facilitates collaborative learning among multiple parties without transferring raw data. However, most existing federated learning studies focus on either horizontal or vertical data settings, where the data of different parties are assumed to be from the same feature or sample space. In practice, a common scenario is the hybrid data setting, where data from different parties may differ both in the features and samples. To address this, we propose HybridTree, a novel federated learning approach that enables federated tree learning on hybrid data. We observe the existence of consistent split rules in trees. With the help of these split rules, we theoretically show that the knowledge of parties can be incorporated into the lower layers of a tree. Based on our theoretical analysis, we propose a layer-level solution that does not need frequent communication traffic to train a tree. Our experiments demonstrate that HybridTree can achieve comparable accuracy to the centralized setting with low computational and communication overhead. HybridTree can achieve up to 8 times speedup compared with the other baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=py4ZV2qYQI",
    "arxiv_id": "2310.11865",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17757,
    "title": "Quantifying the Sensitivity of Inverse Reinforcement Learning to Misspecification",
    "authors": [
      "Joar Max Viktor Skalse",
      "Alessandro Abate"
    ],
    "abstract": "Inverse reinforcement learning (IRL) aims to infer an agent's *preferences* (represented as a reward function $R$) from their *behaviour* (represented as a policy $\\pi$). To do this, we need a *behavioural model* of how $\\pi$ relates to $R$. In the current literature, the most common behavioural models are *optimality*, *Boltzmann-rationality*, and *causal entropy maximisation*. However, the true relationship between a human's preferences and their behaviour is much more complex than any of these behavioural models. This means that the behavioural models are *misspecified*, which raises the concern that they may lead to systematic errors if applied to real data. In this paper, we analyse how sensitive the IRL problem is to misspecification of the behavioural model. Specifically, we provide necessary and sufficient conditions that completely characterise how the observed data may differ from the assumed behavioural model without incurring an error above a given threshold. In addition to this, we also characterise the conditions under which a behavioural model is robust to small perturbations of the observed policy, and we analyse how robust many behavioural models are to misspecification of their parameter values (such as e.g. the discount rate). Our analysis suggests that the IRL problem is highly sensitive to misspecification, in the sense that very mild misspecification can lead to very large errors in the inferred reward function.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pz2E1Q9Wni",
    "arxiv_id": "2403.06854",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17755,
    "title": "Conformal Language Modeling",
    "authors": [
      "Victor Quach",
      "Adam Fisch",
      "Tal Schuster",
      "Adam Yala",
      "Jae Ho Sohn",
      "Tommi S. Jaakkola",
      "Regina Barzilay"
    ],
    "abstract": "In this paper, we propose a novel approach to conformal prediction for  language models (LMs) in which we produce prediction sets with performance guarantees. LM responses are typically sampled from a predicted distribution over the large, combinatorial output space of  language. Translating this to conformal prediction, we calibrate a stopping rule for sampling LM outputs  that get added to a growing set of candidates until we are confident that the set covers at least one acceptable response. Since some samples may be low-quality, we also simultaneously calibrate a rejection rule for removing candidates from the output set to reduce noise. Similar to conformal prediction, we  can prove that the final output set obeys certain desirable distribution-free guarantees. Within these sets of candidate responses, we also show that we can also identify subsets of individual components---such as phrases or sentences---that are each independently correct (e.g., that are not ``hallucinations''), again with guarantees. Our method can be applied to any LM API that supports sampling. Furthermore, we empirically demonstrate that we can achieve many desired coverage levels within a limited number of total samples when applying our method to  multiple tasks in open-domain question answering, text summarization, and radiology report generation using different LM variants.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pzUhfQ74c5",
    "arxiv_id": "2306.10193",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17754,
    "title": "Universal Guidance for Diffusion Models",
    "authors": [
      "Arpit Bansal",
      "Hong-Min Chu",
      "Avi Schwarzschild",
      "Soumyadip Sengupta",
      "Micah Goldblum",
      "Jonas Geiping",
      "Tom Goldstein"
    ],
    "abstract": "Typical diffusion models are trained to accept a particular form of conditioning, most commonly text, and cannot be conditioned on other modalities without retraining. In this work, we propose a universal guidance algorithm that enables diffusion models to be controlled by arbitrary guidance modalities without the need to retrain any use-specific components. We show that our algorithm successfully generates quality images with guidance functions including segmentation, face recognition, object detection, style guidance and classifier signals.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=pzpWBbnwiJ",
    "arxiv_id": "2302.07121",
    "GitHub": [
      "https://github.com/arpitbansal297/Universal-Guided-Diffusion"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17753,
    "title": "Adversarial Attacks on Fairness of Graph Neural Networks",
    "authors": [
      "Binchi Zhang",
      "Yushun Dong",
      "Chen Chen",
      "Yada Zhu",
      "Minnan Luo",
      "Jundong Li"
    ],
    "abstract": "Fairness-aware graph neural networks (GNNs) have gained a surge of attention as they can reduce the bias of predictions on any demographic group (e.g., female) in graph-based applications. Although these methods greatly improve the algorithmic fairness of GNNs, the fairness can be easily corrupted by carefully designed adversarial attacks. In this paper, we investigate the problem of adversarial attacks on fairness of GNNs and propose G-FairAttack, a general framework for attacking various types of fairness-aware GNNs in terms of fairness with an unnoticeable effect on prediction utility. In addition, we propose a fast computation technique to reduce the time complexity of G-FairAttack. The experimental study demonstrates that G-FairAttack successfully corrupts the fairness of different types of GNNs while keeping the attack unnoticeable. Our study on fairness attacks sheds light on potential vulnerabilities in fairness-aware GNNs and guides further research on the robustness of GNNs in terms of fairness.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=q3KNrmW6Ql",
    "arxiv_id": "2310.13822",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17752,
    "title": "Solving High Frequency and Multi-Scale PDEs with Gaussian Processes",
    "authors": [
      "Shikai Fang",
      "Madison Cooley",
      "Da Long",
      "Shibo Li",
      "Mike Kirby",
      "Shandian Zhe"
    ],
    "abstract": "Machine learning based solvers have garnered much attention in physical simulation and scientific computing, with a prominent example, physics-informed neural networks (PINNs). However, PINNs often struggle to solve high-frequency and multi-scale PDEs, which can be due to the spectral bias during neural network training. To address this problem, we resort to the Gaussian process (GP) framework. To flexibly capture the dominant frequencies, we model the power spectrum of the PDE solution with a student $t$ mixture or Gaussian mixture. We then apply inverse Fourier transform to obtain the covariance function (according to the Wiener-Khinchin theorem). The covariance derived from the Gaussian mixture spectrum corresponds to the known spectral mixture kernel. We are the first to discover its rationale and effectiveness for PDE solving. Next,  we estimate the mixture weights in the log domain, which we show is equivalent to placing a Jeffreys prior. It automatically induces sparsity, prunes excessive frequencies, and adjusts the remaining toward the ground truth. Third, to enable efficient and scalable computation on massive collocation points, which are critical to capture high frequencies, we place the collocation points on a grid, and multiply our covariance function at each input dimension. We use the GP conditional mean to predict the solution and its derivatives so as to fit the boundary condition and the equation itself. As a result, we can derive a Kronecker product structure in the covariance matrix. We use Kronecker product properties and multilinear algebra to greatly promote computational efficiency and scalability, without any low-rank approximations. We show the advantage of our method in systematic experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=q4AEBLHuA6",
    "arxiv_id": "2311.04465",
    "GitHub": [
      "https://github.com/xuangu-fang/Gaussian-Process-Slover-for-High-Freq-PDE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17751,
    "title": "An Investigation of Representation and Allocation Harms in Contrastive Learning",
    "authors": [
      "Subha Maity",
      "Mayank Agarwal",
      "Mikhail Yurochkin",
      "Yuekai Sun"
    ],
    "abstract": "The effect of underrepresentation on the performance of minority groups is known to be a serious problem in supervised learning settings; however, it has been underexplored so far in the context of self-supervised learning (SSL). In this paper, we demonstrate that contrastive learning (CL), a popular variant of SSL, tends to collapse representations of minority groups with certain majority groups. We refer to this phenomenon as representation harm and demonstrate it on image and text datasets using the corresponding popular CL methods. Furthermore, our causal mediation analysis of allocation harm on a downstream classification task reveals that representation harm is partly responsible for it, thus emphasizing the importance of studying and mitigating representation harm. Finally, we provide a theoretical explanation for representation harm using a stochastic block model that leads to a representational neural collapse in a contrastive learning setting.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=q4SiDyYQbo",
    "arxiv_id": "2310.01583",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17749,
    "title": "Leveraging Hyperbolic Embeddings for Coarse-to-Fine Robot Design",
    "authors": [
      "Heng Dong",
      "Junyu Zhang",
      "Chongjie Zhang"
    ],
    "abstract": "Multi-cellular robot design aims to create robots comprised of numerous cells that can be efficiently controlled to perform diverse tasks. Previous research has demonstrated the ability to generate robots for various tasks, but these approaches often optimize robots directly in the vast design space, resulting in robots with complicated morphologies that are hard to control. In response, this paper presents a novel coarse-to-fine method for designing multi-cellular robots. Initially, this strategy seeks optimal coarse-grained robots and progressively refines them. To mitigate the challenge of determining the precise refinement juncture during the coarse-to-fine transition, we introduce the Hyperbolic Embeddings for Robot Design (HERD) framework. HERD unifies robots of various granularity within a shared hyperbolic space and leverages a refined Cross-Entropy Method for optimization. This framework enables our method to autonomously identify areas of exploration in hyperbolic space and concentrate on regions demonstrating promise.  Finally, the extensive empirical studies on various challenging tasks sourced from EvoGym show our approach's superior efficiency and generalization capability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=q9jQPA6zPK",
    "arxiv_id": "2311.00462",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17750,
    "title": "Large-Vocabulary 3D Diffusion Model with Transformer",
    "authors": [
      "Ziang Cao",
      "Fangzhou Hong",
      "Tong Wu",
      "Liang Pan",
      "Ziwei Liu"
    ],
    "abstract": "Creating diverse and high-quality 3D assets with an automatic generative model is highly desirable. Despite extensive efforts on 3D generation, most existing works focus on the generation of a single category or a few categories. In this paper, we introduce a diffusion-based feed-forward framework for synthesizing massive categories of real-world 3D objects \\textit{with a single generative model}. Notably, there are three major challenges for this large-vocabulary 3D generation: \\textbf{a}) the need for expressive yet efficient 3D representation; \\textbf{b}) large diversity in geometry and texture across categories; \\textbf{c}) complexity in the appearances of real-world objects. To this end, we propose a novel triplane-based 3D-aware \\textbf{Diff}usion model with \\textbf{T}rans\\textbf{F}ormer, \\textbf{DiffTF}, for handling challenges via three aspects. \\textbf{1}) Considering efficiency and robustness, we adopt a revised triplane representation and improve the fitting speed and accuracy. \\textbf{2}) To handle the drastic variations in geometry and texture, we regard the features of all 3D objects as a combination of generalized 3D knowledge and specialized 3D features. To extract generalized 3D knowledge from diverse categories, we propose a novel 3D-aware transformer with shared cross-plane attention. It learns the cross-plane relations across different planes and aggregates the generalized 3D knowledge with specialized 3D features. \\textbf{3}) In addition, we devise the 3D-aware encoder/decoder to enhance the generalized 3D knowledge in the encoded triplanes for handling categories with complex appearances. Extensive experiments on ShapeNet and OmniObject3D (over 200 diverse real-world categories) convincingly demonstrate that a single DiffTF model achieves state-of-the-art large-vocabulary 3D object generation performance with large diversity, rich semantics, and high quality. More results are available at https://difftf.github.io/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=q57JLSE2j5",
    "arxiv_id": "2309.07920",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17748,
    "title": "Efficient Integrators for Diffusion Generative Models",
    "authors": [
      "Kushagra Pandey",
      "Maja Rudolph",
      "Stephan Mandt"
    ],
    "abstract": "Diffusion models suffer from slow sample generation at inference time. Therefore, developing a principled framework for fast deterministic/stochastic sampling for a broader class of diffusion models is a promising direction. We propose two complementary frameworks for accelerating sample generation in pre-trained models: Conjugate Integrators and Splitting Integrators. Conjugate integrators generalize DDIM, mapping the reverse diffusion dynamics to a more amenable space for sampling. In contrast, splitting-based integrators, commonly used in molecular dynamics, reduce the numerical simulation error by cleverly alternating between numerical updates involving the data and auxiliary variables. After extensively studying these methods empirically and theoretically, we present a hybrid method that leads to the best-reported performance for diffusion models in augmented spaces. Applied to Phase Space Langevin Diffusion [Pandey \\& Mandt, 2023] on CIFAR-10, our deterministic and stochastic samplers achieve FID scores of 2.11 and 2.36 in only 100 network function evaluations (NFE) as compared to 2.57 and 2.63 for the best-performing baselines, respectively. Our code and model checkpoints will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qA4foxO5Gf",
    "arxiv_id": "2310.07894",
    "GitHub": [
      "https://github.com/mandt-lab/PSLD"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17738,
    "title": "Learning Grounded Action Abstractions from Language",
    "authors": [
      "Lionel Wong",
      "Jiayuan Mao",
      "Pratyusha Sharma",
      "Zachary S Siegel",
      "Jiahai Feng",
      "Noa Korneev",
      "Joshua B. Tenenbaum",
      "Jacob Andreas"
    ],
    "abstract": "Long-horizon planning is dauntingly hard -- it requires modeling relevant aspects of the environment and searching over large, complex action spaces. \\textit{Hierarchical planning} approaches make complex problems more tractable using temporal \\textit{action abstractions}, decomposing hard tasks into smaller abstract subproblems that can be solved modularly. However, actually learning useful action abstractions has long posed significant challenges without human expert knowledge. Here, we introduce a system that leverages background information in language to learn a \\textit{library of symbolic action abstractions and accompanying low-level policies} that can be composed to solve increasingly complex tasks. Our approach queries large language models (LLMs) as a prior for proposing useful symbolic action definitions, but integrates these proposals into a formal hierarchical planning system to ground and verify proposed actions. On two language-guided interactive planning domains (\\textit{Mini Minecraft} and the \\textit{ALFRED Household Tasks} benchmark), our approach far outperforms other baseline approaches that use LLMs in planning, enabling far more accurate planning and enable better generalization to more complex tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qJ0Cfj4Ex9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17737,
    "title": "SAFLEX: Self-Adaptive Augmentation via Feature Label Extrapolation",
    "authors": [
      "Mucong Ding",
      "Bang An",
      "Yuancheng Xu",
      "Anirudh Satheesh",
      "Furong Huang"
    ],
    "abstract": "Data augmentation, a cornerstone technique in deep learning, is crucial in enhancing model performance, especially with scarce labeled data. While traditional techniques are effective, their reliance on hand-crafted methods limits their applicability across diverse data types and tasks. Although modern learnable augmentation methods offer increased adaptability, they are computationally expensive and challenging to incorporate within prevalent augmentation workflows. In this work, we present a novel, efficient method for data augmentation, effectively bridging the gap between existing augmentation strategies and emerging datasets and learning tasks. We introduce SAFLEX (Self-Adaptive Augmentation via Feature Label EXtrapolation), which learns the sample weights and soft labels of augmented samples provided by any given upstream augmentation pipeline, using a specifically designed efficient bilevel optimization algorithm. Remarkably, SAFLEX effectively reduces the noise and label errors of the upstream augmentation pipeline with a marginal computational cost. As a versatile module, SAFLEX excels across diverse datasets, including natural and medical images and tabular data, showcasing its prowess in few-shot learning and out-of-distribution generalization. SAFLEX seamlessly integrates with common augmentation strategies like RandAug, CutMix, and those from large pre-trained generative models like stable diffusion and is also compatible with frameworks such as CLIP's fine-tuning. Our findings highlight the potential to adapt existing augmentation pipelines for new data types and tasks, signaling a move towards more adaptable and resilient training frameworks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qL6brrBDk2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17736,
    "title": "Zero and Few-shot Semantic Parsing with Ambiguous Inputs",
    "authors": [
      "Elias Stengel-Eskin",
      "Kyle Rawlins",
      "Benjamin Van Durme"
    ],
    "abstract": "Despite the frequent challenges posed by ambiguity when representing meaning via natural language, it is often ignored or deliberately removed in tasks mapping language to formally-designed representations, which generally assume a one-to-one mapping between linguistic and formal representations. We attempt to address this shortcoming by introducing AmP, a framework, dataset, and challenge for translating ambiguous natural language to formal representations like logic and code. We define templates and generate data for five well-documented linguistic ambiguities.Using AmP, we investigate how several few-shot text-to-code systems handle ambiguity, introducing three new metrics.We find that large pre-trained models perform poorly at capturing the distribution of possible meanings without deliberate instruction.However, models are able to capture the distribution well when ambiguity is attested in their inputs. These results motivate a call for including ambiguity explicitly in datasets and promote considering the distribution of possible outputs when evaluating systems. We release our data and code.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qL9gogRepu",
    "arxiv_id": "2306.00824",
    "GitHub": [
      "https://github.com/esteng/ambiguous_parsing"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17735,
    "title": "FairSeg: A Large-Scale Medical Image Segmentation Dataset for Fairness Learning Using Segment Anything Model with Fair Error-Bound Scaling",
    "authors": [
      "Yu Tian",
      "Min Shi",
      "Yan Luo",
      "Ava Kouhana",
      "Tobias Elze",
      "Mengyu Wang"
    ],
    "abstract": "Fairness in artificial intelligence models has gained significantly more attention in recent years, especially in the area of medicine, as fairness in medical models is critical to people's well-being and lives. High-quality medical fairness datasets are needed to promote fairness learning research. Existing medical fairness datasets are all for classification tasks, and no fairness datasets are available for medical segmentation, while medical segmentation is an equally important clinical task as classifications, which can provide detailed spatial information on organ abnormalities ready to be assessed by clinicians. In this paper, we propose the first fairness dataset for medical segmentation named FairSeg with 10,000 subject samples. In addition, we propose a fair error-bound scaling approach to reweight the loss function with the upper error-bound in each identity group. We anticipate that the segmentation performance equity can be improved by explicitly tackling the hard cases with high training errors in each identity group. To facilitate fair comparisons, we propose new equity-scaled segmentation performance metrics, such as the equity-scaled Dice coefficient, which is calculated as the overall Dice coefficient divided by one plus the standard deviation of group Dice coefficients. Through comprehensive experiments, we demonstrate that our fair error-bound scaling approach either has superior or comparable fairness performance to the state-of-the-art fairness learning models. The dataset and code are publicly accessible via https://github.com/anonymous-for-science/FairSeg.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qNrJJZAKI3",
    "arxiv_id": "2311.02189",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17734,
    "title": "Masks, Signs, And Learning Rate Rewinding",
    "authors": [
      "Advait Harshal Gadhikar",
      "Rebekka Burkholz"
    ],
    "abstract": "Learning Rate Rewinding (LRR) has been established as a strong variant of Iterative Magnitude Pruning (IMP) to find lottery tickets in deep overparameterized neural networks. While both iterative pruning schemes couple structure and parameter learning, understanding how LRR excels in both aspects can bring us closer to the design of more flexible deep learning algorithms that can optimize diverse sets of sparse architectures. To this end, we conduct experiments that disentangle the effect of mask learning and parameter optimization and how both benefit from overparameterization. The ability of LRR to flip parameter signs early and stay robust to sign perturbations seems to make it not only more effective in mask identification but also in optimizing  diverse sets of masks, including random ones. In support of this hypothesis, we prove in a simplified single hidden neuron setting that LRR succeeds in more cases than IMP, as it can escape initially problematic sign configurations.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=qODvxQ8TXW",
    "arxiv_id": "2402.19262",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17733,
    "title": "Guess & Sketch: Language Model Guided Transpilation",
    "authors": [
      "Celine Lee",
      "Abdulrahman Mahmoud",
      "Michal Kurek",
      "Simone Campanoni",
      "David Brooks",
      "Stephen Chong",
      "Gu-Yeon Wei",
      "Alexander M Rush"
    ],
    "abstract": "Maintaining legacy software requires many software and systems engineering hours. Assembly code programs, which demand low-level control over the computer machine state and have no variable names, are particularly difficult for humans to analyze.Existing conventional program translators guarantee correctness, but are hand-engineered for the source and target programming languages in question. Learned transpilation, i.e.  automatic translation of code, offers an alternative to manual re-writing and engineering efforts. Automated symbolic program translation approaches guarantee correctness but struggle to scale to longer programs due to the exponentially large search space. Their rigid rule-based systems also limit their expressivity, so they can only reason about a reduced space of programs. Probabilistic neural language models (LMs) produce plausible outputs for every input, but do so at the cost of guaranteed correctness. In this work, we leverage the strengths of LMs and symbolic solvers in a neurosymbolic approach to learned transpilation for assembly code. Assembly code is an appropriate setting for a neurosymbolic approach, since assembly code can be divided into shorter non-branching basic blocks amenable to the use of symbolic methods. Guess & Sketch extracts alignment and confidence information from features of the LM then passes it to a symbolic solver to resolve semantic equivalence of the transpilation input and output. We test Guess & Sketch on three different test sets of assembly transpilation tasks, varying in difficulty, and show that it successfully transpiles 57.6% more examples than GPT-4 and 39.6% more examples than an engineered transpiler. We also share a training and evaluation dataset for this task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qPFsIbF3V6",
    "arxiv_id": "2309.14396",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17732,
    "title": "Robustifying and Boosting Training-Free Neural Architecture Search",
    "authors": [
      "Zhenfeng He",
      "Yao Shu",
      "Zhongxiang Dai",
      "Bryan Kian Hsiang Low"
    ],
    "abstract": "Neural architecture search (NAS) has become a key component of AutoML and a standard tool to automate the design of deep neural networks. Recently, training-free NAS as an emerging paradigm has successfully reduced the search costs of standard training-based NAS by estimating the true architecture performance with only training-free metrics. Nevertheless, the estimation ability of these metrics typically varies across different tasks, making it challenging to achieve robust and consistently good search performance on diverse tasks with only a single training-free metric. Meanwhile, the estimation gap between training-free metrics and the true architecture performances limits training-free NAS to achieve superior performance. To address these challenges, we propose the robustifying and boosting training-free NAS (RoBoT) algorithm which (a) employs the optimized combination of existing training-free metrics explored from Bayesian optimization to develop a robust and consistently better-performing metric on diverse tasks, and (b) applies greedy search, i.e., the exploitation, on the newly developed metric to bridge the aforementioned gap and consequently to boost the search performance of standard training-free NAS further. Remarkably, the expected performance of our RoBoT can be theoretically guaranteed, which improves over the existing training-free NAS under mild conditions with additional interesting insights. Our extensive experiments on various NAS benchmark tasks yield substantial empirical evidence to support our theoretical results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qPloNoDJZn",
    "arxiv_id": "2403.07591",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17731,
    "title": "Extending Power of Nature from Binary to Real-Valued Graph Learning in Real World",
    "authors": [
      "Chunshu Wu",
      "Ruibing Song",
      "Chuan Liu",
      "Yunan Yang",
      "Ang Li",
      "Michael Huang",
      "Tong Geng"
    ],
    "abstract": "Nature performs complex computations constantly at clearly lower cost and higher performance than digital computers. It is crucial to understand how to harness the unique computational power of nature in Machine Learning (ML). In the past decade, besides the development of Neural Networks (NNs), the community has also relentlessly explored nature-powered ML paradigms. Although most of them are still predominantly theoretical, a new practical paradigm enabled by the recent advent of CMOS-compatible room-temperature nature-based computers has emerged. By harnessing the nature's power of entropy increase, this paradigm can solve binary learning problems delivering immense speedup and energy savings compared with NNs, while maintaining comparable accuracy. Regrettably, its values to the real world are highly constrained by its binary nature. A clear pathway to its extension to real-valued problems remains elusive. This paper aims to unleash this pathway by proposing a novel end-to-end Nature-Powered Graph Learning (NP-GL) framework. Specifically, through a three-dimensional co-design, NP-GL can leverage the nature's power of entropy increase to efficiently solve real-valued graph learning problems. Experimental results across 4 real-world applications with 6 datasets demonstrate that NP-GL delivers, on average, $6.97\\times 10^3$ speedup and $10^5$ energy consumption reduction with comparable or even higher accuracy than Graph Neural Networks (GNNs).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qT7DXUmX7j",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17730,
    "title": "Relay Diffusion: Unifying diffusion process across resolutions for image synthesis",
    "authors": [
      "Jiayan Teng",
      "Wendi Zheng",
      "Ming Ding",
      "Wenyi Hong",
      "Jianqiao Wangni",
      "Zhuoyi Yang",
      "Jie Tang"
    ],
    "abstract": "Diffusion models achieved great success in image synthesis, but still face challenges in high-resolution generation. Through the lens of discrete cosine transformation, we find the main reason is that *the same noise level on a higher resolution results in a higher Signal-to-Noise Ratio in the frequency domain*. In this work, we present Relay Diffusion Model (RDM), which transfers a low-resolution image or noise into an equivalent high-resolution one for diffusion model via blurring diffusion and block noise. Therefore, the diffusion process can continue seamlessly in any new resolution or model without restarting from pure noise or low-resolution conditioning. RDM achieves state-of-the-art FID on CelebA-HQ and sFID on ImageNet 256$\\times$256, surpassing previous works such as ADM, LDM and DiT by a large margin. All the codes and checkpoints are open-sourced at https://anonymous.4open.science/r/RelayDiffusion-anonymous-1B3E.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=qTlcbLSm4p",
    "arxiv_id": "2309.03350",
    "GitHub": [
      "https://github.com/THUDM/RelayDiffusion"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17729,
    "title": "Large Language Models as Tool Makers",
    "authors": [
      "Tianle Cai",
      "Xuezhi Wang",
      "Tengyu Ma",
      "Xinyun Chen",
      "Denny Zhou"
    ],
    "abstract": "Recent research has highlighted the potential of large language models (LLMs)to improve their problem-solving capabilities with the aid of suitable externaltools. In our work, we further advance this concept by introducing a closed-loop framework, referred to as LLMs A s Tool Makers (LATM), where LLMscreate their own reusable tools for problem-solving. Our approach consists of twophases: 1) tool making: an LLM acts as the tool maker that crafts tools for a setof tasks, where a tool is implemented as a Python utility function. 2) tool using:another LLM acts as the tool user, which applies the tool built by the tool makerfor problem-solving. The tool user can be either the same or a different LLMfrom the tool maker. On the problem-solving server side, tool-making enablescontinual tool generation and caching as new requests emerge. This frameworkenables subsequent requests to access cached tools via their corresponding APIs,enhancing the efficiency of task resolution. Beyond enabling LLMs to create theirown tools, our framework also uncovers intriguing opportunities to optimize theserving cost of LLMs: Recognizing that tool-making requires more sophisticatedcapabilities, we assign this task to a powerful, albeit resource-intensive, model.Conversely, the simpler tool-using phase is delegated to a lightweight model. Thisstrategic division of labor allows the once-off cost of tool-making to be spreadover multiple instances of tool-using, significantly reducing average costs whilemaintaining strong performance. Furthermore, our method offers a functionalcache through the caching and reuse of tools, which stores the functionality ofa class of requests instead of the natural language responses from LLMs, thusextending the applicability of the conventional cache mechanism. We evaluateour approach across various complex reasoning tasks, including Big-Bench tasks.With GPT-4 as the tool maker and GPT-3.5 as the tool user, LATM demonstratesperformance equivalent to using GPT-4 for both roles, but with a significantlyreduced inference cost.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qV83K9d5WB",
    "arxiv_id": "2305.17126",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17728,
    "title": "Counting Graph Substructures with Graph Neural Networks",
    "authors": [
      "Charilaos Kanatsoulis",
      "Alejandro Ribeiro"
    ],
    "abstract": "Graph Neural Networks (GNNs) are powerful representation learning tools that have achieved remarkable performance in various important tasks. However, their ability to count substructures, which play a crucial role in biological and social networks, remains uncertain. In this work, we fill this gap and characterize the representation power of GNNs in terms of their ability to produce powerful representations that count graph substructures. In particular, we study the message-passing operations of GNNs with random stationary input and show that they can produce permutation equivariant representations that are associated with high-order statistical moments. Using these representations, we prove that GNNs can learn how to count cycles, quasi-cliques, and the number of connected components in a graph. We also provide new insights into the generalization capacity of GNNs. Our analysis is constructive and enables the design of a generic GNN architecture that shows remarkable performance in four distinct tasks: cycle detection, cycle counting, graph classification, and molecular property prediction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qaJxPhkYtD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17727,
    "title": "Learning Thresholds with Latent Values and Censored Feedback",
    "authors": [
      "Jiahao Zhang",
      "Tao Lin",
      "Weiqiang Zheng",
      "Zhe Feng",
      "Yifeng Teng",
      "Xiaotie Deng"
    ],
    "abstract": "In this paper, we investigate a problem of *actively* learning threshold in latent space, where the *unknown* reward $g(\\gamma, v)$ depends on the proposed threshold $\\gamma$ and latent value $v$ and it can be $only$ achieved if the threshold is lower than or equal to the *unknown* latent value. This problem has broad applications in practical scenarios, e.g., reserve price optimization in online auctions, online task assignments in crowdsourcing, setting recruiting bars in hiring, etc. We first characterize the query complexity of learning a threshold with the expected reward at most $\\epsilon$ smaller than the optimum and prove that the number of queries needed can be infinitely large even when $g(\\gamma, v)$ is monotone with respect to both $\\gamma$ and $v$. On the positive side, we provide a tight query complexity $\\tilde{\\Theta}(1/\\epsilon^3)$ when $g$ is monotone and the CDF of value distribution is Lipschitz. Moreover, we show a tight $\\tilde{\\Theta}(1/\\epsilon^3)$ query complexity can be achieved as long as $g$ satisfies one-sided Lipschitzness, which provides a complete characterization for this problem. Finally, we extend this model to an online learning setting and demonstrate a tight $\\Theta(T^{2/3})$ regret bound using continuous-arm bandit techniques and the aforementioned query complexity results.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qaKRfobbTg",
    "arxiv_id": "2312.04653",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17726,
    "title": "Transformer-Modulated Diffusion Models for Probabilistic Multivariate  Time Series Forecasting",
    "authors": [
      "Yuxin Li",
      "Wenchao Chen",
      "Xinyue Hu",
      "Bo Chen",
      "baolin sun",
      "Mingyuan Zhou"
    ],
    "abstract": "Transformers have gained widespread usage in multivariate time series (MTS) forecasting, delivering impressive performance. Nonetheless, these existing transformer-based methods often neglect an essential aspect: the incorporation of uncertainty into the predicted series, which holds significant value in decision-making. In this paper, we introduce a Transformer-Modulated Diffusion Model (TMDM), uniting conditional diffusion generative process with transformers into a unified framework to enable precise distribution forecasting for MTS. TMDM harnesses the power of transformers to extract essential insights from historical time series data. This information is then utilized as prior knowledge, capturing covariate-dependence in both the forward and reverse processes within the diffusion model. Furthermore, we seamlessly integrate well-designed transformer-based forecasting methods into TMDM to enhance its overall performance. Additionally, we introduce two novel metrics for evaluating uncertainty estimation performance. Through extensive experiments on six datasets using four evaluation metrics, we establish the effectiveness of TMDM in probabilistic MTS forecasting.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qae04YACHs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17725,
    "title": "Diverse Projection Ensembles for Distributional Reinforcement Learning",
    "authors": [
      "Moritz Akiya Zanger",
      "Wendelin Boehmer",
      "Matthijs T. J. Spaan"
    ],
    "abstract": "In contrast to classical reinforcement learning, distributional RL algorithms aim to learn the distribution of returns rather than their expected value. Since the nature of the return distribution is generally unknown a priori or arbitrarily complex, a common approach finds approximations within a set of representable, parametric distributions. Typically, this involves a projection of the unconstrained distribution onto the set of simplified distributions. We argue that this projection step entails a strong inductive bias when coupled with neural networks and gradient descent, thereby profoundly impacting the generalization behavior of learned models. In order to facilitate reliable uncertainty estimation through diversity, this work studies the combination of several different projections and representations in a distributional ensemble. We establish theoretical properties of such projection ensembles and derive an algorithm that uses ensemble disagreement, measured by the average $1$-Wasserstein distance, as a bonus for deep exploration. We evaluate our algorithm on the behavior suite benchmark and find that diverse projection ensembles lead to significant performance improvements over existing methods on a wide variety of tasks with the most pronounced gains in directed exploration problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qe49ybvvPs",
    "arxiv_id": "2306.07124",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17724,
    "title": "EBMDock: Neural Probabilistic Protein-Protein Docking via a Differentiable Energy Model",
    "authors": [
      "Huaijin Wu",
      "Wei Liu",
      "Yatao Bian",
      "Jiaxiang Wu",
      "Nianzu Yang",
      "Junchi Yan"
    ],
    "abstract": "Protein complex formation, a pivotal challenge in contemporary biology, has recently gained interest from the machine learning community, particularly concerning protein-ligand docking tasks. In this paper, we delve into the equally crucial but comparatively under-investigated domain of protein-protein docking. Specifically, we propose a  geometric deep learning framework, termed EBMDock,  which employs statistical potential as its energy function. This approach produces a probability distribution over docking poses, such that the identified docking pose aligns with a minimum point in the energy landscape. We employ a differential algorithm grounded in Langevin dynamics to efficiently sample from the docking pose distribution. Additionally, we incorporate energy-based training using contrastive divergence, enhancing both performance and stability. Empirical results demonstrate that our approach achieves superior performance on two benchmark datasets DIPS and DB5.5. Furthermore, the results suggest EBMDock can serve as an orthogonal enhancement to existing methods. Source code will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qg2boc2AwU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17722,
    "title": "Fast Equilibrium of SGD in Generic Situations",
    "authors": [
      "Zhiyuan Li",
      "Yi Wang",
      "Zhiren Wang"
    ],
    "abstract": "Normalization layers are ubiquitous in deep learning, greatly accelerating optimization. However, they also introduce many unexpected phenomena during training, for example, the Fast Equilibrium conjecture proposed by (Li et al.,2020), which states that the scale-invariant normalized network, when trained by SGD with $\\eta$ learning rate and $\\lambda$ weight decay, mixes to an equilibrium in $\\tilde{O}(1/\\eta\\lambda)$ steps, as opposed to classical $e^{O(\\eta^{-1})}$ mixing time. Recent works by Wang & Wang (2022); Li et al. (2022c)  proved this conjecture under different sets of assumptions. This paper aims to answer the fast equilibrium conjecture in full generality by removing the non-generic assumptions of Wang & Wang (2022); Li et al. (2022c) that the minima are isolated, that the region near minima forms a unique basin, and that the set of minima is an analytic set. Our main technical contribution is to show that with probability close to 1,  in exponential time trajectories will not escape the attracting basin containing its initial position.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qgWJkDiI5p",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17721,
    "title": "A Newborn Embodied Turing Test for Comparing Object Segmentation Across Animals and Machines",
    "authors": [
      "Manju Garimella",
      "Denizhan Pak",
      "Justin Newell Wood",
      "Samantha Marie Waters Wood"
    ],
    "abstract": "Newborn brains rapidly learn to solve challenging object recognition tasks, including segmenting objects from backgrounds and recognizing objects across novel backgrounds and viewpoints. Conversely, modern machine-learning (ML) algorithms are \"data hungry,\" requiring more training data than brains to reach similar performance levels. How do we close this learning gap between brains and machines? Here we introduce a new benchmark\u2014a Newborn Embodied Turing Test (NETT) for object segmentation\u2014in which newborn animals and machines are raised in the same environments and tested with the same tasks, permitting direct comparison of their learning abilities. First, we raised newborn chicks in controlled environments containing a single object rotating on a single background, then tested their ability to recognize that object across new backgrounds and viewpoints. Second, we performed \u201cdigital twin\u201d experiments in which we reared and tested artificial chicks in virtual environments that mimicked the rearing and testing conditions of the biological chicks. We inserted a variety of ML \u201cbrains\u201d into the artificial chicks and measured whether those algorithms learned common object recognition behavior as biological chicks. All biological chicks solved this one-shot object segmentation task, successfully learning background-invariant object representations that generalized across new backgrounds and viewpoints. In contrast, none of the artificial chicks solved this object segmentation task, instead learning background-dependent representations that failed to generalize across new backgrounds and viewpoints. This digital twin design exposes core limitations in current ML algorithms in achieving brain-like object perception. Our NETT is publicly available for comparing ML algorithms with newborn chicks. Ultimately, we anticipate that NETT benchmarks will allow researchers to build embodied AI systems that learn as efficiently and robustly as newborn brains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qhkEOCcVX9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17720,
    "title": "Learning with Language-Guided State Abstractions",
    "authors": [
      "Andi Peng",
      "Ilia Sucholutsky",
      "Belinda Z. Li",
      "Theodore Sumers",
      "Thomas L. Griffiths",
      "Jacob Andreas",
      "Julie Shah"
    ],
    "abstract": "We describe a framework for using natural language to design state abstractions for imitation learning. Generalizable policy learning in high-dimensional observation spaces is facilitated by well-designed state representations, which can surface important features of an environment and hide irrelevant ones. Today, these state representations must often be manually specified, or derived from other labor-intensive labeling procedures. Our method, LGA (\\textit{language-guided abstraction}), uses a combination of natural language supervision and background knowledge from language models (LMs) to automatically build state representations tailored to unseen tasks. In LGA, a user first provides a (possibly incomplete) description of a target task in natural language; next, a pre-trained LM translates this task description into a state abstraction function that masks out irrelevant features; finally, an imitation policy is trained using a small number of demonstrations and LGA-generated abstract states. Experiments on simulated robotic tasks show that LGA yields state abstractions similar to human-designed ones, but in a fraction of the time, and that these abstractions improve generalization and robustness in the presence of spurious correlations and ambiguous specifications. We illustrate the utility of the learned abstractions on mobile manipulation tasks with a Spot robot.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qi5Xa2cOZg",
    "arxiv_id": "2402.18759",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17719,
    "title": "Skill Machines: Temporal Logic Skill Composition in Reinforcement Learning",
    "authors": [
      "Geraud Nangue Tasse",
      "Devon Jarvis",
      "Steven James",
      "Benjamin Rosman"
    ],
    "abstract": "It is desirable for an agent to be able to solve a rich variety of problems that can be specified through language in the same environment. A popular approach towards obtaining such agents is to reuse skills learned in prior tasks to generalise compositionally to new ones. However, this is a challenging problem due to the curse of dimensionality induced by the combinatorially large number of ways high-level goals can be combined both logically and temporally in language. To address this problem, we propose a framework where an agent first learns a sufficient set of skill primitives to achieve all high-level goals in its environment. The agent can then flexibly compose them both logically and temporally to provably achieve temporal logic specifications in any regular language, such as regular fragments of linear temporal logic. This provides the agent with the ability to map from complex temporal logic task specifications to near-optimal behaviours zero-shot. We demonstrate this experimentally in a tabular setting, as well as in a high-dimensional video game and continuous control environment. Finally, we also demonstrate that the performance of skill machines can be improved with regular off-policy reinforcement learning algorithms when optimal behaviours are desired.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qiduMcw3CU",
    "arxiv_id": "2205.12532",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17718,
    "title": "Learning Stackable and Skippable LEGO Bricks for Efficient, Reconfigurable, and Variable-Resolution Diffusion Modeling",
    "authors": [
      "Huangjie Zheng",
      "Zhendong Wang",
      "Jianbo Yuan",
      "Guanghan Ning",
      "Pengcheng He",
      "Quanzeng You",
      "Hongxia Yang",
      "Mingyuan Zhou"
    ],
    "abstract": "Diffusion models excel at generating photo-realistic images but come with significant computational costs in both training and sampling. While various techniques address these computational challenges, a less-explored issue is designing an efficient and adaptable network backbone for iterative refinement. Current options like U-Net and Vision Transformer often rely on resource-intensive deep networks and lack the flexibility needed for generating images at variable resolutions or with a smaller network than used in training.This study introduces LEGO bricks, which seamlessly integrate Local-feature Enrichment and Global-content Orchestration. These bricks can be stacked to create a test-time reconfigurable diffusion backbone, allowing selective skipping of bricks to reduce sampling costs and generate higher-resolution images than the training data. LEGO bricks enrich local regions with an MLP and transform them using a Transformer block while maintaining a consistent full-resolution image across all bricks. Experimental results demonstrate that LEGO bricks enhance training efficiency, expedite convergence, and facilitate variable-resolution image generation while maintaining strong generative performance. Moreover, LEGO significantly reduces sampling time compared to other methods, establishing it as a valuable enhancement for diffusion models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qmXedvwrT1",
    "arxiv_id": "2310.06389",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17717,
    "title": "Fast Imitation via Behavior Foundation Models",
    "authors": [
      "Matteo Pirotta",
      "Andrea Tirinzoni",
      "Ahmed Touati",
      "Alessandro Lazaric",
      "Yann Ollivier"
    ],
    "abstract": "Imitation learning (IL) aims at producing agents that can imitate any behavior given a few expert demonstrations. Yet existing approaches require many demonstrations and/or running (online or offline) reinforcement learning (RL) algorithms for each new imitation task. Here we show that recent RL foundation models based on successor measures can imitate any expert behavior almost instantly with just a few demonstrations and no need for RL or fine-tuning, while accommodating several IL principles (behavioral cloning, feature matching, reward-based, and goal-based reductions). In our experiments, imitation via RL foundation models matches, and often surpasses, the performance of SOTA offline IL algorithms, and produces imitation policies from new demonstrations within seconds instead of hours.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=qnWtw3l0jb",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17716,
    "title": "Teach LLMs to Phish: Stealing Private Information from Language Models",
    "authors": [
      "Ashwinee Panda",
      "Christopher A. Choquette-Choo",
      "Zhengming Zhang",
      "Yaoqing Yang",
      "Prateek Mittal"
    ],
    "abstract": "When large language models are trained on private data, it can be a _significant_ privacy risk for them to memorize and regurgitate sensitive information. In this work, we propose a new _practical_ data extraction attack that we call ``neural phishing''. This attack enables an adversary to target and extract sensitive or personally identifiable information (PII), e.g., credit card numbers, from a model trained on user data with upwards of $10$% secret extraction rates, at times, as high as $80$%. Our attack assumes only that an adversary can insert only $10$s of benign-appearing sentences into the training dataset using only vague priors on the structure of the user data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qo21ZlfNu6",
    "arxiv_id": "2403.00871",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17715,
    "title": "Grounding Language Plans in Demonstrations Through Counterfactual Perturbations",
    "authors": [
      "Yanwei Wang",
      "Tsun-Hsuan Wang",
      "Jiayuan Mao",
      "Michael Hagenow",
      "Julie Shah"
    ],
    "abstract": "Grounding the abstract knowledge captured by Large Language Models (LLMs) inphysical domains remains a pivotal yet unsolved problem. Whereas prior workshave largely focused on leveraging LLMs for generating abstract plans in symbolicspaces, this work uses LLMs to guide the learning for structures and constraintsin robot manipulation tasks. Specifically, we borrow from manipulation plan-ning literature the concept of mode families, defining specific types of motionconstraints among sets of objects, to serve as an intermediate layer that connectshigh-level language representations with low-level physical trajectories. By lo-cally perturbing a small set of successful human demonstrations, we augment thedataset with additional successful executions as well as counterfactuals that failthe task. Our explanation-based learning framework trains neural network-basedclassifiers to differentiate success task executions from failures and as a by-productlearns classifiers that ground low-level states into mode families without denselabeling. This further enables us to learn structured policies for the target task.Experimental validation in both 2D continuous-space and robotic manipulationenvironments demonstrates the robustness of our mode-basedimitation methods under external perturbations.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=qoHeuRAcSl",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17714,
    "title": "Demystifying Embedding Spaces using Large Language Models",
    "authors": [
      "Guy Tennenholtz",
      "Yinlam Chow",
      "ChihWei Hsu",
      "Jihwan Jeong",
      "Lior Shani",
      "Azamat Tulepbergenov",
      "Deepak Ramachandran",
      "Martin Mladenov",
      "Craig Boutilier"
    ],
    "abstract": "Embeddings have become a pivotal means to represent complex, multi-faceted information about entities, concepts, and relationships in a condensed and useful format. Nevertheless, they often preclude direct interpretation. While downstream tasks make use of these compressed representations, meaningful interpretation usually requires visualization using dimensionality reduction or specialized machine learning interpretability methods. This paper addresses the challenge of making such embeddings more interpretable and broadly useful, by employing large language models (LLMs) to directly interact with embeddings -- transforming abstract vectors into understandable narratives. By injecting embeddings into LLMs, we enable querying and exploration of complex embedding data. We demonstrate our approach on a variety of diverse tasks, including: enhancing concept activation vectors (CAVs), communicating novel embedded entities, and decoding user preferences in recommender systems. Our work couples the immense information potential of embeddings with the interpretative power of LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qoYogklIPz",
    "arxiv_id": "2310.04475",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17713,
    "title": "On the Expressivity of Objective-Specification Formalisms in Reinforcement Learning",
    "authors": [
      "Rohan Subramani",
      "Marcus Williams",
      "Max Heitmann",
      "Halfdan Holm",
      "Charlie Griffin",
      "Joar Max Viktor Skalse"
    ],
    "abstract": "Most algorithms in reinforcement learning (RL) require that the objective is formalised with a Markovian reward function. However, it is well-known that certain tasks cannot be expressed by means of an objective in the Markov rewards formalism, motivating the study of alternative objective-specification formalisms in RL such as Linear Temporal Logic and Multi-Objective Reinforcement Learning. To date, there has not yet been any thorough analysis of how these formalisms relate to each other in terms of their expressivity. We fill this gap in the existing literature by providing a comprehensive comparison of 17 salient objective-specification formalisms. We place these formalisms in a preorder based on their expressive power, and present this preorder as a Hasse diagram. We find a variety of limitations for the different formalisms, and argue that no formalism is both dominantly expressive and straightforward to optimise with current techniques. For example, we prove that each of Regularised RL, (Outer) Nonlinear Markov Rewards, Reward Machines, Linear Temporal Logic, and Limit Average Rewards can express a task that the others cannot. The significance of our results is twofold. First, we identify important expressivity limitations to consider when specifying objectives for policy optimization. Second, our results highlight the need for future research which adapts reward learning to work with a greater variety of formalisms, since many existing reward learning methods assume that the desired objective takes a Markovian form. Our work contributes towards a more cohesive understanding of the costs and benefits of different RL objective-specification formalisms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qr4ECbGcSj",
    "arxiv_id": "2310.11840",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17712,
    "title": "Towards domain-invariant Self-Supervised Learning with Batch Styles Standardization",
    "authors": [
      "Marin Scalbert",
      "Maria Vakalopoulou",
      "Florent Couzinie-Devy"
    ],
    "abstract": "In Self-Supervised Learning (SSL), models are typically pretrained, fine-tuned, and evaluated on the same domains. However, they tend to perform poorly when evaluated on unseen domains, a challenge that Unsupervised Domain Generalization (UDG) seeks to address. Current UDG methods rely on domain labels, which are often challenging to collect, and domain-specific architectures that lack scalability when confronted with numerous domains, making the current methodology impractical and rigid. Inspired by contrastive-based UDG methods that mitigate spurious correlations by restricting comparisons to examples from the same domain, we hypothesize that eliminating style variability within a batch could provide a more convenient and flexible way to reduce spurious correlations without requiring domain labels. To verify this hypothesis, we introduce Batch Styles Standardization (BSS), a relatively simple yet powerful Fourier-based method to standardize the style of images in a batch specifically designed for integration with SSL methods to tackle UDG. Combining BSS with existing SSL methods offers serious advantages over prior UDG methods: (1) It eliminates the need for domain labels or domain-specific network components to enhance domain-invariance in SSL representations, and (2) offers flexibility as BSS can be seamlessly integrated with diverse contrastive-based but also non-contrastive-based SSL methods. Experiments on several UDG datasets demonstrate that it significantly improves downstream task performances on unseen domains, often outperforming or rivaling with UDG methods. Finally, this work clarifies the underlying mechanisms contributing to BSS's effectiveness in improving domain-invariance in SSL representations and performances on unseen domain.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qtE9K23ISq",
    "arxiv_id": "2303.06088",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17711,
    "title": "Behaviour Distillation",
    "authors": [
      "Andrei Lupu",
      "Chris Lu",
      "Jarek Luca Liesen",
      "Robert Tjarko Lange",
      "Jakob Nicolaus Foerster"
    ],
    "abstract": "Dataset distillation aims to condense large datasets into a small number of synthetic examples that can be used as drop-in replacements when training new models. It has applications to interpretability, neural architecture search, privacy, and continual learning. Despite strong successes in supervised domains, such methods have not yet been extended to reinforcement learning, where the lack of fixed dataset renders most distillation methods unusable.Filling the gap, we formalize $\\textit{behaviour distillation}$, a setting that aims to discover and then condense the information required for training an expert policy into a synthetic dataset of state-action pairs, $\\textit{without access to expert data}$. We then introduce Hallucinating Datasets with Evolution Strategies (HaDES), a method for behaviour distillation that can discover datasets of $\\textit{just four}$ state-action pairs which, under supervised learning, train agents to competitive performance levels in continuous control tasks.We show that these datasets generalize out of distribution to training policies with a wide range of architectures and hyperparameters. We also demonstrate application to a downstream task, namely training multi-task agents in a zero-shot fashion.Beyond behaviour distillation, HaDES provides significant improvements in neuroevolution for RL over previous approaches and achieves SoTA results on one standard supervised dataset distillation task. Finally, we show that visualizing the synthetic datasets can provide human-interpretable task insights.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qup9xD8mW4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17710,
    "title": "From Graphs to Hypergraphs: Hypergraph Projection and its Reconstruction",
    "authors": [
      "Yanbang Wang",
      "Jon Kleinberg"
    ],
    "abstract": "We study the implications of the modeling choice to use a graph, instead of a hypergraph, to represent real-world interconnected systems whose constituent relationships are of higher order by nature. Such a modeling choice typically involves an underlying projection process that maps the original hypergraph onto a graph, and is prevalent in graph-based analysis.  While hypergraph projection can potentially lead to loss of higher-order relations, there exists very limited studies on the consequences of doing so, as well as its remediation. This work fills this gap by doing two things: (1) we develop analysis based on graph and set theory, showing two ubiquitous patterns of hyperedges that are root to structural information loss in all hypergraph projections; we also quantify the combinatorial impossibility of recovering the lost higher-order structures if no extra help is provided; (2) we still seek to recover the lost higher-order structures in hypergraph projection, and in light of (1)'s findings we make reasonable assumptions to allow the help of some prior knowledge of the application domain. Under this problem setting, we develop a learning-based hypergraph reconstruction method based on an important statistic of hyperedge distributions that we find. Our reconstruction method is systematically evaluated on 8 real-world datasets under different settings, and exhibits consistently top performance. We also demonstrate benefits of the reconstructed hypergraphs through use cases of protein rankings and link predictions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qwYKE3VB2h",
    "arxiv_id": "2401.08519",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17709,
    "title": "Data Debugging with Shapley Importance over Machine Learning Pipelines",
    "authors": [
      "Bojan Karla\u0161",
      "David Dao",
      "Matteo Interlandi",
      "Sebastian Schelter",
      "Wentao Wu",
      "Ce Zhang"
    ],
    "abstract": "When a machine learning (ML) model exhibits poor quality (e.g., poor accuracy or fairness), the problem can often be traced back to errors in the training data. Being able to discover the data examples that are the most likely culprits is a fundamental concern that has received a lot of attention recently. One prominent way to measure \"data importance\" with respect to model quality is the Shapley value. Unfortunately, existing methods only focus on the ML model in isolation, without considering the broader ML pipeline for data preparation and feature extraction, which appears in the majority of real-world ML code. This presents a major limitation to applying existing methods in practical settings. In this paper, we propose Canonpipe, a method for efficiently computing Shapley-based data importance over ML pipelines. We introduce several approximations that lead to dramatic improvements in terms of computational speed. Finally, our experimental evaluation demonstrates that our methods are capable of data error discovery that is as effective as existing Monte Carlo baselines, and in some cases even outperform them.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qxGXjWxabq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17708,
    "title": "Robust Training of Federated Models with Extremely Label Deficiency",
    "authors": [
      "Yonggang Zhang",
      "Zhiqin Yang",
      "Xinmei Tian",
      "Nannan Wang",
      "Tongliang Liu",
      "Bo Han"
    ],
    "abstract": "Federated semi-supervised learning (FSSL) has emerged as a powerful paradigm for collaboratively training machine learning models using distributed data with label deficiency. Advanced FSSL methods predominantly focus on training a single model on each client. However, this approach could lead to a discrepancy between the objective functions of labeled and unlabeled data, resulting in gradient conflicts. To alleviate gradient conflict, we propose a novel twin-model paradigm, called **Twinsight**, designed to enhance mutual guidance by providing insights from different perspectives of labeled and unlabeled data. In particular, Twinsight concurrently trains a supervised model with a supervised objective function while training an unsupervised model using an unsupervised objective function. To enhance the synergy between these two models, Twinsight introduces a neighborhood-preserving constraint, which encourages the preservation of the neighborhood relationship among data features extracted by both models. Our comprehensive experiments on four benchmark datasets provide substantial evidence that Twinsight can significantly outperform state-of-the-art methods across various experimental settings, demonstrating the efficacy of the proposed Twinsight.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qxLVaYbsSI",
    "arxiv_id": "2402.14430",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17707,
    "title": "Effectively Leveraging Capacity for Improved Deterministic Robustness Certification",
    "authors": [
      "Kai Hu",
      "Klas Leino",
      "Zifan Wang",
      "Matt Fredrikson"
    ],
    "abstract": "Recent studies have highlighted the potential of Lipschitz-based methods for training certifiably robust neural networks against adversarial attacks.A key challenge, supported both theoretically and empirically, is that robustness demands greater network capacity and more data than standard training. However, effectively adding capacity under stringent Lipschitz constraints has proven more difficult than it may seem, evident by the fact that state-of-the-art approach tend more towards \\emph{underfitting} than overfitting.Moreover, we posit that a lack of careful exploration of the design space for Lipshitz-based approaches has left potential performance gains on the table.In this work, we provide a more comprehensive evaluation to better uncover the potential of Lipschitz-based certification methods.Using a combination of novel techniques, design optimizations, and synthesis of prior work, we are able to significantly improve the state-of-the-art VRA for deterministic certification on a variety of benchmark datasets, and over a range of perturbation sizes.Of particular note, we discover that the addition of large ``Cholesky-orthogonalized residual dense'' layers to the end of existing state-of-the-art Lipschitz-controlled ResNet architectures is especially effective for increasing network capacity and performance.Combined with filtered generative data augmentation, our final results further the state of the art deterministic VRA by up to 8.5 percentage points.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qz3mcn99cu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17706,
    "title": "Catastrophic Jailbreak of Open-source LLMs via Exploiting Generation",
    "authors": [
      "Yangsibo Huang",
      "Samyak Gupta",
      "Mengzhou Xia",
      "Kai Li",
      "Danqi Chen"
    ],
    "abstract": "The rapid progress in open-source large language models (LLMs) is significantly advancing AI development. Extensive efforts have been made before model release to align their behavior with human values, with the primary goal of ensuring their helpfulness and harmlessness. However, even carefully aligned models can be manipulated maliciously, leading to unintended behaviors, known as \"jailbreaks\". These jailbreaks are typically triggered by specific text inputs, often referred to as adversarial prompts. In this work, we propose the \\emph{generation exploitation} attack, an extremely simple approach that disrupts model alignment by only manipulating variations of decoding methods. By exploiting different generation strategies, including varying decoding hyper-parameters and sampling methods, we increase the misalignment rate from $0\\\\%$ to more than $95\\\\%$ across 11 language models including LLaMA2, Vicuna, Falcon, and MPT families, outperforming state-of-the-art attacks with $30\\times$ lower computational cost. Finally, we propose an effective alignment method that explores diverse generation strategies, which can reasonably reduce the misalignment rate under our attack. Altogether, our study underscores a major failure in current safety evaluation and alignment procedures for open-source LLMs, strongly advocating for more comprehensive red teaming and better alignment before releasing such models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=r42tSSCHPh",
    "arxiv_id": "2310.06987",
    "GitHub": [
      "https://github.com/Princeton-SysML/Jailbreak_LLM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17705,
    "title": "Nearly $d$-Linear Convergence Bounds for Diffusion Models via Stochastic Localization",
    "authors": [
      "Joe Benton",
      "Valentin De Bortoli",
      "Arnaud Doucet",
      "George Deligiannidis"
    ],
    "abstract": "Denoising diffusions are a powerful method to generate approximate samples from high-dimensional data distributions. Recent results provide polynomial bounds on their convergence rate, assuming $L^2$-accurate scores. Until now, the tightest bounds were either superlinear in the data dimension or required strong smoothness assumptions. We provide the first convergence bounds which are linear in the data dimension (up to logarithmic factors) assuming only finite second moments of the data distribution. We show that diffusion models require at most $\\tilde O(\\frac{d \\log^2(1/\\delta)}{\\varepsilon^2})$ steps to approximate an arbitrary distribution on $\\mathbb{R}^d$ corrupted with Gaussian noise of variance $\\delta$ to within $\\varepsilon^2$ in KL divergence. Our proof extends the Girsanov-based methods of previous works. We introduce a refined treatment of the error from discretizing the reverse SDE inspired by stochastic localization.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=r5njV3BsuD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17704,
    "title": "UniversalNER: Targeted Distillation from Large Language Models for Open Named Entity Recognition",
    "authors": [
      "Wenxuan Zhou",
      "Sheng Zhang",
      "Yu Gu",
      "Muhao Chen",
      "Hoifung Poon"
    ],
    "abstract": "Large language models (LLMs) have demonstrated remarkable generalizability, such as understanding arbitrary entities and relations. Instruction tuning has proven effective for distilling LLMs into more cost-efficient models such as Alpaca and Vicuna. Yet such student models still trail the original LLMs by large margins in downstream applications. In this paper, we explore targeted distillation with mission-focused instruction tuning to train student models that can excel in a broad application class such as open information extraction. Using named entity recognition (NER) for case study, we show how ChatGPT can be distilled into much smaller UniversalNER models for open NER. For evaluation, we assemble the largest NER benchmark to date, comprising 43 datasets across 9 diverse domains such as biomedicine, programming, social media, law, finance. Without using any direct supervision, UniversalNER attains remarkable NER accuracy across tens of thousands of entity types, outperforming general instruction-tuned models such as Alpaca and Vicuna by over 30 absolute F1 points in average. With a tiny fraction of parameters, UniversalNER not only acquires ChatGPT's capability in recognizing arbitrary entity types, but also outperforms its NER accuracy by 7-9 absolute F1 points in average. Remarkably, UniversalNER even outperforms by a large margin state-of-the-art multi-task instruction-tuned systems such as InstructUIE, which uses supervised NER examples. We also conduct thorough ablation studies to assess the impact of various components in our distillation approach. We will release the distillation recipe, data, and UniversalNER models to facilitate future research on targeted distillation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=r65xfUb76p",
    "arxiv_id": "2308.03279",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17703,
    "title": "Object centric architectures enable efficient causal representation learning",
    "authors": [
      "Amin Mansouri",
      "Jason Hartford",
      "Yan Zhang",
      "Yoshua Bengio"
    ],
    "abstract": "Causal representation learning has showed a variety of settings in which we can disentangle latent variables with identifiability guarantees (up to some reasonable equivalence class). Common to all of these approaches is the assumption that (1) the latent variables are represented as $d$-dimensional vectors, and (2) that the observations are the output of some injective generative function of these latent variables. While these assumptions appear benign, we show that when the observations are of multiple objects, the generative function is no longer injective and disentanglement fails in practice. We can address this failure by combining recent developments in object-centric learning and causal representation learning. By modifying the Slot Attention architecture (Locatello et al., 2020), we develop an object-centric architecture that leverages weak supervision from sparse perturbations to disentangle each object's properties. This approach is more data-efficient in the sense that it requires significantly fewer perturbations than a comparable approach that encodes to a Euclidean space and we show that this approach successfully disentangles the properties of a set of objects in a series of simple image-based disentanglement experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=r9FsiXZxZt",
    "arxiv_id": "2310.19054",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17702,
    "title": "S$2$AC: Energy-Based Reinforcement Learning with Stein Soft Actor Critic",
    "authors": [
      "Safa Messaoud",
      "Billel Mokeddem",
      "Zhenghai Xue",
      "Linsey Pang",
      "Bo An",
      "Haipeng Chen",
      "Sanjay Chawla"
    ],
    "abstract": "Learning expressive stochastic policies instead of deterministic ones has been proposed to achieve better stability, sample complexity and robustness. Notably, in Maximum Entropy reinforcement learning (MaxEnt RL), the policy is modeled as an expressive energy-based model (EBM) over the Q-values. However, this formulation requires the estimation of the entropy of such EBM distributions which is an open problem. To address this, previous MaxEnt RL methods either implicitly estimate the entropy, yielding high computational complexity and variance (SQL), or follow a variational inference approach that fits simplified distributions (e.g., Gaussian) for tractability (SAC). We propose Sein Soft Actor-Critic (S$^2$AC), a MaxEnt RL algorithm that learns expressive policies without compromising efficiency. S$^2$AC uses parameterized Stein Variational Gradient Descent (SVGD) as the underlying policy. At the core of S$^2$AC is a new solution to the above open challenge of entropy computation for EBMs. Our entropy formula is computationally efficient and only depends on first-order derivatives and vector products. Empirical results show that S$^2$AC yields more optimal solutions to the MaxEnt objective than SQL and SAC in the multi-goal environment, and outperforms SAC and SQL on the MuJoCo benchmark. Our code is available at: https://anonymous.4open.science/r/Stein-Soft-Actor-Critic/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rAHcTCMaLc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17701,
    "title": "Random Sparse Lifts: Construction, Analysis and Convergence of finite sparse networks",
    "authors": [
      "David A. R. Robin",
      "Kevin Scaman",
      "Marc Lelarge"
    ],
    "abstract": "We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global optimality of non-convex optimization, this new form of convergence, and the techniques introduced to prove such convergence, pave the way for a usable deep learning convergence theory in the near future, without overparameterization assumptions relating the number of parameters and training samples. We define these architectures from a simple computation graph and a mechanism to lift it, thus increasing the number of parameters, generalizing the idea of increasing the widths of multi-layer perceptrons. We show that architectures similar to most common deep learning models are present in this class, obtained by sparsifying the weight tensors of usual architectures at initialization. Leveraging tools of algebraic topology and random graph theory, we use the computation graph\u2019s geometry to propagate properties guaranteeing convergence to any precision for these large sparse models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rBH7x87VfJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17699,
    "title": "Progressive Fourier Neural Representation for Sequential Video Compilation",
    "authors": [
      "Haeyong Kang",
      "Jaehong Yoon",
      "DaHyun Kim",
      "Sung Ju Hwang",
      "Chang D. Yoo"
    ],
    "abstract": "Neural Implicit Representation (NIR) has recently gained significant attention due to its remarkable ability to encode complex and high-dimensional data into representation space and easily reconstruct it through a trainable mapping function. However, NIR methods assume a one-to-one mapping between the target data and representation models regardless of data relevancy or similarity. This results in poor generalization over multiple complex data and limits their efficiency and scalability. Motivated by continual learning, this work investigates how to accumulate and transfer neural implicit representations for multiple complex video data over sequential encoding sessions. To overcome the limitation of NIR, we propose a novel method, Progressive Fourier Neural Representation (PFNR), that aims to find an adaptive and compact sub-module in Fourier space to encode videos in each training session. This sparsified neural encoding allows the neural network to hold free weights, enabling an improved adaptation for future videos. In addition, when learning a representation for a new video, PFNR transfers the representation of previous videos with frozen weights. This design allows the model to continuously accumulate high-quality neural representations for multiple videos while ensuring lossless decoding that perfectly preserves the learned representations for previous videos. We validate our PFNR method on the UVG8/17 video sequence benchmarks and achieve impressive performance gains over strong continual learning baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rGFrRMBbOq",
    "arxiv_id": "2306.11305",
    "GitHub": [
      "https://github.com/ihaeyong/PFNR.git"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17698,
    "title": "Advancing Pose-Guided Image Synthesis with Progressive Conditional Diffusion Models",
    "authors": [
      "Fei Shen",
      "Hu Ye",
      "Jun Zhang",
      "Cong Wang",
      "Xiao Han",
      "Yang Wei"
    ],
    "abstract": "Recent work has showcased the significant potential of diffusion models in pose-guided person image synthesis.However, owing to the inconsistency in pose between the source and target images, synthesizing an image with a distinct pose, relying exclusively on the source image and target pose information, remains a formidable challenge.This paper presents Progressive Conditional Diffusion Models (PCDMs) that incrementally bridge the gap between person images under the target and source poses through three stages.Specifically, in the first stage, we design a simple prior conditional diffusion model that predicts the global features of the target image by mining the global alignment relationship between pose coordinates and image appearance.Then, the second stage establishes a dense correspondence between the source and target images using the global features from the previous stage, and an inpainting conditional diffusion model is proposed to further align and enhance the contextual features, generating a coarse-grained person image.In the third stage, we propose a refining conditional diffusion model to utilize the coarsely generated image from the previous stage as a condition, achieving texture restoration and enhancing fine-detail consistency.The three-stage PCDMs work progressively to generate the final high-quality and high-fidelity synthesized image.Both qualitative and quantitative results demonstrate the consistency and photorealism of our proposed PCDMs under challenging scenarios.Our code and models will be publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rHzapPnCgT",
    "arxiv_id": "2310.06313",
    "GitHub": [
      "https://github.com/tencent-ailab/PCDMs"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17697,
    "title": "Curriculum reinforcement learning for quantum architecture search under hardware errors",
    "authors": [
      "Yash J. Patel",
      "Akash Kundu",
      "Mateusz Ostaszewski",
      "Xavier Bonet-Monroig",
      "Vedran Dunjko",
      "Onur Danaci"
    ],
    "abstract": "The key challenge in the noisy intermediate-scale quantum era is finding useful circuits compatible with current device limitations.Variational quantum algorithms (VQAs) offer a potential solution by fixing the circuit architecture and optimizing individual gate parameters in an external loop. However, parameter optimization can become intractable, and the overall performance of the algorithm depends heavily on the initially chosen circuit architecture. Several quantum architecture search (QAS) algorithms have been developed to design useful circuit architectures automatically. In the case of parameter optimization alone, noise effects have been observed to dramatically influence the performance of the optimizer and final outcomes, which is a key line of study. However, the effects of noise on the architecture search, which could be just as critical, are poorly understood. This work addresses this gap by introducing a curriculum-based reinforcement learning QAS (CRLQAS) algorithm designed to tackle challenges in realistic VQA deployment. The algorithm incorporates (i) a 3D architecture encoding and restrictions on environment dynamics to explore the search space of possible circuits efficiently, (ii) an episode halting scheme to steer the agent to find shorter circuits, and (iii) a novel variant of simultaneous perturbation stochastic approximation as an optimizer for faster convergence. To facilitate studies, we developed an optimized simulator for our algorithm, significantly improving computational efficiency in simulating noisy quantum circuits by employing the Pauli-transfer matrix formalism in the Pauli-Liouville basis. Numerical experiments focusing on quantum chemistry tasks demonstrate that CRLQAS outperforms existing QAS algorithms across several metrics in both noiseless and noisy environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rINBD8jPoP",
    "arxiv_id": "2402.03500",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17696,
    "title": "Understanding Addition in Transformers",
    "authors": [
      "Philip Quirke",
      "Fazl Barez"
    ],
    "abstract": "Understanding the inner workings of machine learning models like Transformers is vital for their safe and ethical use. This paper presents an in-depth analysis of a one-layer Transformer model trained for integer addition. We reveal that the model divides the task into parallel, digit-specific streams and employs distinct algorithms for different digit positions. Our study also finds that the model starts calculations late but executes them rapidly. A rare use case with high loss is identified and explained. Overall the model's algorithm is explained in detail. These findings are validated through rigorous testing and mathematical modeling, contributing to the broader works in Mechanistic Interpretability, AI safety, and alignment. Our approach opens the door for analyzing more complex tasks and multi-layer Transformer models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rIx1YXVWZb",
    "arxiv_id": "2310.13121",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17695,
    "title": "Masked Structural Growth for 2x Faster Language Model Pre-training",
    "authors": [
      "Yiqun Yao",
      "Zheng Zhang",
      "Jing Li",
      "Yequan Wang"
    ],
    "abstract": "Accelerating large language model pre-training is a critical issue in present research. In this paper, we focus on speeding up pre-training by progressively growing from a small Transformer structure to a large one. There are two main research problems associated with progressive growth: determining the optimal growth schedule, and designing efficient growth operators. In terms of growth schedule, the impact of each single dimension on a schedule\u2019s efficiency is underexplored by existing work. Regarding the growth operators, existing methods rely on the initialization of new weights to inherit knowledge, and achieve only non-strict function preservation, limiting further improvements on training dynamics. To address these issues, we propose Masked Structural Growth (MSG), including (i) growth schedules involving all possible dimensions and (ii) strictly function-preserving growth operators that is independent of the initialization of new weights. Experiments show that MSG is significantly faster than related work: we achieve up to 2.2x speedup in pre-training different types of language models while maintaining comparable or better downstream performances. Code is publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rL7xsg1aRn",
    "arxiv_id": "2305.02869",
    "GitHub": [
      "https://github.com/cofe-ai/MSG"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17694,
    "title": "Like Oil and Water: Group Robustness Methods and Poisoning Defenses Don't Mix",
    "authors": [
      "Michael-Andrei Panaitescu-Liess",
      "Yigitcan Kaya",
      "Sicheng Zhu",
      "Furong Huang",
      "Tudor Dumitras"
    ],
    "abstract": "Group robustness has become a major concern in machine learning (ML) as conventional training paradigms were found to produce high error on minority groups. Without explicit group annotations, proposed solutions rely on heuristics that aim to identify and then amplify the minority samples during training. In our work, we first uncover a critical shortcoming of these methods: an inability to distinguish legitimate minority samples from poison samples in the training set. By amplifying poison samples as well, group robustness methods inadvertently boost the success rate of an adversary---e.g., from 0\\% without amplification to over 97\\% with it. Notably, we supplement our empirical evidence with an impossibility result proving this inability of a standard heuristic under some assumptions. Moreover, scrutinizing recent poisoning defenses both in centralized and federated learning, we observe that they rely on similar heuristics to identify which samples should be eliminated as poisons. In consequence, minority samples are eliminated along with poisons, which damages group robustness---e.g., from 55\\% without the removal of the minority samples to 41\\% with it. Finally, as they pursue opposing goals using similar heuristics, our attempt to alleviate the trade-off by combining group robustness methods and poisoning defenses falls short. By exposing this tension, we also hope to highlight how benchmark-driven ML scholarship can obscure the trade-offs among different metrics with potentially detrimental consequences.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rM9VJPB20F",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17692,
    "title": "Towards Lossless Dataset Distillation via Difficulty-Aligned Trajectory Matching",
    "authors": [
      "Ziyao Guo",
      "Kai Wang",
      "George Cazenavette",
      "HUI LI",
      "Kaipeng Zhang",
      "Yang You"
    ],
    "abstract": "The ultimate goal of Dataset Distillation is to synthesize a small synthetic dataset such that a model trained on this synthetic set will perform equally well as a model trained on the full, real dataset. Until now, no method of Dataset Distillation has reached this completely lossless goal, in part due to the fact that previous methods only remain effective when the total number of synthetic samples is extremely small. Since only so much information can be contained in such a small number of samples, it seems that to achieve truly loss dataset distillation, we must develop a distillation method that remains effective as the size of the synthetic dataset grows. In this work, we present such an algorithm and elucidate why existing methods fail to generate larger, high-quality synthetic sets. Current state-of-the-art methods rely on trajectory-matching, or optimizing the synthetic data to induce similar long-term training dynamics as the real data. We empirically find that the training stage of the trajectories we choose to match (i.e., early or late) greatly affects the effectiveness of the distilled dataset. Specifically, early trajectories (where the teacher network learns easy patterns) work well for a low-cardinality synthetic set since there are fewer examples wherein to distribute the necessary information. Conversely, late trajectories (where the teacher network learns hard patterns) provide better signals for larger synthetic sets since there are now enough samples to represent the necessary complex patterns. Based on our findings, we propose to align the difficulty of the generated patterns with the size of the synthetic dataset. In doing so, we successfully scale trajectory matching-based methods to larger synthetic datasets, achieving lossless dataset distillation for the very first time. Code and distilled datasets will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rTBL8OhdhH",
    "arxiv_id": "2310.05773",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17691,
    "title": "Octavius: Mitigating Task Interference in MLLMs via LoRA-MoE",
    "authors": [
      "Zeren Chen",
      "Ziqin Wang",
      "Zhen Wang",
      "Huayang Liu",
      "Zhenfei Yin",
      "Si Liu",
      "Lu Sheng",
      "Wanli Ouyang",
      "Jing Shao"
    ],
    "abstract": "Recent studies have demonstrated Large Language Models (LLMs) can extend their zero-shot generalization capabilities to multimodal learning through instruction tuning. As more modalities and downstream tasks are introduced, negative conflicts and interference may have a worse impact on performance. While this phenomenon has been overlooked in previous work, we propose a novel and extensible framework, called Octavius, for comprehensive studies and experimentation on multimodal learning with Multimodal Large Language Models (MLLMs). Specifically, to mitigate the interference, we combine the concept of Mixture-of-Experts (MoE) with LoRA and design a multimodal LoRA-MoE decoder for task- and modality-specific learning. The experimental results (about 20% improvement) have shown the effectiveness and versatility of our design in various 2D and 3D downstream tasks. Code and corresponding dataset will be availablesoon.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rTDyN8yajn",
    "arxiv_id": "2311.02684",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17690,
    "title": "Image Inpainting via Iteratively Decoupled Probabilistic Modeling",
    "authors": [
      "Wenbo Li",
      "Xin Yu",
      "Kun Zhou",
      "Yibing Song",
      "Zhe Lin"
    ],
    "abstract": "Generative adversarial networks (GANs) have made great success in image inpainting yet still have difficulties tackling large missing regions. In contrast, iterative probabilistic algorithms, such as autoregressive and denoising diffusion models, have to be deployed with massive computing resources for decent effect. To achieve high-quality results with low computational cost, we present a novel pixel spread model (PSM) that iteratively employs decoupled probabilistic modeling, combining the optimization efficiency of GANs with the prediction tractability of probabilistic models. As a result, our model selectively spreads informative pixels throughout the image in a few iterations, largely enhancing the completion quality and efficiency. On multiple benchmarks, we achieve new state-of-the-art performance. Our code and models will be publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=rUf9G9k2im",
    "arxiv_id": "2212.02963",
    "GitHub": [
      "https://github.com/fenglinglwb/PSM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17689,
    "title": "Does Progress On Object Recognition Benchmarks Improve Generalization on Crowdsourced, Global Data?",
    "authors": [
      "Megan Richards",
      "Polina Kirichenko",
      "Diane Bouchacourt",
      "Mark Ibrahim"
    ],
    "abstract": "For more than a decade, researchers have measured progress in object recognition on the ImageNet dataset along with its associated generalization benchmarks such as ImageNet-A, -C, and -R. Recent advances in foundation models, trained on orders of magnitude more data, have begun to saturate performance on these benchmarks. Despite this progress, even today\u2019s best models are brittle in practice. As a step toward more holistic measurement of model reliability, we propose studying performance on crowdsourced, global datasets, which contain natural distribution shifts seen practically in deployment. We perform a comprehensive empirical study on two crowdsourced, globally representative datasets, evaluating nearly 100 vision models to uncover several concerning empirical trends: first, that progress on crowdsourced, global data has significantly lagged behind standard benchmarks, with advances on ImageNet occurring at $2.5x$ the rate of progress on crowdsourced, global data. Second, we find that progress on standard benchmarks has failed to improve or exacerbated geographic disparities: \\textit{geographic disparities between the least performant models and today's best models have more than tripled}. We showcase the promise of using more curated and/or representative training datasets for mitigating these trends, and emphasize curation of web-scale, geographically representative training datasets as a critical open problem for the research community.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rhaQbS3K3R",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17688,
    "title": "TabR: Tabular Deep Learning Meets Nearest Neighbors",
    "authors": [
      "Yury Gorishniy",
      "Ivan Rubachev",
      "Nikolay Kartashev",
      "Daniil Shlenskii",
      "Akim Kotelnikov",
      "Artem Babenko"
    ],
    "abstract": "Deep learning (DL) models for tabular data problems (e.g. classification, regression) are currently receiving increasingly more attention from researchers.However, despite the recent efforts, the non-DL algorithms based on gradient-boosted decision trees (GBDT) remain a strong go-to solution for these problems.One of the research directions aimed at improving the position of tabular DL involves designing so-called retrieval-augmented models.For a target object, such models retrieve other objects (e.g. the nearest neighbors) from the available training data and use their features and labels to make a better prediction.In this work, we present TabR -- essentially, a feed-forward network with a custom k-Nearest-Neighbors-like component in the middle.On a set of public benchmarks with datasets up to several million objects, TabR marks a big step forward for tabular DL: it demonstrates the best average performance among tabular DL models, becomes the new state-of-the-art on several datasets, and even outperforms GBDT models on the recently proposed \"GBDT-friendly\" benchmark (see Figure 1).Among the important findings and technical details powering TabR, the main ones lie in the attention-like mechanism that is responsible for retrieving the nearest neighbors and extracting valuable signal from them.In addition to the higher performance, TabR is simple and significantly more efficient compared to prior retrieval-based tabular DL models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rhgIgTSSxW",
    "arxiv_id": "2307.14338",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17687,
    "title": "A Branching Decoder for Set Generation",
    "authors": [
      "Zixian Huang",
      "Gengyang Xiao",
      "Yu Gu",
      "Gong Cheng"
    ],
    "abstract": "Generating a set of text is a common challenge for many NLP applications, for example, automatically providing multiple keyphrases for a document to facilitate user reading. Existing generative models use a sequential decoder which generates a single sequence successively, and the set generation problem is converted to sequence generation via concatenating multiple texts into a long text sequence. However, the elements of a set are unordered, which makes this scheme suffer from biased or conflicting training signals. In this paper, we propose a novel branching decoder. It can generate a dynamic number of tokens at each time-step and branch multiple generation paths. In particular, paths are generated individually so that no order dependence is required. Moreover, multiple paths can be generated in parallel which greatly reduces inference time. Experiments on three keyphrase generation datasets demonstrate that our branching decoder is more effective and efficient than the existing sequential decoder.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=riNuqYiD66",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17686,
    "title": "Gen-Z: Generative Zero-Shot Text Classification with Contextualized Label Descriptions",
    "authors": [
      "Sachin Kumar",
      "Chan Young Park",
      "Yulia Tsvetkov"
    ],
    "abstract": "Language model (LM) prompting\u2014a popular paradigm for solving NLP tasks\u2014has been shown to be susceptible to miscalibration and brittleness to slight prompt variations, caused by its discriminative prompting approach, i.e., predicting the label given the input. To address these issues, we propose Gen-Z\u2014a generative prompting framework for zero-shot text classification. GEN-Z is generative, as it measures the LM likelihood of input text, conditioned on natural language descriptions of labels. The framework is multivariate, as label descriptions allow us to seamlessly integrate additional contextual information about the labels to improve task performance. On various standard classification benchmarks, with six open-source LM families, we show that zero-shot classification with simple contextualization of the data source of the evaluation set consistently outperforms both zero-shot and few-shot baselines while improving robustness to prompt variations. Further, our approach enables personalizing classification in a zero-shot manner by incorporating author, subject, or reader information in the label descriptions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rkplYfqUr0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17685,
    "title": "On the Provable Advantage of Unsupervised Pretraining",
    "authors": [
      "Jiawei Ge",
      "Shange Tang",
      "Jianqing Fan",
      "Chi Jin"
    ],
    "abstract": "Unsupervised pretraining, which learns a useful representation using a large amount of unlabeled data to facilitate the learning of downstream tasks, is a critical component of modern large-scale machine learning systems. Despite its tremendous empirical success, the rigorous theoretical understanding of why unsupervised pretraining generally helps remains rather limited---most existing results are restricted to particular methods or approaches for unsupervised pretraining with specialized structural assumptions. This paper studies a generic framework,where the unsupervised representation learning task is specified by an abstract class of latent variable models $\\Phi$ and the downstream task is specified by a class of prediction functions $\\Psi$. We consider a natural approach of using Maximum Likelihood Estimation (MLE) for unsupervised pretraining and Empirical Risk Minimization (ERM) for learning downstream tasks. We prove that, under a mild ``informative'' condition, our algorithm achieves an excess risk of $\\\\tilde{\\\\mathcal{O}}(\\sqrt{\\mathcal{C}\\_\\Phi/m} + \\sqrt{\\mathcal{C}\\_\\Psi/n})$ for downstream tasks, where $\\mathcal{C}\\_\\Phi, \\mathcal{C}\\_\\Psi$ are complexity measures of function classes $\\Phi, \\Psi$, and $m, n$ are the number of unlabeled and labeled data respectively. Comparing to the baseline of $\\tilde{\\mathcal{O}}(\\sqrt{\\mathcal{C}\\_{\\Phi \\circ \\Psi}/n})$ achieved by performing supervised learning using only the labeled data, our result rigorously shows the benefit of unsupervised pretraining when $m \\gg n$ and $\\mathcal{C}\\_{\\Phi\\circ \\Psi} > \\mathcal{C}\\_\\Psi$. This paper further shows that our generic framework covers a wide range of approaches for unsupervised pretraining, including factor models, Gaussian mixture models, and contrastive learning.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=rmXXKxQpOR",
    "arxiv_id": "2303.01566",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17684,
    "title": "Intriguing Properties of Generative Classifiers",
    "authors": [
      "Priyank Jaini",
      "Kevin Clark",
      "Robert Geirhos"
    ],
    "abstract": "What is the best paradigm to recognize objects---discriminative inference (fast but potentially prone to shortcut learning) or using a generative model (slow but potentially more robust)? We build on recent advances in generative modeling that turn text-to-image models into classifiers. This allows us to study their behavior and to compare them against discriminative models and human psychophysical data.We report four intriguing emergent properties of generative classifiers: they show a record-breaking human-like shape bias (99% for Imagen), near human-level out-of-distribution accuracy, state-of-the-art alignment with human classification errors, and they understand certain perceptual illusions. Our results indicate that while the current dominant paradigm for modeling human object recognition is discriminative inference, zero-shot generative models approximate human object recognition data surprisingly well.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=rmg0qMKYRQ",
    "arxiv_id": "2309.16779",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17683,
    "title": "Stylized Offline Reinforcement Learning: Extracting Diverse High-Quality Behaviors from Heterogeneous Datasets",
    "authors": [
      "Yihuan Mao",
      "Chengjie Wu",
      "Xi Chen",
      "Hao Hu",
      "Ji Jiang",
      "Tianze Zhou",
      "Tangjie Lv",
      "Changjie Fan",
      "Zhipeng Hu",
      "Yi Wu",
      "Yujing Hu",
      "Chongjie Zhang"
    ],
    "abstract": "Previous literature on policy diversity in reinforcement learning (RL) either focuses on the online setting or ignores the policy performance. In contrast, offline RL, which aims to learn high-quality policies from batched data, has yet to fully leverage the intrinsic diversity of the offline dataset. Addressing this dichotomy and aiming to balance quality and diversity poses a significant challenge to extant methodologies. This paper introduces a novel approach, termed Stylized Offline RL (SORL), which is designed to extract high-performing, stylistically diverse policies from a dataset characterized by distinct behavioral patterns. Drawing inspiration from the venerable Expectation-Maximization (EM) algorithm, SORL innovatively alternates between policy learning and trajectory clustering, a mechanism that promotes policy diversification. To further augment policy performance, we introduce advantage-weighted style learning into the SORL framework. Experimental evaluations across multiple environments demonstrate the significant superiority of SORL over previous methods in extracting high-quality policies with diverse behaviors. A case in point is that SORL successfully learns strong policies with markedly distinct playing patterns from a real-world human dataset of a popular basketball video game \"Dunk City Dynasty.\"",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rnHNDihrIT",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17682,
    "title": "Faithful Vision-Language Interpretation via Concept Bottleneck Models",
    "authors": [
      "Songning Lai",
      "Lijie Hu",
      "Junxiao Wang",
      "Laure Berti-Equille",
      "Di Wang"
    ],
    "abstract": "The demand for transparency in healthcare and finance has led to interpretable machine learning (IML) models, notably the concept bottleneck models (CBMs), valued for its potential in performance and insights into deep neural networks. However, CBM's reliance on manually annotated data poses challenges. Label-free CBM has emerged to address this, but they remain unstable, affecting their faithfulness as explanatory tools. To address this inherent instability issue, we introduce a formal definition for an alternative concept called the Faithful Vision-Language Concept (FVLC) models. We present a methodology for constructing an FVLC that satisfies four critical properties. Our extensive experimentation, conducted on four benchmark datasets using Label-free CBM model architectures, demonstrates that our FVLC outperforms other baselines in terms of stability against input and concept set perturbations. Our approach incurs minimal accuracy degradation compared to the vanilla CBM, making it a promising solution for reliable and faithful model interpretation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rp0EdI8X4e",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17680,
    "title": "DistillSpec: Improving Speculative Decoding via Knowledge Distillation",
    "authors": [
      "Yongchao Zhou",
      "Kaifeng Lyu",
      "Ankit Singh Rawat",
      "Aditya Krishna Menon",
      "Afshin Rostamizadeh",
      "Sanjiv Kumar",
      "Jean-Fran\u00e7ois Kagy",
      "Rishabh Agarwal"
    ],
    "abstract": "Speculative decoding~(SD) accelerates large language model inference by employing a faster {\\em draft} model for generating multiple tokens, which are then verified in parallel by the larger {\\em target} model, resulting in the text generated according to the target model distribution. However, identifying a compact draft model that is well-aligned with the target model is challenging. To tackle this issue, we propose {\\em DistillSpec} that uses knowledge distillation to better align the draft model with the target model, before applying SD. DistillSpec makes two key design choices, which we demonstrate via systematic study to be crucial to improve the draft and target alignment: utilizing \\emph{on-policy} data generation from the draft model, and \\emph{tailoring the divergence function} to the task and decoding strategy. Notably, DistillSpec yields impressive $10 - 45\\%$ speedups over standard SD on a range of standard benchmarks, using both greedy and non-greedy sampling. Furthermore, we combine DistillSpec with lossy SD to achieve fine-grained control over the latency vs. task performance trade-off. Finally, in practical scenarios with models of varying sizes, first using distillation to boost the performance of the target model and then applying DistillSpec to train a well-aligned draft model can reduce decoding latency by $6 - 10\\times$ with minimal performance drop, compared to standard decoding without distillation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rsY6J3ZaTF",
    "arxiv_id": "2310.08461",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17679,
    "title": "Federated Wasserstein Distance",
    "authors": [
      "Alain Rakotomamonjy",
      "Kimia Nadjahi",
      "Liva Ralaivola"
    ],
    "abstract": "We introduce a principled way of computing the Wasserstein distance between two distributions in a federated manner.Namely, we show how to estimate the Wasserstein distance between two samples stored and kept on different devices/clients whilst a central entity/server orchestrates the computations  (again, without having access to the samples). To achieve this feat, we take advantage of the geometric properties of the Wasserstein distance -- in particular, the triangle inequality --  and that of the associated {\\em geodesics}: our algorithm, FedWad (for Federated Wasserstein Distance), iteratively approximates  the Wasserstein distance by manipulating and exchanging distributions from the  space of geodesics in lieu of the input samples.   In addition to establishing the convergence properties of FedWad,   we provide empirical results on federated coresets and federate    optimal transport dataset distance, that we respectively exploit for   building a novel federated model and for boosting performance of popular federated learning algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rsg1mvUahT",
    "arxiv_id": "2310.01973",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17678,
    "title": "Understanding the Robustness of Multi-modal Contrastive Learning to Distribution Shift",
    "authors": [
      "Yihao Xue",
      "Siddharth Joshi",
      "Dang Nguyen",
      "Baharan Mirzasoleiman"
    ],
    "abstract": "Recently, multimodal contrastive learning (MMCL) approaches, such as CLIP \\citep{radford2021learning}, have achieved a remarkable success in learning representations that are robust against distribution shift and generalize to new domains. Despite the empirical success, the mechanism behind learning such generalizable representations is not understood. In this work, we rigorously analyze this problem and uncover two mechanisms behind MMCL's robustness: \\emph{intra-class contrasting}, which allows the model to learn features with a high variance, and \\emph{inter-class feature sharing}, where annotated details in one class help learning other classes better. Both mechanisms prevent spurious features that are over-represented in the training data to overshadow the generalizable core features. This yields superior zero-shot classification accuracy under distribution shift. Furthermore, we theoretically demonstrate the benefits of using rich captions on robustness and explore the effect of annotating different types of details in the captions. We validate our theoretical findings through experiments, including a well-designed synthetic experiment and an experiment involving training CLIP on MS COCO \\citep{lin2014microsoft} and evaluating the model on variations of shifted ImageNet.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rtl4XnJYBh",
    "arxiv_id": "2310.04971",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17677,
    "title": "Variational Inference for SDEs Driven by Fractional Noise",
    "authors": [
      "Rembert Daems",
      "Manfred Opper",
      "Guillaume Crevecoeur",
      "Tolga Birdal"
    ],
    "abstract": "We present a novel variational framework for performing inference in (neural) stochastic differential equations (SDEs) driven by Markov-approximate fractional Brownian motion (fBM). SDEs offer a versatile tool for modeling real-world continuous-time dynamic systems with inherent noise and randomness. Combining SDEs with the powerful inference capabilities of variational methods, enables the learning of representative function distributions through stochastic gradient descent. However, conventional SDEs typically assume  the underlying noise to follow a Brownian motion (BM), which hinders their ability to capture long-term dependencies. In contrast, fractional Brownian motion (fBM) extends BM to encompass non-Markovian dynamics, but existing methods for inferring fBM parameters are either computationally demanding or statistically inefficient. In this paper, building upon the Markov approximation of fBM, we derive the evidence lower bound essential for efficient variational inference of posterior path measures, drawing from the well-established field of stochastic analysis. Additionally, we provide a closed-form expression to determine optimal approximation coefficients. Furthermore, we propose the use of neural networks to learn the drift, diffusion and control terms within our variational posterior, leading to the variational training of neural-SDEs. In this framework, we also optimize the Hurst index, governing the nature of our fractional noise. Beyond validation on synthetic data, we contribute a novel architecture for variational latent video prediction,\u2014an approach that, to the best of our knowledge, enables the first variational neural-SDE application to video perception.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=rtx8B94JMS",
    "arxiv_id": "2310.12975",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17676,
    "title": "A Data-Driven Measure of Relative Uncertainty for Misclassification Detection",
    "authors": [
      "Eduardo Dadalto C\u00e2mara Gomes",
      "Marco Romanelli",
      "Georg Pichler",
      "Pablo Piantanida"
    ],
    "abstract": "Misclassification detection is an important problem in machine learning, as it allows for the identification of instances where the model's predictions are unreliable. However, conventional uncertainty measures such as Shannon entropy do not provide an effective way to infer the real uncertainty associated with the model's predictions. In this paper, we introduce a novel data-driven measure of relative uncertainty to an observer for misclassification detection. By learning patterns in the distribution of soft-predictions, our uncertainty measure can identify misclassified samples based on the predicted class probabilities.  Interestingly, according to the proposed measure, soft-predictions that correspond to misclassified instances can carry a large amount of uncertainty, even though they may have low Shannon entropy. We demonstrate empirical improvements over multiple image classification tasks, outperforming state-of-the-art misclassification detection methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ruGY8v10mK",
    "arxiv_id": "2306.01710",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17674,
    "title": "Conformal Prediction via Regression-as-Classification",
    "authors": [
      "Etash Kumar Guha",
      "Shlok Natarajan",
      "Thomas M\u00f6llenhoff",
      "Mohammad Emtiyaz Khan",
      "Eugene Ndiaye"
    ],
    "abstract": "Conformal prediction (CP) for regression can be challenging, especially when the output distribution is heteroscedastic, multimodal, or skewed. Some of the issues can be addressed by estimating a distribution over the output, but in reality, such approaches can be sensitive to estimation error and yield unstable intervals. Here, we circumvent the challenges by converting regression to a classification problem and then use CP for classification to obtain CP sets for regression. To preserve the ordering of the continuous-output space, we design a new loss function and present necessary modifications to the CP classification techniques. Empirical results on many benchmarks show that this simple approach gives surprisingly good results on many practical problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rulxyXjf46",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17673,
    "title": "Long-Short-Range Message-Passing: A Physics-Informed Framework to Capture Non-Local Interaction for Scalable Molecular Dynamics Simulation",
    "authors": [
      "Yunyang Li",
      "Yusong Wang",
      "Lin Huang",
      "Han Yang",
      "Xinran Wei",
      "Jia Zhang",
      "Tong Wang",
      "Zun Wang",
      "Bin Shao",
      "Tie-Yan Liu"
    ],
    "abstract": "Computational simulation of chemical and biological systems using *ab initio* molecular dynamics has been a challenge over decades. Researchers have attempted to address the problem with machine learning and fragmentation-based methods. However, the two approaches fail to give a satisfactory description of long-range and many-body interactions, respectively. Inspired by fragmentation-based methods, we propose the Long-Short-Range Message-Passing (LSR-MP) framework as a generalization of the existing equivariant graph neural networks (EGNNs) with the intent to incorporate long-range interactions efficiently and effectively. We apply the LSR-MP framework to the recently proposed ViSNet and demonstrate the state-of-the-art results with up to 40% MAE reduction for molecules in MD22 and Chignolin datasets. Consistent improvements to various EGNNs will also be discussed to illustrate the general applicability and robustness of our LSR-MP framework. The code for our experiments and trained model weights could be found at https://anonymous.4open.science/r/LSRM-760E/.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rvDQtdMnOl",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17827,
    "title": "Entropy-MCMC: Sampling from Flat Basins with Ease",
    "authors": [
      "Bolian Li",
      "Ruqi Zhang"
    ],
    "abstract": "Bayesian deep learning counts on the quality of posterior distribution estimation. However, the posterior of deep neural networks is highly multi-modal in nature, with local modes exhibiting varying generalization performance. Given a practical budget, targeting at the original posterior can lead to suboptimal performance, as some samples may become trapped in \"bad\" modes and suffer from overfitting. Leveraging the observation that \"good\" modes with low generalization error often reside in flat basins of the energy landscape, we propose to bias sampling on the posterior toward these flat regions. Specifically, we introduce an auxiliary guiding variable, the stationary distribution of which resembles a smoothed posterior free from sharp modes, to lead the MCMC sampler to flat basins. By integrating this guiding variable with the model parameter, we create a simple joint distribution that enables efficient sampling with minimal computational overhead. We prove the convergence of our method and further show that it converges faster than several existing flatness-aware methods in the strongly convex setting. Empirical results demonstrate that our method can successfully sample from flat basins of the posterior, and outperforms all compared baselines on multiple benchmarks including classification, calibration, and out-of-distribution detection.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=oGNdBvymod",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17672,
    "title": "Learning to Act without Actions",
    "authors": [
      "Dominik Schmidt",
      "Minqi Jiang"
    ],
    "abstract": "Pre-training large models on vast amounts of web data has proven to be an effective approach for obtaining powerful, general models in several domains, including language and vision. However, this paradigm has not yet taken hold in deep reinforcement learning (RL). This gap is due to the fact that the most abundant form of embodied behavioral data on the web consists of videos, which do not include the action labels required by existing methods for training policies from offline data. We introduce Latent Action Policies from Observation (LAPO), a method to infer latent actions and, consequently, latent-action policies purely from action-free demonstrations. Our experiments on challenging procedurally-generated environments show that LAPO can act as an effective pre-training method to obtain RL policies that can then be rapidly fine-tuned to expert-level performance. Our approach serves as a key stepping stone to enabling the pre-training of powerful, generalist RL models on the vast amounts of action-free demonstrations readily available on the web.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=rvUq3cxpDF",
    "arxiv_id": "2312.10812",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17671,
    "title": "Selective Mixup Fine-Tuning for Optimizing Non-Decomposable Objectives",
    "authors": [
      "Shrinivas Ramasubramanian",
      "Harsh Rangwani",
      "Sho Takemori",
      "Kunal Samanta",
      "Yuhei Umeda",
      "Venkatesh Babu Radhakrishnan"
    ],
    "abstract": "The rise in internet usage has led to the generation of massive amounts of data, resulting in the adoption of various supervised and semi-supervised machine learning algorithms, which can effectively utilize the colossal amount of data to train models. However, before deploying these models in the real world, these must be strictly evaluated on performance measures like worst-case recall and satisfy constraints such as fairness. We find that current state-of-the-art empirical techniques offer sub-optimal performance on these practical, non-decomposable performance objectives. On the other hand, the theoretical techniques necessitate training a new model from scratch for each performance objective. To bridge the gap, we propose SelMix, a selective mixup-based inexpensive fine-tuning technique for pre-trained models, to optimize for the desired objective. The core idea of our framework is to determine a sampling distribution to perform a mixup of features between samples from particular classes such that it optimizes the given objective.  We comprehensively evaluate our technique against the existing empirical and theoretically principled methods on standard benchmark datasets for imbalanced classification. We find that proposed SelMix fine-tuning significantly improves the performance for various practical non-decomposable objectives across benchmarks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=rxVBKhyfSo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17670,
    "title": "Improving protein optimization with smoothed fitness landscapes",
    "authors": [
      "Andrew Kirjner",
      "Jason Yim",
      "Raman Samusevich",
      "Shahar Bracha",
      "Tommi S. Jaakkola",
      "Regina Barzilay",
      "Ila R Fiete"
    ],
    "abstract": "The ability to engineer novel proteins with higher fitness for a desired property would be revolutionary for biotechnology and medicine. Modeling the combinatorially large space of sequences is infeasible; prior methods often constrain optimization to a small mutational radius, but this drastically limits the design space. Instead of heuristics, we propose smoothing the fitness landscape to facilitate protein optimization. First, we formulate protein fitness as a graph signal then use Tikunov regularization to smooth the fitness landscape. We find optimizing in this smoothed landscape leads to improved performance across multiple methods in the GFP and AAV benchmarks. Second, we achieve state-of-the-art results utilizing discrete energy-based models and MCMC in the smoothed landscape. Our method, called Gibbs sampling with Graph-based Smoothing (GGS), demonstrates a unique ability to achieve 2.5 fold fitness improvement (with in-silico evaluation) over its training set. GGS demonstrates potential to optimize proteins in the limited data regime. Code: https://github.com/kirjner/GGS",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rxlF2Zv8x0",
    "arxiv_id": "2307.00494",
    "GitHub": [
      "https://github.com/kirjner/GGS"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17669,
    "title": "CAMIL: Context-Aware Multiple Instance Learning for Cancer Detection and Subtyping in Whole Slide Images",
    "authors": [
      "Olga Fourkioti",
      "Matt De Vries",
      "Chris Bakal"
    ],
    "abstract": "The visual examination of tissue biopsy sections is fundamental for cancer diagnosis, with pathologists analyzing sections at multiple magnifications to discern tumor cells and their subtypes. However, existing attention-based multiple instance learning (MIL) models, used for analyzing Whole Slide Images (WSIs) in cancer diagnostics, often overlook the contextual information of tumor and neighboring tiles, leading to misclassifications. To address this, we propose the Context-Aware Multiple Instance Learning (CAMIL) architecture. CAMIL incorporates neighbor-constrained attention to consider dependencies among tiles within a WSI and integrates contextual constraints as prior knowledge into the MIL model. We evaluated CAMIL on subtyping non-small cell lung cancer (TCGA-NSCLC) and detecting lymph node (CAMELYON16) metastasis, achieving test AUCs of 0.959\\% and 0.975\\%, respectively, outperforming other state-of-the-art methods. Additionally, CAMIL enhances model interpretability by identifying regions of high diagnostic value",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=rzBskAEmoc",
    "arxiv_id": "2305.05314",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17668,
    "title": "Neural SDF Flow for 3D Reconstruction of Dynamic Scenes",
    "authors": [
      "Wei Mao",
      "Richard Hartley",
      "Mathieu Salzmann",
      "miaomiao Liu"
    ],
    "abstract": "In this paper, we tackle the problem of 3D reconstruction of dynamic scenes from multi-view videos. Previous works attempt to model the motion of 3D points in space, which either constrains them to handle a single articulated object or requires extra efforts to handle topology changes. By contrast, we propose to directly estimate the change of Signed Distance Function (SDF), namely SDF flow, of the dynamic scene. We show that the SDF flow captures the evolution of the scene surface and handles topology changes naturally. We further derive the mathematical relation between the SDF flow and the scene flow, which allows us to calculate the scene flow from the SDF flow analytically by solving linear equations. Our experiments on real-world multi-view video datasets show that our reconstructions are better than those of the state-of-the-art methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rzF0R6GOd4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17667,
    "title": "Accurate Retraining-free Pruning for Pretrained Encoder-based Language Models",
    "authors": [
      "Seungcheol Park",
      "Hojun Choi",
      "U Kang"
    ],
    "abstract": "Given a pretrained encoder-based language model, how can we accurately compress it without retraining? Retraining-free structured pruning algorithms are crucial in pretrained language model compression due to their significantly reduced pruning cost and capability to prune large language models. However, existing retraining-free algorithms encounter severe accuracy degradation, as they fail to handle pruning errors, especially at high compression rates. In this paper, we propose KPrune (Knowledge-preserving pruning), an accurate retraining-free structured pruning algorithm for pretrained encoder-based language models.KPrune focuses on preserving the useful knowledge of the pretrained model to minimize pruning errors through a carefully designed iterative pruning process composed of knowledge measurement, knowledge-preserving mask search, and knowledge-preserving weight-tuning. As a result, KPrune shows significant accuracy improvements up to 58.02%p higher F1 score compared to existing retraining-free pruning algorithms under a high compression rate of 80% on the SQuAD benchmark without any retraining process.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=s2NjWfaYdZ",
    "arxiv_id": "2308.03449",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17666,
    "title": "BaDExpert: Extracting Backdoor Functionality for Accurate Backdoor Input Detection",
    "authors": [
      "Tinghao Xie",
      "Xiangyu Qi",
      "Ping He",
      "Yiming Li",
      "Jiachen T. Wang",
      "Prateek Mittal"
    ],
    "abstract": "We present a novel defense, against backdoor attacks on Deep Neural Networks (DNNs), wherein adversaries covertly implant malicious behaviors (backdoors) into DNNs. Our defense falls within the category of post-development defenses that operate independently of how the model was generated. The proposed defense is built upon a novel reverse engineering approach that can directly extract **backdoor functionality** of a given backdoored model to a *backdoor expert* model. The approach is straightforward --- finetuning the backdoored model over a small set of intentionally mislabeled clean samples, such that it unlearns the normal functionality while still preserving the backdoor functionality, and thus resulting in a model~(dubbed a backdoor expert model) that can only recognize backdoor inputs. Based on the extracted backdoor expert model, we show the feasibility of devising highly accurate backdoor input detectors that filter out the backdoor inputs during model inference. Further augmented by an ensemble strategy with a finetuned auxiliary model, our defense, **BaDExpert** (**Ba**ckdoor Input **D**etection with Backdoor **Expert**), effectively mitigates 17 SOTA backdoor attacks while minimally impacting clean utility. The effectiveness of BaDExpert has been verified on multiple datasets (CIFAR10, GTSRB and ImageNet) across various model architectures (ResNet, VGG, MobileNetV2 and Vision Transformer).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=s56xikpD92",
    "arxiv_id": "2308.12439",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17665,
    "title": "The Human-AI Substitution game: active learning from a strategic labeler",
    "authors": [
      "Tom Yan",
      "Chicheng Zhang"
    ],
    "abstract": "The standard active learning setting assumes a willing labeler, who provides labels on informative examples to speed up learning. However, if the labeler wishes to be compensated for as many labels as possible before learning finishes, the labeler may benefit from actually slowing down learning. This incentive arises for instance if the labeler is to be replaced by the ML model, once it is learned. In this paper, we initiate the study of learning from a strategic labeler, who selectively abstains from labeling to slow down learning. We first prove that strategic abstention can prolong learning, and propose novel complexity measures to analyze the query cost of the learning game. Next, we develop a near-optimal deterministic algorithm, prove its robustness to strategic labeling, and contrast it with other active learning algorithms. We also provide extensions that encompass other learning setups/goals. Finally, we characterize the query cost of multi-task active learning, with and without abstention. Our first exploration of strategic labeling aims to add to our theoretical understanding of the imitative nature of ML in human-AI interaction.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=s5hSp7EdL3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17664,
    "title": "Towards Eliminating Hard Label Constraints in Gradient Inversion Attacks",
    "authors": [
      "Yanbo Wang",
      "Jian Liang",
      "Ran He"
    ],
    "abstract": "Gradient inversion attacks aim to reconstruct local training data from intermediate gradients exposed in the federated learning framework. Despite successful attacks, all previous methods, starting from reconstructing a single data point and then relaxing the single-image limit to batch level, only work well under hard label constraints. Even for single-image reconstruction, we still lack an analysis-based algorithm to recover augmented soft labels. In this work, we change the focus from enlarging batchsize to investigating the hard label constraints, considering a more realistic circumstance where label smoothing and mixup techniques are used in the training process. In particular, we are the first to initialize a novel algorithm to simultaneously recover the ground-truth augmented label and the input feature of the last fully-connected layer from single-input gradients, and provide a necessary condition for any analytical-based label recovery methods. Extensive experiments testify to the label recovery accuracy, as well as the benefits to the following image reconstruction. We believe soft labels in classification tasks are worth further attention in gradient inversion attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=s8cMuxI5gu",
    "arxiv_id": "2402.03124",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17663,
    "title": "f-FERM: A  Scalable Framework for  Robust Fair Empirical Risk Minimization",
    "authors": [
      "Sina Baharlouei",
      "Shivam Patel",
      "Meisam Razaviyayn"
    ],
    "abstract": "Training and deploying machine learning models that meet fairness criteria for protected groups are fundamental in modern artificial intelligence. While numerous constraints and regularization terms have been proposed in the literature to promote fairness in machine learning tasks, most of these methods are not amenable to stochastic optimization due to the complex and nonlinear structure of constraints and regularizers. Here, the term \"stochastic\" refers to the ability of the algorithm to work with small mini-batches of data. Motivated by the limitation of existing literature, this paper presents a unified stochastic optimization framework for fair empirical risk minimization based on $f$-divergence measures ($f$-FERM). The proposed stochastic algorithm enjoys theoretical convergence guarantees. In addition, our experiments demonstrate the superiority of fairness-accuracy tradeoffs offered by $f$-FERM for almost all batch sizes (ranging from full-batch to batch size of one). Moreover, we show that our framework can be extended to the case where there is a distribution shift from training to the test data. Our extension is based on a  distributionally robust optimization reformulation of $f$-FERM objective under $\\ell_p$ norms as uncertainty sets. Again in this distributionally robust setting, $f$-FERM not only enjoys theoretical convergence guarantees but also outperforms other baselines in the literature in the tasks involving distribution shifts.  An efficient stochastic implementation of $f$-FERM is publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=s90VIdza2K",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17661,
    "title": "MagicDrive: Street View Generation with Diverse 3D Geometry Control",
    "authors": [
      "Ruiyuan Gao",
      "Kai Chen",
      "Enze Xie",
      "Lanqing HONG",
      "Zhenguo Li",
      "Dit-Yan Yeung",
      "Qiang Xu"
    ],
    "abstract": "Recent advancements in diffusion models have significantly enhanced the data synthesis with 2D control. Yet, precise 3D control in street view generation, crucial for 3D perception tasks, remains elusive. Specifically, utilizing Bird's-Eye View (BEV) as the primary condition often leads to challenges in geometry control (e.g., height), affecting the representation of object shapes, occlusion patterns, and road surface elevations, all of which are essential to perception data synthesis, especially for 3D object detection tasks. In this paper, we introduce MagicDrive, a novel street view generation framework offering diverse 3D geometry controls, including camera poses, road maps, and 3D bounding boxes, together with textual descriptions, achieved through tailored encoding strategies. Besides, our design incorporates a cross-view attention module, ensuring consistency across multiple camera views. With MagicDrive, we achieve high-fidelity street-view synthesis that captures nuanced 3D geometry and various scene descriptions, enhancing tasks like BEV segmentation and 3D object detection. Project Website: https://magic-drive.github.io/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sBQwvucduK",
    "arxiv_id": "2310.02601",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17659,
    "title": "Memory-Assisted Sub-Prototype Mining for Universal Domain Adaptation",
    "authors": [
      "Yuxiang Lai",
      "Yi Zhou",
      "Xinghong Liu",
      "Tao Zhou"
    ],
    "abstract": "Universal domain adaptation aims to align the classes and reduce the feature gap between the same category of the source and target domains. The target private category is set as the unknown class during the adaptation process, as it is not included in the source domain. However, most existing methods overlook the intra-class structure within a category, especially in cases where there exists significant concept shift between the samples belonging to the same category. When samples with large concept shift are forced to be pushed together, it may negatively affect the adaptation performance. Moreover, from the interpretability aspect, it is unreasonable to align visual features with significant differences, such as fighter jets and civil aircraft, into the same category. Unfortunately, due to such semantic ambiguity and annotation cost, categories are not always classified in detail, making it difficult for the model to perform precise adaptation. To address these issues, we propose a novel Memory-Assisted Sub-Prototype Mining (MemSPM) method that can learn the differences between samples belonging to the same category and mine sub-classes when there exists significant concept shift between them. By doing so, our model learns a more reasonable feature space that enhances the transferability and reflects the inherent differences among samples annotated as the same category. We evaluate the effectiveness of our MemSPM method over multiple scenarios, including UniDA, OSDA, and PDA. Our method achieves state-of-the-art performance on four benchmarks in most cases.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sGVmr7KHfn",
    "arxiv_id": "2310.05453",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17658,
    "title": "Branch-GAN: Improving Text Generation with (not so) Large Language Models",
    "authors": [
      "Fredrik Carlsson",
      "Johan Broberg",
      "Erik Hillbom",
      "Magnus Sahlgren",
      "Joakim Nivre"
    ],
    "abstract": "The current advancements in open domain text generation have been spearheaded by Transformer-based large language models. Leveraging efficient parallelization and vast training datasets, these models achieve unparalleled text generation capabilities. Even so, current models are known to suffer from  deficiencies such as repetitive texts, looping issues, and lack of robustness. While adversarial training through generative adversarial networks (GAN) is a proposed solution, earlier research in this direction has predominantly focused on older architectures, or narrow tasks. As a result, this approach is not yet compatible with modern language models for open-ended text generation, leading to diminished interest within the broader research community. We propose a computationally efficient GAN approach for sequential data that utilizes the parallelization capabilities of Transformer models. Our method revolves around generating multiple branching sequences from each training sample, while also incorporating the typical next-step prediction loss on the original data. In this way, we achieve a dense reward and loss signal for both the generator and the discriminator, resulting in a stable training dynamic. We apply our training method to pre-trained language models, using data from their original training set but less than 0.01% of the available data.  A comprehensive human evaluation shows that our method significantly improves the quality of texts generated by the model while avoiding the previously reported sparsity problems of GAN approaches. Even our smaller models outperform larger original baseline models with more than 16 times the number of parameters. Finally, we corroborate previous claims that perplexity on held-out data is not a sufficient metric for measuring the quality of generated texts.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sHEJJmzBIN",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17656,
    "title": "Addressing Loss of Plasticity and Catastrophic Forgetting in Continual Learning",
    "authors": [
      "Mohamed Elsayed",
      "A. Rupam Mahmood"
    ],
    "abstract": "Deep representation learning methods struggle with continual learning, suffering from both catastrophic forgetting of useful units and loss of plasticity, often due to rigid and unuseful units. While many methods address these two issues separately, only a few currently deal with both simultaneously. In this paper, we introduce Utility-based Perturbed Gradient Descent (UPGD) as a novel approach for the continual learning of representations. UPGD combines gradient updates with perturbations, where it applies smaller modifications to more useful units, protecting them from forgetting, and larger modifications to less useful units, rejuvenating their plasticity. We adopt the challenging setup of streaming learning as the testing ground and design continual learning problems with hundreds of non-stationarities and unknown task boundaries. We show that many existing methods suffer from at least one of the issues, predominantly manifested by their decreasing accuracy over tasks. On the other hand, UPGD continues to improve performance and surpasses or is competitive with all methods in all problems, being among the few methods demonstrably capable of addressing both issues.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sKPzAXoylB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17655,
    "title": "Fair and Efficient Contribution Valuation for Vertical Federated Learning",
    "authors": [
      "Zhenan Fan",
      "Huang Fang",
      "Xinglu Wang",
      "Zirui Zhou",
      "Jian Pei",
      "Michael Friedlander",
      "Yong Zhang"
    ],
    "abstract": "Federated learning is an emerging technology for training machine learning models across decentralized data sources without sharing data. Vertical federated learning, also known as feature-based federated learning, applies to scenarios where data sources have the same sample IDs but different feature sets. To ensure fairness among data owners, it is critical to objectively assess the contributions from different data sources and compensate the corresponding data owners accordingly. The Shapley value is a provably fair contribution valuation metric originating from cooperative game theory. However, its straight-forward computation requires extensively retraining a model on each potential combination of data sources, leading to prohibitively high communication and computation overheads due to multiple rounds of federated learning. To tackle this challenge, we propose a contribution valuation metric called vertical federated Shapley value (VerFedSV) based on the classic Shapley value. We show that VerFedSV not only satisfies many desirable properties of fairness but is also efficient to compute. Moreover, VerFedSV can be adapted to both synchronous and asynchronous vertical federated learning algorithms. Both theoretical analysis and extensive experimental results demonstrate the fairness, efficiency, adaptability, and effectiveness of VerFedSV.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sLQb8q0sUi",
    "arxiv_id": "2201.02658",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17654,
    "title": "NuwaDynamics: Discovering and Updating in Causal Spatio-Temporal Modeling",
    "authors": [
      "Kun Wang",
      "Hao Wu",
      "Yifan Duan",
      "Guibin Zhang",
      "Kai Wang",
      "Xiaojiang Peng",
      "Yu Zheng",
      "Yuxuan Liang",
      "Yang Wang"
    ],
    "abstract": "Spatio-temporal (ST) prediction plays a pivotal role in earth sciences, such as meteorological prediction, urban computing. Adequate high-quality data, coupled with deep models capable of inference, are both indispensable and prerequisite for achieving meaningful results. However, the sparsity of data and the high costs associated with deploying sensors lead to significant data imbalances. Models that are overly tailored and lack causal relationships further compromise the generalizabilities of inference methods. Towards this end, we first establish a causal concept for ST predictions, named  NuwaDynamics, which targets to identify causal regions in data and endow model with causal reasoning ability in a two-stage process. Concretely, we initially leverage upstream self-supervision to discern causal important patches, imbuing the model with generalized information and conducting informed interventions on complementary trivial patches to extrapolate potential test distributions. This phase is referred to as the discovery step. Advancing beyond discovery step, we transfer the data to downstream tasks for targeted ST objectives, aiding the model in recognizing a broader potential distribution and fostering its causal perceptual capabilities (refer as Update step). Our concept aligns seamlessly with the contemporary backdoor adjustment mechanism in causality theory. Extensive experiments on six real-world ST benchmarks showcase that models can gain outcomes upon the integration of the NuwaDynamics concept. NuwaDynamics also can significantly benefit a wide range of changeable ST tasks like extreme weather and long temporal step super-resolution predictions.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=sLdVl0q68X",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17653,
    "title": "Transformers can optimally learn regression mixture models",
    "authors": [
      "Reese Pathak",
      "Rajat Sen",
      "Weihao Kong",
      "Abhimanyu Das"
    ],
    "abstract": "Mixture models arise in many regression problems, but most methods have seen limited adoption partly due to these algorithms' highly-tailored and model-specific nature. On the other hand, transformers are flexible, neural sequence models that present the intriguing possibility of providing general-purpose prediction methods, even in this mixture setting. In this work, we investigate the hypothesis that transformers can learn an optimal predictor for mixtures of regressions. We construct a generative process for a mixture of linear regressions for which the decision-theoretic optimal procedure is given by data-driven exponential weights on a finite set of parameters. We observe that transformers achieve low mean-squared error on data generated via this process. By probing the transformer's output at inference time, we also show that transformers typically make predictions that are close to the optimal predictor. Our experiments also demonstrate that transformers can learn mixtures of regressions in a sample-efficient fashion and are somewhat robust to distribution shifts. We complement our experimental observations by proving constructively that the decision-theoretic optimal procedure is indeed implementable by a transformer.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sLkj91HIZU",
    "arxiv_id": "2311.08362",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17652,
    "title": "On the Analysis of GAN-based Image-to-Image Translation with Gaussian Noise Injection",
    "authors": [
      "Chaohua Shi",
      "Kexin Huang",
      "Lu GAN",
      "Hongqing Liu",
      "Mingrui Zhu",
      "Nannan Wang",
      "Xinbo Gao"
    ],
    "abstract": "Image-to-image (I2I) translation is vital in computer vision tasks like style transfer and domain adaptation. While recent advances in GAN have enabled high-quality sample generation, real-world challenges such as noise and distortion remain significant obstacles. Although Gaussian noise injection during training has been utilized, its theoretical underpinnings have been unclear. This work provides a robust theoretical framework elucidating the role of Gaussian noise injection in I2I translation models. We address critical questions on the influence of noise variance on distribution divergence, resilience to unseen noise types, and optimal noise intensity selection. Our contributions include connecting $f$-divergence and score matching, unveiling insights into the impact of Gaussian noise on aligning probability distributions, and demonstrating generalized robustness implications. We also explore choosing an optimal training noise level for consistent performance in noisy environments. Extensive experiments validate our theoretical findings, showing substantial improvements over various I2I baseline models in noisy settings. Our research rigorously grounds Gaussian noise injection for I2I translation, offering a sophisticated theoretical understanding beyond heuristic applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sLregLuXpn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17651,
    "title": "Towards Meta-Pruning via Optimal Transport",
    "authors": [
      "Alexander Theus",
      "Olin Geimer",
      "Friedrich Wicke",
      "Thomas Hofmann",
      "Sotiris Anagnostidis",
      "Sidak Pal Singh"
    ],
    "abstract": "Pruning is one of the mainstream methods to compress over-parameterized neural networks, resulting in significant practical benefits. Recently, another line of work has explored the direction of fusion, i.e. merging, independently trained neural networks. Here, we seek to marry the two approaches in a bid to combine their advantages into a single approach, which we term `Intra-Fusion'. Specifically, we implicitly utilize the pruning criteria to result in more informed fusion. Agnostic to the choice of a specific neuron-importance metric, Intra-Fusion can typically prune an additional considerable amount of the parameters while retaining the same accuracy as the standard pruning approach. Additionally, we explore how fusion can be added to the pruning process to significantly decrease the training time while maintaining competitive performance. We benchmark our results for various networks on commonly used datasets such as CIFAR10, CIFAR100, and ImageNet. More broadly, we hope that the proposed approach invigorates exploration into a fresh alternative to the predominant compression approaches.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=sMoifbuxjB",
    "arxiv_id": "2402.07839",
    "GitHub": [
      "https://github.com/alexandertheus/Intra-Fusion"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17650,
    "title": "Neural Common Neighbor with Completion for Link Prediction",
    "authors": [
      "Xiyuan Wang",
      "Haotong Yang",
      "Muhan Zhang"
    ],
    "abstract": "In this work, we propose a novel link prediction model and further boost it by studying graph incompleteness. First, We introduce MPNN-then-SF, an innovative architecture leveraging structural feature (SF) to guide MPNN's representation pooling, with its implementation, namely Neural Common Neighbor (NCN). NCN exhibits superior expressiveness and scalability compared with existing models, which can be classified into two categories: SF-then-MPNN, augmenting MPNN's input with SF, and SF-and-MPNN, decoupling SF and MPNN. Second, we investigate the impact of graph incompleteness---the phenomenon that some links are unobserved in the input graph---on SF, like the common neighbor. Through dataset visualization, we observe that incompleteness reduces common neighbors and induces distribution shifts, significantly affecting model performance. To address this issue, we propose to use a link prediction model to complete the common neighbor structure. Combining this method with NCN, we propose Neural Common Neighbor with Completion (NCNC). NCN and NCNC outperform recent strong baselines by large margins, and NCNC further surpasses state-of-the-art models in standard link prediction benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sNFLN3itAd",
    "arxiv_id": "2302.00890",
    "GitHub": [
      "https://github.com/GraphPKU/NeuralCommonNeighbor"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17649,
    "title": "NeRM: Learning Neural Representations for High-Framerate Human Motion Synthesis",
    "authors": [
      "Dong Wei",
      "Huaijiang Sun",
      "Bin Li",
      "Xiaoning Sun",
      "Shengxiang Hu",
      "Weiqing Li",
      "Jianfeng Lu"
    ],
    "abstract": "Generating realistic human motions with high framerate is an underexplored task, due to the varied framerates of training data, huge memory burden brought by high framerates and slow sampling speed of generative models. Recent advances make a compromise for training by downsampling high-framerate details away and discarding low-framerate samples, which suffer from severe information loss and restricted-framerate generation. In this paper, we found that the recent emerging paradigm of Implicit Neural Representations (INRs) that encode a signal into a continuous function can effectively tackle this challenging problem. To this end, we introduce NeRM, a generative model capable of taking advantage of varied-size data and capturing variational distribution of motions for high-framerate motion synthesis. By optimizing latent representation and a auto-decoder conditioned on temporal coordinates, NeRM learns continuous motion fields of sampled motion clips that ingeniously avoid explicit modeling of raw varied-size motions. This expressive latent representation is then used to learn a diffusion model that enables both unconditional and conditional generation of human motions. We demonstrate that our approach achieves competitive results with state-of-the-art methods, and can generate arbitrary framerate motions. Additionally, we show that NeRM is not only memory-friendly, but also highly efficient even when generating high-framerate motions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sOJriBlOFd",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17648,
    "title": "Fiber Monte Carlo",
    "authors": [
      "Nick Richardson",
      "Deniz Oktay",
      "Yaniv Ovadia",
      "James C Bowden",
      "Ryan P Adams"
    ],
    "abstract": "Integrals with discontinuous integrands are ubiquitous, arising from discrete structure in applications like topology optimization, graphics, and computational geometry.    These integrals are often part of a forward model in an inverse problem where it is necessary to reason backwards about the parameters, ideally using gradient-based optimization.     Monte Carlo methods are widely used to estimate the value of integrals, but this results in a non-differentiable approximation that is amenable to neither conventional automatic differentiation nor reparameterization-based gradient methods.     This significantly disrupts efforts to integrate machine learning methods in areas that exhibit these discontinuities: physical simulation and robotics, design, graphics, and computational geometry.      Although bespoke domain-specific techniques can handle special cases, a general methodology to wield automatic differentiation in these discrete contexts is wanting.     We introduce a differentiable variant of the simple Monte Carlo estimator which samples line segments rather than points from the domain.     We justify our estimator analytically as conditional Monte Carlo and demonstrate the diverse functionality of the method as applied to image stylization, topology optimization, and computational geometry.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sP1tCl2QBk",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17647,
    "title": "Consistent4D: Consistent 360\u00b0 Dynamic Object Generation from Monocular Video",
    "authors": [
      "Yanqin Jiang",
      "Li Zhang",
      "Jin Gao",
      "Weiming Hu",
      "Yao Yao"
    ],
    "abstract": "In this paper, we present Consistent4D, a novel approach for generating 4D dynamic objects from uncalibrated monocular videos. Uniquely, we cast the 360-degree dynamic object reconstruction as a 4D generation problem, eliminating the need for tedious multi-view data collection and camera calibration. This is achieved by leveraging the object-level 3D-aware image diffusion model as the primary supervision signal for training dynamic Neural Radiance Fields (DyNeRF). Specifically, we propose a cascade DyNeRF to facilitate stable convergence and temporal continuity under the supervision signal which is discrete along the time axis. To achieve spatial and temporal consistency, we further introduce an interpolation-driven consistency loss. It is optimized by minimizing the L2 distance between rendered frames from DyNeRF and interpolated frames from a pre-trained video interpolation model. Extensive experiments show that our Consistent4D can perform competitively to prior art alternatives, opening up new possibilities for 4D dynamic object generation from monocular videos, whilst also demonstrating advantage for conventional text-to-3D generation tasks",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sPUrdFGepF",
    "arxiv_id": "2311.02848",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17646,
    "title": "Adapting to Distribution Shift by Visual Domain Prompt Generation",
    "authors": [
      "Zhixiang Chi",
      "Li Gu",
      "Tao Zhong",
      "Huan Liu",
      "YUANHAO YU",
      "Konstantinos N Plataniotis",
      "Yang Wang"
    ],
    "abstract": "In this paper, we aim to adapt a model at test-time using a few unlabeled data to address distribution shifts. In this setting, extracting the domain knowledge from a limited amount of data is challenging. To improve such a process, it is crucial to utilize correlated information from pre-trained backbones and source domains. Previous studies fail to utilize recent foundation models with strong out-of-distribution generalization. Additionally, domain-centric designs are not flavored in their works. Furthermore, they employ the process of modelling source domains and the process of learning to adapt independently into disjoint training stages. In this work, we propose an approach on top of the pre-computed features of the foundation model. Specifically, we build a knowledge bank to learn the transferable knowledge from source domains. Conditioned on few-shot target data, we introduce a domain prompt generator to condense the knowledge bank into a domain-specific prompt. The domain prompt then directs the visual features towards a particular domain via a guidance module. Moreover, we propose a domain-aware contrastive loss and employ meta-learning to facilitate domain knowledge extraction. Extensive experiments are conducted to validate the domain knowledge extraction. The proposed method outperforms previous work significantly on 5 large-scale benchmarks including WILDS and DomainNet.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sSaN4gxuEf",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17645,
    "title": "Divide and not forget: Ensemble of  selectively trained experts  in Continual Learning",
    "authors": [
      "Grzegorz Rype\u015b\u0107",
      "Sebastian Cygert",
      "Valeriya Khan",
      "Tomasz Trzcinski",
      "Bartosz Micha\u0142 Zieli\u0144ski",
      "Bart\u0142omiej Twardowski"
    ],
    "abstract": "Class-incremental learning is becoming more popular as it helps models widen their applicability while not forgetting what they already know. A trend in this area is to use a mixture-of-expert technique, where different models work together to solve the task. However, the experts are usually trained all at once using whole task data, which makes them all prone to forgetting and increasing computational burden. To address this limitation, we introduce a novel approach named SEED. SEED selects only one, the most optimal expert for a considered task, and uses data from this task to fine-tune only this expert. For this purpose, each expert represents each class with a Gaussian distribution, and the optimal expert is selected based on the similarity of those distributions. Consequently, SEED increases diversity and heterogeneity within the experts while maintaining the high stability of this ensemble method. The extensive experiments demonstrate that SEED achieves state-of-the-art performance in exemplar-free settings across various scenarios, showing the potential of expert diversification through data in continual learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sSyytcewxe",
    "arxiv_id": "2401.10191",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17637,
    "title": "Probabilistic Self-supervised Representation Learning via Scoring Rules Minimization",
    "authors": [
      "Amirhossein Vahidi",
      "Simon Schosser",
      "Lisa Wimmer",
      "Yawei Li",
      "Bernd Bischl",
      "Eyke H\u00fcllermeier",
      "Mina Rezaei"
    ],
    "abstract": "Self-supervised learning methods have shown promising results across a wide range of tasks in computer vision, natural language processing, and multimodal analysis. However, self-supervised approaches come with a notable limitation, dimensional collapse, where a model doesn't fully utilize its capacity to encode information optimally. Motivated by this, we propose ProSMin, a novel probabilistic self-supervised learning approach that leverages the power of probabilistic models to enhance representation quality and mitigate collapsing representations. Our proposed approach involves two neural networks; the online network and the target network, which collaborate and learn the diverse distribution of representations from each other through probabilistic knowledge distillation. The two networks are trained via our new loss function based on proper scoring rules. We provide a theoretical justification for ProSMin's convergence, demonstrating the strict propriety of its modified scoring rule. This insight validates the method's optimization process and contributes to its robustness and effectiveness in improving representation quality. We evaluate our probabilistic model on various downstream tasks, such as in-distribution generalization, out-of-distribution detection, dataset corruption, low-shot learning, and transfer learning. Our method achieves superior accuracy and calibration, outperforming the self-supervised baseline in a variety of experiments on large datasets such as ImageNet-O and ImageNet-C. ProSMin thus demonstrates its scalability and real-world applicability. The code is in the supplementary material.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=skcTCdJz0f",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17644,
    "title": "Evaluating Representation Learning on the Protein Structure Universe",
    "authors": [
      "Arian Rokkum Jamasb",
      "Alex Morehead",
      "Zuobai Zhang",
      "Chaitanya K. Joshi",
      "Kieran Didi",
      "Simon V Mathis",
      "Charles Harris",
      "Jian Tang",
      "Jianlin Cheng",
      "Pietro Lio",
      "Tom Leon Blundell"
    ],
    "abstract": "Protein structure representation learning is the foundation for promising applications in drug discovery, protein design, and protein function prediction. However, there remains a need for a robust, standardised benchmark to track the progress of new and established methods with greater granularity and relevance to downstream applications. In this work, we introduce a comprehensive and open benchmark suite for evaluating protein structure representation learning methods.We provide several pre-training methods, downstream tasks and pre-training corpora comprised of both experimental and predicted structures, offering a balanced challenge to representation learning algorithms. These tasks enable the systematic evaluation of the quality of the learned embeddings, the structural and functional relationships captured, and their usefulness in downstream tasks. We benchmark state-of-the-art protein-specific and generic geometric Graph Neural Networks and the extent to which they benefit from different types of pre-training. We find that pre-training consistently improves the performance of both rotation-invariant and equivariant models, and that equivariant models seem to benefit even more from pre-training compared to invariant models.We aim to establish a common ground for the machine learning and computational biology communities to collaborate, compare, and advance protein structure representation learning. By providing a standardised and rigorous evaluation platform, we expect to accelerate the development of novel methodologies and improve our understanding of protein structures and their functions. The codebase incorporates several engineering contributions which considerably reduces the barrier to entry for pre-training and working with large structure-based datasets. Our benchmark is available at: https://anonymous.4open.science/r/ProteinWorkshop-B8F5/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sTYuRVrdK3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17625,
    "title": "Classification with Conceptual Safeguards",
    "authors": [
      "Hailey Joren",
      "Charles Thomas Marx",
      "Berk Ustun"
    ],
    "abstract": "Machine learning models are often used to automate routine tasks. In settings where mistakes are costly, we can trade off accuracy for coverage by abstaining from making a prediction on instances for which the model is uncertain. In this work, we present a new approach to selective classification in deep learning with concepts. Our approach constructs a concept bottleneck model where the front-end model can make predictions given soft concepts and leverage concept confirmation to improve coverage and performance under abstention. We develop techniques to propagate uncertainty and identify concepts for confirmation. We evaluate our approach on real-world and synthetic datasets, showing that it can improve coverage while maintaining performance across a range of tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=t8cBsT9mcg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17624,
    "title": "Tailoring Self-Rationalizers with Multi-Reward Distillation",
    "authors": [
      "Sahana Ramnath",
      "Brihi Joshi",
      "Skyler Hallinan",
      "Ximing Lu",
      "Liunian Harold Li",
      "Aaron Chan",
      "Jack Hessel",
      "Yejin Choi",
      "Xiang Ren"
    ],
    "abstract": "Large language models (LMs) are capable of generating free-text rationales to aid question answering. However, prior work 1) suggests that useful self-rationalization is emergent only at significant scales (e.g., 175B parameter GPT-3); and 2) focuses largely on downstream performance, ignoring the semantics of the rationales themselves, e.g., are they faithful, true, and helpful for humans? In this work, we enable small-scale LMs (\u223c200x smaller than GPT-3) to generate rationales that not only improve downstream task performance, but are also more plausible, consistent, and diverse, assessed both by automatic and human evaluation. Our method, MaRio (Multi-rewArd RatIOnalization), is a multi-reward conditioned self-rationalization algorithm that optimizes multiple distinct properties like plausibility, diversity and consistency. Results on three difficult question-answering datasets StrategyQA, QuaRel and OpenBookQA show that not only does MaRio improve task accuracy, but it also improves the self-rationalization quality of small LMs across the aforementioned axes better than a supervised fine-tuning (SFT) baseline. Extensive human evaluations confirm that MaRio rationales are preferred vs. SFT rationales, as well as qualitative improvements in plausibility and consistency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=t8eO0CiZJV",
    "arxiv_id": "2311.02805",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17623,
    "title": "Language Model Inversion",
    "authors": [
      "John Xavier Morris",
      "Wenting Zhao",
      "Justin T Chiu",
      "Vitaly Shmatikov",
      "Alexander M Rush"
    ],
    "abstract": "Given a prompt, language models produce a distribution over all possible next tokens; when the prompt is unknown, can we use this distributional information to recover the prompt? We consider the problem of anguage model inversion and show that next-token probabilities contain a surprising amount of information about the preceding text. Often we can recover the text in cases where it is hidden from the user, motivating a method for recovering unknown prompts given only the model's current distribution output. We consider a variety of model access scenarios, and show how even without predictions for every token in the vocabulary we can recover the probability vector through search and reconstruction of the input. On LLAMA-7B, our inversion method reconstructs prompts with a BLEU of $59$ and token-level F1 of $77$ and recovers $23\\%$ of prompts exactly",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=t9dWHpGkPj",
    "arxiv_id": "2311.13647",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17622,
    "title": "How Realistic Is Your Synthetic Data? Constraining Deep Generative Models for Tabular Data",
    "authors": [
      "Mihaela C Stoian",
      "Salijona Dyrmishi",
      "Maxime Cordy",
      "Thomas Lukasiewicz",
      "Eleonora Giunchiglia"
    ],
    "abstract": "Deep Generative Models (DGMs) have been shown to be powerful tools for generating tabular data, as they have been increasingly able to capture the complex distributions that characterize them. However, to generate realistic synthetic data, it is often not enough to have a good approximation of their distribution, as it also requires compliance with constraints that encode essential background knowledge on the problem at hand. In this paper, we address this limitation and show how DGMs for tabular data can be transformed into Constrained Deep Generative Models (C-DGMs), whose generated samples are guaranteed to be compliant with the given constraints. This is achieved by automatically parsing the constraints and transforming them into a Constraint Layer (CL) seamlessly integrated with the DGM. Our extensive experimental analysis with various DGMs and tasks reveals that standard DGMs often violate constraints, some exceeding 95% non-compliance, while their corresponding C-DGMs are never non-compliant. Then, we quantitatively demonstrate that, at training time, C-DGMs are able to exploit the background knowledge expressed by the constraints to outperform their standard counterparts with up to 4.5% improvement in utility and detection. Further, we show how our CL does not necessarily need to be integrated at training time, as it can be also used as a guardrail at inference time, still producing some improvements in the overall performance of the models. Finally, we show that our CL does not hinder the sample generation time of the models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tBROYsEz9G",
    "arxiv_id": "2402.04823",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17621,
    "title": "Partitioning Message Passing for Graph Fraud Detection",
    "authors": [
      "Wei Zhuo",
      "Zemin Liu",
      "Bryan Hooi",
      "Bingsheng He",
      "Guang Tan",
      "Rizal Fathony",
      "Jia Chen"
    ],
    "abstract": "Label imbalance and homophily-heterophily mixture are the fundamental problems encountered when applying Graph Neural Networks (GNNs) to Graph Fraud Detection (GFD) tasks. Existing GNN-based GFD models are designed to augment graph structure to accommodate the inductive bias of GNNs towards homophily, by excluding heterophilic neighbors during message passing. In our work, we argue that the key to applying GNNs for GFD is not to exclude but to {\\em distinguish} neighbors with different labels. Grounded in this perspective, we introduce Partitioning Message Passing (PMP), an intuitive yet effective message passing paradigm expressly crafted for GFD. Specifically, in the neighbor aggregation stage of PMP, neighbors with different classes are aggregated with distinct node-specific aggregation functions. By this means, the center node can adaptively adjust the information aggregated from its heterophilic and homophilic neighbors, thus avoiding the model gradient being dominated by benign nodes which occupy the majority of the population. We theoretically establish a connection between the spatial formulation of PMP and spectral analysis to characterize that PMP operates an adaptive node-specific spectral graph filter, which demonstrates the capability of PMP to handle heterophily-homophily mixed graphs. Extensive experimental results show that PMP can significantly boost the performance on GFD tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tEgrUrUuwA",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17620,
    "title": "Reasoning with Latent Diffusion in Offline Reinforcement Learning",
    "authors": [
      "Siddarth Venkatraman",
      "Shivesh Khaitan",
      "Ravi Tej Akella",
      "John Dolan",
      "Jeff Schneider",
      "Glen Berseth"
    ],
    "abstract": "Offline reinforcement learning (RL) holds promise as a means to learn high-reward policies from a static dataset, without the need for further environment interactions. However, a key challenge in offline RL lies in effectively stitching portions of suboptimal trajectories from the static dataset while avoiding extrapolation errors arising due to a lack of support in the dataset. Existing approaches use conservative methods that are tricky to tune and struggle with multi-modal data or rely on noisy Monte Carlo return-to-go samples for reward conditioning. In this work, we propose a novel approach that leverages the expressiveness of latent diffusion to model in-support trajectory sequences as compressed latent skills. This facilitates learning a Q-function while avoiding extrapolation error via batch-constraining. The latent space is also expressive and gracefully copes with multi-modal data. We show that the learned temporally-abstract latent space encodes richer task-specific information for offline RL tasks as compared to raw state-actions. This improves credit assignment and facilitates faster reward propagation during Q-learning. Our method demonstrates state-of-the-art performance on the D4RL benchmarks, particularly excelling in long-horizon, sparse-reward tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tGQirjzddO",
    "arxiv_id": "2309.06599",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17619,
    "title": "Generalization of Scaled Deep ResNets in the Mean-Field Regime",
    "authors": [
      "Yihang Chen",
      "Fanghui Liu",
      "Yiping Lu",
      "Grigorios Chrysos",
      "Volkan Cevher"
    ],
    "abstract": "Despite the widespread empirical success of ResNet, the generalization ability of deep ResNet is rarely explored beyond the lazy-training regime. In this work, we investigate ResNet in the limit of infinitely deep and wide neural networks, of which the gradient flow is described by a partial differential equation in the large-neural network limit, i.e., the \\emph{mean-field} regime. To derive the generalization bounds under this setting, our analysis necessitates a shift from the conventional time-invariant Gram matrix employed in the lazy training regime to a time-variant, distribution-dependent version tailored to the mean-field regime. To this end, we provide a lower bound on the minimum eigenvalue of the Gram matrix under the mean-field regime. Besides, the traceability of the dynamic of Kullback-Leibler (KL) divergence is also required under the mean-field regime. We therefore establish the linear convergence of the empirical error and estimate the upper bound of the KL divergence over parameters distribution. The above two results are employed to build the uniform convergence for generalization bound via Rademacher complexity. Our results offer new insights into the generalization ability of deep ResNet beyond the lazy training regime and contribute to advancing the understanding of the fundamental properties of deep neural networks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tMzPZTvz2H",
    "arxiv_id": "2403.09889",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17618,
    "title": "Matryoshka Diffusion Models",
    "authors": [
      "Jiatao Gu",
      "Shuangfei Zhai",
      "Yizhe Zhang",
      "Joshua M. Susskind",
      "Navdeep Jaitly"
    ],
    "abstract": "Diffusion models are the de-facto approach for generating high-quality images and videos, but learning high-dimensional models remains a formidable task due to computational and optimization challenges. Existing methods often resort to training cascaded models in pixel space, or using a downsampled latent space of a separately trained auto-encoder. In this paper, we introduce Matryoshka Diffusion (MDM), an end-to-end framework for high-resolution image and video synthesis. We propose a diffusion process that denoises inputs at multiple resolutions jointly and uses a NestedUNet architecture where features and parameters for small-scale inputs are nested within those of large scales. In addition, MDM enables a progressive training schedule from lower to higher resolutions, which leads to significant improvements in optimization for high-resolution generation. We demonstrate the effectiveness of our approach on various benchmarks, including class-conditioned image generation, high-resolution text-to-image, and text-to-video applications. Remarkably, we can train a single pixel-space model at resolutions of up to 1024x1024 pixels, demonstrating strong zero-shot generalization using the CC12M dataset, which contains only 12 million images.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tOzCcDdH9O",
    "arxiv_id": "2310.15111",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17617,
    "title": "Towards Robust Out-of-Distribution Generalization Bounds via Sharpness",
    "authors": [
      "Yingtian Zou",
      "Kenji Kawaguchi",
      "Yingnan Liu",
      "Jiashuo Liu",
      "Mong-Li Lee",
      "Wynne Hsu"
    ],
    "abstract": "Generalizing to out-of-distribution (OOD) data or unseen domain, termed OOD generalization, still lacks appropriate theoretical guarantees. Canonical OOD bounds focus on different distance measurements between source and target domains but fail to consider the optimization property of the learned model. As empirically shown in recent work, sharpness of learned minimum influences OOD generalization. To bridge this gap between optimization and OOD generalization, we study the effect of sharpness on how a model tolerates data change in domain shift which is usually captured by \"robustness\" in generalization. In this paper, we give a rigorous connection between sharpness and robustness, which gives better OOD guarantees for robust algorithms. It also provides a theoretical backing for \"flat minima leads to better OOD generalization\". Overall, we propose a sharpness-based OOD generalization bound by taking robustness into consideration, resulting in a tighter bound than non-robust guarantees. Our findings are supported by the experiments on a ridge regression model, as well as the experiments on deep learning classification tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tPEwSYPtAC",
    "arxiv_id": "2403.06392",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17616,
    "title": "Text2Reward: Reward Shaping with Language Models for Reinforcement Learning",
    "authors": [
      "Tianbao Xie",
      "Siheng Zhao",
      "Chen Henry Wu",
      "Yitao Liu",
      "Qian Luo",
      "Victor Zhong",
      "Yanchao Yang",
      "Tao Yu"
    ],
    "abstract": "Designing reward functions is a longstanding challenge in reinforcement learning (RL); it requires specialized knowledge or domain data, leading to high costs for development. To address this, we introduce Text2Reward, a data-free framework that automates the generation and shaping of dense reward functions based on large language models (LLMs). Given a goal described in natural language, Text2Reward generates shaped dense reward functions as an executable program grounded in a compact representation of the environment. Unlike inverse RL and recent work that uses LLMs to write sparse reward codes or unshaped dense rewards with a constant function across timesteps, Text2Reward produces interpretable, free-form dense reward codes that cover a wide range of tasks, utilize existing packages, and allow iterative refinement with human feedback. We evaluate Text2Reward on two robotic manipulation benchmarks (ManiSkill2, MetaWorld) and two locomotion environments of MuJoCo. On 13 of the 17 manipulation tasks, policies trained with generated reward codes achieve similar or better task success rates and convergence speed than expert-written reward codes. For locomotion tasks, our method learns six novel locomotion behaviors with a success rate exceeding 94%. Furthermore, we show that the policies trained in the simulator with our method can be deployed in the real world. Finally, Text2Reward further improves the policies by refining their reward functions with human feedback. Video results are available at https://text-to-reward.github.io/",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tUM39YTRxH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17615,
    "title": "Learning Conditional Invariances through Non-Commutativity",
    "authors": [
      "Abhra Chaudhuri",
      "Serban Georgescu",
      "Anjan Dutta"
    ],
    "abstract": "Invariance learning algorithms that conditionally filter out domain-specific random variables as distractors, do so based only on the data semantics, and not the target domain under evaluation. We show that a provably optimal and sample-efficient way of learning conditional invariances is by relaxing the invariance criterion to be non-commutatively directed towards the target domain. Under domain asymmetry, i.e., when the target domain contains semantically relevant information absent in the source, the risk of the encoder $\\varphi^*$ that is optimal on average across domains is strictly lower-bounded by the risk of the target-specific optimal encoder $\\Phi^*_\\tau$. We prove that non-commutativity steers the optimization towards $\\Phi^*_\\tau$ instead of $\\varphi^*$, bringing the $\\mathcal{H}$-divergence between domains down to zero, leading to a stricter bound on the target risk. Both our theory and experiments demonstrate that non-commutative invariance (NCI) can leverage source domain samples to meet the sample complexity needs of learning $\\Phi^*_\\tau$, surpassing SOTA invariance learning algorithms for domain adaptation, at times by over 2\\%, approaching the performance of an oracle. Implementation is available at https://github.com/abhrac/nci.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tUVG9nGzgE",
    "arxiv_id": "2402.11682",
    "GitHub": [
      "https://github.com/abhrac/nci"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17613,
    "title": "Provable Offline Preference-Based Reinforcement Learning",
    "authors": [
      "Wenhao Zhan",
      "Masatoshi Uehara",
      "Nathan Kallus",
      "Jason D. Lee",
      "Wen Sun"
    ],
    "abstract": "In this paper, we investigate the problem of offline Preference-based Reinforcement Learning (PbRL) with human feedback where feedback is available in the form of preference between trajectory pairs rather than explicit rewards. Our proposed algorithm consists of two main steps: (1) estimate the implicit reward using Maximum Likelihood Estimation (MLE) with general function approximation from offline data and (2) solve a distributionally robust planning problem over a confidence set around the MLE. We consider the general reward setting where the reward can be defined over the whole trajectory and provide a novel guarantee that allows us to learn any target policy with a polynomial number of samples, as long as the target policy is covered by the offline data. This guarantee is the first of its kind with general function approximation. To measure the coverage of the target policy, we introduce a new single-policy concentrability coefficient, which can be upper bounded by the per-trajectory concentrability coefficient. We also establish lower bounds that highlight the necessity of such concentrability and the difference from standard RL, where state-action-wise rewards are directly observed. We further extend and analyze our algorithm when the feedback is given over action pairs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tVMPfEGT2w",
    "arxiv_id": "2305.14816",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17612,
    "title": "GraphCare: Enhancing Healthcare Predictions with Personalized Knowledge Graphs",
    "authors": [
      "Pengcheng Jiang",
      "Cao Xiao",
      "Adam Richard Cross",
      "Jimeng Sun"
    ],
    "abstract": "Clinical predictive models often rely on patients\u2019 electronic health records (EHR), but integrating medical knowledge to enhance predictions and decision-making is challenging. This is because personalized predictions require personalized knowledgegraphs (KGs), which are difficult to generate from patient EHR data. To address this, we propose GraphCare, an open-world framework that uses external KGs to improve EHR-based predictions. Our method extracts knowledge from large language models (LLMs) and external biomedical KGs to build patient-specific KGs, which are then used to train our proposed Bi-attention AugmenTed(BAT) graph neural network (GNN) for healthcare predictions. On two public datasets, MIMIC-III and MIMIC-IV, GraphCare surpasses baselines in four vital healthcare prediction tasks: mortality, readmission, length of stay (LOS), and drug recommendation. On MIMIC-III, it boosts AUROC by 17.6% and 6.6% for mortality and readmission, and F1-score by 7.9% and 10.8% for LOS and drug recommendation, respectively. Notably, GraphCare demonstrates a substantial edge in scenarios with limited data availability. Our findings highlight the potential of using external KGs in healthcare prediction tasks and demonstrate the promise of GraphCare in generating personalized KGs for promoting personalized medicine.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tVTN7Zs0ml",
    "arxiv_id": "2305.12788",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17611,
    "title": "Learning to Reject for Balanced Error and Beyond",
    "authors": [
      "Harikrishna Narasimhan",
      "Aditya Krishna Menon",
      "Wittawat Jitkrittum",
      "Neha Gupta",
      "Sanjiv Kumar"
    ],
    "abstract": "Learning to reject (L2R) is a classical problem where one seeks a classifier capable of abstaining on low-confidence samples. Most prior work on L2R has focused on minimizing the standard misclassification error. However, in many real-world applications, the label distribution is highly imbalanced,  necessitating alternate evaluation metrics such as the balanced error or the worst-group error that enforce equitable performance across both the head and tail classes. In this paper, we establish that traditional L2R methods can be grossly sub-optimal for such metrics, and show that this is due to an intricate  dependence in the objective between the label costs and the rejector. We then derive the form of the Bayes-optimal classifier and rejector for the balanced error, propose a novel plug-in approach to mimic this solution, and extend our results to general evaluation metrics. Through experiments on benchmark  image classification tasks, we show that our approach yields better trade-offs in both the balanced and worst-group error compared to L2R baselines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ta26LtNq2r",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17609,
    "title": "A Benchmark for Learning to Translate a New Language from One Grammar Book",
    "authors": [
      "Garrett Tanzer",
      "Mirac Suzgun",
      "Eline Visser",
      "Dan Jurafsky",
      "Luke Melas-Kyriazi"
    ],
    "abstract": "Large language models (LLMs) can perform impressive feats with in-context learning or lightweight finetuning. It is natural to wonder how well these models adapt to genuinely new tasks, but how does one find tasks that are unseen in internet-scale training sets? We turn to a field that is explicitly motivated and bottlenecked by a scarcity of web data: low-resource languages. In this paper, we introduce MTOB (Machine Translation from One Book), a benchmark for learning to translate between English and Kalamang\u2014a language with less than 200 speakers and therefore virtually no presence on the web\u2014using several hundred pages of field linguistics reference materials. This task framing is novel in that it asks a model to learn a language from a single human-readable book of grammar explanations, rather than a large mined corpus of in-domain data, more akin to L2 language learning than L1 language acquisition. We demonstrate that baselines using current LLMs are promising but fall short of human performance, achieving 44.7 chrF on Kalamang to English translation and 45.8 chrF on English to Kalamang translation, compared to 51.6 and 57.0 chrF by a human who learned Kalamang from the same reference materials. We hope that MTOB will help measure LLM capabilities along a new dimension, and that the methods developed to solve it could help expand access to language technology for underserved communities by leveraging qualitatively different kinds of data than traditional machine translation.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tbVWug9f2h",
    "arxiv_id": "2309.16575",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17608,
    "title": "$\\mathbb{D}^2$ Pruning: Message Passing for Balancing Diversity & Difficulty in Data Pruning",
    "authors": [
      "Adyasha Maharana",
      "Prateek Yadav",
      "Mohit Bansal"
    ],
    "abstract": "In recent years, data quality has emerged as an important factor for training massive models. Analytical theories suggest that higher-quality data can lead to lower test errors in models trained on a fixed data budget. Moreover, a model can be trained on a lower compute budget without compromising performance if a dataset can be stripped of its redundancies. Coreset selection (or data pruning) seeks to select a subset of the training data so as to maximize the performance of models trained on this subset, also referred to as coreset. There are two dominant approaches: (1) geometry-based data selection for maximizing *data diversity* in the coreset, and (2) functions that assign *difficulty scores* to samples based on training dynamics. Optimizing for data diversity leads to a coreset that is biased towards easier samples, whereas, selection by difficulty ranking omits easy samples that are necessary for the training of deep learning models. This demonstrates that data diversity and importance scores are two complementary factors that need to be jointly considered during coreset selection. In this work, we represent a dataset as an undirected graph and propose a novel pruning algorithm, $\\mathbb{D}^2$ Pruning, that uses message passing over this dataset graph for coreset selection. $\\mathbb{D}^2$ Pruning updates the difficulty scores of each example by incorporating the difficulty of its neighboring examples in the dataset graph. Then, these updated difficulty scores direct a graph-based sampling method to select a coreset that encapsulates both diverse and difficult regions of the dataset space. We evaluate supervised and self-supervised versions of our method on various vision and NLP datasets. Results show that $\\mathbb{D}^2$ Pruning improves coreset selection over previous state-of-the-art methods at low-to-medium pruning rates. Additionally, we find that using $\\mathbb{D}^2$ Pruning for filtering large multimodal datasets leads to increased diversity in the dataset and improved generalization of pretrained models. Our work shows that $\\mathbb{D}^2$ Pruning is a versatile framework for understanding and processing datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=thbtoAkCe9",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17607,
    "title": "Compositional Preference Models for Aligning LMs",
    "authors": [
      "Dongyoung Go",
      "Tomasz Korbak",
      "Germ\u00e1n Kruszewski",
      "Jos Rozen",
      "Marc Dymetman"
    ],
    "abstract": "As language models (LMs) become more capable, it is increasingly important to align them with human preferences. However, the dominant paradigm for training Preference Models (PMs) for that purpose suffers from fundamental limitations, such as lack of transparency and scalability, along with susceptibility to overfitting the preference dataset.We propose Compositional Preference Models (CPMs), a novel PM framework that decomposes one global preference assessment into several interpretable features, obtains scalar scores for these features from a prompted LM, and aggregates these scores using a logistic regression classifier. CPMs allow to control which properties of the preference data are used to train the preference model and to build it based on features that are believed to underlie the human preference judgment.Our experiments show that CPMs not only improve generalization and are more robust to overoptimization than standard PMs, but also that best-of-n samples obtained using CPMs tend to be preferred over samples obtained using conventional PMs.Overall, our approach demonstrates the benefits of endowing PMs with priors about which features determine human preferences while relying on LM capabilities to extract those features in a scalable and robust way.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tiiAzqi6Ol",
    "arxiv_id": "2310.13011",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17606,
    "title": "Social Reward: Evaluating and Enhancing Generative AI through Million-User Feedback from an Online Creative Community",
    "authors": [
      "Arman Isajanyan",
      "Artur Shatveryan",
      "David Kocharian",
      "Zhangyang Wang",
      "Humphrey Shi"
    ],
    "abstract": "Social reward as a form of community recognition provides a strong source ofmotivation for users of online platforms to actively engage and contribute withcontent to accumulate peers approval. In the realm of text-conditioned imagesynthesis, the recent surge in progress has ushered in a collaborative era whereusers and AI systems coalesce to refine visual creations. This co-creative pro-cess in the landscape of online social networks empowers users to craft originalvisual artworks seeking for community validation. Nevertheless, assessing thesemodels in the context of collective community preference introduces distinct chal-lenges. Existing evaluation methods predominantly center on limited size userstudies guided by image quality and alignment with prompts. This work pio-neers a paradigm shift, unveiling Social Reward - an innovative reward modelingframework that leverages implicit feedback from social network users engagedin creative editing of generated images. We embark on an extensive journey ofdataset curation and refinement, drawing from Picsart: an online visual creationand editing platform, yielding a first million-user-scale dataset of implicit humanpreferences for user-generated visual art named Picsart Image-Social. Our anal-ysis exposes the shortcomings of current metrics in modeling community creativepreference of text-to-image models\u2019 outputs, compelling us to introduce a novelpredictive model explicitly tailored to address these limitations. Rigorous quan-titative experiments and user study show that our Social Reward model alignsbetter with social popularity than existing metrics. Furthermore, we utilize So-cial Reward to fine-tune text-to-image models, yielding images that are more fa-vored by not only Social Reward, but also other established metrics. These find-ings highlight the relevance and effectiveness of Social Reward in assessing com-munity appreciation for AI-generated artworks, establishing a closer alignmentwith users\u2019 creative goals: creating popular visual art. Codes can be accessed athttps://github.com/Picsart-AI-Research/Social-Reward",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tjn2YZSHUv",
    "arxiv_id": "2402.09872",
    "GitHub": [
      "https://github.com/Picsart-AI-Research/Social-Reward"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17605,
    "title": "Enhancing One-Shot Federated Learning Through Data and Ensemble Co-Boosting",
    "authors": [
      "Rong Dai",
      "Yonggang Zhang",
      "Ang Li",
      "Tongliang Liu",
      "Xun Yang",
      "Bo Han"
    ],
    "abstract": "One-shot Federated Learning (OFL) has become a promising learning paradigm, enabling the training of a global server model via a single communication round. In OFL, the server model is aggregated by distilling knowledge from all client models (the ensemble), which are also responsible for synthesizing samples for distillation. In this regard, advanced works show that the performance of the server model is intrinsically related to the quality of the synthesized data and the ensemble model. To promote OFL, we introduce a novel framework, Co-Boosting, in which synthesized data and the ensemble model mutually enhance each other progressively. Specifically, Co-Boosting leverages the current ensemble model to synthesize higher-quality samples in an adversarial attack manner. These hard samples are then employed to promote the quality of the ensemble model by adjusting the ensembling weights for each client model. Consequently, Co-Boosting periodically achieves high-quality data and ensemble models. Extensive experiments demonstrate that Co-Boosting can substantially outperform existing baselines under various settings. Moreover, Co-Boosting eliminates the need for adjustments to the client's local training, requires no additional data or model transmission, and allows client models to have heterogeneous architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tm8s3696Ox",
    "arxiv_id": "2402.15070",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17604,
    "title": "Motif: Intrinsic Motivation from Artificial Intelligence Feedback",
    "authors": [
      "Martin Klissarov",
      "Pierluca D'Oro",
      "Shagun Sodhani",
      "Roberta Raileanu",
      "Pierre-Luc Bacon",
      "Pascal Vincent",
      "Amy Zhang",
      "Mikael Henaff"
    ],
    "abstract": "Exploring rich environments and evaluating one's actions without prior knowledge is immensely challenging. In this paper, we propose Motif, a general method to interface such prior knowledge from a Large Language Model (LLM) with an agent. Motif is based on the idea of grounding LLMs for decision-making without requiring them to interact with the environment: it elicits preferences from an LLM over pairs of captions to construct an intrinsic reward, which is then used to train agents with reinforcement learning. We evaluate Motif's performance and behavior on the challenging, open-ended and procedurally-generated NetHack game. Surprisingly, by only learning to maximize its intrinsic reward, Motif achieves a higher game score than an algorithm directly trained to maximize the score itself. When combining Motif's intrinsic reward with the environment reward, our method significantly outperforms existing approaches and makes progress on tasks where no advancements have ever been made without demonstrations. Finally, we show that Motif mostly generates intuitive human-aligned behaviors which can be steered easily through prompt modifications, while scaling well with the LLM size and the amount of information given in the prompt.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tmBKIecDE9",
    "arxiv_id": "2310.00166",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17603,
    "title": "Maximum Entropy Heterogeneous-Agent Reinforcement Learning",
    "authors": [
      "Jiarong Liu",
      "Yifan Zhong",
      "Siyi Hu",
      "Haobo Fu",
      "QIANG FU",
      "Xiaojun Chang",
      "Yaodong Yang"
    ],
    "abstract": "*Multi-agent reinforcement learning* (MARL) has been shown effective for cooperative games in recent years. However, existing state-of-the-art methods face challenges related to sample complexity, training instability, and the risk of converging to a suboptimal Nash Equilibrium. In this paper, we propose a unified framework for learning \\emph{stochastic} policies to resolve these issues. We embed cooperative MARL problems into probabilistic graphical models, from which we derive the maximum entropy (MaxEnt) objective for MARL. Based on the MaxEnt framework, we propose *Heterogeneous-Agent Soft Actor-Critic* (HASAC) algorithm. Theoretically, we prove the monotonic improvement and convergence to *quantal response equilibrium* (QRE) properties of HASAC. Furthermore, we generalize a unified template for MaxEnt algorithmic design named *Maximum Entropy Heterogeneous-Agent Mirror Learning* (MEHAML), which provides any induced method with the same guarantees as HASAC. We evaluate HASAC on six benchmarks: Bi-DexHands, Multi-Agent MuJoCo, StarCraft Multi-Agent Challenge, Google Research Football, Multi-Agent Particle Environment, and Light Aircraft Game. Results show that HASAC consistently outperforms strong baselines, exhibiting better sample efficiency, robustness, and sufficient exploration.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tmqOhBC4a5",
    "arxiv_id": "2306.10715",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17602,
    "title": "Dissecting learning and forgetting in language model finetuning",
    "authors": [
      "Xiao Zhang",
      "Ji Wu"
    ],
    "abstract": "Finetuning language models on domain-specific corpus is a common approach to enhance their domain knowledge and capability. While improving performance on domain tasks, it often brings a side-effect of forgetting of the model's general abilities. In this study, we analyze the effects of finetuning on language models by dissecting its impacts on the modeling of topic, style, and factual knowledge in text. Our method uses instruction-following LLMs such as ChatGPT to auto-generate controlled-variable text examples which we use to probe the model. Our findings reveal that finetuning results in significant shifts in the language model's topic and style priors, while actual knowledge learning only contributes to a small fraction of the total probability change. Analysis shows that the adaptation of topic and style priors behave akin to learning simple features: they are learned rapidly and require little model capacity. They are also learned independently and primarily at the beginning of a text sequence. In contrast, factual knowledge is learned stably but slowly and requires significant model capacity to learn. The research offers insights and understanding into the finer dynamics of learning and forgetting in language models, and can potentially inform future research on improving domain adaptation and addressing the challenges of forgetting in continual learning of language models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tmsqb6WpLz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17601,
    "title": "Does CLIP\u2019s generalization performance mainly stem from high train-test similarity?",
    "authors": [
      "Prasanna Mayilvahanan",
      "Thadd\u00e4us Wiedemer",
      "Evgenia Rusak",
      "Matthias Bethge",
      "Wieland Brendel"
    ],
    "abstract": "Foundation models like CLIP are trained on hundreds of millions of samples and effortlessly generalize to new tasks and inputs. Out of the box, CLIP shows stellar zero-shot and few-shot capabilities on a wide range of out-of-distribution (OOD) benchmarks, which prior works attribute mainly to today's large and comprehensive training dataset (like LAION). However, it is questionable how meaningful terms like out-of-distribution generalization are for CLIP as it seems likely that web-scale datasets like LAION simply contain many samples that are similar to common OOD benchmarks originally designed for ImageNet. To test this hypothesis, we retrain CLIP on pruned LAION splits that replicate ImageNet\u2019s train-test similarity with respect to common OOD benchmarks. While we observe a performance drop on some benchmarks, surprisingly, CLIP\u2019s overall performance remains high. This shows that high train-test similarity is insufficient to explain CLIP\u2019s OOD performance, and other properties of the training data must drive CLIP to learn more generalizable representations. Additionally, by pruning data points that are dissimilar to the OOD benchmarks, we uncover a 100M split of LAION (\u00bc of its original size) on which CLIP can be trained to match its original OOD performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tnBaiidobu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17600,
    "title": "Diffusion Posterior Sampling for Linear Inverse Problem Solving: A Filtering Perspective",
    "authors": [
      "Zehao Dou",
      "Yang Song"
    ],
    "abstract": "Diffusion models have achieved tremendous success in generating high-dimensional data like images, videos and audio. These models provide powerful data priors that can solve linear inverse problems in zero shot through Bayesian posterior sampling.However, exact posterior sampling for diffusion models is intractable. Current solutions often hinge on approximations that are either computationally expensive or lack strong theoretical guarantees. In this work, we introduce an efficient diffusion sampling algorithm for linear inverse problems that is guaranteed to be asymptotically accurate. We reveal a link between Bayesian posterior sampling and Bayesian filtering in diffusion models, proving the former as a specific instance of the latter. Our method, termed filtering posterior sampling, leverages sequential Monte Carlo methods to solve the corresponding filtering problem. It seamlessly integrates with all Markovian diffusion samplers, requires no model re-training, and guarantees accurate samples from the Bayesian posterior as particle counts rise. Empirical tests demonstrate that our method generates better or comparable results than leading zero-shot diffusion posterior samplers on tasks like image inpainting, super-resolution, and deblurring.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tplXNcHZs1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17598,
    "title": "Evaluating Large Language Models at Evaluating Instruction Following",
    "authors": [
      "Zhiyuan Zeng",
      "Jiatong Yu",
      "Tianyu Gao",
      "Yu Meng",
      "Tanya Goyal",
      "Danqi Chen"
    ],
    "abstract": "As research in large language models (LLMs) continues to accelerate, LLM-based evaluation has emerged as a scalable and cost-effective alternative to human evaluations for comparing the ever-increasing list of models. This paper investigates the efficacy of these \u201cLLM evaluators\u201d, particularly in using them to assess instruction following, a metric that gauges how closely generated text adheres to theinstructions. We introduce a challenging meta-evaluation benchmark, LLMBAR, designed to test the ability of an LLM evaluator to discern instruction-following outputs. The authors curated 419 pairs of outputs, one adhering to instructions while the other diverging, yet may possess deceptive qualities that could mislead an LLM evaluator. Contrary to existing meta-evaluation, we discover that different evaluators (i.e., combinations of LLMs and prompts) exhibit distinct performance on LLMBAR and even the highest-scoring LLM evaluators have substantial room for improvement. We also present a novel suite of prompting strategies that further close the gap between LLM and human evaluators. With LLMBAR, we hope to offer more insight into the behavior of LLM evaluators and foster research in developing better instruction-following models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tr0KidwPLc",
    "arxiv_id": "2310.07641",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17597,
    "title": "SafeDreamer: Safe Reinforcement Learning with World Models",
    "authors": [
      "Weidong Huang",
      "Jiaming Ji",
      "Borong Zhang",
      "Chunhe Xia",
      "Yaodong Yang"
    ],
    "abstract": "The deployment of Reinforcement Learning (RL) in real-world applications is constrained by its failure to satisfy safety criteria.Existing Safe Reinforcement Learning (SafeRL) methods, which rely on cost functions to enforce safety, often fail to achieve zero-cost performance in complex scenarios, especially vision-only tasks. These limitations are primarily due to model inaccuracies and inadequate sample efficiency. The integration of world models has proven effective in mitigating these shortcomings. In this work, we introduce SafeDreamer, a novel algorithm incorporating Lagrangian-based methods into world model planning processes within the superior Dreamer framework. Our method achieves nearly zero-cost performance on various tasks, spanning low-dimensional and vision-only input, within the Safety-Gymnasium benchmark, showcasing its efficacy in balancing performance and safety in RL tasks. Further details and resources are available on the project website: https://sites.google.com/view/safedreamer.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tsE5HLYtYg",
    "arxiv_id": "2307.07176",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17596,
    "title": "Connect, Collapse, Corrupt: Learning Cross-Modal Tasks with Uni-Modal Data",
    "authors": [
      "Yuhui Zhang",
      "Elaine Sui",
      "Serena Yeung"
    ],
    "abstract": "Building cross-modal applications is challenging due to limited paired multi-modal data. Recent works have shown that leveraging a pre-trained multi-modal contrastive representation space enables cross-modal tasks to be learned from uni-modal data. This is based on the assumption that contrastive optimization makes embeddings from different modalities interchangeable. However, this assumption is under-explored due to the poorly understood geometry of the multi-modal contrastive space, where a modality gap exists. In our study, we provide a theoretical explanation of this space's geometry and introduce a three-step method, $C^3$ (Connect, Collapse, Corrupt), to bridge the modality gap, enhancing the interchangeability of embeddings. Our $C^3$ method significantly improves cross-modal learning from uni-modal data, achieving state-of-the-art results on zero-shot image / audio / video captioning and text-to-image generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ttXg3SKAg5",
    "arxiv_id": "2401.08567",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17595,
    "title": "Zero Bubble (Almost) Pipeline Parallelism",
    "authors": [
      "Penghui Qi",
      "Xinyi Wan",
      "Guangxing Huang",
      "Min Lin"
    ],
    "abstract": "Pipeline parallelism is one of the key components for large-scale distributed training, yet its efficiency suffers from pipeline bubbles which were deemed inevitable. In this work, we introduce a scheduling strategy that, to our knowledge, is the first to successfully achieve zero pipeline bubbles under synchronous training semantics. The key idea behind this improvement is to split the backward computation into two parts, one that computes gradient for the input and another that computes for the parameters. Based on this idea, we handcraft novel pipeline schedules that significantly outperform the baseline methods. We further develop an algorithm that automatically finds an optimal schedule based on specific model configuration and memory limit. Additionally, to truly achieve zero bubble, we introduce a novel technique to bypass synchronizations during the optimizer step. Experimental evaluations show that our method outperforms the 1F1B schedule up to 15\\% in throughput under a similar memory limit. This number can be further pushed to 30\\% when the memory constraint is relaxed. We believe our results mark a major step forward in harnessing the true potential of pipeline parallelism. The source code based on Megatron-LM is publicly avaiable at \\url{https://github.com/sail-sg/zero-bubble-pipeline-parallelism}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tuzTN0eIO5",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17594,
    "title": "SWAP-NAS: Sample-Wise Activation Patterns for Ultra-fast NAS",
    "authors": [
      "Yameng Peng",
      "Andy Song",
      "Haytham M. Fayek",
      "Vic Ciesielski",
      "Xiaojun Chang"
    ],
    "abstract": "Training-free metrics (a.k.a. zero-cost proxies) are widely used to avoid resource-intensive neural network training, especially in Neural Architecture Search (NAS). Recent studies show that existing training-free metrics have several limitations, such as limited correlation and poor generalisation across different search spaces and tasks. Hence, we propose a novel high-performance training-free metric, SWAP-Score, based on Sample-Wise Activation Patterns.  It measures the expressivity of networks over a batch of input samples. The SWAP-Score is strongly correlated with ground-truth performance across various search spaces and tasks, outperforming 15 existing training-free metrics on NAS-Bench-101/201/301 and TransNAS-Bench-101. The SWAP-Score can be further enhanced by regularisation, which leads to even higher correlations in cell-based search space and enables model size control during the search. For example, Spearman's rank correlation coefficient between regularised SWAP-Score and CIFAR-100 validation accuracies on NAS-Bench-201 networks is 0.90, significantly higher than 0.80 from the second-best metric, NWOT. When integrated with an evolutionary algorithm for NAS, our SWAP-NAS achieves competitive performance on CIFAR-10 and ImageNet in approximately 6 minutes and 9 minutes of GPU time respectively.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=tveiUXU2aa",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17593,
    "title": "Towards Understanding Sycophancy in Language Models",
    "authors": [
      "Mrinank Sharma",
      "Meg Tong",
      "Tomasz Korbak",
      "David Duvenaud",
      "Amanda Askell",
      "Samuel R. Bowman",
      "Esin DURMUS",
      "Zac Hatfield-Dodds",
      "Scott R Johnston",
      "Shauna M Kravec",
      "Timothy Maxwell",
      "Sam McCandlish",
      "Kamal Ndousse",
      "Oliver Rausch",
      "Nicholas Schiefer",
      "Da Yan",
      "Miranda Zhang",
      "Ethan Perez"
    ],
    "abstract": "Reinforcement learning from human feedback (RLHF) is a popular technique for training high-quality AI assistants. However, RLHF may also encourage model responses that match user beliefs over truthful responses, a behavior known as sycophancy. We investigate the prevalence of sycophancy in RLHF-trained models and whether human preference judgments are responsible. We first demonstrate that five state-of-the-art AI assistants consistently exhibit sycophancy behavior across four varied free-form text-generation tasks. To understand if human preferences drive this broadly observed behavior of RLHF models, we analyze existing human preference data. We find that when a response matches a user's views, it is more likely to be preferred. Moreover, both humans and preference models (PMs) prefer convincingly-written sycophantic responses over correct ones a non-negligible fraction of the time. Optimizing model outputs against PMs also sometimes sacrifices truthfulness in favor of sycophancy. Overall, our results indicate that sycophancy is a general behavior of RLHF models, likely driven in part by human preference judgments favoring sycophantic responses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=tvhaxkMKAn",
    "arxiv_id": "2310.13548",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17592,
    "title": "Learning invariant representations of time-homogeneous stochastic dynamical systems",
    "authors": [
      "Vladimir R Kostic",
      "Pietro Novelli",
      "Riccardo Grazzi",
      "Karim Lounici",
      "massimiliano pontil"
    ],
    "abstract": "We consider the general class of time-homogeneous stochastic dynamical systems,both discrete and continuous, and study the problem of learning a representationof the state that faithfully captures its dynamics. This is instrumental to learn thetransfer operator of the system, that in turn can be used for numerous tasks, suchas forecasting and interpreting the system dynamics. We show that the searchfor a good representation can be cast as an optimization problem over neuralnetworks. Our approach is supported by recent results in statistical learning theory,highlighting the role of approximation error and metric distortion in the context oftransfer operator regression. The objective function we propose is associated withprojection operators from the representation space to the data space, overcomesmetric distortion, and can be empirically estimated from data. In the discrete timesetting, we further derive a relaxed objective function that is differentiable andnumerically well-conditioned. We compare our method against state-of-the-artapproaches on different datasets, showing better performance across the board",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=twSnZwiOIm",
    "arxiv_id": "2307.09912",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17591,
    "title": "The Joint Effect of Task Similarity and Overparameterization on Catastrophic Forgetting \u2014 An Analytical Model",
    "authors": [
      "Daniel Goldfarb",
      "Itay Evron",
      "Nir Weinberger",
      "Daniel Soudry",
      "PAul HAnd"
    ],
    "abstract": "In continual learning, catastrophic forgetting is affected by multiple aspects of the tasks. Previous works have analyzed separately how forgetting is affected by either task similarity or overparameterization. In contrast, our paper examines how task similarity and overparameterization jointly affect forgetting in an analyzable model. Specifically, we focus on two-task continual linear regression, where the second task is a random orthogonal transformation of an arbitrary first task (an abstraction of random permutation tasks). We derive an exact analytical expression for the expected forgetting \u2014 and uncover a nuanced pattern. In highly overparameterized models, intermediate task similarity causes the most forgetting. However, near the interpolation threshold, forgetting decreases monotonically with the expected task similarity. We validate our findings with linear regression on synthetic data, and with neural networks on established permutation task benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=u3dHl287oB",
    "arxiv_id": "2401.12617",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17590,
    "title": "Scaling physics-informed hard constraints with mixture-of-experts",
    "authors": [
      "Nithin Chalapathi",
      "Yiheng Du",
      "Aditi S. Krishnapriyan"
    ],
    "abstract": "Imposing known physical constraints, such as conservation laws, during neural network training introduces an inductive bias that can improve accuracy, reliability, convergence, and data efficiency for modeling physical dynamics. While such constraints can be softly imposed via loss function penalties, recent advancements in differentiable physics and optimization improve performance by incorporating PDE-constrained optimization as individual layers in neural networks. This enables a stricter adherence to physical constraints. However, imposing hard constraints significantly increases computational and memory costs, especially for complex dynamical systems. This is because it requires solving an optimization problem over a large number of points in a mesh, representing spatial and temporal discretizations, which greatly increases the complexity of the constraint. To address this challenge, we develop a scalable approach to enforce hard physical constraints using Mixture-of-Experts (MoE), which can be used with any neural network architecture. Our approach imposes the constraint over smaller decomposed domains, each of which is solved by an ``expert'' through differentiable optimization. During training, each expert independently performs a localized backpropagation step by leveraging the implicit function theorem; the independence of each expert allows for parallelization across multiple GPUs. Compared to standard differentiable optimization, our scalable approach achieves greater accuracy in the neural PDE solver setting for predicting the dynamics of challenging non-linear systems. We also improve training stability and require significantly less computation time during both training and inference stages.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=u3dX2CEIZb",
    "arxiv_id": "2402.13412",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17589,
    "title": "ScaleCrafter: Tuning-free Higher-Resolution Visual Generation with Diffusion Models",
    "authors": [
      "Yingqing He",
      "Shaoshu Yang",
      "Haoxin Chen",
      "Xiaodong Cun",
      "Menghan Xia",
      "Yong Zhang",
      "Xintao Wang",
      "Ran He",
      "Qifeng Chen",
      "Ying Shan"
    ],
    "abstract": "In this work, we investigate the capability of generating images from pre-trained diffusion models at much higher resolutions than the training image sizes. In addition, the generated images should have arbitrary image aspect ratios. When generating images directly at a higher resolution, 1024 x 1024, with the pre-trained Stable Diffusion using training images of resolution 512 x 512, we observe persistent problems of object repetition and unreasonable object structures. Existing works for higher-resolution generation, such as attention-based and joint-diffusion approaches, cannot well address these issues. As a new perspective, we examine the structural components of the U-Net in diffusion models and identify the crucial cause as the limited perception field of convolutional kernels. Based on this key observation, we propose a simple yet effective re-dilation that can dynamically adjust the convolutional perception field during inference. We further propose the dispersed convolution and noise-damped classifier-free guidance, which can enable ultra-high-resolution image generation  (e.g., 4096 x 4096). Notably, our approach does not require any training or optimization. Extensive experiments demonstrate that our approach can address the repetition issue well and achieve state-of-the-art performance on higher-resolution image synthesis, especially in texture details. Our work also suggests that a pre-trained diffusion model trained on low-resolution images can be directly used for high-resolution visual generation without further tuning, which may provide insights for future research on ultra-high-resolution image and video synthesis. More results are available at the anonymous website: https://scalecrafter.github.io/ScaleCrafter/",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=u48tHG5f66",
    "arxiv_id": "2310.07702",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17588,
    "title": "Large Language Models as Generalizable Policies for Embodied Tasks",
    "authors": [
      "Andrew Szot",
      "Max Schwarzer",
      "Harsh Agrawal",
      "Bogdan Mazoure",
      "Rin Metcalf",
      "Walter Talbott",
      "Natalie Mackraz",
      "R Devon Hjelm",
      "Alexander T Toshev"
    ],
    "abstract": "We show that large language models (LLMs) can be adapted to be generalizable policies for embodied visual tasks. Our approach, called Large LAnguage model Reinforcement Learning Policy (LLaRP), adapts a pre-trained frozen LLM to take as input text instructions and visual egocentric observations and output actions directly in the environment. Using reinforcement learning, we train LLaRP to see and act solely through environmental interactions. We show that LLaRP is robust to complex paraphrasings of task instructions and can generalize to new tasks that require novel optimal behavior. In particular, on 1,000 unseen tasks it achieves 42% success rate, 1.7x the success rate of other common learned baselines or zero-shot applications of LLMs. Finally, to aid the community in studying language conditioned, massively multi-task, embodied AI problems we release a novel benchmark, Language Rearrangement, consisting of 150,000 training and 1,000 testing tasks for language-conditioned rearrangement.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=u6imHU4Ebu",
    "arxiv_id": "2310.17722",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17587,
    "title": "Adversarial Training on Purification (AToP): Advancing Both Robustness and Generalization",
    "authors": [
      "Guang Lin",
      "Chao Li",
      "Jianhai Zhang",
      "Toshihisa Tanaka",
      "Qibin Zhao"
    ],
    "abstract": "The deep neural networks are known to be vulnerable to well-designed adversarial attacks. The most successful defense technique based on adversarial training (AT) can achieve optimal robustness against particular attacks but cannot generalize well to unseen attacks. Another effective defense technique based on adversarial purification (AP) can enhance generalization but cannot achieve optimal robustness. Meanwhile, both methods share one common limitation on the degraded standard accuracy. To mitigate these issues, we propose a novel framework called Adversarial Training on Purification (AToP), which  comprises two components:  perturbation destruction by random transforms (RT) and purifier model fine-tuned (FT) by adversarial loss. RT is essential to avoid overlearning to known attacks resulting in the robustness generalization to unseen attacks and FT is essential for the improvement of robustness. To evaluate our method in an efficient and scalable way, we conduct extensive experiments on CIFAR-10, CIFAR-100, and ImageNette to demonstrate that our method achieves state-of-the-art results and exhibits generalization ability against unseen attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=u7559ZMvwY",
    "arxiv_id": "2401.16352",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17585,
    "title": "Entity-Centric Reinforcement Learning for Object Manipulation from Pixels",
    "authors": [
      "Dan Haramati",
      "Tal Daniel",
      "Aviv Tamar"
    ],
    "abstract": "Manipulating objects is a hallmark of human intelligence, and an important task in domains such as robotics. In principle, Reinforcement Learning (RL) offers a general approach to learn object manipulation. In practice, however, domains with more than a few objects are difficult for RL agents due to the curse of dimensionality, especially when learning from raw image observations. In this work we propose a structured approach for visual RL that is suitable for representing multiple objects and their interaction, and use it to learn goal-conditioned manipulation of several objects. Key to our method is the ability to handle goals with dependencies between the objects (e.g., moving objects in a certain order). We further relate our architecture to the generalization capability of the trained agent, and demonstrate agents that learn with 3 objects but generalize to similar tasks with over 10 objects. Rollout videos are available on our website: https://sites.google.com/view/entity-centric-rl",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=uDxeSZ1wdI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17586,
    "title": "Augmenting Transformers with Recursively Composed Multi-grained Representations",
    "authors": [
      "Xiang Hu",
      "Qingyang Zhu",
      "Kewei Tu",
      "Wei Wu"
    ],
    "abstract": "We present ReCAT, a recursive composition augmented Transformer that is able to explicitly model hierarchical syntactic structures of raw texts without relying on gold trees during both learning and inference. Existing research along this line restricts data to follow a hierarchical tree structure and thus lacks inter-span communications.To overcome the problem, we propose a novel contextual inside-outside (CIO) layer that learns contextualized representations of spans through bottom-up and top-down passes, where a bottom-up pass forms representations of high-level spans by composing low-level spans, while a top-down pass combines information inside and outside a span. By stacking several CIO layers between the embedding layer and the attention layers in Transformer, the ReCAT model can perform both deep intra-span and deep inter-span interactions, and thus generate multi-grained representations fully contextualized with other spans.Moreover, the CIO layers can be jointly pre-trained with Transformers, making ReCAT enjoy scaling ability, strong performance, and interpretability at the same time. We conduct experiments on various sentence-level and span-level tasks. Evaluation results indicate that ReCAT can significantly outperform vanilla Transformer models on all span-level tasks and recursive models on natural language inference tasks. More interestingly, the hierarchical structures induced by ReCAT exhibit strong consistency with human-annotated syntactic trees, indicating good interpretability brought by the CIO layers.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=u859gX7ADC",
    "arxiv_id": "2309.16319",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17584,
    "title": "Enhanced Face Recognition using Intra-class Incoherence Constraint",
    "authors": [
      "Yuanqing Huang",
      "Yinggui Wang",
      "Le Yang",
      "Lei Wang"
    ],
    "abstract": "The current face recognition (FR) algorithms has achieved a high level of accuracy, making further improvements increasingly challenging. While existing FR algorithms primarily focus on optimizing margins and loss functions, limited attention has been given to exploring the feature representation space. Therefore, this paper endeavors to improve FR performance in the view of feature representation space. Firstly, we consider two FR models that exhibit distinct performance discrepancies, where one model exhibits superior recognition accuracy compared to the other. We implement orthogonal decomposition on the features from the superior model along those from the inferior model and obtain two sub-features. Surprisingly, we find the sub-feature perpendicular to the inferior still possesses a certain level of face distinguishability. We adjust the modulus of the sub-features and recombine them through vector addition. Experiments demonstrate this recombination is likely to contribute to an improved facial feature representation, even better than features from the original superior model. Motivated by this discovery, we further consider how to improve FR accuracy when there is only one FR model available. Inspired by knowledge distillation, we incorporate the intra-class incoherence constraint (IIC) to solve the problem. Experiments on various FR benchmarks show the existing state-of-the-art method with IIC can be further improved, highlighting its potential to further enhance FR performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=uELjxVbrqG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17583,
    "title": "Differentially Private SGD Without Clipping Bias: An Error-Feedback Approach",
    "authors": [
      "Xinwei Zhang",
      "Zhiqi Bu",
      "Steven Wu",
      "Mingyi Hong"
    ],
    "abstract": "Differentially Private Stochastic Gradient Descent with gradient clipping (DPSGD-GC) is a powerful tool for training deep learning models using sensitive data, providing both a solid theoretical privacy guarantee and high efficiency. However, existing research has shown that DPSGD-GC only converges when using large clipping thresholds that are dependent on problem-specific parameters that are often unknown in practice. Therefore, DPSGD-GC suffers from degraded performance due to the {\\it constant}  bias introduced by the clipping. In our work, we propose a new error-feedback (EF) DP algorithm as an alternative to DPSGD-GC, which offers a diminishing utility bound without inducing a constant clipping bias. More importantly, it allows for an arbitrary choice of clipping threshold that is independent of the problem. We establish an algorithm-specific DP analysis for our proposed algorithm, providing privacy guarantees based on R{\\'e}nyi DP. And we demonstrate that under mild conditions, our algorithm can achieve nearly the same utility bound as DPSGD without gradient clipping. Our empirical results on standard datasets show that the proposed algorithm achieves higher accuracies than DPSGD while maintaining the same level of DP guarantee.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uFbWHyTlPn",
    "arxiv_id": "2311.14632",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17582,
    "title": "Towards Faithful Explanations: Boosting Rationalization with Shortcuts Discovery",
    "authors": [
      "Linan Yue",
      "Qi Liu",
      "Yichao Du",
      "Li Wang",
      "Weibo Gao",
      "Yanqing An"
    ],
    "abstract": "The remarkable success in neural networks provokes the selective rationalization. It explains the prediction results by identifying a small subset of the inputs sufficient to support them. Since existing methods still suffer from adopting the shortcuts in data to compose rationales and limited large-scale annotated rationales by human, in this paper, we propose a Shortcuts-fused Selective Rationalization (SSR) method, which boosts the rationalization by discovering and exploiting potential shortcuts. Specifically, SSR first designs a shortcuts discovery approach to detect several potential shortcuts. Then, by introducing the identified shortcuts, we propose two strategies to mitigate the problem of utilizing shortcuts to compose rationales. Finally, we develop two data augmentations methods to close the gap in the number of annotated rationales. Extensive experimental results on four real-world datasets clearly validate the effectiveness of our proposed method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uGtfk2OphU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17581,
    "title": "Expected flow networks in stochastic environments and two-player zero-sum games",
    "authors": [
      "Marco Jiralerspong",
      "Bilun Sun",
      "Danilo Vucetic",
      "Tianyu Zhang",
      "Yoshua Bengio",
      "Gauthier Gidel",
      "Nikolay Malkin"
    ],
    "abstract": "Generative flow networks (GFlowNets) are sequential sampling models trained to match a given distribution. GFlowNets have been successfully applied to various structured object generation tasks, sampling a diverse set of high-reward objects quickly. We propose expected flow networks (EFlowNets), which extend GFlowNets to stochastic environments. We show that EFlowNets outperform other GFlowNet formulations in stochastic tasks such as protein design. We then extend the concept of EFlowNets to adversarial environments, proposing adversarial flow networks (AFlowNets) for two-player zero-sum games. We show that AFlowNets learn to find above 80% of optimal moves in Connect-4 via self-play and outperform AlphaZero in tournaments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uH0FGECSEI",
    "arxiv_id": "2310.02779",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17580,
    "title": "In-context Exploration-Exploitation for Reinforcement Learning",
    "authors": [
      "Zhenwen Dai",
      "Federico Tomasi",
      "Sina Ghiassian"
    ],
    "abstract": "In-context learning is a promising approach for online policy learning of offline reinforcement learning (RL) methods, which can be achieved at inference time without gradient optimization. However, this method is hindered by significant computational costs resulting from the gathering of large training trajectory sets and the need to train large Transformer models. We address this challenge by introducing an In-context Exploration-Exploitation (ICEE) algorithm, designed to optimize the efficiency of in-context policy learning. Unlike existing models, ICEE performs an exploration-exploitation trade-off at inference time within a Transformer model, without the need for explicit Bayesian inference. Consequently, ICEE can solve Bayesian optimization problems as efficiently as Gaussian process biased methods do, but in significantly less time. Through experiments in grid world environments, we demonstrate that ICEE can learn to solve new RL tasks using only tens of episodes, marking a substantial improvement over the hundreds of episodes needed by the previous in-context learning method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uIKZSStON3",
    "arxiv_id": "2403.06826",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17579,
    "title": "GTA: A Geometry-Aware Attention Mechanism for Multi-View Transformers",
    "authors": [
      "Takeru Miyato",
      "Bernhard Jaeger",
      "Max Welling",
      "Andreas Geiger"
    ],
    "abstract": "As transformers are equivariant to the permutation of input tokens, encoding the positional information of tokens is necessary for many tasks. However, since existing positional encoding schemes have been initially designed for NLP tasks, their suitability for vision tasks, which typically exhibit different structural properties in their data, is questionable. We argue that existing positional encoding schemes are suboptimal for 3D vision tasks, as they do not respect their underlying 3D geometric structure. Based on this hypothesis, we propose a geometry-aware attention mechanism that encodes the geometric structure of tokens as relative transformation determined by the geometric relationship between queries and key-value pairs. By evaluating on multiple novel view synthesis (NVS) datasets in the sparse wide-baseline multi-view setting, we show that our attention, called Geometric Transform Attention (GTA), improves learning efficiency and performance of state-of-the-art transformer-based NVS models without any additional learned parameters and only minor computational overhead.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uJVHygNeSZ",
    "arxiv_id": "2310.10375",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17578,
    "title": "BEND: Benchmarking DNA Language Models on Biologically Meaningful Tasks",
    "authors": [
      "Frederikke Isa Marin",
      "Felix Teufel",
      "Marc Horlacher",
      "Dennis Madsen",
      "Dennis Pultz",
      "Ole Winther",
      "Wouter Boomsma"
    ],
    "abstract": "The genome sequence contains the blueprint for governing cellular processes.   While the availability of genomes has vastly increased over the last decades, experimental annotation of the various functional, non-coding and regulatory elements encoded in the DNA sequence remains both expensive and challenging. This has sparked interest in unsupervised language modeling of genomic DNA, a paradigm that has seen great success for protein sequence data.   Although various DNA language models have been proposed, evaluation tasks often differ between individual works, and might not fully recapitulate the fundamental challenges of genome annotation, including the length, scale and sparsity of the data. In this study, we introduce **BEND**, a **BEN**chmark for **D**NA language models, featuring  a collection of realistic and biologically meaningful downstream tasks defined on the human genome.  We find that embeddings from current DNA LMs can approach performance of expert methods on some tasks, but only capture limited information about long-range features.  BEND is available at https://anonymous.4open.science/r/BEND-8C42/README.md",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uKB4cFNQFg",
    "arxiv_id": "2311.12570",
    "GitHub": [
      "https://github.com/frederikkemarin/BEND"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17577,
    "title": "Self-supervised Pocket Pretraining via Protein Fragment-Surroundings Alignment",
    "authors": [
      "Bowen Gao",
      "Yinjun Jia",
      "YuanLe Mo",
      "Yuyan Ni",
      "Wei-Ying Ma",
      "Zhi-Ming Ma",
      "Yanyan Lan"
    ],
    "abstract": "Pocket representations play a vital role in various biomedical applications, such as druggability estimation, ligand affinity prediction, and de novo drug design. While existing geometric features and pretrained representations have demonstrated promising results, they usually treat pockets independent of ligands, neglecting the fundamental interactions between them. However, the limited pocket-ligand complex structures available in the PDB database (less than 100 thousand non-redundant pairs) hampers large-scale pretraining endeavors for interaction modeling. To address this constraint, we propose a novel pocket pretraining approach that leverages knowledge from high-resolution atomic protein structures, assisted by highly effective pretrained small molecule representations. By segmenting protein structures into drug-like fragments and their corresponding pockets, we obtain a reasonable simulation of ligand-receptor interactions, resulting in the generation of over 5 million complexes. Subsequently, the pocket encoder is trained in a contrastive manner to align with the representation of pseudo-ligand furnished by some pretrained small molecule encoders. Our method, named ProFSA, achieves state-of-the-art performance across various tasks, including pocket druggability prediction, pocket matching, and ligand binding affinity prediction. Notably, ProFSA surpasses other pretraining methods by a substantial margin. Moreover, our work opens up a new avenue for mitigating the scarcity of protein-ligand complex data through the utilization of high-quality and diverse protein structure databases.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uMAujpVi9m",
    "arxiv_id": "2310.07229",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17576,
    "title": "Learning with Mixture of Prototypes for Out-of-Distribution Detection",
    "authors": [
      "Haodong Lu",
      "Dong Gong",
      "Shuo Wang",
      "Jason Xue",
      "Lina Yao",
      "Kristen Moore"
    ],
    "abstract": "Out-of-distribution (OOD) detection aims to detect testing samples far away from the in-distribution (ID) training data, which is crucial for the safe deployment of machine learning models in the real world. Distance-based OOD detection methods have emerged with enhanced deep representation learning. They identify unseen OOD samples by measuring their distances from ID class centroids or prototypes. However, existing approaches learn the representation relying on oversimplified data assumptions, e.g. modeling ID data of each class with one centroid class prototype or using loss functions not designed for OOD detection, which overlook the natural diversities within the data. Naively enforcing data samples of each class to be compact around only one prototype leads to inadequate modeling of realistic data and limited performance. To tackle these issues, we propose PrototypicAl Learning with a Mixture of prototypes (PALM) that models each class with multiple prototypes to capture the sample diversities, which learns more faithful and compact samples embeddings for enhanching OOD detection. Our method automatically identifies and dynamically updates prototypes, assigning each sample to a subset of prototypes via reciprocal neighbor soft assignment weights. To learn embeddings with multiple prototypes, PALM optimizes a maximum likelihood estimation (MLE) loss to encourage the sample embeddings to compact around the associated prototypes, as well as a contrastive loss on all prototypes to enhance intra-class compactness and inter-class discrimination at the prototype level. Compared to previous methods with prototypes, the proposed mixture prototype modeling of PALM promotes the representations of each ID class to be more compact and separable from others and the unseen OOD samples, resulting in more reliable OOD detection. Moreover, the automatic estimation of prototypes enables our approach to be extended to the challenging OOD detection task with unlabelled ID data. Extensive experiments demonstrate the superiority of PALM over previous methods, achieving state-of-the-art average AUROC performance of 93.82 on the challenging CIFAR-100 benchmark.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uNkKaD3MCs",
    "arxiv_id": "2402.02653",
    "GitHub": [
      "https://github.com/jeff024/PALM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17574,
    "title": "Unpaired Image-to-Image Translation via Neural Schr\u00f6dinger Bridge",
    "authors": [
      "Beomsu Kim",
      "Gihyun Kwon",
      "Kwanyoung Kim",
      "Jong Chul Ye"
    ],
    "abstract": "Diffusion models are a powerful class of generative models which simulate stochastic differential equations (SDEs) to generate data from noise. Although diffusion models have achieved remarkable progress in recent years, they have limitations in the unpaired image-to-image translation tasks due to the Gaussian prior assumption. Schr\u00f6dinger Bridge (SB), which learns an SDE to translate between two arbitrary distributions, have risen as an attractive solution to this problem. However, none of SB models so far have been successful at unpaired translation between high-resolution images. In this work, we propose the Unpaired Neural Schr\u00f6dinger Bridge (UNSB), which expresses SB problem as a sequence of adversarial learning problems. This allows us to incorporate advanced discriminators and regularization to learn a SB between unpaired data. We demonstrate that UNSB is scalable and successfully solves various unpaired image-to-image translation tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uQBW7ELXfO",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17573,
    "title": "In-context Autoencoder for Context Compression in a Large Language Model",
    "authors": [
      "Tao Ge",
      "Hu Jing",
      "Lei Wang",
      "Xun Wang",
      "Si-Qing Chen",
      "Furu Wei"
    ],
    "abstract": "We propose the In-context Autoencoder (ICAE), leveraging the power of a large language models (LLM) to compress a long context into short compact memory slots that can be directly conditioned on by the LLM for various purposes. ICAE is first pretrained using both autoencoding and language modeling objectives on massive text data, enabling it to generate memory slots that accurately and comprehensively represent the original context; Then, it is fine-tuned on instruction data for producing desirable responses to various prompts. Experiments demonstrate that our lightweight ICAE, introducing fewer than 1% additional parameters, effectively achieves $4\\times$ context compression based on Llama, offering advantages in both improved latency and GPU memory cost during inference, and showing an interesting insight in memorization as well as potential for scalability. These promising results imply a novel perspective on the connection between working memory in cognitive science and representation learning in LLMs, revealing ICAE's significant implications in addressing the long context problem and suggesting further research in LLM context management. Our data, code and model will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uREj4ZuGJE",
    "arxiv_id": "2307.06945",
    "GitHub": [
      "https://github.com/getao/icae"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17572,
    "title": "Unbiased Watermark for Large Language Models",
    "authors": [
      "Zhengmian Hu",
      "Lichang Chen",
      "Xidong Wu",
      "Yihan Wu",
      "Hongyang Zhang",
      "Heng Huang"
    ],
    "abstract": "The recent advancements in large language models (LLMs) have sparked a growing apprehension regarding the potential misuse. One approach to mitigating this risk is to incorporate watermarking techniques into LLMs, allowing for the tracking and attribution of model outputs. This study examines a crucial aspect of watermarking: how significantly watermarks impact the quality of model-generated outputs. Previous studies have suggested a trade-off between watermark strength and output quality. However, our research demonstrates that it is possible to integrate watermarks without affecting the output probability distribution with appropriate implementation. We refer to this type of watermark as an unbiased watermark. This has significant implications for the use of LLMs, as it becomes impossible for users to discern whether a service provider has incorporated watermarks or not. Furthermore, the presence of watermarks does not compromise the performance of the model in downstream tasks, ensuring that the overall utility of the language model is preserved. Our findings contribute to the ongoing discussion around responsible AI development, suggesting that unbiased watermarks can serve as an effective means of tracking and attributing model outputs without sacrificing output quality.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=uWVC5FVidc",
    "arxiv_id": "2310.10669",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17571,
    "title": "MoLE: Mixture of LoRA Experts",
    "authors": [
      "Xun Wu",
      "Shaohan Huang",
      "Furu Wei"
    ],
    "abstract": "LoRA has gained widespread acceptance in the fine-tuning of large pre-trained models to cater to a diverse array of downstream tasks, showcasing notable effectiveness and efficiency, thereby solidifying its position as one of the most prevalent fine-tuning techniques. Due to the modular nature of LoRA's plug-and-play plugins, researchers have delved into the amalgamation of multiple LoRAs to empower models to excel across various downstream tasks. Nonetheless, extant approaches for LoRA fusion grapple with inherent challenges. Direct arithmetic merging may result in the loss of the original pre-trained model's generative capabilities or the distinct identity of LoRAs, thereby yielding suboptimal outcomes. On the other hand, Reference tuning-based fusion exhibits limitations concerning the requisite flexibility for the effective combination of multiple LoRAs. In response to these challenges, this paper introduces the Mixture of LoRA Experts (MoLE) approach, which harnesses hierarchical control and unfettered branch selection. The MoLE approach not only achieves superior LoRA fusion performance in comparison to direct arithmetic merging but also retains the crucial flexibility for combining LoRAs effectively. Extensive experimental evaluations conducted in both the Natural Language Processing (NLP) and Vision \\& Language (V\\&L) domains substantiate the efficacy of MoLE.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uWvKBCYh4S",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17570,
    "title": "Embodied Active Defense: Leveraging Recurrent Feedback to Counter Adversarial Patches",
    "authors": [
      "Lingxuan Wu",
      "Xiao Yang",
      "Yinpeng Dong",
      "Liuwei XIE",
      "Hang Su",
      "Jun Zhu"
    ],
    "abstract": "The vulnerability of deep neural networks to adversarial patches has motivated numerous defense strategies for boosting model robustness. However, the prevailing defenses depend on single observation or pre-established adversary information to counter adversarial patches, often failing to be confronted with unseen or adaptive adversarial attacks and easily exhibiting unsatisfying performance in dynamic 3D environments. Inspired by active human perception and recurrent feedback mechanisms, we develop Embodied Active Defense (EAD), a proactive defensive strategy that actively contextualizes environmental information to address misaligned adversarial patches in 3D real-world settings. To achieve this, EAD develops two central recurrent sub-modules, i.e., a perception module and a policy module, to implement two critical functions of active vision. These models recurrently process a series of beliefs and observations, facilitating progressive refinement of their comprehension of the target object and enabling the development of strategic actions to counter adversarial patches in 3D environments. To optimize learning efficiency, we incorporate a differentiable approximation of environmental dynamics and deploy patches that are agnostic to the adversary\u2019s strategies. Extensive experiments demonstrate that EAD substantially enhances robustness against a variety of patches within just a few steps through its action policy in safety-critical tasks (e.g., face recognition and object detection), without compromising standard accuracy. Furthermore, due to the attack-agnostic characteristic, EAD facilitates excellent generalization to unseen attacks, diminishing the averaged attack success rate by $95\\%$ across a range of unseen adversarial attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uXjfOmTiDt",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17569,
    "title": "Implicit Neural Representations and the Algebra of Complex Wavelets",
    "authors": [
      "T Mitchell Roddenberry",
      "Vishwanath Saragadam",
      "Maarten V. de Hoop",
      "Richard Baraniuk"
    ],
    "abstract": "Implicit neural representations (INRs) have arisen as useful methods for representing signals on Euclidean domains. By parameterizing an image as a multilayer perceptron (MLP) on Euclidean space, INRs effectively represent signals in a way that couples spatial and spectral features of the signal that is not obvious in the usual discrete representation, paving the way for continuous signal processing and machine learning approaches that were not previously possible. Although INRs using sinusoidal activation functions have been studied in terms of Fourier theory, recent works have shown the advantage of using wavelets instead of sinusoids as activation functions, due to their ability to simultaneously localize in both frequency and space. In this work, we approach such INRs and demonstrate how they resolve high-frequency features of signals from coarse approximations done in the first layer of the MLP. This leads to multiple prescriptions for the design of INR architectures, including the use of complex wavelets, decoupling of low and band-pass approximations, and initialization schemes based on the singularities of the desired signal.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uZfjFyPAvn",
    "arxiv_id": "2310.00545",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17568,
    "title": "Mathematical Justification of Hard Negative Mining via Isometric Approximation Theorem",
    "authors": [
      "Albert Xu",
      "Jhih-Yi Hsieh",
      "Bhaskar Vundurthy",
      "Nithya Kemp",
      "Eliana Cohen",
      "Lu Li",
      "Howie Choset"
    ],
    "abstract": "In deep metric learning, the triplet loss has emerged as a popular method to learn many computer vision and natural language processing tasks such as facial recognition, object detection, and visual-semantic embeddings. One issue that plagues the triplet loss is network collapse, an undesirable phenomenon where the network projects the embeddings of all data onto a single point. Researchers predominately solve this problem by using triplet mining strategies. While hard negative mining is the most effective of these strategies, existing formulations lack strong theoretical justification for their empirical success. In this paper, we utilize the mathematical theory of isometric approximation to show an equivalence between the triplet loss sampled by hard negative mining and an optimization problem that minimizes a Hausdorff-like distance between the neural network and its ideal counterpart function. This provides the theoretical justifications for hard negative mining's empirical efficacy. Experiments performed on the Market-1501 and Stanford Online Products datasets with various network architectures corroborate our theoretical findings, indicating that network collapse tends to happen when batch size is too large or embedding dimension is too small. In addition, our novel application of the isometric approximation theorem provides the groundwork for future forms of hard negative mining that avoid network collapse.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=udO3k28bEw",
    "arxiv_id": "2210.11173",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17565,
    "title": "Hierarchical Context Merging: Better Long Context Understanding for Pre-trained LLMs",
    "authors": [
      "Woomin Song",
      "Seunghyuk Oh",
      "Sangwoo Mo",
      "Jaehyung Kim",
      "Sukmin Yun",
      "Jung-Woo Ha",
      "Jinwoo Shin"
    ],
    "abstract": "Large language models (LLMs) have established new standards in various natural language processing tasks. However, a primary constraint they face is the context limit, i.e., the maximum number of tokens they can process.To relax the constraint, previous works have explored architectural changes and modifications in positional encoding, but they often require expensive training or do not address the computational demands of self-attention.In this paper, we present Hierarchical cOntext MERging (HOMER), a new training-freescheme designed to overcome the limitations. HOMER harnesses a divide-and-conquer methodology, segmenting extensive inputs into manageable units. The segments are then processed collectively, employing a hierarchical strategy that fuses adjacent chunks at progressive Transformer layers. A token reduction technique precedes each fusion, ensuring memory usage efficiency.We also propose an optimized computational order reducing the memory requirement to logarithmically scale with respect to input length, making it especially favorable for environments with tight memory restrictions. Our experimental results demonstrate the superior performance and memory efficiency of the proposed method, opening doors for broader applications of LLMs in scenarios with extended context requirements.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ulaUJFd96G",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17564,
    "title": "GROOT: Learning to Follow Instructions by Watching Gameplay Videos",
    "authors": [
      "Shaofei Cai",
      "Bowei Zhang",
      "Zihao Wang",
      "Xiaojian Ma",
      "Anji Liu",
      "Yitao Liang"
    ],
    "abstract": "We study the problem of building a controller that can follow open-ended instructions in open-world environments. We propose to follow reference videos as instructions, which offer expressive goal specifications while eliminating the need for expensive text-gameplay annotations. A new learning framework is derived to allow learning such instruction-following controllers from gameplay videos while producing a video instruction encoder that induces a structured goal space. We implement our agent GROOT in a simple yet effective encoder-decoder architecture based on causal transformers. We evaluate GROOT against open-world counterparts and human players on a proposed Minecraft SkillForge benchmark. The Elo ratings clearly show that GROOT is closing the human-machine gap as well as exhibiting a 70% winning rate over the best generalist agent baseline. Qualitative analysis of the induced goal space further demonstrates some interesting emergent properties, including the goal composition and complex gameplay behavior synthesis.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=uleDLeiaT3",
    "arxiv_id": "2310.08235",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17563,
    "title": "Towards Robust Fidelity for Evaluating Explainability of Graph Neural Networks",
    "authors": [
      "Xu Zheng",
      "Farhad Shirani",
      "Tianchun Wang",
      "Wei Cheng",
      "Zhuomin Chen",
      "Haifeng Chen",
      "Hua Wei",
      "Dongsheng Luo"
    ],
    "abstract": "Graph Neural Networks (GNNs) are neural models that leverage the dependency structure in graphical data via message passing among the graph nodes. GNNs have emerged as pivotal architectures in analyzing graph-structured data, and their expansive application in sensitive domains requires a comprehensive understanding of their decision-making processes --- necessitating a framework for GNN explainability. An explanation function for GNNs takes a pre-trained GNN along with a graph as input, to produce a `sufficient statistic' subgraph with respect to the graph label. A main challenge in studying GNN explainability is to provide fidelity measures that evaluate the performance of these explanation functions. This paper studies this foundational challenge, spotlighting the inherent limitations of prevailing fidelity metrics, including $Fid_+$, $Fid_-$, and $Fid_\\Delta$. Specifically, a formal, information-theoretic definition of explainability is introduced and it is shown that existing metrics often fail to align with this definition across various statistical scenarios. The reason is due to potential distribution shifts when subgraphs are removed in computing these fidelity measures. Subsequently, a robust class of fidelity measures are introduced, and it is shown analytically that they are resilient to distribution shift issues and are applicable in a wide range of scenarios. Extensive empirical analysis on both synthetic and real datasets are provided to illustrate that the proposed metrics are more coherent with gold standard metrics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=up6hr4hIQH",
    "arxiv_id": "2310.01820",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17561,
    "title": "LLMs Meet VLMs: Boost Open Vocabulary Object Detection with Fine-grained Descriptors",
    "authors": [
      "Sheng Jin",
      "Xueying Jiang",
      "Jiaxing Huang",
      "Lewei Lu",
      "Shijian Lu"
    ],
    "abstract": "Inspired by the outstanding zero-shot capability of vision language models (VLMs) in image classification tasks, open-vocabulary object detection has attracted increasing interest by distilling the broad VLM knowledge into detector training. However, most existing open-vocabulary detectors learn by aligning region embeddings with categorical labels (e.g., bicycle) only, disregarding the capability of VLMs on aligning visual embeddings with fine-grained text descriptions of object parts (e.g., pedals and bells). This paper presents DVDet, a Descriptor-Enhanced Open Vocabulary Detector that introduces conditional context prompts and hierarchical textual descriptors that enable precise region-text alignment as well as open-vocabulary detection training in general. Specifically, the conditional context prompt transforms regional embeddings into image-like representations that can be directly integrated into general open vocabulary detection training. In addition, we introduce large language models as an interactive and implicit knowledge repository which enables iterative mining and refining visually oriented textual descriptors for precise region-text alignment. Extensive experiments over multiple large-scale benchmarks show that DVDet outperforms the state-of-the-art consistently by large margins.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=usrChqw6yK",
    "arxiv_id": "2402.04630",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17560,
    "title": "Beyond Spatio-Temporal Representations: Evolving Fourier Transform for Temporal Graphs",
    "authors": [
      "Anson Bastos",
      "Kuldeep Singh",
      "Abhishek Nadgeri",
      "Manish Singh",
      "Toyotaro Suzumura"
    ],
    "abstract": "We present the Evolving Graph Fourier Transform (EFT), the first invertible spectral transform that captures evolving representations on temporal graphs. We motivate our work by the inadequacy of existing methods for capturing the evolving graph spectra, which are also computationally expensive due to the temporal aspect along with the graph vertex domain. We view the problem as an optimization over the Laplacian of the continuous time dynamic graph. Additionally, we propose pseudo-spectrum relaxations that decompose the transformation process, making it highly computationally efficient. The EFT method adeptly captures the evolving graph's structural and positional properties, making it effective for downstream tasks on evolving graphs. Hence, as a reference implementation, we develop a simple neural model induced with \\eft for capturing evolving graph spectra. We empirically validate our theoretical findings on a number of large-scale and standard temporal graph benchmarks and demonstrate that our model achieves state-of-the-art performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uvFhCUPjtI",
    "arxiv_id": "2402.16078",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18364,
    "title": "Soft Mixture Denoising: Beyond the Expressive Bottleneck of Diffusion Models",
    "authors": [
      "Yangming Li",
      "Boris van Breugel",
      "Mihaela van der Schaar"
    ],
    "abstract": "Because diffusion models have shown impressive performances in a number of tasks, such as image synthesis, there is a trend in recent works to prove (with certain assumptions) that these models have strong approximation capabilities. In this paper, we show that current diffusion models actually have an expressive bottleneck in backward denoising and some assumption made by existing theoretical guarantees is too strong. Based on this finding, we prove that diffusion models have unbounded errors in both local and global denoising. In light of our theoretical studies, we introduce soft mixture denoising (SMD), an expressive and efficient model for backward denoising. SMD not only permits diffusion models to well approximate any Gaussian mixture distributions in theory, but also is simple and efficient for implementation. Our experiments on multiple image datasets show that SMD significantly improves different types of diffusion models (e.g., DDPM), espeically in the situation of few backward iterations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aaBnFAyW9O",
    "arxiv_id": "2309.14068",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17559,
    "title": "DEEP NEURAL NETWORK INITIALIZATION WITH SPARSITY INDUCING ACTIVATIONS",
    "authors": [
      "Ilan Price",
      "Nicholas Daultry Ball",
      "Adam Christopher Jones",
      "Samuel Chun Hei Lam",
      "Jared Tanner"
    ],
    "abstract": "Inducing and leveraging sparse activations during training and inference is a promising avenue for improving the computational efficiency of deep networks, which is increasingly important as network sizes continue to grow and their application becomes more widespread.  Here we use the large width Gaussian process limit to analyze the behaviour, at random initialization, of nonlinear activations that induce sparsity in the hidden outputs.  A previously unreported form of training instability is proven for arguably two of the most natural candidates for hidden layer sparsification; those being a shifted ReLU ($\\phi(x)=\\max(0, x-\\tau)$ for $\\tau\\ge 0$) and soft thresholding ($\\phi(x)=0$ for $|x|\\le\\tau$ and $x-\\text{sign}(x)\\tau$ for $|x|>\\tau$).  We show that this instability is overcome by clipping the nonlinear activation magnitude, at a level prescribed by the shape of the associated Gaussian process variance map. Numerical experiments verify the theory and show that the proposed magnitude clipped sparsifying activations can be trained with training and test fractional sparsity as high as 85\\% while retaining close to full accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uvXK8Xk9Jk",
    "arxiv_id": "2402.16184",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17558,
    "title": "Bayesian Neural Controlled Differential Equations for Treatment Effect Estimation",
    "authors": [
      "Konstantin Hess",
      "Valentyn Melnychuk",
      "Dennis Frauen",
      "Stefan Feuerriegel"
    ],
    "abstract": "Treatment effect estimation in continuous time is crucial for personalized medicine. However, existing methods for this task are limited to point estimates of the potential outcomes, whereas uncertainty estimates have been ignored. Needless to say, uncertainty quantification is crucial for reliable decision-making in medical applications. To fill this gap, we propose a novel Bayesian neural controlled differential equation (BNCDE) for treatment effect estimation in continuous time. In our BNCDE, the time dimension is modeled through a coupled system of neural controlled differential equations and neural stochastic differential equations, where the neural stochastic differential equations allow for tractable variational Bayesian inference. Thereby, for an assigned sequence of treatments, our BNCDE provides meaningful posterior predictive distributions of the potential outcomes. To the best of our knowledge, ours is the first tailored neural method to provide uncertainty estimates of treatment effects in continuous time. As such, our method is of direct practical value for promoting reliable decision-making in medicine.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uwO71a8wET",
    "arxiv_id": "2310.17463",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17556,
    "title": "On Stationary Point Convergence of PPO-Clip",
    "authors": [
      "Ruinan Jin",
      "Shuai Li",
      "Baoxiang Wang"
    ],
    "abstract": "Proximal policy optimization (PPO) has gained popularity in reinforcement learning (RL). Its PPO-Clip variant is one the most frequently implemented algorithms and is one of the first-to-try algorithms in RL tasks. This variant uses a clipped surrogate objective function not typically found in other algorithms. Many works have demonstrated the practical performance of PPO-Clip, but the theoretical understanding of it is limited to specific settings. In this work, we provide a comprehensive analysis that shows the stationary point convergence of PPO-Clip and the convergence rate thereof. Our analysis is new and overcomes many challenges, including the non-smooth nature of the clip operator, the potentially unbounded score function, and the involvement of the ratio of two stochastic policies. Our results and techniques might share new insights into PPO-Clip.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uznKlCpWjV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17555,
    "title": "How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation",
    "authors": [
      "Josh Alman",
      "Zhao Song"
    ],
    "abstract": "In the classical transformer attention scheme, we are given three $n \\times d$ size matrices $Q, K, V$ (the query, key, and value tokens), and the goal is to compute a new $n \\times d$ size matrix $D^{-1} \\exp(QK^\\top) V$ where $D = \\mathrm{diag}( \\exp(QK^\\top) {\\bf 1}_n )$. Here, $\\exp()$ is applied entry-wise and ${\\bf 1}_n$ denotes a length-$n$ vector whose entries are all ones.Intuitively, attention computation captures pairwise information between words in a sentence, but not higher-order information. Indeed, recent work \\cite{sht23} has shown that attention units cannot solve simple problems about detecting triples of connected words.In this work, we study a generalization of attention which captures triple-wise  correlations. The generalization is based on computations involving tensors defined by tuples of words. More formally, given five $n \\times d$ size matrices $Q, K_1, K_2, V_1$ and $V_2$ (generalized query, key, and value tokens), our new goal is to compute an $n \\times d$ size matrix $D^{-1} \\exp( Q ( K_1 \\oslash K_2)^\\top ) (V_1 \\oslash V_2) $ where $D = \\mathrm{diag}( \\exp( Q ( K_1 \\oslash K_2)^\\top ) {\\bf 1}_{n^2} )$ and $K_1 \\oslash K_2 \\in \\mathbb{R}^{n^2 \\times d}$ denotes the column-wise Kronecker product of $K_1$ and $K_2$. This generalization is indeed able to solve problems about detecting triple-wise connections that were shown to be impossible for transformers.The potential downside of this generalization is that it appears as though computations are even more difficult, since the straightforward algorithm requires cubic time in $n$. However, we show that in the bounded-entry setting (which arises in practice, and which is well-studied in both theory and practice), there is actually a near-linear time algorithm. More precisely, we show that bounded entries are both necessary and sufficient for quickly performing generalized computations:$\\bullet$ On the positive side, if all entries of the input matrices are bounded above by $o(\\sqrt[3]{\\log n})$ then we show how to approximate the ``tensor-type'' attention matrix in $n^{1+o(1)}$ time.$\\bullet$ On the negative side, we show that if the entries of the input matrices may be as large as $\\Omega(\\sqrt[3]{\\log n})$, then there is no algorithm that runs faster than $n^{3-o(1)}$ (assuming the Strong Exponential Time Hypothesis from fine-grained complexity theory).We also show that our construction, algorithms, and lower bounds naturally generalize to higher-order tensors and correlations. Interestingly, the higher the order of the tensors, the lower the bound on the entries needs to be for an efficient algorithm. Our results thus yield a natural tradeoff between the boundedness of the entries, and order of the tensor one may use for more expressive, efficient attention computation.Our constructions make use of a novel connection with a higher-order variant on the kernel density estimation problem. They combine a number of technical tools, including the polynomial method, algebraic geometry codes, and multiparty Merlin-Arthur communication protocols.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=v0zNCwwkaV",
    "arxiv_id": "2310.04064",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17554,
    "title": "Towards Characterizing Domain Counterfactuals for Invertible Latent Causal Models",
    "authors": [
      "Zeyu Zhou",
      "Ruqi Bai",
      "Sean Kulinski",
      "Murat Kocaoglu",
      "David I. Inouye"
    ],
    "abstract": "Answering counterfactual queries has many important applications such as knowledge discovery and explainability, but is challenging when causal variables are unobserved and we only see a projection onto an observation space, for instance, image pixels.    One approach is to recover the latent Structural Causal Model (SCM), but this typically needs unrealistic assumptions, such as linearity of the causal mechanisms.    Another approach is to use na&iuml;ve ML approximations, such as generative models, to generate counterfactual samples; however, these lack guarantees of accuracy.    In this work, we strive to strike a balance between practicality and theoretical guarantees by focusing on a specific type of causal query called *domain counterfactuals*, which hypothesizes what a sample would have looked like if it had been generated in a different domain (or environment).    Concretely, by only assuming invertibility, sparse domain interventions and access to observational data from different domains, we aim to improve domain counterfactual estimation both theoretically and practically with less restrictive assumptions.    We define *domain counterfactually equivalent* models and prove necessary and sufficient properties for equivalent models that provide a tight characterization of the domain counterfactual equivalence classes.    Building upon this result, we prove that every equivalence class contains a model where all intervened variables are at the end when topologically sorted by the causal DAG, i.e., all non-intervened variables have non-intervened ancestors.    This surprising result suggests that a model design that only allows intervention in the last $k$ latent variables may improve model estimation for counterfactuals.    We then test this model design on extensive simulated and image-based experiments which show the sparse canonical model indeed improves counterfactual estimation over baseline non-sparse models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=v1VvCWJAL8",
    "arxiv_id": "2306.11281",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17552,
    "title": "RLCD: Reinforcement Learning from Contrastive Distillation for LM Alignment",
    "authors": [
      "Kevin Yang",
      "Dan Klein",
      "Asli Celikyilmaz",
      "Nanyun Peng",
      "Yuandong Tian"
    ],
    "abstract": "We propose Reinforcement Learning from Contrastive Distillation (RLCD), a method for aligning language models to follow principles expressed in natural language (e.g., to be more harmless) without using human feedback. RLCD creates preference pairs from two contrasting model outputs, one using a positive prompt designed to encourage following the given principles, and one using a negative prompt designed to encourage violating them. Using two different prompts causes model outputs to be more differentiated on average, resulting in cleaner preference labels in the absence of human annotations. We then use the preference pairs to train a preference model, which is in turn used to improve a base unaligned language model via reinforcement learning. Empirically, RLCD outperforms RLAIF (Bai et al., 2022b) and context distillation (Huang et al., 2022) baselines across three diverse alignment tasks\u2014harmlessness, helpfulness, and story outline generation\u2014and when using both 7B and 30B model scales for simulating preference data",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=v3XXtxWKi6",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17551,
    "title": "Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers",
    "authors": [
      "Oren Mangoubi",
      "Nisheeth K. Vishnoi"
    ],
    "abstract": "We consider the problem of sampling from a logconcave distribution $\\pi(\\theta) \\propto e^{-f(\\theta)}$ constrained to a polytope $K:=${$\\theta \\in \\mathbb{R}^d: A\\theta \\leq b$}, where $A\\in   \\mathbb{R}^{m\\times d}$ and $b \\in \\mathbb{R}^m$. The fastest-known algorithm for the setting when $f$ is $O(1)$-Lipschitz or $O(1)$-smooth runs in roughly $O(md \\times md^{\\omega -1})$ arithmetic operations, where the $md^{\\omega -1}$ term arises because each Markov chain step requires computing a matrix inversion and determinant ($\\omega \\approx 2.37$ is the matrix multiplication constant). We present a nearly-optimal implementation of this Markov chain with per-step complexity that is roughly the number of non-zero entries of $A$ while the number of Markov chain steps remains the same. The key technical ingredients are 1) to show that the matrices that arise in this Dikin walk change slowly, 2) to deploy efficient linear solvers which can leverage this slow change to speed up matrix inversion by using information computed in previous steps, and 3) to speed up the computation of the determinantal term in the Metropolis filter step via a randomized Taylor series-based estimator. This result directly improves the runtime for applications that involve sampling from Gibbs distributions constrained to polytopes that arise in Bayesian statistics and private optimization.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=v63GWletn8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17548,
    "title": "Consistency Models as a Rich and Efficient Policy Class for Reinforcement Learning",
    "authors": [
      "Zihan Ding",
      "Chi Jin"
    ],
    "abstract": "Score-based generative models like the diffusion model have been testified to be effective in modeling multi-modal data from image generation to reinforcement learning (RL). However, the inference process of diffusion model can be slow, which hinders its usage in RL with iterative sampling. We propose to apply the consistency model as an efficient yet expressive policy representation, namely consistency policy, with an actor-critic style algorithm for three typical RL settings: offline, offline-to-online and online. For offline RL, we demonstrate the expressiveness of generative models as policies from multi-modal data. For offline-to-online RL, the consistency policy is shown to be more computational efficient than diffusion policy, with a comparable performance. For online RL, the consistency policy demonstrates significant speedup and even higher average performances than the diffusion policy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=v8jdwkUNXb",
    "arxiv_id": "2309.16984",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17547,
    "title": "A Framework for Inference Inspired by Human Memory Mechanisms",
    "authors": [
      "Xiangyu Zeng",
      "Jie Lin",
      "Piao Hu",
      "Ruizheng Huang",
      "Zhicheng Zhang"
    ],
    "abstract": "How humans and machines make sense of current inputs for relation reasoning and question-answering, and put the perceived information into context of our past memories, has been a challenging conundrum in cognitive science and artificial intelligence. Inspired by human brain's memory system and cognitive architectures, we propose a PMI framework that consists of perception, memory and inference components. Notably, the memory module comprises working and long-term memory, with the latter endowed with a higher-order structure to retain more accumulated knowledge and experiences. Through a differentiable competitive write access, current perceptions update working memory, which is later merged with long-term memory via outer product associations, averting memory overflow and minimizing information conflicts. In the inference module, relevant information is retrieved from two separate memory origins and associatively integrated to attain a more comprehensive and precise interpretation of current perceptions. We exploratively apply our PMI to improve prevailing Transformers and CNN models on question-answering tasks like bAbI-20k and Sort-of-CLEVR datasets, as well as relation reasoning and image classification tasks, and in each case, our PMI enhancements consistently outshine their original counterparts significantly. Visualization analyses reveal that memory consolidation, along with the interaction and integration of information from diverse memory sources, substantially contributes to the model effectiveness on inference tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vBo7544jZx",
    "arxiv_id": "2310.09297",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17546,
    "title": "Encoding Unitig-level Assembly Graphs with Heterophilous Constraints for Metagenomic Contigs Binning",
    "authors": [
      "Hansheng Xue",
      "Vijini Mallawaarachchi",
      "Lexing Xie",
      "Vaibhav Rajan"
    ],
    "abstract": "Metagenomics studies genomic material derived from mixed microbial communities in diverse environments, holding considerable significance for both human health and environmental sustainability. Metagenomic binning refers to the clustering of genomic subsequences obtained from high-throughput DNA sequencing into distinct bins, each representing a constituent organism within the community. Mainstream binning methods primarily rely on sequence features such as composition and abundance, making them unable to effectively handle sequences shorter than 1,000 bp and inherent noise within sequences. Several binning tools have emerged, aiming to enhance binning outcomes by using the assembly graph generated by assemblers, which encodes valuable overlapping information among genomic sequences. However, existing assembly graph-based binners mainly focus on simplified contig-level assembly graphs that are recreated from assembler\u2019s original graphs, unitig-level assembly graphs. The simplification reduces the resolution of the connectivity information in original graphs. In this paper, we design a novel binning tool named UnitigBin, which leverages representation learning on unitig-level assembly graphs while adhering to heterophilious constraints imposed by single-copy marker genes, ensuring that constrained contigs cannot be grouped together. Extensive experiments conducted on synthetic and real datasets demonstrate that UnitigBin significantly surpasses state-of-the-art binning tools.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vBw8JGBJWj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17549,
    "title": "Let's Verify Step by Step",
    "authors": [
      "Hunter Lightman",
      "Vineet Kosaraju",
      "Yuri Burda",
      "Harrison Edwards",
      "Bowen Baker",
      "Teddy Lee",
      "Jan Leike",
      "John Schulman",
      "Ilya Sutskever",
      "Karl Cobbe"
    ],
    "abstract": "In recent years, large language models have greatly improved in their ability to perform complex multi-step reasoning. However, even state-of-the-art models still regularly produce logical mistakes. To train more reliable models, we can turn either to outcome supervision, which provides feedback for a final result, or process supervision, which provides feedback for each intermediate reasoning step. Given the importance of training reliable models, and given the high cost of human feedback, it is important to carefully compare the both methods. Recent work has already begun this comparison, but many questions still remain. We conduct our own investigation, finding that process supervision significantly outperforms outcome supervision for training models to solve problems from the challenging MATH dataset. Our process-supervised model solves 78% of problems from a representative subset of the MATH test set. Additionally, we show that active learning significantly improves the efficacy of process supervision. To support related research, we also release PRM800K, the complete dataset of 800,000 step-level human feedback labels used to train our best reward model.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=v8L0pN6EOi",
    "arxiv_id": "2305.20050",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17544,
    "title": "Threshold-Consistent Margin Loss for Open-World Deep Metric Learning",
    "authors": [
      "Qin ZHANG",
      "Linghan Xu",
      "Jun Fang",
      "Qingming Tang",
      "Ying Nian Wu",
      "Joseph Tighe",
      "Yifan Xing"
    ],
    "abstract": "Existing losses used in deep metric learning (DML) for image retrieval often lead to highly non-uniform intra-class and inter-class representation structures across test classes and data distributions. When combined with the common practice of using a fixed threshold to declare a match, this gives rise to significant performance variations in terms of false accept rate (FAR) and false reject rate (FRR) across test classes and data distributions. We define this issue in DML as threshold inconsistency. In real-world applications, such inconsistency often complicates the threshold selection process when deploying large-scale image retrieval systems. To measure this inconsistency, we propose a novel variance-based metric called Operating-Point-Inconsistency-Score (OPIS) that quantifies the variance in the operating characteristics across classes. Using the OPIS metric, we find that achieving high accuracy levels in a DML model does not automatically guarantee threshold consistency. In fact, our investigation reveals a Pareto frontier in the high-accuracy regime, where existing methods to improve accuracy often lead to degradation in threshold consistency. To address this trade-off, we introduce the Threshold-Consistent Margin (TCM) loss, a simple yet effective regularization technique that promotes uniformity in representation structures across classes by selectively penalizing hard sample pairs. Large-scale experiments demonstrate TCM's effectiveness in enhancing threshold consistency while preserving accuracy, simplifying the threshold selection process in practical DML settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vE5MyzpP92",
    "arxiv_id": "2307.04047",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17543,
    "title": "Multilingual Jailbreak Challenges in Large Language Models",
    "authors": [
      "Yue Deng",
      "Wenxuan Zhang",
      "Sinno Jialin Pan",
      "Lidong Bing"
    ],
    "abstract": "While large language models (LLMs) exhibit remarkable capabilities across a wide range of tasks, they pose potential safety concerns, such as the ``jailbreak'' problem. Although several preventive measures have been developed to mitigate the potential risks associated with LLMs, they have primarily focused on English data. In this study, we reveal the presence of multilingual jailbreak challenges within LLMs and consider two potential risky scenarios: unintentional and intentional. The unintentional scenario involves users querying LLMs using non-English prompts and inadvertently bypassing the safety mechanisms, while the intentional scenario entails malicious users combining jailbreak instructions with multilingual prompts to attack LLMs deliberately. The experimental results reveal that in the unintentional scenario, the rate of unsafe content increases as the availability of languages decreases. Specifically, low-resource languages exhibit three times the likelihood of encountering harmful content compared to high-resource languages, with both ChatGPT and GPT-4. In the intentional scenario, multilingual prompts can exacerbate the negative impact of jailbreak instructions, with astonishingly high rates of unsafe output: 80.92\\% for ChatGPT and 40.71\\% for GPT-4. Finally, we propose a novel \\textsc{Self-Defense} framework that addresses the  multilingual jailbreak challenges  via automatically generating multilingual safety training data for fine-tuning. Experiment results demonstrate its effectiveness with notable reduction in unsafe rate.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vESNKdEMGp",
    "arxiv_id": "2310.06474",
    "GitHub": [
      "https://github.com/DAMO-NLP-SG/multilingual-safety-for-LLMs"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17542,
    "title": "Learning in reverse causal strategic environments with ramifications on two sided markets",
    "authors": [
      "Seamus Somerstep",
      "Yuekai Sun",
      "Yaacov Ritov"
    ],
    "abstract": "Motivated by equilibrium models of labor markets, we develop a formulation of causal strategic classification in which strategic agents can directly manipulate their outcomes. As an application, we consider employers that seek to anticipate the strategic response of a labor force when developing a hiring policy. We show theoretically that employers with performatively optimal hiring policies improve employer reward, labor force skill level, and labor force equity (compared to employers that do not anticipate the strategic labor force response) in the classic Coate-Loury labor market model. Empirically, we show that these desirable properties of performative hiring policies do generalize to our own formulation of a general equilibrium labor market. On the other hand, we also observe that the benefits of performatively optimal hiring policies are brittle in some aspects. We demonstrate that in our formulation a performative employer both harms workers by reducing their aggregate welfare and fails to prevent discrimination when more sophisticated wage and cost structures are introduced.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vEfmVS5ywF",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17541,
    "title": "Skip-Attention: Improving Vision Transformers by Paying Less Attention",
    "authors": [
      "Shashanka Venkataramanan",
      "Amir Ghodrati",
      "Yuki M Asano",
      "Fatih Porikli",
      "Amir Habibian"
    ],
    "abstract": "This work aims to improve the efficiency of vision transformers (ViTs).  While ViTs use computationally expensive self-attention operations in every layer, we identify that these operations are highly correlated across layers --  a key redundancy that causes unnecessary computations. Based on this observation, we propose SkipAT a method to reuse self-attention computation from preceding layers to approximate attention at one or more subsequent layers. To ensure that reusing self-attention blocks across layers does not degrade the performance, we introduce a simple parametric function, which outperforms the baseline transformer's performance while running computationally faster. We show that SkipAT is agnostic to transformer architecture and is effective in image classification,  semantic segmentation on ADE20K, image denoising on SIDD, and video denoising on DAVIS. We achieve improved throughput at the same-or-higher accuracy levels in all these tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vI95kcLAoU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17540,
    "title": "Intriguing Properties of Data Attribution on Diffusion Models",
    "authors": [
      "Xiaosen Zheng",
      "Tianyu Pang",
      "Chao Du",
      "Jing Jiang",
      "Min Lin"
    ],
    "abstract": "Data attribution seeks to trace model outputs back to training data. With the recent development of diffusion models, data attribution has become a desired module to properly assign valuations for high-quality or copyrighted training samples, ensuring that data contributors are fairly compensated or credited. Several theoretically motivated methods have been proposed to implement data attribution, in an effort to improve the trade-off between computational scalability and effectiveness. In this work, we conduct extensive experiments and ablation studies on attributing diffusion models, specifically focusing on DDPMs trained on CIFAR-10 and CelebA, as well as a Stable Diffusion model LoRA-finetuned on ArtBench. Intriguingly, we report counter-intuitive observations that theoretically unjustified design choices for attribution empirically outperform previous baselines by a large margin, in terms of both linear datamodeling score and counterfactual evaluation. Our work presents a significantly more efficient approach for attributing diffusion models, while the unexpected findings suggest that at least in non-convex settings, constructions guided by theoretical assumptions may lead to inferior attribution performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vKViCoKGcB",
    "arxiv_id": "2311.00500",
    "GitHub": [
      "https://github.com/sail-sg/D-TRAK"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17539,
    "title": "SYMBOL: Generating Flexible Black-Box Optimizers through Symbolic Equation Learning",
    "authors": [
      "Jiacheng Chen",
      "Zeyuan Ma",
      "Hongshu Guo",
      "Yining Ma",
      "Jie Zhang",
      "Yue-Jiao Gong"
    ],
    "abstract": "Recent Meta-learning for Black-Box Optimization (MetaBBO) methods harness neural networks to meta-learn configurations of traditional black-box optimizers. Despite their success, they are inevitably restricted by the limitations of predefined hand-crafted optimizers. In this paper, we present SYMBOL, a novel framework that promotes the automated discovery of black-box optimizers through symbolic equation learning. Specifically, we propose a Symbolic Equation Generator (SEG) that allows closed-form optimization rules to be dynamically generated for specific tasks and optimization steps. Within SYMBOL, we then develop three distinct strategies based on reinforcement learning, so as to meta-learn the SEG efficiently. Extensive experiments reveal that the optimizers generated by SYMBOL not only surpass the state-of-the-art BBO and MetaBBO baselines, but also exhibit exceptional zero-shot generalization abilities across entirely unseen tasks with different problem dimensions, population sizes, and optimization horizons. Furthermore, we conduct in-depth analyses of our SYMBOL framework and the optimization rules that it generates, underscoring its desirable flexibility and interpretability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vLJcd43U7a",
    "arxiv_id": "2402.02355",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17537,
    "title": "Provable Memory Efficient Self-Play Algorithm for Model-free Reinforcement Learning",
    "authors": [
      "Na Li",
      "Yuchen Jiao",
      "Hangguan Shan",
      "Shefeng Yan"
    ],
    "abstract": "The thriving field of multi-agent reinforcement learning (MARL) studies how a group of interacting agents make decisions autonomously in a shared dynamic environment. Existing theoretical studies in this area suffer from at least two of the following obstacles: memory inefficiency, the heavy dependence of sample complexity on the long horizon and the large state space, the high computational complexity, non-Markov policy, non-Nash policy, and high burn-in cost. In this work, we take a step towards settling this problem by designing a model-free self-play algorithm \\emph{Memory-Efficient Nash Q-Learning (ME-Nash-QL)} for two-player zero-sum Markov games, which is a specific setting of MARL. We prove that ME-Nash-QL can output an $\\varepsilon$-approximate Nash policy with remarkable space complexity $O(SABH)$, sample complexity $\\widetilde{O}(H^4SAB/\\varepsilon^2)$, and computational complexity $O(T\\mathrm{poly}(AB))$, where $S$ is the number of states, $\\{A, B\\}$ is the number of actions for the two players, $H$ is the horizon length, and $T$ is the number of samples. Notably, our approach outperforms in terms of space complexity compared to existing algorithms for tabular cases. It achieves the lowest computational complexity while preserving Markov policies, setting a new standard. Furthermore, our algorithm outputs a Nash policy and achieves the best sample complexity compared with the existing guarantee for long horizons, i.e. when $\\min \\\\{ A, B \\\\} \\ll H^2$. Our algorithm also achieves the best burn-in cost $O(SAB\\,\\mathrm{poly}(H))$, whereas previous algorithms need at least $O(S^3 AB\\,\\mathrm{poly}(H))$ to attain the same level of sample complexity with ours.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vNiI3aGcE6",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17536,
    "title": "Efficient Backdoor Attacks for Deep Neural Networks in Real-world Scenarios",
    "authors": [
      "Ziqiang Li",
      "Hong Sun",
      "Pengfei Xia",
      "Heng Li",
      "Beihao Xia",
      "Yi Wu",
      "Bin Li"
    ],
    "abstract": "Recent deep neural networks (DNNs) have came to rely on vast amounts of training data, providing an opportunity for malicious attackers to exploit and contaminate the data to carry out backdoor attacks. However, existing backdoor attack methods make unrealistic assumptions, assuming that all training data comes from a single source and that attackers have full access to the training data. In this paper, we introduce a more realistic attack scenario where victims collect data from multiple sources, and attackers cannot access the complete training data. We refer to this scenario as $\\textbf{data-constrained backdoor attacks}$. In such cases, previous attack methods suffer from severe efficiency degradation due to the $\\textbf{entanglement}$ between benign and poisoning features during the backdoor injection process. To tackle this problem, we introduce three CLIP-based technologies from two distinct streams: $\\textit{Clean Feature Suppression}$ and $\\textit{Poisoning Feature Augmentation}$. The results demonstrate remarkable improvements, with some settings achieving over $\\textbf{100}$% improvement compared to existing attacks in data-constrained scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vRyp2dhEQp",
    "arxiv_id": "2306.08386",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17535,
    "title": "How Many Pretraining Tasks Are Needed for In-Context Learning of Linear Regression?",
    "authors": [
      "Jingfeng Wu",
      "Difan Zou",
      "Zixiang Chen",
      "Vladimir Braverman",
      "Quanquan Gu",
      "Peter Bartlett"
    ],
    "abstract": "Transformers pretrained on diverse tasks exhibit remarkable in-context learning (ICL) capabilities, enabling them to solve unseen tasks solely based on input contexts without adjusting model parameters. In this paper, we study ICL in one of its simplest setups: pretraining a single-layer linear attention model for linear regression with a Gaussian prior. We establish a statistical task complexity bound for the attention model pretraining, showing that effective pretraining only requires a small number of independent tasks. Furthermore, we prove that the pretrained model closely matches the Bayes optimal algorithm, i.e., optimally tuned ridge regression, by achieving nearly Bayes optimal risk on unseen tasks under a fixed context length. These theoretical findings complement prior experimental research and shed light on the statistical foundations of ICL.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=vSh5ePa0ph",
    "arxiv_id": "2310.08391",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17534,
    "title": "Enhancing Transfer Learning with Flexible Nonparametric Posterior Sampling",
    "authors": [
      "Hyungi Lee",
      "Giung Nam",
      "Edwin Fong",
      "Juho Lee"
    ],
    "abstract": "Transfer learning has recently shown significant performance across various tasks involving deep neural networks. In these transfer learning scenarios, the prior distribution for downstream data becomes crucial in Bayesian model averaging (BMA). While previous works proposed the prior over the neural network parameters centered around the pre-trained solution, such strategies have limitations when dealing with distribution shifts between upstream and downstream data. This paper introduces nonparametric transfer learning (NPTL), a flexible posterior sampling method to address the distribution shift issue within the context of nonparametric learning. The nonparametric learning (NPL) method is a recent approach that employs a nonparametric prior for posterior sampling, efficiently accounting for model misspecification scenarios, which is suitable for transfer learning scenarios that may involve the distribution shift between upstream and downstream tasks. Through extensive empirical validations, we demonstrate that our approach surpasses other baselines in BMA performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vSwu81S33z",
    "arxiv_id": "2403.07282",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17532,
    "title": "Xformer: Hybrid X-Shaped Transformer for Image Denoising",
    "authors": [
      "Jiale Zhang",
      "Yulun Zhang",
      "Jinjin Gu",
      "Jiahua Dong",
      "Linghe Kong",
      "Xiaokang Yang"
    ],
    "abstract": "In this paper, we present a hybrid X-shaped vision Transformer, named Xformer, which performs notably on image denoising tasks. We explore strengthening the global representation of tokens from different scopes. In detail, we adopt two types of Transformer blocks. The spatial-wise Transformer block performs fine-grained local patches interactions across tokens defined by spatial dimension. The channel-wise Transformer block performs direct global context interactions across tokens defined by channel dimension. Based on the concurrent network structure, we design two branches to conduct these two interaction fashions. Within each branch, we employ an encoder-decoder architecture to capture multi-scale features. Besides, we propose the Bidirectional Connection Unit (BCU) to couple the learned representations from these two branches while providing enhanced information fusion. The joint designs make our Xformer powerful to conduct global information modeling in both spatial and channel dimensions. Extensive experiments show that Xformer, under the comparable model complexity, achieves state-of-the-art performance on the synthetic and real-world image denoising tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vXrIQLzIKY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17531,
    "title": "SliceGPT: Compress Large Language Models by Deleting Rows and Columns",
    "authors": [
      "Saleh Ashkboos",
      "Maximilian L. Croci",
      "Marcelo Gennari do Nascimento",
      "Torsten Hoefler",
      "James Hensman"
    ],
    "abstract": "Large language models have become the cornerstone of natural language processing, but their use comes with substantial costs in terms of compute and memory resources. Sparsification provides a solution to alleviate these resource constraints, and recent works have shown that trained models can be sparsified post-hoc. Existing sparsification techniques face challenges as they need additional data structures and offer constrained speedup with current hardware.  In this paper we present SliceGPT, a new post-training sparsification scheme which replaces each weight matrix with a smaller (dense) matrix, reducing the embedding dimension of the network. Through extensive experimentation, we show that SliceGPT can remove up to 25\\% of the model parameters (including embeddings) for  OPT 66B and LLAMA-2 70B models with negligible loss in accuracy. Our sliced models run on fewer GPUs and run faster without any additional code optimization: on 24GB consumer GPUs we reduce the total compute for inference on LLAMA-2 70B to 64% of that of the dense model; on 40GB A100 GPUs we reduce it to 66%. We offer a new insight, computational invariance in transformer networks, which enables SliceGPT and we hope it will inspire and enable future avenues to reduce memory and computation demands for pre-trained models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vXxardq6db",
    "arxiv_id": "2401.15024",
    "GitHub": [
      "https://github.com/microsoft/TransformerCompression"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17530,
    "title": "Vocos: Closing the gap between time-domain and Fourier-based neural vocoders for high-quality audio synthesis",
    "authors": [
      "Hubert Siuzdak"
    ],
    "abstract": "Recent advancements in neural vocoding are predominantly driven by Generative Adversarial Networks (GANs) operating in the time-domain. While effective, this approach neglects the inductive bias offered by time-frequency representations, resulting in reduntant and computionally-intensive upsampling operations. Fourier-based time-frequency representation is an appealing alternative, aligning more accurately with human auditory perception, and benefitting from well-established fast algorithms for its computation. Nevertheless, direct reconstruction of complex-valued spectrograms has been historically problematic, primarily due to phase recovery issues. This study seeks to close this gap by presenting Vocos, a new model that directly generates Fourier spectral coefficients. Vocos not only matches the state-of-the-art in audio quality, as demonstrated in our evaluations, but it also substantially improves computational efficiency, achieving an order of magnitude increase in speed compared to prevailing time-domain neural vocoding approaches. The source code and model weights have been open-sourced.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vY9nzQmQBw",
    "arxiv_id": "2306.00814",
    "GitHub": [
      "https://github.com/charactr-platform/vocos"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17529,
    "title": "CodeChain: Towards Modular Code Generation Through Chain of Self-revisions with Representative Sub-modules",
    "authors": [
      "Hung Le",
      "Hailin Chen",
      "Amrita Saha",
      "Akash Gokul",
      "Doyen Sahoo",
      "Shafiq Joty"
    ],
    "abstract": "Large Language Models (LLMs) have already become quite proficient at solving simpler programming tasks like those in HumanEval or MBPP benchmarks. However, solving more complex and competitive programming tasks is still quite challenging for these models - possibly due to their tendency to generate solutions as monolithic code blocks instead of decomposing them into logical sub-tasks and sub-modules. On the other hand, experienced programmers instinctively write modularized code with abstraction for solving complex tasks, often reusing previously developed modules. To address this gap, we propose CodeChain, a novel framework for inference that elicits modularized code generation through a chain of self-revisions, each being guided by some representative sub-modules generated in previous iterations. Concretely, CodeChain first instructs the LLM to generate modularized codes through chain-of-thought prompting. Then it applies a chain of self-revisions by iterating the two steps: 1) extracting and clustering the generated sub-modules and selecting the cluster representatives as the more generic and re-usable implementations, and 2) augmenting the original chain-of-thought prompt with these selected module-implementations and instructing the LLM to re-generate new modularized solutions. We find that by naturally encouraging the LLM to reuse the previously developed and verified sub-modules, CodeChain can significantly boost both modularity as well as correctness of the generated solutions, achieving relative pass@1 improvements of 35\\% on APPS and 76\\% on CodeContests. It is shown to be effective on both OpenAI LLMs as well as open-sourced LLMs like WizardCoder. We also conduct comprehensive ablation studies with different methods of prompting, number of clusters, model sizes, program qualities, etc., to provide useful insights that underpin CodeChain's success.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vYhglxSj8j",
    "arxiv_id": "2310.08992",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17528,
    "title": "Understanding the Robustness of Randomized Feature Defense Against Query-Based Adversarial Attacks",
    "authors": [
      "Nguyen Hung-Quang",
      "Yingjie Lao",
      "Tung Pham",
      "Kok-Seng Wong",
      "Khoa D Doan"
    ],
    "abstract": "Recent works have shown that deep neural networks are vulnerable to adversarial examples that find samples close to the original image but can make the model misclassify. Even with access only to the model's output, an attacker can employ black-box attacks to generate such adversarial examples. In this work, we propose a simple and lightweight defense against black-box attacks by adding random noise to hidden features at intermediate layers of the model at inference time. Our theoretical analysis confirms that this method effectively enhances the model's resilience against both score-based and decision-based black-box attacks. Importantly, our defense does not necessitate adversarial training and has minimal impact on accuracy, rendering it applicable to any pre-trained model. Our analysis also reveals the significance of selectively adding noise to different parts of the model based on the gradient of the adversarial objective function, which can be varied during the attack. We demonstrate the robustness of our defense against multiple black-box attacks through extensive empirical experiments involving diverse models with various architectures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vZ6r9GMT1n",
    "arxiv_id": "2310.00567",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17527,
    "title": "Learning Multi-Agent Communication with Contrastive Learning",
    "authors": [
      "Yat Long Lo",
      "Biswa Sengupta",
      "Jakob Nicolaus Foerster",
      "Michael Noukhovitch"
    ],
    "abstract": "Communication is a powerful tool for coordination in multi-agent RL. But inducing an effective, common language is a difficult challenge, particularly in the decentralized setting. In this work, we introduce an alternative perspective where communicative messages sent between agents are considered as different incomplete views of the environment state. By examining the relationship between messages sent and received, we propose to learn to communicate using contrastive learning to maximize the mutual information between messages of a given trajectory. In communication-essential environments, our method outperforms previous work in both performance and learning speed. Using qualitative metrics and representation probing, we show that our method induces more symmetric communication and captures global state information from the environment. Overall, we show the power of contrastive learning and the importance of leveraging messages as encodings for effective communication.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vZZ4hhniJU",
    "arxiv_id": "2307.01403",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17526,
    "title": "SAS: Structured Activation Sparsification",
    "authors": [
      "Yusuke Sekikawa",
      "Shingo Yashima"
    ],
    "abstract": "Wide networks usually yield better accuracy than their narrower counterpart at the expense of the massive $\\texttt{mult}$ cost.To break this tradeoff, we advocate a novel concept of $\\textit{Structured Activation Sparsification}$, dubbed SAS, which boosts accuracy without increasing computation by utilizing the projected sparsity in activation maps with a specific structure. Concretely, the projected sparse activation is allowed to have N nonzero value among M consecutive activations.Owing to the local structure in sparsity, the wide $\\texttt{matmul}$ between a dense weight and the sparse activation is executed as an equivalent narrow $\\texttt{matmul}$ between a dense weight and dense activation, which is compatible with NVIDIA's $\\textit{SparseTensorCore}$ developed for the N:M structured sparse weight.In extensive experiments, we demonstrate that increasing sparsity monotonically improves accuracy (up to 7% on CIFAR10) without increasing the $\\texttt{mult}$ count.Furthermore, we show that structured sparsification of $\\textit{activation}$ scales better than that of $\\textit{weight}$ given the same computational budget.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vZfi5to2Xl",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17525,
    "title": "Towards Robust and Efficient Cloud-Edge Elastic Model Adaptation via Selective Entropy Distillation",
    "authors": [
      "Yaofo Chen",
      "Shuaicheng Niu",
      "Shoukai Xu",
      "Hengjie Song",
      "Yaowei Wang",
      "Mingkui Tan"
    ],
    "abstract": "The conventional deep learning paradigm often involves training a deep model on a server and then deploying the model or its distilled ones to resource-limited edge devices. Usually, the models shall remain fixed once deployed (at least for some period) due to the potential high cost of model adaptation for both the server and edge sides. However, in many real-world scenarios, the test environments may change dynamically (known as distribution shifts), which often results in degraded performance. Thus, one has to adapt the edge models promptly to attain promising performance. Moreover, with the increasing data collected at the edge, this paradigm also fails to further adapt the cloud model for better performance. To address these, we encounter two primary challenges: 1) the edge model has limited computation power and may only support forward propagation; 2) the data transmission budget between cloud and edge devices is limited in latency-sensitive scenarios. In this paper, we establish a Cloud-Edge Model Adaptation (CEMA) paradigm in which the edge models only need to perform forward propagation and the edge models can be adapted online. In our CEMA, to reduce the communication burden, we devise two criteria to exclude unnecessary samples from uploading to the cloud, i.e., dynamic unreliable and low-informative sample exclusion. Based on the uploaded samples, we update and distribute the affine parameters of normalization layers by distilling from the stronger foundation model to the edge model with a sample replay strategy. Extensive experimental results on ImageNet-C and ImageNet-R verify the effectiveness of our CEMA.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vePdNU3u6n",
    "arxiv_id": "2402.17316",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17523,
    "title": "General Graph Random Features",
    "authors": [
      "Isaac Reid",
      "Krzysztof Marcin Choromanski",
      "Eli Berger",
      "Adrian Weller"
    ],
    "abstract": "We propose a novel random walk-based algorithm for unbiased estimation of arbitrary functions of a weighted adjacency matrix, coined universal graph random features (u-GRFs). This includes many of the most popular examples of kernels defined on the nodes of a graph. Our algorithm enjoys subquadratic time complexity with respect to the number of nodes, overcoming the notoriously prohibitive cubic scaling of exact graph kernel evaluation. It can also be trivially distributed across machines, permitting learning on much larger networks. At the heart of the algorithm is a modulation function which upweights or downweights the contribution from different random walks depending on their lengths. We show that by parameterising it with a neural network we can obtain u-GRFs that give higher-quality kernel estimates or perform efficient, scalable kernel learning. We provide robust theoretical analysis and support our findings with experiments including pointwise estimation of fixed graph kernels, solving non-homogeneous graph ordinary differential equations, node clustering and kernel regression on triangular meshes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=viftsX50Rt",
    "arxiv_id": "2310.04859",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17522,
    "title": "Alice Benchmarks: Connecting Real World Re-Identification with the Synthetic",
    "authors": [
      "Xiaoxiao Sun",
      "Yue Yao",
      "Shengjin Wang",
      "Hongdong Li",
      "Liang Zheng"
    ],
    "abstract": "For object re-identification (re-ID), learning from synthetic data has become a promising strategy to cheaply acquire large-scale annotated datasets and effective models, with few privacy concerns. Many interesting research problems arise from this strategy, e.g., how to reduce the domain gap between synthetic source and real-world target. To facilitate developing more new approaches in learning from synthetic data, we introduce the Alice benchmarks, large-scale datasets providing benchmarks as well as evaluation protocols to the research community. Within the Alice benchmarks, two object re-ID tasks are offered: person and vehicle re-ID. We collected and annotated two challenging real-world target datasets: AlicePerson and AliceVehicle, captured under various illuminations, image resolutions, etc. As an important feature of our real target, the clusterability of its training set is not manually guaranteed to make it closer to a real domain adaptation test scenario. Correspondingly, we reuse existing PersonX and VehicleX as synthetic source domains. The primary goal is to train models from synthetic data that can work effectively in the real world. In this paper, we detail the settings of Alice benchmarks, provide an analysis of existing commonly-used domain adaptation methods, and discuss some interesting future directions. An online server will be set up for the community to evaluate methods conveniently and fairly.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vkkHqoerLV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17520,
    "title": "ModernTCN: A Modern Pure Convolution Structure for General Time Series Analysis",
    "authors": [
      "Luo donghao",
      "wang xue"
    ],
    "abstract": "Recently, Transformer-based and MLP-based models have emerged rapidly and won dominance in time series analysis. In contrast, convolution is losing steam in time series tasks nowadays for inferior performance. This paper studies the open question of how to better use convolution in time series analysis and makes efforts to bring convolution back to the arena of time series analysis. To this end, we modernize the traditional TCN and conduct time series related modifications to make it more suitable for time series tasks. As the outcome, we propose ModernTCN and successfully solve this open question through a seldom-explored way in time series community. As a pure convolution structure, ModernTCN still achieves the consistent state-of-the-art performance on five mainstream time series analysis tasks (long-term and short-term forecasting, imputation, classification and anomaly detection) while maintaining the efficiency advantage of convolution-based models, therefore providing a better balance of efficiency and performance than state-of-the-art Transformer-based and MLP-based models. Our study further reveals that, compared with previous convolution-based models, our ModernTCN has much larger effective receptive fields (ERFs), therefore can better unleash the potential of convolution in time series analysis. The code will be publicly available.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=vpJMJerXHU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17521,
    "title": "From Bricks to Bridges: Product of Invariances to Enhance Latent Space Communication",
    "authors": [
      "Irene Cannistraci",
      "Luca Moschella",
      "Marco Fumero",
      "Valentino Maiorca",
      "Emanuele Rodol\u00e0"
    ],
    "abstract": "It has been observed that representations learned by distinct neural networks conceal structural similarities when the models are trained under similar inductive biases. From a geometric perspective, identifying the classes of transformations and the related invariances that connect these representations is fundamental to unlocking applications, such as merging, stitching, and reusing different neural modules. However, estimating task-specific transformations a priori can be challenging and expensive due to several factors (e.g., weights initialization, training hyperparameters, or data modality). To this end, we introduce a versatile method to directly incorporate a set of invariances into the representations, constructing a product space of invariant components on top of the latent representations without requiring prior knowledge about the optimal invariance to infuse. We validate our solution on classification and reconstruction tasks, observing consistent latent similarity and downstream performance improvements in a zero-shot stitching setting. The experimental analysis comprises three modalities (vision, text, and graphs), twelve pretrained foundational models, eight benchmarks, and several architectures trained from scratch.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=vngVydDWft",
    "arxiv_id": "2310.01211",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17519,
    "title": "When should we prefer Decision Transformers for Offline Reinforcement Learning?",
    "authors": [
      "Prajjwal Bhargava",
      "Rohan Chitnis",
      "Alborz Geramifard",
      "Shagun Sodhani",
      "Amy Zhang"
    ],
    "abstract": "Offline reinforcement learning (RL) allows agents to learn effective, return-maximizing policies from a static dataset. Three popular algorithms for offline RL are Conservative Q-Learning (CQL), Behaviour Cloning (BC), and Decision Transformer (DT), from the class of Q-Learning, Imitation Learning, and Sequence Modeling respectively. A key open question is: which algorithm is preferred under what conditions? We study this question empirically by exploring the performance of these algorithms across the commonly used D4RL and Robomimic benchmarks. We design targeted experiments to understand their behavior concerning data suboptimality, task complexity, and stochasticity. Our key findings are: (1) DT requires more data than CQL to learn competitive policies but is more robust; (2) DT is a substantially better choice than both CQL and BC in sparse-reward and low-quality data settings; (3) DT and BC are preferable as task horizon increases, or when data is obtained from human demonstrators; and (4) CQL excels in situations characterized by the combination of high stochasticity and lower data quality. We also investigate architectural choices and scaling trends for DT on Atari and D4RL and make design/scaling recommendations. We find that scaling the amount of data for DT by 5x gives a 2.5x average score improvement on Atari.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vpV7fOFQy4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17518,
    "title": "Can Large Language Models Infer Causation from Correlation?",
    "authors": [
      "Zhijing Jin",
      "Jiarui Liu",
      "Zhiheng LYU",
      "Spencer Poff",
      "Mrinmaya Sachan",
      "Rada Mihalcea",
      "Mona T. Diab",
      "Bernhard Sch\u00f6lkopf"
    ],
    "abstract": "Causal inference is one of the hallmarks of human intelligence. While the field of CausalNLP has attracted much interest in the recent years, existing causal inference datasets in NLP primarily rely on discovering causality from empirical knowledge (e.g. commonsense knowledge). In this work, we propose the first benchmark dataset to test the pure causal inference skills of large language models (LLMs). Specifically, we formulate a novel task Corr2Cause, which takes a set of correlational statements and determines the causal relationship between the variables. We curate a large-scale dataset of more than 400K samples, on which we evaluate seventeen existing LLMs. Through our experiments, we identify a key shortcoming of LLMs in terms of their causal inference skills, and show that these models achieve almost close to random performance on the task. This shortcoming is somewhat mitigated when we try to re-purpose LLMs for this skill via finetuning, but we find that these models still fail to generalize \u2013 they can only perform causal inference in in-distribution settings when variable names and textual expressions used in the queries are similar to those in the training set, but fail in out-of-distribution settings generated by perturbing these queries. Corr2Cause is a challenging task for LLMs, and would be helpful in guiding future research on improving LLMs\u2019 pure reasoning ability and generalizability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vqIH0ObdqL",
    "arxiv_id": "2306.05836",
    "GitHub": [
      "https://github.com/causalNLP/corr2cause"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17517,
    "title": "Towards LLM4QPE: Unsupervised Pretraining of Quantum Property Estimation and A Benchmark",
    "authors": [
      "Yehui Tang",
      "Hao Xiong",
      "Nianzu Yang",
      "Tailong Xiao",
      "Junchi Yan"
    ],
    "abstract": "Estimating the properties of quantum systems such as quantum phase has been critical in addressing the essential quantum many-body problems in physics and chemistry. Deep learning models have been recently introduced to property estimation, surpassing  conventional statistical approaches. However, these methods are tailored to the specific task and quantum data at hand. It remains an open and attractive question for devising a more universal task-agnostic pre-training model for quantum property estimation. In this paper, we propose LLM4QPE, a large language model style quantum task-agnostic pre-training and finetuning paradigm that 1) performs unsupervised pretraining on diverse quantum systems with different physical conditions; 2) uses the pretrained model for supervised finetuning and delivers high performance with limited training data, on downstream tasks. It mitigates the cost for quantum data collection and speeds up convergence. Extensive experiments show the promising efficacy of LLM4QPE in various tasks including classifying quantum phases of matter on Rydberg atom model and predicting two-body correlation function on anisotropic Heisenberg model.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=vrBVFXwAmi",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17516,
    "title": "Fixed-Budget Differentially Private Best Arm Identification",
    "authors": [
      "Zhirui Chen",
      "P. N. Karthik",
      "Yeow Meng Chee",
      "Vincent Tan"
    ],
    "abstract": "We study best arm identification (BAI) in linear bandits in the fixed-budget regime under differential privacy constraints, when the arm rewards are supported on the unit interval. Given a finite budget $T$ and a privacy parameter  $\\varepsilon>0$, the goal is to minimise the error probability in finding the arm with the largest mean after $T$ sampling rounds, subject to the constraint that the policy of the decision maker satisfies a certain {\\em $\\varepsilon$-differential privacy} ($\\varepsilon$-DP) constraint. We construct a policy satisfying the $\\varepsilon$-DP constraint (called {\\sc DP-BAI}), based on the principle of {\\em maximum absolute determinants}, and derive an upper bound on its error probability. Furthermore, we derive a minimax lower bound on the error probability, and demonstrate that the lower and the upper bounds decay exponentially in $T$, with exponents in the two bounds matching order-wise in (a) the sub-optimality gaps of the arms, (b) $\\varepsilon$, and (c) the problem complexity that is expressible as the sum of two terms, one characterising the complexity of standard fixed-budget BAI (without privacy constraints), and the other accounting for the $\\varepsilon$-DP constraint. Additionally, we present some auxiliary results that contribute to the derivation of the lower bound on the error probability. These results, we posit, may be of independent interest and could prove instrumental in proving lower bounds on error probabilities in several other bandit problems.Whereas prior works provide results for BAI in the fixed-budget regime without privacy constraints or in the fixed-confidence regime with privacy constraints, our work fills the gap in the literature by providing the results for BAI in the fixed-budget regime under the $\\varepsilon$-DP constraint.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vrE2fqAInO",
    "arxiv_id": "2401.09073",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17515,
    "title": "Grokking as the transition from lazy to rich training dynamics",
    "authors": [
      "Tanishq Kumar",
      "Blake Bordelon",
      "Samuel J. Gershman",
      "Cengiz Pehlevan"
    ],
    "abstract": "We propose that the grokking phenomenon, where the train loss of a neural network decreases much earlier than its test loss, can arise due to a neural network transitioning from lazy training dynamics to a rich, feature learning regime. To illustrate this mechanism, we study the simple setting of vanilla gradient descent on a polynomial regression problem with a two layer neural network which exhibits grokking without regularization in a way that cannot be explained by existing theories. We identify sufficient statistics for the test loss of such a network, and tracking these over training reveals that grokking arises in this setting when the network first attempts to fit a kernel regression solution with its initial features, followed by late-time feature learning where a generalizing solution is identified after train loss is already low. We find that the key determinants of grokking are the rate of feature learning---which can be controlled precisely by parameters that scale the network output---and the alignment of the initial features with the target function $y(x)$. We argue this delayed generalization arises when (1) the top eigenvectors of the initial neural tangent kernel and the task labels $y(x)$ are misaligned, but (2) the dataset size is large enough so that it is possible for the network to generalize eventually, but not so large that train loss perfectly tracks test loss at all epochs, and (3) the network begins training in the lazy regime so does not learn features immediately. We conclude with evidence that this transition from lazy (linear model) to rich training (feature learning) can control grokking in more general settings, like on MNIST, one-layer Transformers, and student-teacher networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vt5mnLVIVo",
    "arxiv_id": "2310.06110",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17514,
    "title": "CoRe-GD: A Hierarchical Framework for Scalable Graph Visualization with GNNs",
    "authors": [
      "Florian Gr\u00f6tschla",
      "Jo\u00ebl Mathys",
      "Robert Veres",
      "Roger Wattenhofer"
    ],
    "abstract": "Graph Visualization, also known as Graph Drawing, aims to find geometric embeddings of graphs that optimize certain criteria. Stress is a widely used metric; stress is minimized when every pair of nodes is positioned at their shortest path distance. However, stress optimization presents computational challenges due to its inherent complexity and is usually solved using heuristics in practice. We introduce a scalable Graph Neural Network (GNN) based Graph Drawing framework with sub-quadratic runtime that can learn to optimize stress. Inspired by classical stress optimization techniques and force-directed layout algorithms, we create a coarsening hierarchy for the input graph. Beginning at the coarsest level, we iteratively refine and un-coarsen the layout, until we generate an embedding for the original graph. To enhance information propagation within the network, we propose a novel positional rewiring technique based on intermediate node positions. Our empirical evaluation demonstrates that the framework achieves state-of-the-art performance while remaining scalable.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vtyasLn4RM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17513,
    "title": "GRAPH-CONSTRAINED DIFFUSION FOR END-TO-END PATH PLANNING",
    "authors": [
      "Dingyuan Shi",
      "Yongxin Tong",
      "Zimu Zhou",
      "Ke Xu",
      "Zheng Wang",
      "Jieping Ye"
    ],
    "abstract": "Path planning underpins various applications such as transportation, logistics, and robotics.Conventionally, path planning is formulated with explicit optimization objectives such as distance or time.However, real-world data reveals that user intentions are hard-to-model, suggesting a need for data-driven path planning that implicitly incorporates the complex user intentions.In this paper, we propose GDP, a diffusion-based model for end-to-end data-driven path planning.It effectively learns path patterns via a novel diffusion process that incorporates constraints from road networks, and plans paths as conditional path generation given the origin and destination as prior evidence.GDP is the first solution that bypasses the traditional search-based frameworks, a long-standing performance bottleneck in path planning.We validate the efficacy of GDP on two real-world datasets.Our GDP beats strong baselines by 14.2% ~ 43.5% and achieves state-of-the-art performances.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vuK8MhVtuu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17512,
    "title": "Off-Policy Primal-Dual Safe Reinforcement Learning",
    "authors": [
      "Zifan Wu",
      "Bo Tang",
      "Qian Lin",
      "Chao Yu",
      "Shangqin Mao",
      "Qianlong Xie",
      "Xingxing Wang",
      "Dong Wang"
    ],
    "abstract": "Primal-dual safe RL methods commonly perform iterations between the primal update of the policy and the dual update of the Lagrange Multiplier. Such a training paradigm is highly susceptible to the error in cumulative cost estimation since this estimation serves as the key bond connecting the primal and dual update processes. We show that this problem causes significant underestimation of cost when using off-policy methods, leading to the failure to satisfy the safety constraint. To address this issue, we propose conservative policy optimization, which learns a policy in a constraint-satisfying area by considering the uncertainty in cost estimation. This improves constraint satisfaction but also potentially hinders reward maximization. We then introduce local policy convexification to help eliminate such suboptimality by gradually reducing the estimation uncertainty. We provide theoretical interpretations of the joint coupling effect of these two ingredients and further verify them by extensive experiments. Results on benchmark tasks show that our method not only achieves an asymptotic performance comparable to state-of-the-art on-policy methods while using much fewer samples, but also significantly reduces constraint violation during training. Our code is available at https://github.com/ZifanWu/CAL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vy42bYs1Wo",
    "arxiv_id": "2401.14758",
    "GitHub": [
      "https://github.com/ZifanWu/CAL"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17511,
    "title": "Are Models Biased on Text without Gender-related Language?",
    "authors": [
      "Catarina G Bel\u00e9m",
      "Preethi Seshadri",
      "Yasaman Razeghi",
      "Sameer Singh"
    ],
    "abstract": "In the large language models era, it is imperative to measure and understand how gender biases present in the training data influence model behavior.Previous works construct benchmarks around known stereotypes (e.g., occupations) and demonstrate high levels of gender bias in large language models, raising serious concerns about models exhibiting undesirable behaviors.We expand on existing literature by asking the question: \\textit{Do large language models still favor one gender over the other in non-stereotypical settings?}To tackle this question, we restrict language model evaluation to a \\textit{neutral} subset, in which sentences are free of pronounced word-gender associations. After characterizing these associations in terms of pretraining data statistics,we use them to (1) create a new benchmark with low gender-word associations, and (2) repurpose popular benchmarks in the gendered pronoun setting | WinoBias and \\Winogender |, removing pronounced gender-correlated words.Surprisingly, when testing $20+$ models (e.g., Llama-2, Pythia, and OPT) in the proposed benchmarks, we still detect critically high gender bias across all tested models. For instance, after adjusting for strong word-gender associations, we find that all models still exhibit clear gender preferences in about $60\\%$-$95\\%$ of the sentences, representing a small change (up to $5\\%$) from the original \\textit{stereotypical} setting.By demonstrating that measured bias is not necessarily due to the presence of highly gender-associated words, our work highlights important questions about bias evaluation as well as potentially underlying model biases.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=w1JanwReU6",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17510,
    "title": "MERT: Acoustic Music Understanding Model with Large-Scale Self-supervised Training",
    "authors": [
      "Yizhi LI",
      "Ruibin Yuan",
      "Ge Zhang",
      "Yinghao Ma",
      "Xingran Chen",
      "Hanzhi Yin",
      "Chenghao Xiao",
      "Chenghua Lin",
      "Anton Ragni",
      "Emmanouil Benetos",
      "Norbert Gyenge",
      "Roger Dannenberg",
      "Ruibo Liu",
      "Wenhu Chen",
      "Gus Xia",
      "Yemin Shi",
      "Wenhao Huang",
      "Zili Wang",
      "Yike Guo",
      "Jie Fu"
    ],
    "abstract": "Self-supervised learning (SSL) has recently emerged as a promising paradigm for training generalisable models on large-scale data in the fields of vision, text, and speech. Although SSL has been proven effective in speech and audio, its application to music audio has yet to be thoroughly explored. This is partially due to the distinctive challenges associated with modelling musical knowledge, particularly tonal and pitched characteristics of music.To address this research gap, we propose an acoustic **M**usic und**ER**standing model with large-scale self-supervised **T**raining (**MERT**), which incorporates teacher models to provide pseudo labels in the masked language modelling (MLM) style acoustic pre-training.In our exploration, we identified an effective combination of teacher models, which outperforms conventional speech and audio approaches in terms of performance. This combination includes an acoustic teacher based on Residual Vector Quantization - Variational AutoEncoder (RVQ-VAE) and a musical teacher based on the Constant-Q Transform (CQT). Furthermore, we explore a wide range of settings to overcome the instability in acoustic language model pre-training, which allows our designed paradigm to scale from 95M to 330M parameters.Experimental results indicate that our model can generalise and perform well on 14 music understanding tasks and attain state-of-the-art (SOTA) overall scores.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=w3YZ9MSlBu",
    "arxiv_id": "2306.00107",
    "GitHub": [
      "https://github.com/yizhilll/MERT"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17509,
    "title": "SuRe: Summarizing Retrievals using Answer Candidates for Open-domain QA of LLMs",
    "authors": [
      "Jaehyung Kim",
      "Jaehyun Nam",
      "Sangwoo Mo",
      "Jongjin Park",
      "Sang-Woo Lee",
      "Minjoon Seo",
      "Jung-Woo Ha",
      "Jinwoo Shin"
    ],
    "abstract": "Large language models (LLMs) have made significant advancements in various natural language processing tasks but face challenges such as hallucinations and integration of up-to-date knowledge, which is particularly critical for question answering (QA). While incorporating new information with the retrieval of relevant passages is a promising way to improve QA with LLMs, the existing methods often require additional fine-tuning which becomes infeasible with recent LLMs. Retrieval augmentation via prompting has the potential to address this limitation, but this direction has been limitedly explored. To this end, we design a simple yet effective framework to enhance open-domain QA (ODQA) with LLMs, based on the summarized retrieval (SuRe). SuRe helps LLMs predict more grounded answers, which are well-supported by the summarization of retrieved passages that could be viewed as an explicit rationale extracted from the retrieved passages. Specifically, SuRe first constructs summaries of the retrieved passages for each of the multiple answer candidates. Then, SuRe confirms the most plausible answer from the candidate set by evaluating the validity and ranking of the generated summaries. Experimental results on diverse ODQA benchmarks demonstrate the superiority of SuRe, with improvements of up to 4.4\\% in exact match (EM) and 3.9\\% in F1 score over standard prompting approaches. SuRe also can be integrated with a broad range of retrieval methods and LLMs. Finally, the generated summaries from SuRe show additional advantages to measure the importance of retrieved passages and serve as more preferred rationales by models and humans.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=w4DW6qkRmt",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17507,
    "title": "Reverse Forward Curriculum Learning for Extreme Sample and Demo Efficiency",
    "authors": [
      "Stone Tao",
      "Arth Shukla",
      "Tse-kai Chan",
      "Hao Su"
    ],
    "abstract": "Reinforcement learning (RL) presents a promising framework to learn policies through environment interaction, but often requires an infeasible amount of interaction data to solve complex tasks from sparse rewards. One direction includes augmenting RL with offline data demonstrating desired tasks, but past work often require a lot of high-quality demonstration data that is difficult to obtain, especially for domains such as robotics. Our approach consists of a reverse curriculum followed by a forward curriculum. Unique to our approach compared to past work is the ability to efficiently leverage more than one demonstration via a per-demonstration reverse curriculum generated via state resets. The result of our reverse curriculum is an initial policy that performs well on a narrow initial state distribution and helps overcome difficult exploration problems. A forward curriculum is then used to accelerate the training of the initial policy to perform well on the full initial state distribution of the task and improve demonstration and sample efficiency. We show how the combination of a reverse curriculum and forward curriculum in our method, RFCL, enables significant improvements in demonstration and sample efficiency compared against various state-of-the-art learning-from-demonstration baselines, even solving previously unsolvable tasks that require high precision and control. Website with code and visualizations are here: https://reverseforward-cl.github.io/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=w4rODxXsmM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17506,
    "title": "Independent-Set Design of Experiments for Estimating Treatment and Spillover Effects under Network Interference",
    "authors": [
      "Chencheng Cai",
      "Xu Zhang",
      "Edoardo Airoldi"
    ],
    "abstract": "Interference is ubiquitous when conducting causal experiments over social networks. Except for certain network structures, causal inference on the network in the presence of interference is difficult due to the entanglement between the treatment assignments and the interference levels. In this article, we conduct causal inference under interference on an observed, sparse but connected network, and we propose a novel design of experiments based on an independent set. Compared to conventional designs, the independent-set design focuses on an independent subset of data and controls their interference exposures through the assignments to the rest (auxiliary set). The independent-set design enhances the performance of causal estimators by trading sample quantity for sample quality. We show the capacity of our approach for various causal inference tasks, justify its superiority over conventional methods, and illustrate the empirical performance through simulations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=w50MQ9Vfty",
    "arxiv_id": "2312.04026",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17505,
    "title": "Geometry-Aware Projective Mapping for Unbounded Neural Radiance Fields",
    "authors": [
      "Junoh Lee",
      "Hyunjun Jung",
      "Jin-Hwi Park",
      "Inhwan Bae",
      "Hae-Gon Jeon"
    ],
    "abstract": "Estimating neural radiance fields (NeRFs) is able to generate novel views of a scene from known imagery. Recent approaches have afforded dramatic progress on small bounded regions of the scene. For an unbounded scene where cameras point in any direction and contents exist at any distance, certain mapping functions are used to represent it within a bounded space, yet they either work in object-centric scenes or focus on objects close to the camera. The goal of this paper is to understand how to design a proper mapping function that considers per-scene optimization, which remains unexplored. We first present a geometric understanding of existing mapping functions that express the relation between the bounded and unbounded scenes. Here, we exploit a stereographic projection method to explain failures of the mapping functions, where input ray samples are too sparse to account for scene geometry in unbounded regions. To overcome the failures, we propose a novel mapping function based on a $p$-norm distance, allowing to adaptively sample the rays by adjusting the $p$-value according to scene geometry, even in unbounded regions. To take the advantage of our mapping function, we also introduce a new ray parameterization to properly allocate ray samples in the geometry of unbounded regions. Through the incorporation of both the novel mapping function and the ray parameterization within existing NeRF frameworks, our method achieves state-of-the-art novel view synthesis results on a variety of challenging datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=w7BwaDHppp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17504,
    "title": "Linearity of Relation Decoding in Transformer Language Models",
    "authors": [
      "Evan Hernandez",
      "Arnab Sen Sharma",
      "Tal Haklay",
      "Kevin Meng",
      "Martin Wattenberg",
      "Jacob Andreas",
      "Yonatan Belinkov",
      "David Bau"
    ],
    "abstract": "Much of the knowledge encoded in transformer language models (LMs) may be expressed in terms of relations: relations between words and their synonyms, entities and their attributes, etc. We show that, for a subset of relations, this computation is well-approximated by a single linear transformation on the subject representation. Linear relation representations may be obtained by constructing a first-order approximation to the LM from a single prompt, and they exist for a variety of factual, commonsense, and linguistic relations. However, we also identify many cases in which LM predictions capture relational knowledge accurately, but this knowledge is not linearly encoded in their representations. Our results thus reveal a simple, interpretable, but heterogeneously deployed knowledge representation strategy in transformer LMs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=w7LU2s14kE",
    "arxiv_id": "2308.09124",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17503,
    "title": "Remote Sensing Vision-Language Foundation Models without Annotations via Ground Remote Alignment",
    "authors": [
      "Utkarsh Mall",
      "Cheng Perng Phoo",
      "Meilin Kelsey Liu",
      "Carl Vondrick",
      "Bharath Hariharan",
      "Kavita Bala"
    ],
    "abstract": "We introduce a method to train vision-language models for remote-sensing images without using any textual annotations. Our key insight is to use co-located internet imagery taken on the ground as an intermediary for connecting remote-sensing images and language.  Specifically, we train an image encoder for remote sensing images to align with the image encoder of CLIP using a large amount of paired internet and satellite images.  Our unsupervised approach enables the training of a first-of-its-kind large scale VLM for remote sensing images at two different resolutions. We show that these VLMs enable zero-shot, open-vocabulary image classification, retrieval, segmentation and visual question answering for satellite images. On each of these tasks, our VLM trained without textual annotations outperforms existing VLMs trained with supervision, with gains of up to 20\\% for classification and 80\\% for segmentation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=w9tc699w3Z",
    "arxiv_id": "2312.06960",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17502,
    "title": "On the Hardness of Constrained Cooperative Multi-Agent Reinforcement Learning",
    "authors": [
      "Ziyi Chen",
      "Yi Zhou",
      "Heng Huang"
    ],
    "abstract": "Constrained cooperative multi-agent reinforcement learning (MARL) is an emerging learning framework that has been widely applied to manage multi-agent systems, and many primal-dual type algorithms have been developed for it. However, the convergence of primal-dual algorithms crucially relies on strong duality -- a condition that has not been formally proved in constrained cooperative MARL. In this work, we prove that strong duality fails to hold in constrained cooperative MARL, by revealing a nonconvex quadratic type constraint on the occupation measure induced by the product policy. Consequently, our reanalysis of the primal-dual algorithm shows that its convergence rate is hindered by the nonzero duality gap. Then, we propose a decentralized primal approach for constrained cooperative MARL to avoid the duality gap, and our analysis shows that its convergence is hindered by another gap induced by the advantage functions. Moreover, we compare these two types of algorithms via concrete examples, and show that neither of them always outperforms the other one. Our study reveals that constrained cooperative MARL is generally a challenging and highly nonconvex problem, and its fundamental structure is very different from that of single-agent constrained RL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wFWuX1Fhtj",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17501,
    "title": "Causal Inference with Conditional Front-Door Adjustment and Identifiable Variational Autoencoder",
    "authors": [
      "Ziqi Xu",
      "Debo Cheng",
      "Jiuyong Li",
      "Jixue Liu",
      "Lin Liu",
      "Kui Yu"
    ],
    "abstract": "An essential and challenging problem in causal inference is causal effect estimation from observational data. The problem becomes more difficult with the presence of unobserved confounding variables. The front-door adjustment is a practical approach for dealing with unobserved confounding variables. However, the restriction for the standard front-door adjustment is difficult to satisfy in practice. In this paper, we relax some of the restrictions by proposing the concept of conditional front-door (CFD) adjustment and develop the theorem that guarantees the causal effect identifiability of CFD adjustment. Furthermore, as it is often impossible for a CFD variable to be given in practice, it is desirable to learn it from data. By leveraging the ability of deep generative models, we propose CFDiVAE to learn the representation of the CFD adjustment variable directly from data with the identifiable Variational AutoEncoder and formally prove the model identifiability. Extensive experiments on synthetic datasets validate the effectiveness of CFDiVAE and its superiority over existing methods. The experiments also show that the performance of CFDiVAE is less sensitive to the causal strength of unobserved confounding variables. We further apply CFDiVAE to a real-world dataset to demonstrate its potential application.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wFf9m4v7oC",
    "arxiv_id": "2310.01937",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17500,
    "title": "Score-based generative models break the curse of dimensionality in learning a family of sub-Gaussian distributions",
    "authors": [
      "Frank Cole",
      "Yulong Lu"
    ],
    "abstract": "While score-based generative models (SGMs) have achieved remarkable successes in enormous image generation tasks, their mathematical foundations are still limited. In this paper, we analyze the approximation and generalization of SGMs in learning a family of sub-Gaussian probability distributions. We introduce a measure of complexity for probability distributions in terms of their relative density with respect to the standard Gaussian measure. We prove that if the log-relative density can be locally approximated by a neural network whose parameters can be suitably bounded, then the distribution generated by empirical score matching approximates the target distribution in total variation with a dimension-independent rate. We illustrate our theory through examples, which include certain mixtures of Gaussians. An essential ingredient of our proof is to derive a dimension-free deep network approximation rate for the true score function associated to the forward process, which is interesting in its own right.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wG12xUSqrI",
    "arxiv_id": "2402.08082",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17499,
    "title": "YaRN: Efficient Context Window Extension of Large Language Models",
    "authors": [
      "Bowen Peng",
      "Jeffrey Quesnelle",
      "Honglu Fan",
      "Enrico Shippole"
    ],
    "abstract": "Rotary Position Embeddings (RoPE) have been shown to effectively encode positional information in transformer-based language models. However, these models fail to generalize past the sequence length they were trained on. We present YaRN (Yet another RoPE extensioN method), a compute-efficient method to extend the context window of such models, requiring 10x less tokens and 2.5x less training steps than previous methods. Using YaRN, we show that LLaMA models can effectively utilize and extrapolate to context lengths much longer than their original pre-training would allow, while also surpassing previous the state-of-the-art at context window extension. In addition, we demonstrate that YaRN exhibits the capability to extrapolate beyond the limited context of a fine-tuning dataset. The models fine-tuned using YaRN has been made available and reproduced online up to 128k context length.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wHBfxhZu1u",
    "arxiv_id": "2309.00071",
    "GitHub": [
      "https://github.com/jquesnelle/yarn"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17498,
    "title": "BarLeRIa: An Efficient Tuning Framework for Referring Image Segmentation",
    "authors": [
      "Yaoming Wang",
      "Jin Li",
      "XIAOPENG ZHANG",
      "Bowen Shi",
      "Chenglin Li",
      "Wenrui Dai",
      "Hongkai Xiong",
      "Qi Tian"
    ],
    "abstract": "Pre-training followed by full fine-tuning has gradually been substituted by Parameter-Efficient Tuning (PET) in the field of computer vision tasks. PET has gained popularity, especially in the context of large-scale models, due to its ability to reduce transfer learning costs and conserve hardware resources. However, existing PET approaches primarily focus on recognition tasks and typically support uni-modal optimization, neglecting dense prediction tasks and vision language interactions. To address this limitation, we propose a novel PET framework called Bi-directional Intertwined Vision Language Efficient Tuning for Referring Image Segmentation (BarLeRIa), which leverages bi-directional intertwined vision language adapters to fully exploit the frozen pre-trained models' potential in cross-modal dense prediction tasks. In BarLeRIa, two different tuning modules are employed for efficient global and local attention, as well as an intertwined vision language tuning algorithm for efficient modal fusion. Extensive experiments conducted on challenging RefCOCO-related benchmarks demonstrating the superiority of BarLeRIa over prior PET methods with a significant margin, \\emph{i.e.}, achieving an average improvement of 5.6\\%. Remarkably, without requiring additional training datasets, BarLeRIa even surpasses SOTA full fine-tuning approaches.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=wHLDHRkmEu",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17497,
    "title": "Learning No-Regret Sparse Generalized Linear Models with Varying Observation(s)",
    "authors": [
      "Diyang Li",
      "Charles Ling",
      "zhiqiang xu",
      "Huan Xiong",
      "Bin Gu"
    ],
    "abstract": "Generalized Linear Models (GLMs) encompass a wide array of regression and classification models, where prediction is a function of a linear combination of the input variables. Often in real-world scenarios, a number of observations would be added into or removed from the existing training dataset, necessitating the development of learning systems that can efficiently train optimal models with varying observations in an online (sequential) manner instead of retraining from scratch. Despite the significance of data-varying scenarios, most existing approaches to sparse GLMs concentrate on offline batch updates, leaving online solutions largely underexplored. In this work, we present the first algorithm without compromising accuracy for GLMs regularized by sparsity-enforcing penalties trained on varying observations. Our methodology is capable of handling the addition and deletion of observations simultaneously, while adaptively updating data-dependent regularization parameters to ensure the best statistical performance. Specifically, we recast sparse GLMs as a bilevel optimization objective upon varying observations and characterize it as an explicit gradient flow in the underlying space for the inner and outer subproblems we are optimizing over, respectively. We further derive a set of rules to ensure a proper transition at regions of non-smoothness, and establish the guarantees of theoretical consistency and finite convergence. Encouraging results are exhibited on real-world benchmarks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=wISvONp3Kq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17495,
    "title": "STARC: A General Framework For Quantifying Differences Between Reward Functions",
    "authors": [
      "Joar Max Viktor Skalse",
      "Lucy Farnik",
      "Sumeet Ramesh Motwani",
      "Erik Jenner",
      "Adam Gleave",
      "Alessandro Abate"
    ],
    "abstract": "In order to solve a task using reinforcement learning, it is necessary to first formalise the goal of that task as a *reward function*. However, for many real-world tasks, it is very difficult to manually specify a reward function that never incentivises undesirable behaviour. As a result, it is increasingly popular to use *reward learning algorithms*, which attempt to *learn* a reward function from data.  However, the theoretical foundations of reward learning are not yet well-developed. In particular, it is typically not known when a given reward learning algorithm with high probability will learn a reward function that is safe to optimise. This means that reward learning algorithms generally must be evaluated empirically, which is expensive, and that their failure modes are difficult to predict in advance. One of the roadblocks to deriving better theoretical guarantees is the lack of good methods for *quantifying* the difference between reward functions. In this paper we provide a solution to this problem, in the form of a class of pseudometrics on the space of all reward functions that we call STARC (STAndardised Reward Comparison) metrics. We show that STARC metrics induce both an upper and a lower bound on worst-case regret, which implies that our metrics are tight, and that any metric with the same properties must be bilipschitz equivalent to ours. Moreover, we also identify a number of issues with reward metrics proposed by earlier works. Finally, we evaluate our metrics empirically, to demonstrate their practical efficacy. STARC metrics can be used to make both theoretical and empirical analysis of reward learning algorithms both easier and more principled.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wPhbtwlCDa",
    "arxiv_id": "2309.15257",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17494,
    "title": "AutoVP: An Automated Visual Prompting Framework and Benchmark",
    "authors": [
      "Hsi-Ai Tsao",
      "Lei Hsiung",
      "Pin-Yu Chen",
      "Sijia Liu",
      "Tsung-Yi Ho"
    ],
    "abstract": "Visual prompting (VP) is an emerging parameter-efficient fine-tuning approach to adapting pre-trained vision models to solve various downstream image-classification tasks. However, there has hitherto been little systematic study of the design space of VP and no clear benchmark for evaluating its performance. To bridge this gap, we propose AutoVP, an end-to-end expandable framework for automating VP design choices, along with 12 downstream image-classification tasks that can serve as a holistic VP-performance benchmark. Our design space covers 1) the joint optimization of the prompts; 2) the selection of pre-trained models, including image classifiers and text-image encoders; and 3) model output mapping strategies, including nonparametric and trainable label mapping. Our extensive experimental results show that AutoVP outperforms the best-known current VP methods by a substantial margin, having up to 6.7% improvement in accuracy; and attains a maximum performance increase of 27.5% compared to linear-probing (LP) baseline. AutoVP thus makes a two-fold contribution: serving both as an efficient tool for hyperparameter tuning on VP design choices, and as a comprehensive benchmark that can reasonably be expected to accelerate VP\u2019s development.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wR9qVlPh0P",
    "arxiv_id": "2310.08381",
    "GitHub": [
      "https://github.com/IBM/AutoVP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17493,
    "title": "MVSFormer++: Revealing the Devil in Transformer's Details for Multi-View Stereo",
    "authors": [
      "Chenjie Cao",
      "Xinlin Ren",
      "Yanwei Fu"
    ],
    "abstract": "Recent advancements in learning-based Multi-View Stereo (MVS) methods have prominently featured transformer-based models with attention mechanisms. However, existing approaches have not thoroughly investigated the profound influence of transformers on different MVS modules, resulting in limited depth estimation capabilities. In this paper, we introduce MVSFormer++, a method that prudently maximizes the inherent characteristics of attention to enhance various components of the MVS pipeline. Formally, our approach involves infusing cross-view information into the pre-trained DINOv2 model to facilitate MVS learning. Furthermore, we employ different attention mechanisms for the feature encoder and cost volume regularization, focusing on feature and spatial aggregations respectively. Additionally, we uncover that some design details would substantially impact the performance of transformer modules in MVS, including normalized 3D positional encoding, adaptive attention scaling, and the position of layer normalization. Comprehensive experiments on DTU, Tanks-and-Temples, BlendedMVS, and ETH3D validate the effectiveness of the proposed method. Notably, MVSFormer++ achieves state-of-the-art performance on the challenging DTU and Tanks-and-Temples benchmarks. Codes and models are available at https://github.com/maybeLx/MVSFormerPlusPlus.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wXWfvSpYHh",
    "arxiv_id": "2401.11673",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17492,
    "title": "CLEX: Continuous  Length Extrapolation for Large Language Models",
    "authors": [
      "Guanzheng Chen",
      "Xin Li",
      "Zaiqiao Meng",
      "Shangsong Liang",
      "Lidong Bing"
    ],
    "abstract": "Transformer-based Large Language Models (LLMs) are pioneering advances in many natural language processing tasks, however, their exceptional capabilities are restricted within the preset context window of Transformer. Position Embedding (PE) scaling methods, while effective in extending the context window to a specific length, demonstrate either notable limitations in their extrapolation abilities or sacrificing partial performance within the context window. Length extrapolation methods, although theoretically capable of extending the context window beyond the training sequence length, often underperform in practical long-context applications. To address these challenges, we propose Continuous Length EXtrapolation (CLEX) for LLMs. We generalise the PE scaling approaches to model the continuous dynamics by ordinary differential equations over the length scaling factor, thereby overcoming the constraints of current PE scaling methods designed for specific lengths. Moreover, by extending the dynamics to desired context lengths beyond the training sequence length, CLEX facilitates the length extrapolation with impressive performance in practical tasks. We demonstrate that CLEX can be seamlessly incorporated into LLMs equipped with Rotary Position Embedding, such as LLaMA and GPT-NeoX, with negligible impact on training and inference latency. Experimental results reveal that CLEX can effectively extend the context window to over 4x training length, with no deterioration in performance. Furthermore, when evaluated on the practical LongBench benchmark, our model trained on a 4k length exhibits competitive performance against state-of-the-art open-source models trained on context lengths up to 32k.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wXpSidPpc5",
    "arxiv_id": "2310.16450",
    "GitHub": [
      "https://github.com/DAMO-NLP-SG/CLEX"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17491,
    "title": "Benign Oscillation of Stochastic Gradient Descent with Large Learning Rate",
    "authors": [
      "Miao Lu",
      "Beining Wu",
      "Xiaodong Yang",
      "Difan Zou"
    ],
    "abstract": "In this work, we theoretically investigate the generalization property of neural networks (NN) trained by stochastic gradient descent (SGD) with \\emph{large learning rate}. Under such a training regime, our finding is that, the oscillation of the NN weights caused by SGD with large learning rates turns out to be beneficial to generalization, potentially improving over the same NN trained by SGD with small learning rates that converges more smoothly. In view of the findings, we call such a phenomenon \u201cbenign oscillation\u201d. Our theory towards demystifying such a phenomenon builds upon the feature learning perspective of deep learning. Specifically, we consider a feature-noise data generation model that consists of (i) weak features which have a small $\\ell_2$-norm and appear in each data point; (ii) strong features which have a large $\\ell_2$-norm but appear only in a certain fraction of all data points; and (iii) noise. We prove that NNs trained by oscillating SGD with a large learning rate can effectively learn the weak features in the presence of those strong features. In contrast, NNs trained by SGD with a small learning rate only learn the strong features but make little progress in learning the weak features. Consequently, when it comes to the new testing data points that consist of only weak features, the NN trained by oscillating SGD with large learning rates can still make correct predictions, while the NN trained by SGD with small learning rates could not. Our theory sheds light on how large learning rate training benefits the generalization of NNs. Experimental results demonstrate our  findings on the phenomenon of \u201cbenign oscillation\".",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wYmvN3sQpG",
    "arxiv_id": "2310.17074",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17490,
    "title": "Mixture of Weak and Strong Experts on Graphs",
    "authors": [
      "Hanqing Zeng",
      "Hanjia Lyu",
      "Diyi Hu",
      "Yinglong Xia",
      "Jiebo Luo"
    ],
    "abstract": "Realistic graphs contain both rich self-features and informative neighborhood structures, jointly handled by a GNN in the typical setup. We propose to decouple the two modalities by mixture of weak and strong experts (Mowst), where the weak expert is a light-weight Multi-layer Perceptron (MLP) , and the strong expert is an off-the-shelf Graph Neural Network (GNN). To adapt the experts' collaboration to different target nodes, we propose a \"confidence\" mechanism based on the dispersion of the weak expert's prediction logits. The strong expert is conditionally activated in the low-confidence region when either the node's classification relies on neighborhood information, or the weak expert has low model quality. We reveal interesting training dynamics by analyzing the influence of the confidence function on loss: our training algorithm encourages specialization of each expert by effectively generating a soft splitting of the graph. In addition, our \"confidence\" design imposes a desirable bias towards the strong expert to benefit from the better generalization capability of GNNs. Mowst is easy to optimize and achieves strong expressive power, with computation cost comparable to a single GNN. Empirically, Mowst shows significant accuracy improvement on 6 standard node classification benchmarks (including both homophilous and heterophilous graphs).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wYvuY60SdD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17553,
    "title": "AutomaTikZ: Text-Guided Synthesis of Scientific Vector Graphics with TikZ",
    "authors": [
      "Jonas Belouadi",
      "Anne Lauscher",
      "Steffen Eger"
    ],
    "abstract": "Generating bitmap graphics from text has gained considerable attention, yet for scientific figures, vector graphics are often preferred. Given that vector graphics are typically encoded using low-level graphics primitives, generating them directly is difficult. To address this, we propose the use of TikZ, a well-known abstract graphics language that can be compiled to vector graphics, as an intermediate representation of scientific figures. TikZ offers human-oriented, high-level commands, thereby facilitating conditional language modeling with any large language model. To this end, we introduce DaTikZ the first large-scale TikZ dataset, consisting of 120k TikZ drawings aligned with captions. We fine-tune LLaMA on DaTikZ, as well as our new model CLiMA, which augments LLaMA with multimodal CLIP embeddings. In both human and automatic evaluation, CLiMA and LLaMA outperform commercial GPT-4 and Claude 2 in terms of similarity to human-created figures, with CLiMA additionally improving text-image alignment. Our detailed analysis shows that all models generalize well and are not susceptible to memorization. GPT-4 and Claude 2, however, tend to generate more simplistic figures compared to both humans and our models. We make our framework, AutomaTikZ, along with model weights and datasets, publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=v3K5TVP8kZ",
    "arxiv_id": "2310.00367",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17489,
    "title": "Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations",
    "authors": [
      "Yongyuan Liang",
      "Yanchao Sun",
      "Ruijie Zheng",
      "Xiangyu Liu",
      "Benjamin Eysenbach",
      "Tuomas Sandholm",
      "Furong Huang",
      "Stephen Marcus McAleer"
    ],
    "abstract": "Deploying reinforcement learning (RL) systems requires robustness to uncertainty and model misspecification, yet prior robust RL methods typically only study noise introduced independently across time. However, practical sources of uncertainty are usually coupled across time.We formally introduce temporally-coupled perturbations, presenting a novel challenge for existing robust RL methods. To tackle this challenge, we propose GRAD, a novel game-theoretic approach that treats the temporally-coupled robust RL problem as a partially-observable two-player zero-sum game. By finding an approximate equilibrium within this game, GRAD optimizes for general robustness against temporally-coupled perturbations. Experiments on continuous control tasks demonstrate that, compared with prior methods, our approach achieves a higher degree of robustness to various types of attacks on different attack domains, both in settings with temporally-coupled perturbations and decoupled perturbations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wZWTHU7AsQ",
    "arxiv_id": "2307.12062",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17488,
    "title": "Counterfactual Density Estimation using Kernel Stein Discrepancies",
    "authors": [
      "Diego Martinez-Taboada",
      "Edward Kennedy"
    ],
    "abstract": "Causal effects are usually studied in terms of the means of counterfactual distributions, which may be insufficient in many scenarios. Given a class of densities known up to normalizing constants, we propose to model counterfactual distributions by minimizing kernel Stein discrepancies in a doubly robust manner. This enables the estimation of counterfactuals over large classes of distributions while exploiting the desired double robustness. We present a theoretical analysis of the proposed estimator, providing sufficient conditions for consistency and asymptotic normality, as well as an examination of its empirical performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wZXlEFO3tZ",
    "arxiv_id": "2309.16129",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17486,
    "title": "Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND",
    "authors": [
      "Qiyu Kang",
      "Kai Zhao",
      "Qinxu Ding",
      "Feng Ji",
      "Xuhao Li",
      "Wenfei Liang",
      "Yang Song",
      "Wee Peng Tay"
    ],
    "abstract": "We introduce the FRactional-Order graph Neural Dynamical network (FROND), a learning framework that extends traditional graph neural ordinary differential equation (ODE) models by incorporating the time-fractional Caputo derivative. Due to its non-local nature, fractional calculus allows our framework to capture long-term memories in the feature updating process, in contrast to the Markovian nature of updates in traditional graph neural ODE models. This can lead to improved graph representation learning.We offer an interpretation of the feature updating process on graphs from a non-Markovian random walk perspective when the feature updating is governed by a diffusion process. We demonstrate analytically that over-smoothing can be mitigated in this setting.To experimentally demonstrate the versatility of the FROND framework, we evaluate the fractional counterparts of various established graph ODE models. Their consistently superior performance, compared to their original counterparts, highlights the potential of the FROND framework as an effective extension to boost the efficacy of various graph neural ODE models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=wcka3bd7P4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17485,
    "title": "Robust Classification via Regression for Learning with Noisy Labels",
    "authors": [
      "Erik Englesson",
      "Hossein Azizpour"
    ],
    "abstract": "Deep neural networks and large-scale datasets have revolutionized the field of machine learning. However, these large networks are susceptible to overfitting to label noise, resulting in reduced generalization. To address this challenge, two promising approaches have emerged: i) loss reweighting, which reduces the influence of noisy examples on the training loss, and ii) label correction that replaces noisy labels with estimated true labels. These directions have been pursued separately or combined as independent methods, lacking a unified approach. In this work, we present a unified method that seamlessly combines loss reweighting and label correction to enhance robustness against label noise in classification tasks. Specifically, by leveraging ideas from compositional data analysis in statistics, we frame the problem as a regression task, where loss reweighting and label correction can naturally be achieved with a shifted Gaussian label noise model. Our unified approach achieves strong performance compared to recent baselines on several noisy labeled datasets. We believe this work is a promising step towards robust deep learning in the presence of label noise.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wfgZc3IMqo",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17487,
    "title": "Uni3D: Exploring Unified 3D Representation at Scale",
    "authors": [
      "Junsheng Zhou",
      "Jinsheng Wang",
      "Baorui Ma",
      "Yu-Shen Liu",
      "Tiejun Huang",
      "Xinlong Wang"
    ],
    "abstract": "Scaling up representations for images or text has been extensively investigated in the past few years and has led to revolutions in learning vision and language. However, scalable representation for 3D objects and scenes is relatively unexplored. In this work, we present Uni3D, a 3D foundation model to explore the unified 3D representation at scale. Uni3D uses a 2D initialized ViT end-to-end pretrained to align the 3D point cloud features with the image-text aligned features. Via the simple architecture and pretext task, Uni3D can leverage abundant 2D pretrained models as initialization and image-text aligned models as the target, unlocking the great potential of 2D model zoos and scaling-up strategies to the 3D world. We efficiently scale up Uni3D to one billion parameters, and set new records on a broad range of 3D tasks, such as zero-shot classification, few-shot classification, open-world understanding and zero-shot part segmentation.  We show that the strong Uni3D representation also enables applications such as 3D painting and retrieval in the wild. We believe that Uni3D provides a new direction for exploring both scaling up and efficiency of the representation in 3D domain.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=wcaE4Dfgt8",
    "arxiv_id": "2310.06773",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17484,
    "title": "Navigating Text-To-Image Customization: From LyCORIS Fine-Tuning to Model Evaluation",
    "authors": [
      "SHIH-YING YEH",
      "Yu-Guan Hsieh",
      "Zhidong Gao",
      "Bernard B W Yang",
      "Giyeong Oh",
      "Yanmin Gong"
    ],
    "abstract": "Text-to-image generative models have garnered immense attention for their ability to produce high-fidelity images from text prompts.  Among these, Stable Diffusion distinguishes itself as a leading open-source model in this fast-growing field.  However, the intricacies of fine-tuning these models pose multiple challenges from new methodology integration to systematic evaluation.  Addressing these issues, this paper introduces LyCORIS (Lora beYond Conventional methods, Other Rank adaptation Implementations for Stable diffusion), an open-source library that offers a wide selection of fine-tuning methodologies for Stable Diffusion.  Furthermore, we present a thorough framework for the systematic assessment of varied fine-tuning techniques. This framework employs a diverse suite of metrics and delves into multiple facets of fine-tuning, including hyperparameter adjustments and the evaluation with different prompt types across various concept categories. Through this comprehensive approach, our work provides essential insights into the nuanced effects of fine-tuning parameters, bridging the gap between state-of-the-art research and practical application.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wfzXa8e783",
    "arxiv_id": "2309.14859",
    "GitHub": [
      "https://github.com/KohakuBlueleaf/LyCORIS]"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17483,
    "title": "$\\texttt{NAISR}$: A 3D Neural Additive Model for Interpretable Shape Representation",
    "authors": [
      "Yining Jiao",
      "Carlton Jude ZDANSKI",
      "Julia S Kimbell",
      "Andrew Prince",
      "Cameron P Worden",
      "Samuel Kirse",
      "Christopher Rutter",
      "Benjamin Shields",
      "William Alexander Dunn",
      "Jisan Mahmud",
      "Marc Niethammer"
    ],
    "abstract": "Deep implicit functions (DIFs) have emerged as a powerful paradigm for many computer vision tasks such as 3D shape reconstruction, generation, registration, completion, editing, and understanding. However, given a set of 3D shapes with associated covariates there is at present no shape representation method which allows to precisely represent the shapes while capturing the individual dependencies on each covariate. Such a method would be of high utility to researchers to discover knowledge hidden in a population of shapes. For scientific shape discovery purpose, we propose a 3D Neural Additive Model for Interpretable Shape Representation ($\\texttt{NAISR}$) which describes individual shapes by deforming a shape atlas in accordance to the effect of disentangled covariates. Our approach captures shape population trends and allows for patient-specific predictions through shape transfer. $\\texttt{NAISR}$ is the first approach to combine the benefits of deep implicit shape representations with an atlas deforming according to specified covariates. We evaluate $\\texttt{NAISR}$ with respect to shape reconstruction, shape disentanglement, shape evolution, and shape transfer on three datasets, i.e. 1) $\\textit{Starman}$, a simulated 2D shape dataset; 2) ADNI hippocampus 3D shape dataset; 3) pediatric airway 3D shape dataset. Our experiments demonstrate that $\\texttt{NAISR}$ achieves competitive shape reconstruction performance while retaining interpretability.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=wg8NPfeMF9",
    "arxiv_id": "2303.09234",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17557,
    "title": "Bayesian Coreset Optimization for Personalized Federated Learning",
    "authors": [
      "Prateek Chanda",
      "Shrey Modi",
      "Ganesh Ramakrishnan"
    ],
    "abstract": "In a distributed machine learning setting like Federated Learning where there are multiple clients involved which update their individual weights to a single central server, often training on the entire individual client's dataset for each client becomes cumbersome. To address this issue we propose CORESET-PFEDBAYES: a personalized coreset weighted federated learning setup where the training updates for each individual clients are forwarded to the central server based on only individual client coreset based representative data points instead of the entire client data. Through theoretical analysis we present how the average generalization error is minimax optimal up to logarithm bounds $\\mathcal{O}(n_k^{-\\frac{2 \\beta}{2 \\beta+d}} \\log ^{2 \\delta^{\\prime}}(n_k))$, where $n_k$ denotes the coreset size and how the approximation error on the data likelihood differs from a vanilla Federated Learning setup as a function $G(\\boldsymbol{w})$ of the coreset weights $\\boldsymbol{w}$. Our experiments on different benchmark datasets based on a variety of recent personalized federated learning architectures show significant gains (+4.87\\% on MNIST,  +8.61\\% on FashionMNIST, +9.71\\% on CIFAR  in terms of model accuracy across ) as compared to random sampling on the training data followed by federated learning, thereby indicating how intelligently selecting such training samples can help in performance. Additionally, through experiments on medical datasets our proposed method showcases some gains (e.g. +9.74\\% under COVID-19 dataset) as compared to  other submodular optimization based approaches used for subset selection on client's data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=uz7d2N2zul",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17482,
    "title": "LUM-ViT: Learnable Under-sampling Mask Vision Transformer for Bandwidth Limited Optical Signal Acquisition",
    "authors": [
      "Lingfeng Liu",
      "Dong Ni",
      "Hangjie Yuan"
    ],
    "abstract": "Bandwidth constraints during signal acquisition frequently impede real-time detection applications. Hyperspectral data is a notable example, whose vast volume compromises real-time hyperspectral detection. To tackle this hurdle, we introduce a novel approach leveraging pre-acquisition modulation to reduce the acquisition volume. This modulation process is governed by a deep learning model, utilizing prior information. Central to our approach is LUM-ViT, a Vision Transformer variant. Uniquely, LUM-ViT incorporates a learnable under-sampling mask tailored for pre-acquisition modulation. To further optimize for optical calculations, we propose a kernel-level weight binarization technique and a three-stage fine-tuning strategy. Our evaluations reveal that, by sampling a mere 10\\% of the original image pixels, LUM-ViT maintains the accuracy loss within 1.8\\% on the ImageNet classification task. The method sustains near-original accuracy when implemented on real-world optical hardware, demonstrating its practicality.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wkbeqr5XhC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17481,
    "title": "Scalable Diffusion for Materials Generation",
    "authors": [
      "Sherry Yang",
      "KwangHwan Cho",
      "Amil Merchant",
      "Pieter Abbeel",
      "Dale Schuurmans",
      "Igor Mordatch",
      "Ekin Dogus Cubuk"
    ],
    "abstract": "Generative models trained on internet-scale data are capable of generating novel and realistic texts, images, and videos. A natural next question is whether these models can advance science, for example by generating novel stable materials. Traditionally, models with explicit structures (e.g., graphs) have been used in modeling structural relationships in scientific data (e.g., atoms and bonds in crystals), but generating structures can be difficult to scale to large and complex systems. Another challenge in generating materials is the mismatch between standard generative modeling metrics and downstream applications. For instance, common metrics such as the reconstruction error do not correlate well with the downstream goal of discovering novel stable materials. In this work, we tackle the scalability challenge by developing a unified crystal representation that can represent any crystal structure (UniMat), followed by training a diffusion probabilistic model on these UniMat representations. Our empirical results suggest that despite the lack of explicit structure modeling, UniMat can generate high fidelity crystal structures from larger and more complex chemical systems, outperforming previous graph-based approaches under various generative modeling metrics. To better connect the generation quality of materials to downstream applications, such as discovering novel stable materials, we propose additional metrics for evaluating generative models of materials, including per-composition formation energy and stability with respect to convex hulls through decomposition energy from Density Function Theory (DFT). Lastly, we show that conditional generation with UniMat can scale to previously established crystal datasets with up to millions of crystals structures, outperforming random structure search (the current leading method for structure discovery) in discovering new stable materials.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wm4WlHoXpC",
    "arxiv_id": "2311.09235",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17480,
    "title": "Compositional Generative Inverse Design",
    "authors": [
      "Tailin Wu",
      "Takashi Maruyama",
      "Long Wei",
      "Tao Zhang",
      "Yilun Du",
      "Gianluca Iaccarino",
      "Jure Leskovec"
    ],
    "abstract": "Inverse design, where we seek to design input variables in order to optimize an underlying objective function, is an important problem that arises across fields such as mechanical engineering to aerospace engineering. Inverse design is typically formulated as an optimization problem, with recent works leveraging optimization across learned dynamics models. However, as models are optimized they tend to fall into adversarial modes, preventing effective sampling. We illustrate that by instead optimizing over the learned energy function captured by the diffusion model, we can avoid such adversarial examples and significantly improve design performance. We further illustrate how such a design system is compositional, enabling us to combine multiple different diffusion models representing subcomponents of our desired system to design systems with every specified component. In an N-body interaction task and a challenging 2D multi-airfoil design task, we demonstrate that by composing the learned diffusion model at test time, our method allows us to design initial states and boundary shapes that are more complex than those in the training data. Our method outperforms state-of-the-art neural inverse design method by an average of 41.5% in prediction MAE and 14.3% in design objective for the N-body dataset and discovers formation flying to minimize drag in the multi-airfoil design task.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=wmX0CqFSd7",
    "arxiv_id": "2401.13171",
    "GitHub": [
      "https://github.com/AI4Science-WestlakeU/cindm"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17479,
    "title": "Sparsistency for inverse optimal transport",
    "authors": [
      "Francisco Andrade",
      "Gabriel Peyr\u00e9",
      "Clarice Poon"
    ],
    "abstract": "Optimal Transport is a useful metric to compare probability distributions and to compute a pairing given a ground cost. Its entropic regularization  variant (eOT) is crucial to have fast algorithms and reflect fuzzy/noisy matchings. This work focuses on Inverse Optimal Transport (iOT), the problem of inferring the ground cost from samples drawn from a coupling that solves an eOT problem. It is a relevant problem that can be used to infer unobserved/missing links, and to obtain meaningful information about the structure of the ground cost yielding the pairing. On one side, iOT benefits from convexity, but on the other side, being ill-posed, it requires regularization to handle the sampling noise. This work presents an in-depth theoretical study of the $\\ell_1$ regularization to model for instance Euclidean costs with sparse interactions between features.  Specifically, we derive a sufficient condition for the robust recovery of the sparsity of the ground cost that can be seen as a far reaching generalization of the Lasso\u2019s celebrated ``Irrepresentability Condition\u2019\u2019. To provide additional insight into this condition (consequently on the types of recoverable costs) we work out in detail the Gaussian case. Surprisingly, varying the entropic regularizer provides evidence that the Gaussian iOT interpolates between a graphical Lasso and a classical Lasso, thereby establishing a connection between iOT and graph estimation, an important problem in ML.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wpXGPCBOTX",
    "arxiv_id": "2310.05461",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17478,
    "title": "Adaptive deep spiking neural network with global-local learning via balanced excitatory and inhibitory mechanism",
    "authors": [
      "Tingting Jiang",
      "Qi Xu",
      "Xuming Ran",
      "Jiangrong Shen",
      "Pan Lv",
      "Qiang Zhang",
      "Gang Pan"
    ],
    "abstract": "The training method of Spiking Neural Networks (SNNs) is an essential problem, and how to integrate local and global learning is a worthy research interest. However, the current integration methods do not consider the network conditions suitable for local and global learning, and thus fail to balance their advantages. In this paper, we propose an Excitation-Inhibition Mechanism-assisted Hybrid Learning(EIHL) algorithm that adjusts the network connectivity by using the excitation-inhibition mechanism and then switches between local and global learning according to the network connectivity. The experimental results on CIFAR10/100 and DVS-CIFAR10 demonstrate that the EIHL not only has better accuracy performance than other methods but also has excellent sparsity advantage. Especially, the Spiking VGG11 is trained by EIHL, STBP, and STDP on DVS_CIFAR10, respectively. The accuracy of the Spiking VGG11 model on EIHL is 62.45%, which is 4.35% higher than STBP and 11.40% higher than STDP, and the sparsity is 18.74%, which is 18.74% higher than the other two methods. Moreover, the excitation-inhibition mechanism used in our method also offers a new perspective on the field of SNN learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wpnlc2ONu0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17475,
    "title": "Consistency-guided Prompt Learning for Vision-Language Models",
    "authors": [
      "Shuvendu Roy",
      "Ali Etemad"
    ],
    "abstract": "We propose Consistency-guided Prompt learning (CoPrompt), a new fine-tuning method for vision-language models. Our approach improves the generalization of large foundation models when fine-tuned on downstream tasks in a few-shot setting. The basic idea of CoPrompt is to enforce a consistency constraint in the prediction of the trainable and pre-trained models to prevent overfitting on the downstream task. Additionally, we introduce the following two components into our consistency constraint to further boost the performance: enforcing consistency on two perturbed inputs and combining two dominant paradigms of tuning, prompting and adapter. Enforcing consistency on perturbed input serves to further regularize the consistency constraint, thereby improving generalization. Moreover, the integration of adapters and prompts not only enhances performance on downstream tasks but also offers increased tuning flexibility in both input and output spaces. This facilitates more effective adaptation to downstream tasks in a few-shot learning setting. Experiments show that CoPrompt outperforms existing methods on a range of evaluation suites, including base-to-novel generalization, domain generalization, and cross-dataset evaluation. On generalization, CoPrompt improves the state-of-the-art on zero-shot tasks and the overall harmonic mean over 11 datasets. Detailed ablation studies show the effectiveness of each of the components in CoPrompt. We make our code available at https://github.com/ShuvenduRoy/CoPrompt.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wsRXwlwx4w",
    "arxiv_id": "2306.01195",
    "GitHub": [
      "https://github.com/ShuvenduRoy/CoPrompt"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17474,
    "title": "Toward Student-oriented Teacher Network Training for Knowledge Distillation",
    "authors": [
      "Chengyu Dong",
      "Liyuan Liu",
      "Jingbo Shang"
    ],
    "abstract": "How to conduct teacher training for knowledge distillation is still an open problem. It has been widely observed that a best-performing teacher does not necessarily yield the best-performing student, suggesting a fundamental discrepancy between the current teacher training practice and the ideal teacher training strategy. To fill this gap, we explore the feasibility of training a teacher that is oriented toward student performance with empirical risk minimization (ERM). Our analyses are inspired by the recent findings that the effectiveness of knowledge distillation hinges on the teacher\u2019s capability to approximate the true label distribution of training inputs. We theoretically establish that ERM minimizer can approximate the true label distribution of training data as long as the feature extractor of the learner network is Lipschitz continuous and is robust to feature transformations. In light of our theory, we propose a teacher training method SoTeacher which incorporates Lipschitz regularization and consistency regularization into ERM. Experiments on benchmark datasets using various knowledge distillation algorithms and teacher-student pairs confirm that SoTeacher can improve student accuracy consistently.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wsWGcw6qKD",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17473,
    "title": "The Unlocking Spell on Base LLMs:  Rethinking Alignment via In-Context Learning",
    "authors": [
      "Bill Yuchen Lin",
      "Abhilasha Ravichander",
      "Ximing Lu",
      "Nouha Dziri",
      "Melanie Sclar",
      "Khyathi Chandu",
      "Chandra Bhagavatula",
      "Yejin Choi"
    ],
    "abstract": "Large language models (LLMs) have shown significant improvements due to alignment tuning, that is, supervised fine-tuning (SFT) on instruction data and reinforcement learning from human feedback (RLHF).This raises questions about what is precisely learned during the alignment tuning process.We investigate the effects of alignment tuning through the lens of  token distribution shift between untuned LLMs and their aligned counterparts (e.g., Llama-2 versus Llama-2-Chat).Our findings reveal that most distribution changes lie in stylistic tokens (e.g., transitional words, discourse markers), suggesting that LLMs primarily learn the language style of AI assistants during alignment tuning, while most of useful knowledge has been acquired by untuned LLMs. Thus, we pose the question: Is it necessary to update model weights to attain LLM alignment?Based on these insights, we propose an alternative method, Untuned LLMs with Restyled In-context Alignment (\\textsc{Urial}), which achieves effective alignment solely through in-context learning (ICL) with as few as three curated, stylistic examples.Our evaluation on diverse examples from LIMA and AlpacaEval demonstrates that \\textsc{Urial} can achieve highly satisfactory performance, sometimes equaling or surpassing SFT+RLHF counterparts, especially when the untuned LLM is sufficiently pre-trained.This implies that fine-tuning may not be as always crucial as previously assumed for LLM alignment, and lightweight alignment methods like \\textsc{Urial} hold promise for efficiently tailoring LLM behavior without fine-tuning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wxJ0eXwwda",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17472,
    "title": "ADOPD: A Large-Scale Document Page Decomposition Dataset",
    "authors": [
      "Jiuxiang Gu",
      "Xiangxi Shi",
      "Jason Kuen",
      "Lu Qi",
      "Ruiyi Zhang",
      "Anqi Liu",
      "Ani Nenkova",
      "Tong Sun"
    ],
    "abstract": "We introduce ADoPD, a large-scale document page decomposition dataset for document understanding, encompassing document entity segmentation, text detection, tagging, and captioning. ADoPD stands out with its novel document taxonomy, meticulously crafted through a data-driven approach enriched by both large-scale pretrained models and human expertise. Our dataset achieves diversity by combining outlier detection with a human-in-the-loop approach. This significant contribution advances the field of document analysis, deepening our insights into document structures and substantially enhancing document processing and analysis techniques. The amalgamation of data-driven exploration, thorough annotation, and the human-in-the-loop methodology paves the way for innovative improvements in document analysis capabilities and the advancement of document processing applications. We conduct a comprehensive evaluation of ADoPD using various methods and demonstrate its effectiveness.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=x1ptaXpOYa",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17471,
    "title": "Privacy-Preserving In-Context Learning for Large Language Models",
    "authors": [
      "Tong Wu",
      "Ashwinee Panda",
      "Jiachen T. Wang",
      "Prateek Mittal"
    ],
    "abstract": "In-context learning (ICL) is an important capability of Large Language Models (LLMs), enabling these models to dynamically adapt based on specific, in-context exemplars, thereby improving accuracy and relevance.However, LLM's responses may leak the sensitive private information contained in in-context exemplars. To address this challenge, we propose Differentially Private In-context Learning (DP-ICL), a general paradigm for privatizing ICL tasks. The key idea for DP-ICL paradigm is generating differentially private responses through a noisy consensus among an ensemble of LLM's responses based on disjoint exemplar sets. Based on the general paradigm of DP-ICL, we instantiate several techniques showing how to privatize ICL for text classification and language generation. We experiment on four text classification benchmarks and two language generation tasks, and our empirical findings suggest that our DP-ICL achieves a strong utility-privacy tradeoff.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=x4OPJ7lHVU",
    "arxiv_id": "2305.01639",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17470,
    "title": "PROGRAM: PROtotype GRAph Model based Pseudo-Label Learning for Test-Time Adaptation",
    "authors": [
      "Haopeng Sun",
      "Lumin Xu",
      "Sheng Jin",
      "Ping Luo",
      "Chen Qian",
      "Wentao Liu"
    ],
    "abstract": "Test-time adaptation (TTA) aims to adapt a pre-trained model from a source domain to a target domain only using online unlabeled target data during testing, without accessing to the source data or modifying the original training process. Among the various TTA methods, pseudo-labeling has gained popularity. However, the presence of incorrect pseudo-labels can hinder the effectiveness of target domain adaptation. To overcome this challenge, we propose a novel TTA method, called PROtotype GRAph Model based pseudo-label learning (PROGRAM). PROGRAM consists of two key components: (1) Prototype Graph Model (PGM) for reliable pseudo-label generation; (2) Robust Self-Training (RST) for test-time adaptation with noisy pseudo-labels. PGM constructs the graph using prototypes and test samples, facilitating effective message passing among them to generate more reliable pseudo-labels. RST combines the advantages of consistency regularization and pseudo-labeling to achieve robust target domain adaptation in the presence of noisy pseudo-labels. Our proposed PROGRAM can be easily integrated into existing baselines, resulting in consistent improvement. Extensive experiments show that our PROGRAM outperforms the existing TTA methods on multiple domain generalization and image corruption benchmarks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=x5LvBK43wg",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17469,
    "title": "Synaptic Weight Distributions Depend on the Geometry of Plasticity",
    "authors": [
      "Roman Pogodin",
      "Jonathan Cornford",
      "Arna Ghosh",
      "Gauthier Gidel",
      "Guillaume Lajoie",
      "Blake Aaron Richards"
    ],
    "abstract": "A growing literature in computational neuroscience leverages gradient descent and learning algorithms that approximate it to study synaptic plasticity in the brain. However, the vast majority of this work ignores a critical underlying assumption: the choice of distance for synaptic changes (i.e. the geometry of synaptic plasticity). Gradient descent assumes that the distance is Euclidean, but many other distances are possible, and there is no reason that biology necessarily uses Euclidean geometry. Here, using the theoretical tools provided by mirror descent, we show that, regardless of the loss being minimized, the distribution of synaptic weights will depend on the geometry of synaptic plasticity. We use these results to show that experimentally-observed log-normal weight distributions found in several brain areas are not consistent with standard gradient descent (i.e. a Euclidean geometry), but rather with non-Euclidean distances. Finally, we show that it should be possible to experimentally test for different synaptic geometries by comparing synaptic weight distributions before and after learning. Overall, this work shows that the current paradigm in theoretical work on synaptic plasticity that assumes Euclidean synaptic geometry may be misguided and that it should be possible to experimentally determine the true geometry of synaptic plasticity in the brain.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=x5txICnnjC",
    "arxiv_id": "2305.19394",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17468,
    "title": "Tag2Text: Guiding Vision-Language Model via Image Tagging",
    "authors": [
      "Xinyu Huang",
      "Youcai Zhang",
      "Jinyu Ma",
      "Weiwei Tian",
      "Rui Feng",
      "Yuejie Zhang",
      "Yaqian Li",
      "Yandong Guo",
      "Lei Zhang"
    ],
    "abstract": "This paper presents Tag2Text, a vision language pre-training (VLP) framework, which introduces image tagging into vision-language models to guide the learning of visual-linguistic features. In contrast to prior works which utilize object tags either manually labeled or automatically detected with a limited detector, our approach utilizes tags parsed from its paired text to learn an image tagger and meanwhile provides guidance to vision-language models. Given that, Tag2Text can utilize large-scale annotation-free image tags in accordance with image-text pairs, and provides more diverse tag categories beyond objects. Strikingly, Tag2Text showcases the ability of a foundational image tagging model, with superior zero-shot performance even comparable to full supervision manner. Moreover, by leveraging tagging guidance, Tag2Text effectively enhances the performance of vision-language models on both generation-based and alignment-based tasks. Across a wide range of downstream benchmarks, Tag2Text achieves state-of-the-art results with similar model sizes and data scales, demonstrating the efficacy of the proposed tagging guidance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=x6u2BQ7xcq",
    "arxiv_id": "2303.05657",
    "GitHub": [
      "https://github.com/xinyu1205/recognize-anything"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17467,
    "title": "A Restoration Network as an Implicit Prior",
    "authors": [
      "Yuyang Hu",
      "Mauricio Delbracio",
      "Peyman Milanfar",
      "Ulugbek Kamilov"
    ],
    "abstract": "Image denoisers have been shown to be powerful priors for solving inverse problems in imaging. In this work, we introduce a generalization of these methods that allows any image restoration network to be used as an implicit prior. The proposed method uses priors specified by deep neural networks pre-trained as general restoration operators. The method provides a principled approach for adapting state-of-the-art restoration models for other inverse problems. Our theoretical result analyzes its convergence to a stationary point of a global functional associated with the restoration operator. Numerical results show that the method using a super-resolution prior achieves state-of-the-art performance both quantitatively and qualitatively. Overall, this work offers a step forward for solving inverse problems by enabling the use of powerful pre-trained restoration models as priors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=x7d1qXEn1e",
    "arxiv_id": "2310.01391",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17465,
    "title": "On the Stability of Expressive Positional Encodings for Graphs",
    "authors": [
      "Yinan Huang",
      "William Lu",
      "Joshua Robinson",
      "Yu Yang",
      "Muhan Zhang",
      "Stefanie Jegelka",
      "Pan Li"
    ],
    "abstract": "Designing effective positional encodings for graphs is key to building powerful graph transformers and enhancing message-passing graph neural networks. Although widespread, using Laplacian eigenvectors as positional encodings faces two fundamental challenges: (1) *Non-uniqueness*: there are many different eigendecompositions of the same Laplacian, and (2) *Instability*: small perturbations to the Laplacian could result in completely different eigenspaces, leading to unpredictable changes in positional encoding.  Despite many attempts to address non-uniqueness, most methods overlook stability, leading to poor generalization on unseen graph structures. We identify the cause of instability to be the use of \"hard partition'' of eigenspaces. Hence, we introduce Stable and Expressive Positional Encodings (SPE), an architecture for processing eigenvectors that uses eigenvalues to ``softly partition'' eigenspaces. SPE is the first architecture that is (1) provably stable, and (2) universally expressive for basis invariant functions whilst respecting all symmetries of eigenvectors. Besides guaranteed stability, we prove that SPE is at least as expressive as existing methods, and highly capable of counting graph structures. Finally, we evaluate the effectiveness of our method on molecular property prediction, and out-of-distribution generalization tasks, finding improved generalization compared to existing positional encoding methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xAqcJ9XoTf",
    "arxiv_id": "2310.02579",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17464,
    "title": "GeoDiffusion: Text-Prompted Geometric Control for Object Detection Data Generation",
    "authors": [
      "Kai Chen",
      "Enze Xie",
      "Zhe Chen",
      "Yibo Wang",
      "Lanqing HONG",
      "Zhenguo Li",
      "Dit-Yan Yeung"
    ],
    "abstract": "Diffusion models have attracted significant attention due to the remarkable ability to create content and generate data for tasks like image classification. However, the usage of diffusion models to generate the high-quality object detection data remains an underexplored area, where not only image-level perceptual quality but also geometric conditions such as bounding boxes and camera views are essential. Previous studies have utilized either copy-paste synthesis or layout-to-image (L2I) generation with specifically designed modules to encode the semantic layouts. In this paper, we propose the GeoDiffusion, a simple framework that can flexibly translate various geometric conditions into text prompts and empower pre-trained text-to-image (T2I) diffusion models for high-quality detection data generation. Unlike previous L2I methods, our GeoDiffusion is able to encode not only the bounding boxes but also extra geometric conditions such as camera views in self-driving scenes. Extensive experiments demonstrate GeoDiffusion outperforms previous L2I methods while maintaining 4x training time faster. To the best of our knowledge, this is the first work to adopt diffusion models for layout-to-image generation with geometric conditions and demonstrate that L2I-generated images can be beneficial for improving the performance of object detectors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xBfQZWeDRH",
    "arxiv_id": "2306.04607",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17463,
    "title": "Navigating Dataset Documentations in AI: A Large-Scale Analysis of Dataset Cards on HuggingFace",
    "authors": [
      "Xinyu Yang",
      "Weixin Liang",
      "James Zou"
    ],
    "abstract": "Advances in machine learning are closely tied to the creation of datasets. While data documentation is widely recognized as essential to the reliability, reproducibility, and transparency of ML, we lack a systematic empirical understanding of current dataset documentation practices. To shed light on this question, here we take Hugging Face - one of the largest platforms for sharing and collaborating on ML models and datasets -  as a prominent case study. By analyzing all 7,433 dataset documentation on Hugging Face, our investigation provides an overview of the Hugging Face dataset ecosystem and insights into dataset documentation practices, yielding 5 main findings: (1) The dataset card completion rate shows marked heterogeneity correlated with dataset popularity: While 86.0\\% of the top 100 downloaded dataset cards fill out all sections suggested by Hugging Face community, only 7.9\\% of dataset cards with no downloads complete all these sections. (2) A granular examination of each section within the dataset card reveals that the practitioners seem to prioritize Dataset Description and Dataset Structure sections, accounting for 36.2\\% and 33.6\\% of the total card length, respectively, for the most downloaded datasets. In contrast, the Considerations for Using the Data section receives the lowest proportion of content, accounting for just 2.1\\% of the text. (3) By analyzing the subsections within each section and utilizing topic modeling to identify key topics, we uncover what is discussed in each section, and underscore significant themes encompassing both technical and social impacts, as well as limitations within the Considerations for Using the Data section. (4) Our findings also highlight the need for improved accessibility and reproducibility of datasets in the Usage sections. (5) In addition, our human annotation evaluation emphasizes the pivotal role of comprehensive dataset content in shaping individuals' perceptions of a dataset card's overall quality. Overall, our study offers a unique perspective on analyzing dataset documentation through large-scale data science analysis and underlines the need for more thorough dataset documentation in machine learning research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xC8xh2RSs2",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17462,
    "title": "Score Regularized Policy Optimization through Diffusion Behavior",
    "authors": [
      "Huayu Chen",
      "Cheng Lu",
      "Zhengyi Wang",
      "Hang Su",
      "Jun Zhu"
    ],
    "abstract": "Recent developments in offline reinforcement learning have uncovered the immense potential of diffusion modeling, which excels at representing heterogeneous behavior policies. However, sampling from diffusion policies is considerably slow because it necessitates tens to hundreds of iterative inference steps for one action. To address this issue, we propose to extract an efficient deterministic inference policy from critic models and pretrained diffusion behavior models, leveraging the latter to directly regularize the policy gradient with the behaviordistribution\u2019s score function during optimization. Our method enjoys powerful generative capabilities of diffusion modeling while completely circumventing the computationally intensive and time-consuming diffusion sampling scheme, both during training and evaluation. Extensive results on D4RL tasks show that our method boosts action sampling speed by more than 25 times compared with various leading diffusion-based methods in locomotion tasks, while still maintaining state-of-the-art performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xCRr9DrolJ",
    "arxiv_id": "2310.07297",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17461,
    "title": "Elucidating the Exposure Bias in Diffusion Models",
    "authors": [
      "Mang Ning",
      "Mingxiao Li",
      "Jianlin Su",
      "Albert Ali Salah",
      "Itir Onal Ertugrul"
    ],
    "abstract": "Diffusion models have demonstrated impressive generative capabilities, but their exposure bias problem, described as the input mismatch between training and sampling, lacks in-depth exploration. In this paper, we systematically investigate the exposure bias problem in diffusion models by first analytically modelling the sampling distribution, based on which we then attribute the prediction error at each sampling step as the root cause of the exposure bias issue. Furthermore, we discuss potential solutions to this issue and propose an intuitive metric for it. Along with the elucidation of exposure bias, we propose a simple, yet effective, training-free method called Epsilon Scaling to alleviate the exposure bias. We show that Epsilon Scaling explicitly moves the sampling trajectory closer to the vector field learned in the training phase by scaling down the network output (Epsilon), mitigating the input mismatch between training and sampling. Experiments on various diffusion frameworks (ADM, DDPM/DDIM, EDM, LDM), unconditional and conditional settings, and deterministic vs. stochastic sampling verify the effectiveness of our method. Remarkably, our ADM-ES, as a SOTA stochastic sampler, obtains 2.17 FID on CIFAR-10 under 100-step unconditional generation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xEJMoj1SpX",
    "arxiv_id": "2308.15321",
    "GitHub": [
      "https://github.com/forever208/ADM-ES",
      "https://github.com/forever208/EDM-ES"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17460,
    "title": "How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization",
    "authors": [
      "Nuoya Xiong",
      "Lijun Ding",
      "Simon Shaolei Du"
    ],
    "abstract": "This paper rigorously shows how over-parameterization dramatically changes the convergence behaviors of gradient descent (GD) for the matrix sensing problem, where the goal is to recover an unknown low-rank ground-truth matrix from near-isotropic linear measurements.First, we consider the symmetric setting with the symmetric parameterization where $M^* \\in \\mathbb{R}^{n \\times n}$ is a positive semi-definite unknown matrix of rank $r \\ll n$, and one uses a symmetric parameterization $XX^\\top$ to learn $M^*$. Here $X \\in \\mathbb{R}^{n \\times k}$ with $k > r$ is the factor matrix. We give a novel $\\Omega\\left(1/T^2\\right)$ lower bound of randomly initialized GD for the over-parameterized case ($k >r$) where $T$ is the number of iterations. This is in stark contrast to the exact-parameterization scenario ($k=r$) where the convergence rate is $\\exp\\left(-\\Omega\\left(T\\right)\\right)$. Next, we study asymmetric setting where $M^* \\in \\mathbb{R}^{n_1 \\times n_2}$ is the unknown matrix of rank $r \\ll \\min\\{n_1,n_2\\}$, and one uses an asymmetric parameterization $FG^\\top$ to learn $M^*$ where $F \\in \\mathbb{R}^{n_1 \\times k}$ and $G \\in \\mathbb{R}^{n_2 \\times k}$. We give the first global exact convergence result of randomly initialized GD for the exact-parameterization case ($k=r$) with an $\\exp\\left(-\\Omega\\left(T\\right)\\right)$ rate. Furthermore, we give the first global exact convergence result for the over-parameterization case ($k>r$) with an $\\exp\\left(-\\Omega\\left(\\alpha^2 T\\right)\\right)$ rate where $\\alpha$ is the initialization scale. This linear convergence result in the over-parameterization case is especially significant because one can apply the asymmetric parameterization to the symmetric setting to speed up from $\\Omega\\left(1/T^2\\right)$ to linear convergence. Therefore, we identify a surprising phenomenon: asymmetric parameterization can exponentially speed up convergence. Equally surprising is our analysis that highlights the importance of imbalance between $F$ and $G$. This is in sharp contrast to prior works which emphasize balance.  We further give an example showing the dependency on $\\alpha$ in the convergence rate is unavoidable in the worst case. On the other hand, we propose a novel method that only modifies one step of GD and obtains a convergence rate independent of $\\alpha$, recovering the rate in the exact-parameterization case. We provide empirical studies to verify our theoretical findings.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xGvPKAiOhq",
    "arxiv_id": "2310.01769",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17459,
    "title": "Correlated Noise Provably Beats Independent Noise for Differentially Private Learning",
    "authors": [
      "Christopher A. Choquette-Choo",
      "Krishnamurthy Dj Dvijotham",
      "Krishna Pillutla",
      "Arun Ganesh",
      "Thomas Steinke",
      "Abhradeep Guha Thakurta"
    ],
    "abstract": "Differentially private learning algorithms inject noise into the learning process. While the most common private learning algorithm, DP-SGD, adds independent Gaussian noise in each iteration, recent work on matrix factorization mechanisms has shown empirically that introducing correlations in the noise can greatly improve their utility. We characterize the asymptotic learning utility for any choice of the correlation function, giving precise analytical bounds for linear regression and as the solution to a convex program for general convex functions. We show, using these bounds, how correlated noise provably improves upon vanilla DP-SGD as a function of problem parameters such as the effective dimension and condition number. Moreover, our analytical expression for the near-optimal correlation function circumvents the cubic complexity of the semi-definite program used to optimize the noise correlation matrix in previous work. We validate these theoretical results with experiments on private deep learning. Our work matches or outperforms prior work while being efficient both in terms of computation and memory.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xHmCdSArUC",
    "arxiv_id": "2310.06771",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17458,
    "title": "Towards 3D Molecule-Text Interpretation in Language Models",
    "authors": [
      "Sihang Li",
      "Zhiyuan Liu",
      "Yanchen Luo",
      "Xiang Wang",
      "Xiangnan He",
      "Kenji Kawaguchi",
      "Tat-Seng Chua",
      "Qi Tian"
    ],
    "abstract": "Language Models (LMs) have greatly influenced diverse domains. However, their inherent limitation in comprehending 3D molecular structures has considerably constrained their potential in the biomolecular domain. To bridge this gap, we focus on 3D molecule-text interpretation, and propose 3D-MoLM: 3D-Molecular Language Modeling. Specifically, 3D-MoLM enables an LM to interpret andanalyze 3D molecules by equipping the LM with a 3D molecular encoder. This integration is achieved by a 3D molecule-text projector, bridging the 3D molecular encoder\u2019s representation space and the LM\u2019s input space. Moreover, to enhance 3DMoLM\u2019s ability of cross-modal molecular understanding and instruction following, we meticulously curated a 3D molecule-centric instruction tuning dataset \u2013 3D-MoIT. Through 3D molecule-text alignment and 3D molecule-centric instruction tuning, 3D-MoLM establishes an integration of 3D molecular encoder and LM. It significantly surpasses existing baselines on downstream tasks, including moleculetext retrieval, molecule captioning, and more challenging open-text molecular QA tasks, especially focusing on 3D-dependent properties. We will release our codes and datasets at https://anonymous.4open.science/r/3D-MoLM.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xI4yNlkaqh",
    "arxiv_id": "2401.13923",
    "GitHub": [
      "https://github.com/lsh0520/3D-MoLM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17457,
    "title": "Subtractive Mixture Models via Squaring: Representation and Learning",
    "authors": [
      "Lorenzo Loconte",
      "Aleksanteri Mikulus Sladek",
      "Stefan Mengel",
      "Martin Trapp",
      "Arno Solin",
      "Nicolas Gillis",
      "Antonio Vergari"
    ],
    "abstract": "Mixture models are traditionally represented and learned by adding several distributions as components. Allowing mixtures to subtract probability mass or density can drastically reduce the number of components needed to model complex distributions. However, learning such subtractive mixtures while ensuring they still encode a non-negative function is challenging. We investigate how to learn and perform inference on deep subtractive mixtures by squaring them. We do this in the framework of probabilistic circuits, which enable us to represent tensorized mixtures and generalize several other subtractive models. We theoretically prove that the class of squared circuits allowing subtractions can be exponentially more expressive than traditional additive mixtures; and, we empirically show this increased expressiveness on a series of real-world distribution estimation tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xIHi5nxu9P",
    "arxiv_id": "2310.00724",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17456,
    "title": "Constrained Bi-Level Optimization: Proximal Lagrangian Value Function Approach and Hessian-free Algorithm",
    "authors": [
      "Wei Yao",
      "Chengming Yu",
      "Shangzhi Zeng",
      "Jin Zhang"
    ],
    "abstract": "This paper presents a new approach and algorithm for solving a class of constrained Bi-Level Optimization (BLO) problems in which the lower-level problem involves constraints coupling both upper-level and lower-level variables. Such problems have recently gained significant attention due to their broad applicability in machine learning. However, conventional gradient-based methods unavoidably rely on computationally intensive calculations related to the Hessian matrix. To address this challenge, we begin by devising a smooth proximal Lagrangian value function to handle the constrained lower-level problem. Utilizing this construct, we introduce a single-level reformulation for constrained BLOs that transforms the original BLO problem into an equivalent optimization problem with smooth constraints. Enabled by this reformulation, we develop a Hessian-free gradient-based algorithm\u2014termed proximal Lagrangian Value function-based Hessian-free Bi-level Algorithm (LV-HBA)\u2014that is straightforward to implement in a single loop manner. Consequently, LV-HBA is especially well-suited for machine learning applications. Furthermore, we offer non-asymptotic convergence analysis for LV-HBA, eliminating the need for traditional strong convexity assumptions for the lower-level problem while also being capable of accommodating non-singleton scenarios. Empirical results substantiate the algorithm's superior practical performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xJ5N8qrEPl",
    "arxiv_id": "2401.16164",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17455,
    "title": "Impact of Computation in Integral Reinforcement Learning for Continuous-Time Control",
    "authors": [
      "Wenhan Cao",
      "Wei Pan"
    ],
    "abstract": "Integral reinforcement learning (IntRL) demands the precise computation of the utility function's integral at its policy evaluation (PEV) stage. This is achieved through quadrature rules, which are weighted sums of utility functions evaluated from state samples obtained in discrete time. Our research reveals a critical yet underexplored phenomenon: the choice of the computational method -- in this case, the quadrature rule -- can significantly impact control performance. This impact is traced back to the fact that computational errors introduced in the PEV stage can affect the policy iteration's convergence behavior, which in turn affects the learned controller. To elucidate how computation impacts control, we draw a parallel between IntRL's policy iteration and Newton's method applied to the Hamilton-Jacobi-Bellman equation. In this light, computational error in PEV manifests as an extra error term in each iteration of Newton's method, with its upper bound proportional to the computational error. Further, we demonstrate that when the utility function resides in a reproducing kernel Hilbert space (RKHS), the optimal quadrature is achievable by employing Bayesian quadrature with the RKHS-inducing kernel function. We prove that the local convergence rates for IntRL using the trapezoidal rule and Bayesian quadrature with a Mat\u00e9rn kernel to be $O(N^{-2})$ and $O(N^{-b})$, where $N$ is the number of evenly-spaced samples and $b$ is the Mat\u00e9rn kernel's smoothness parameter. These theoretical findings are finally validated by two canonical control tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xJEd8PkdNz",
    "arxiv_id": "2402.17375",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17453,
    "title": "Negative Label Guided OOD Detection with Pretrained Vision-Language Models",
    "authors": [
      "Xue Jiang",
      "Feng Liu",
      "Zhen Fang",
      "Hong Chen",
      "Tongliang Liu",
      "Feng Zheng",
      "Bo Han"
    ],
    "abstract": "Out-of-distribution (OOD) detection aims at identifying samples from unknown classes, playing a crucial role in trustworthy models against errors on unexpected inputs.  There is extensive research dedicated to exploring OOD detection in the vision modality. Vision-language models (VLMs) can leverage both textual and visual information for various multi-modal applications, whereas few OOD detection methods take into account information from the text modality. In this paper, we propose a novel post hoc OOD detection method, called NegLabel, which takes a vast number of negative labels from extensive corpus databases. We design a novel scheme for the OOD score collaborated with negative labels.Theoretical analysis helps to understand the mechanism of negative labels. Extensive experiments demonstrate that our method NegLabel achieves state-of-the-art performance on various OOD detection benchmarks and generalizes well on multiple VLM architectures. Furthermore, our method NegLabel exhibits remarkable robustness against diverse domain shifts.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xUO1HXz4an",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17452,
    "title": "Privacy Amplification for Matrix Mechanisms",
    "authors": [
      "Christopher A. Choquette-Choo",
      "Arun Ganesh",
      "Thomas Steinke",
      "Abhradeep Guha Thakurta"
    ],
    "abstract": "Privacy amplification exploits randomness in data selection to provide tighter differential privacy (DP) guarantees. This analysis is key to DP-SGD's success in machine learning (ML), but, is not readily applicable to the newer state-of-the-art (SOTA) algorithms. This is because these algorithms, known as DP-FTRL, use the matrix mechanism to add correlated noise instead of independent noise as in DP-SGD.In this paper, we propose \"MMCC'' (matrix mechanism conditional composition), the first algorithm to analyze privacy amplification via sampling for any generic matrix mechanism. MMCC is nearly tight in that it approaches a lower bound as $\\epsilon\\to0$. To analyze correlated outputs in MMCC, we prove that they can be analyzed as if they were independent, by conditioning them on prior outputs. Our \"conditional composition theorem'' has broad utility: we use it to show that the noise added to binary-tree-DP-FTRL can asymptotically match the noise added to DP-SGD with amplification. Our algorithm also has practical empirical utility. We show that amplification leads to significant improvement in the privacy/utility trade-offs for DP-FTRL style algorithms for standard benchmark tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xUzWmFdglP",
    "arxiv_id": "2310.15526",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17451,
    "title": "Tell Your Model Where to Attend: Post-hoc Attention Steering for LLMs",
    "authors": [
      "Qingru Zhang",
      "Chandan Singh",
      "Liyuan Liu",
      "Xiaodong Liu",
      "Bin Yu",
      "Jianfeng Gao",
      "Tuo Zhao"
    ],
    "abstract": "In human-written articles, we often leverage the subtleties of text style, such as bold and italics, to guide the attention of readers. These textual emphases are vital for the readers to grasp the conveyed information.  When interacting with large language models (LLMs), we have a similar need -- steering the model to pay closer attention to user-specified information, e.g., an instruction. Existing methods, however, are constrained to process plain text and do not support such a mechanism. This motivates us to introduce PASTA -- Post-hoc Attention STeering Approach, a method that allows LLMs to read text with user-specified emphasis marks. To this end, PASTA identifies a small subset of attention heads and applies precise attention reweighting on them, directing the model attention to user-specified parts. Like prompting, PASTA is applied at inference time and does not require changing any model parameters. Experiments demonstrate that PASTA can substantially enhance an LLM's ability to follow user instructions or integrate new knowledge from user inputs, leading to a significant performance improvement on a variety of tasks, e.g., an average accuracy improvement of 22\\% for LLAMA-7B. Code is provided at https://anonymous.4open.science/r/PASTA-10E9.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xZDWO0oejD",
    "arxiv_id": "2311.02262",
    "GitHub": [
      "https://github.com/QingruZhang/PASTA"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17450,
    "title": "Statistical Rejection Sampling Improves Preference Optimization",
    "authors": [
      "Tianqi Liu",
      "Yao Zhao",
      "Rishabh Joshi",
      "Misha Khalman",
      "Mohammad Saleh",
      "Peter J Liu",
      "Jialu Liu"
    ],
    "abstract": "Improving the alignment of language models with human preferences remains an active research challenge. Previous approaches have primarily utilized online Reinforcement Learning from Human Feedback (RLHF). Recently, offline methods such as Sequence Likelihood Calibration (SLiC) and Direct Preference Optimization (DPO) have emerged as attractive alternatives, offering improvements in stability and scalability while maintaining competitive performance. SLiC refines its loss function using sequence pairs sampled from a supervised fine-tuned (SFT) policy, while DPO directly optimizes language models based on preference data, foregoing the need for a separate reward model. However, the maximum likelihood estimator (MLE) of the target optimal policy requires labeled preference pairs sampled from that policy. The absence of a reward model in DPO constrains its ability to sample preference pairs from the optimal policy. Meanwhile, SLiC can only sample preference pairs from the SFT policy. To address these limitations, we introduce a novel approach called Statistical Rejection Sampling Optimization (RSO) designed to source preference data from the target optimal policy using rejection sampling, enabling a more accurate estimation of the optimal policy. We also propose a unified framework that enhances the loss functions used in both SLiC and DPO from a preference modeling standpoint. Through extensive experiments across diverse tasks, we demonstrate that RSO consistently outperforms both SLiC and DPO as evaluated by both Large Language Models (LLMs) and human raters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xbjSwwrQOe",
    "arxiv_id": "2309.06657",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18550,
    "title": "LILO: Learning Interpretable Libraries by Compressing and Documenting Code",
    "authors": [
      "Gabriel Grand",
      "Lionel Wong",
      "Matthew Bowers",
      "Theo X. Olausson",
      "Muxin Liu",
      "Joshua B. Tenenbaum",
      "Jacob Andreas"
    ],
    "abstract": "While large language models (LLMs) now excel at code generation, a key aspect of software development is the art of refactoring: consolidating code into libraries of reusable and readable programs. In this paper, we introduce LILO, a neurosymbolic framework that iteratively synthesizes, compresses, and documents code to build libraries tailored to particular problem domains. Computationally, library learning presents a challenging optimization problem that requires formal reasoning about program structure at scale. LILO combines LLM-guided program synthesis with recent algorithmic advances in automated refactoring from Stitch: a symbolic compression system that efficiently identifies optimal lambda abstractions across large code corpora. To make these abstractions interpretable, we introduce an auto-documentation (AutoDoc) procedure that infers natural language names and docstrings based on contextual examples of usage. In addition to improving human readability, we find that AutoDoc boosts performance by helping LILO's synthesizer to interpret and deploy learned abstractions. We evaluate LILO on three inductive program synthesis benchmarks for string editing, scene reasoning, and graphics composition. Compared to existing neural and symbolic methods\u2014including the state-of-the-art library learning algorithm DreamCoder\u2014LILO solves more complex tasks and learns richer libraries that are grounded in linguistic knowledge. In sum, LILO provides a general design pattern for human-interpretable systems that build up shared libraries of program abstractions to solve complex software problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TqYbAWKMIe",
    "arxiv_id": "2310.19791",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17449,
    "title": "Learning to design protein-protein interactions with enhanced generalization",
    "authors": [
      "Anton Bushuiev",
      "Roman Bushuiev",
      "Petr Kouba",
      "Anatolii Filkin",
      "Marketa Gabrielova",
      "Michal Gabriel",
      "Jiri Sedlar",
      "Tomas Pluskal",
      "Jiri Damborsky",
      "Stanislav Mazurenko",
      "Josef Sivic"
    ],
    "abstract": "Discovering mutations enhancing protein-protein interactions (PPIs) is critical for advancing biomedical research and developing improved therapeutics. While machine learning approaches have substantially advanced the field, they often struggle to generalize beyond training data in practical scenarios. The contributions of this work are three-fold. First, we construct PPIRef, the largest and non-redundant dataset of 3D protein-protein interactions, enabling effective large-scale learning. Second, we leverage PPIRef to pre-train PPIformer, a new SE(3)-equivariant model, generalizing across diverse protein-binder variants. We fine-tune PPIformer to predict effects of mutations on protein-protein interactions via a thermodynamically motivated adjustment of the pre-training loss function. Finally, we demonstrate the enhanced generalization of our new PPIformer approach by outperforming other state-of-the-art methods on the new non-leaking splits of the standard labeled PPI mutational data and independent case studies optimizing a human antibody against SARS-CoV-2 and increasing staphylokinase thrombolytic activity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xcMmebCT7s",
    "arxiv_id": "2310.18515",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17448,
    "title": "Towards Training Without Depth Limits: Batch Normalization Without Gradient Explosion",
    "authors": [
      "Alexandru Meterez",
      "Amir Joudaki",
      "Francesco Orabona",
      "Alexander Immer",
      "Gunnar Ratsch",
      "Hadi Daneshmand"
    ],
    "abstract": "Normalization layers are one of the key building blocks for deep neural networks. Several theoretical studies have shown that batch normalization improves the signal propagation, by avoiding the representations from becoming collinear across the layers. However, results on mean-field theory of batch normalization also conclude that this benefit comes at the expense of exploding gradients in depth. Motivated by these two aspects of batch normalization, in this study we pose the following question: *Can a batch-normalized network keep the optimal signal propagation properties, but avoid exploding gradients?* We answer this question in the affirmative by giving a particular construction of an *MLP with linear activations* and batch-normalization that provably has *bounded gradients* at any depth. Based on Weingarten calculus, we develop a rigorous and non-asymptotic theory for this constructed MLP that gives a precise characterization of forward signal propagation, while proving that gradients remain bounded for linearly independent input samples, which holds in most practical settings. Inspired by our theory, we also design an activation shaping scheme that empirically achieves the same properties for non-linear activations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xhCZD9hiiA",
    "arxiv_id": "2310.02012",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17447,
    "title": "Robust Model-Based Optimization for Challenging Fitness Landscapes",
    "authors": [
      "Saba Ghaffari",
      "Ehsan Saleh",
      "Alex Schwing",
      "Yu-Xiong Wang",
      "Martin D. Burke",
      "Saurabh Sinha"
    ],
    "abstract": "Protein design, a grand challenge of the day, involves optimization on a fitness landscape, and leading methods adopt a model-based approach where a model is trained on a training set (protein sequences and fitness) and proposes candidates to explore next. These methods are challenged by sparsity of high-fitness samples in the training set, a problem that has been in the literature. A less recognized but equally important problem stems from the distribution of training samples in the design space: leading methods are not designed for scenarios where the desired optimum is in a region that is not only poorly represented in training data, but also relatively far from the highly represented low-fitness regions. We show that this problem of \u201cseparation\u201d in the design space is a significant bottleneck in existing model-based optimization tools and propose a new approach that uses a novel VAE as its search model to overcome the problem. We demonstrate its advantage over prior methods in robustly finding improved samples, regardless of the imbalance and separation between low- and high-fitness samples. Our comprehensive benchmark on real and semi-synthetic protein datasets as well as solution design for physics-informed neural networks, showcases the generality of our approach in discrete and continuous design spaces. Our implementation is available at https://anonymous.4open.science/r/PPGVAE-F83E.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xhEN0kJh4q",
    "arxiv_id": "2305.13650",
    "GitHub": [
      "https://github.com/sabagh1994/PGVAE"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17446,
    "title": "Federated Recommendation with Additive Personalization",
    "authors": [
      "Zhiwei Li",
      "Guodong Long",
      "Tianyi Zhou"
    ],
    "abstract": "Building recommendation systems via federated learning (FL) is a new emerging challenge for next-generation Internet service. Existing FL models share item embedding across clients while keeping the user embedding private and local on the client side. However, identical item embedding cannot capture users' individual differences in perceiving the same item and may lead to poor personalization. Moreover, dense item embedding in FL results in expensive communication costs and latency. To address these challenges, we propose Federated Recommendation withAdditive Personalization (FedRAP), which learns a global view of items via FL and a personalized view locally on each user. FedRAP encourages a sparse global view to save FL's communication cost and enforces the two views to be complementary via two regularizers. We propose an effective curriculum to learn the local and global views progressively with increasing regularization weights. To produce recommendations for a user, FedRAP adds the two views together to obtain a personalized item embedding. FedRAP achieves the best performance in FL setting on multiple benchmarks. It outperforms recent federated recommendation methods and several ablation study baselines. Our code is available at https://github.com/mtics/FedRAP.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xkXdE81mOK",
    "arxiv_id": "2301.09109",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17444,
    "title": "On the Fairness ROAD: Robust Optimization for Adversarial Debiasing",
    "authors": [
      "Vincent Grari",
      "Thibault Laugel",
      "Tatsunori Hashimoto",
      "sylvain lamprier",
      "Marcin Detyniecki"
    ],
    "abstract": "In the field of algorithmic fairness, significant attention has been put on group fairness criteria, such as Demographic Parity and Equalized Odds. Nevertheless, these objectives, measured as global averages,  have raised concerns about persistent local disparities between sensitive groups. In this work, we address the problem of local fairness, which ensures that the predictor is unbiased not only in terms of expectations over the whole population, but also within any subregion of the feature space, unknown at training time. To enforce this objective, we introduce ROAD, a novel approach that leverages the Distributionally Robust Optimization (DRO) framework  within a fair adversarial learning objective, where an adversary tries to infer the sensitive attribute from the predictions. Using an instance-level re-weighting strategy, ROAD is designed to prioritize inputs that are likely to be locally unfair, i.e. where the adversary faces the least difficulty in reconstructing the sensitive attribute. Numerical experiments demonstrate the effectiveness of our method: it achieves Pareto dominance with respect to local fairness and accuracy for a given global fairness level across three standard datasets, and also enhances fairness generalization under distribution shift.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xnhvVtZtLD",
    "arxiv_id": "2310.18413",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17445,
    "title": "Exploring Target Representations for Masked Autoencoders",
    "authors": [
      "xingbin liu",
      "Jinghao Zhou",
      "Tao Kong",
      "Xianming Lin",
      "Rongrong Ji"
    ],
    "abstract": "Masked autoencoders have become popular training paradigms for self-supervised visual representation learning. These models randomly mask a portion of the input and reconstruct the masked portion according to assigned target representations. In this paper, we show that a careful choice of the target representation is unnecessary for learning good visual representation since different targets tend to derive similarly behaved models. Driven by this observation, we propose a multi-stage masked distillation pipeline and use a randomly initialized model as the teacher, enabling us to effectively train high-capacity models without any effort to carefully design the target representation. On various downstream tasks, the proposed method to perform masked knowledge distillation with bootstrapped teachers (dbot) outperforms previous self-supervised methods by nontrivial margins. We hope our findings, as well as the proposed method, could motivate people to rethink the roles of target representations in pre-training masked autoencoders.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xmQMz9OPF5",
    "arxiv_id": "2209.03917",
    "GitHub": [
      "https://github.com/liuxingbin/dbot"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17566,
    "title": "Enhancing High-Resolution 3D Generation through Pixel-wise Gradient Clipping",
    "authors": [
      "Zijie Pan",
      "Jiachen Lu",
      "Xiatian Zhu",
      "Li Zhang"
    ],
    "abstract": "High-resolution 3D object generation remains a challenging task primarily due to the limited availability of comprehensive annotated training data. Recent advancements have aimed to overcome this constraint by harnessing image generative models, pretrained on extensive curated web datasets, using knowledge transfer techniques like Score Distillation Sampling (SDS).Efficiently addressing the requirements of high-resolution rendering often necessitates the adoption of latent representation-based models, such as the Latent Diffusion Model (LDM). In this framework, a significant challenge arises: To compute gradients for individual image pixels, it is necessary to backpropagate gradients from the designated latent space through the frozen components of the image model, such as the VAE encoder used within LDM. However, this gradient propagation pathway has never been optimized, remaining uncontrolled during training.We find that the unregulated gradients adversely affect the 3D model's capacity in acquiring texture-related information from the image generative model, leading to poor quality appearance synthesis.To address this overarching challenge, we propose an innovative operation termed Pixel-wise Gradient Clipping (PGC) designed for seamless integration into existing 3D generative models, thereby enhancing their synthesis quality. Specifically, we control the magnitude of stochastic gradients by clipping the pixel-wise gradients efficiently,while preserving crucial texture-related gradient directions.Despite this simplicity and minimal extra cost, extensive experiments demonstrate the efficacy of our PGCin enhancing the performance of existing 3D generative modelsfor high-resolution object rendering.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ukidfml68f",
    "arxiv_id": "2310.12474",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17443,
    "title": "Teaching Language Models to Hallucinate Less with Synthetic Tasks",
    "authors": [
      "Erik Jones",
      "Hamid Palangi",
      "Clarisse Sim\u00f5es Ribeiro",
      "Varun Chandrasekaran",
      "Subhabrata Mukherjee",
      "Arindam Mitra",
      "Ahmed Hassan Awadallah",
      "Ece Kamar"
    ],
    "abstract": "Large language models (LLMs) frequently hallucinate on abstractive summarization tasks such as document-based question-answering, meeting summarization, and clinical report generation, even though all necessary information is included in context. However, optimizing to make LLMs hallucinate less is challenging, as hallucination is hard to efficiently, cheaply, and reliably evaluate at each optimization step. In this work, we show that reducing hallucination on a _synthetic task_ can also reduce hallucination on real-world downstream tasks. Our method, SynTra, first designs a synthetic task where hallucinations are easy to elicit and measure. It next optimizes the LLM's system message via prefix tuning on the synthetic task, then uses the system message on realistic, hard-to-optimize tasks. Across three realistic abstractive summarization tasks, we reduce hallucination for two 13B-parameter LLMs using supervision signal from only a synthetic retrieval task. We also find that optimizing the system message rather than the model weights can be critical; fine-tuning the entire model on the synthetic task can counterintuitively _increase_ hallucination. Overall, SynTra demonstrates that the extra flexibility of working with synthetic data can help mitigate undesired behaviors in practice.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xpw7V0P136",
    "arxiv_id": "2310.06827",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17567,
    "title": "A Discretization Framework for Robust Contextual Stochastic Optimization",
    "authors": [
      "Rares C Cristian",
      "Georgia Perakis"
    ],
    "abstract": "We study contextual stochastic optimization problems. Optimization problems have uncertain parameters stemming from unknown, context-dependent, distributions. Due to the inherent uncertainty in these problems, one is often interested not only in minimizing expected cost, but also to be robust and protect against worst case scenarios. We propose a novel method that combines the learning stage with knowledge of the downstream optimization task. The method prescribes decisions which aim to maximize the likelihood that the cost is below a (user-controlled) threshold. The key idea is (1) to discretize the feasible region into subsets so that the uncertain objective function can be well approximated deterministically within each subset, and (2) devise a secondary optimization problem to prescribe decisions by integrating the individual approximations determined in step (1). We provide theoretical guarantees bounding the underlying regret of decisions proposed by our method. In addition, experimental results demonstrate that our approach is competitive in terms of average regret and yields more robust solutions than other methods proposed in the literature, including up to 20 times lower worst-case cost on a real-world electricity generation problem.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ueTdErd5Ib",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17442,
    "title": "Inherently Interpretable Time Series Classification via Multiple Instance Learning",
    "authors": [
      "Joseph Early",
      "Gavin Cheung",
      "Kurt Cutajar",
      "Hanting Xie",
      "Jas Kandola",
      "Niall Twomey"
    ],
    "abstract": "Conventional Time Series Classification (TSC) methods are often black boxes that obscure inherent interpretation of their decision-making processes. In this work, we leverage Multiple Instance Learning (MIL) to overcome this issue, and propose a new framework called MILLET: Multiple Instance Learning for Locally Explainable Time series classification. We apply MILLET to existing deep learning TSC models and show how they become inherently interpretable without compromising (and in some cases, even improving) predictive performance. We evaluate MILLET on 85 UCR TSC datasets and also present a novel synthetic dataset that is specially designed to facilitate interpretability evaluation. On these datasets, we show MILLET produces sparse explanations quickly that are of higher quality than other well-known interpretability methods. To the best of our knowledge, our work with MILLET is the first to develop general MIL methods for TSC and apply them to an extensive variety of domains.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xriGRsoAza",
    "arxiv_id": "2311.10049",
    "GitHub": [
      "https://github.com/JAEarly/MILTimeSeriesClassification"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17441,
    "title": "FLD: Fourier Latent Dynamics for Structured Motion Representation and Learning",
    "authors": [
      "Chenhao Li",
      "Elijah Stanger-Jones",
      "Steve Heim",
      "Sang bae Kim"
    ],
    "abstract": "Motion trajectories offer reliable references for physics-based motion learning but suffer from sparsity, particularly in regions that lack sufficient data coverage. To address this challenge, we introduce a self-supervised, structured representation and generation method that extracts spatial-temporal relationships in periodic or quasi-periodic motions. The motion dynamics in a continuously parameterized latent space enable our method to enhance the interpolation and generalization capabilities of motion learning algorithms. The motion learning controller, informed by the motion parameterization, operates online tracking of a wide range of motions, including targets unseen during training. With a fallback mechanism, the controller dynamically adapts its tracking strategy and automatically resorts to safe action execution when a potentially risky target is proposed. By leveraging the identified spatial-temporal structure, our work opens new possibilities for future advancements in general motion representation and learning algorithms.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xsd2llWYSA",
    "arxiv_id": "2402.13820",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17440,
    "title": "Dual RL: Unification and New Methods for Reinforcement and Imitation Learning",
    "authors": [
      "Harshit Sikchi",
      "Qinqing Zheng",
      "Amy Zhang",
      "Scott Niekum"
    ],
    "abstract": "The goal of reinforcement learning (RL) is to find a policy that maximizes the expected cumulative return. It has been shown that this objective can be represented as an optimization problem of state-action visitation distribution under linear constraints. The dual problem of this formulation, which we refer to as *dual RL*, is unconstrained and easier to optimize. In this work, we first cast several state-of-the-art offline RL and offline imitation learning (IL) algorithms as instances of dual RL approaches with shared structures. Such unification allows us to identify the root cause of the shortcomings of prior methods. For offline IL, our analysis shows that prior methods are based on a restrictive coverage assumption that greatly limits their performance in practice. To fix this limitation, we propose a new discriminator-free method ReCOIL that learns to imitate from arbitrary off-policy data to obtain near-expert performance. For offline RL, our analysis frames a recent offline RL method XQL in the dual framework, and we further propose a new method $f$-DVL that provides alternative choices to the Gumbel regression loss that fixes the known training instability issue of XQL. The performance improvements by both of our proposed methods, ReCOIL and $f$-DVL, in IL and RL are validated on an extensive suite of simulated robot locomotion and manipulation tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=xt9Bu66rqv",
    "arxiv_id": "2302.08560",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17439,
    "title": "TACTiS-2: Better, Faster, Simpler Attentional Copulas for Multivariate Time Series",
    "authors": [
      "Arjun Ashok",
      "\u00c9tienne Marcotte",
      "Valentina Zantedeschi",
      "Nicolas Chapados",
      "Alexandre Drouin"
    ],
    "abstract": "We introduce a new model for multivariate probabilistic time series prediction, designed to flexibly address a range of tasks including forecasting, interpolation, and their combinations. Building on copula theory, we propose a simplified objective for the recently-introduced transformer-based attentional copulas (TACTiS), wherein the number of distributional parameters now scales linearly with the number of variables instead of factorially. The new objective requires the introduction of a training curriculum, which goes hand-in-hand with necessary changes to the original architecture. We show that the resulting model has significantly better training dynamics and achieves state-of-the-art performance across diverse real-world forecasting tasks, while maintaining the flexibility of prior work, such as seamless handling of unaligned and unevenly-sampled time series.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xtOydkE1Ku",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17437,
    "title": "Threaten Spiking Neural Networks through Combining Rate and Temporal Information",
    "authors": [
      "Zecheng Hao",
      "Tong Bu",
      "Xinyu Shi",
      "Zihan Huang",
      "Zhaofei Yu",
      "Tiejun Huang"
    ],
    "abstract": "Spiking Neural Networks (SNNs) have received widespread attention in academic communities due to their superior spatio-temporal processing capabilities and energy-efficient characteristics. With further in-depth application in various fields, the vulnerability of SNNs under adversarial attack has become a focus of concern. In this paper, we draw inspiration from two mainstream learning algorithms of SNNs and observe that SNN models reserve both rate and temporal information. To better understand the capabilities of these two types of information, we conduct a quantitative analysis separately for each. In addition, we note that the retention degree of temporal information is related to the parameters and input settings of spiking neurons. Building on these insights, we propose a hybrid adversarial attack based on rate and temporal information (HART), which allows for dynamic adjustment of the rate and temporal attributes. Experimental results demonstrate that compared to previous works, HART attack can achieve significant superiority under different attack scenarios, data types, network architecture, time-steps, and model hyper-parameters. These findings call for further exploration into how both types of information can be effectively utilized to enhance the reliability of SNNs. Code is available at [https://github.com/hzc1208/HART_Attack](https://github.com/hzc1208/HART_Attack).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xv8iGxENyI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17436,
    "title": "LQ-LoRA: Low-rank plus Quantized Matrix Decomposition for Efficient Language Model Finetuning",
    "authors": [
      "Han Guo",
      "Philip Greengard",
      "Eric Xing",
      "Yoon Kim"
    ],
    "abstract": "We propose a simple approach for memory-efficient adaptation of pretrained language models. Our approach uses an iterative algorithm to decompose each pretrained matrix into a high-precision low-rank component and a memory-efficient quantized component. During finetuning, the quantized component remains fixed and only the low-rank component is updated. We present an integer linear programming formulation of the quantization component, which enables dynamic configuration of quantization parameters (e.g., bit-width, block size) for each matrix given an overall target memory budget.  We further explore a data-aware version of the algorithm which uses an approximation of the Fisher information matrix to weight the reconstruction objective during matrix decomposition. Across standard NLP benchmarks, our low-rank plus quantized matrix decomposition approach (LQ-LoRA) is found to perform well against strong baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xw29VvOMmU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17435,
    "title": "Retrieval meets Long Context Large Language Models",
    "authors": [
      "Peng Xu",
      "Wei Ping",
      "Xianchao Wu",
      "Lawrence McAfee",
      "Chen Zhu",
      "Zihan Liu",
      "Sandeep Subramanian",
      "Evelina Bakhturina",
      "Mohammad Shoeybi",
      "Bryan Catanzaro"
    ],
    "abstract": "Extending the context window of large language models (LLMs) is getting popular recently, while the solution of augmenting LLMs with retrieval has existed for years. The natural questions are: i) Retrieval-augmentation versus long context window, which one is better for downstream tasks? ii) Can both methods be combined to get the best of both worlds? In this work, we answer these questions by studying both solutions using two state-of-the-art pretrained LLMs, i.e., a proprietary 43B GPT and Llama2-70B. Perhaps surprisingly, we find that LLM with 4K context window using simple retrieval-augmentation at generation can achieve comparable performance to finetuned LLM with 16K context window via positional interpolation on long context tasks, while taking much less computation. More importantly, we demonstrate that retrieval can significantly improve the performance of LLMs regardless of their extended context window sizes. Our best model, retrieval-augmented Llama2-70B with 32K context window, outperforms GPT-3.5-turbo-16k and Davinci003 in terms of average score on nine long context tasks including question answering, query-based summarization, and in-context few-shot learning tasks. It also outperforms its non-retrieval Llama2-70B-32k baseline by a margin, while being much faster at generation. Our study provides general insights on the choice of retrieval-augmentation versus long context extension of LLM for practitioners.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xw5nxFWMlo",
    "arxiv_id": "2310.03025",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17433,
    "title": "Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging",
    "authors": [
      "Max Zimmer",
      "Christoph Spiegel",
      "Sebastian Pokutta"
    ],
    "abstract": "Neural networks can be significantly compressed by pruning, yielding sparse models with reduced storage and computational demands while preserving predictive performance. Model soups (Wortsman et al., 2022) enhance generalization and out-of-distribution (OOD) performance by averaging the parameters of multiple models into a single one, without increasing inference time. However, achieving both sparsity and parameter averaging is challenging as averaging arbitrary sparse models reduces the overall sparsity due to differing sparse connectivities. This work addresses these challenges by demonstrating that exploring a single retraining phase of Iterative Magnitude Pruning (IMP) with varied hyperparameter configurations such as batch ordering or weight decay yields models suitable for averaging, sharing identical sparse connectivity by design. Averaging these models significantly enhances generalization and OOD performance over their individual counterparts. Building on this, we introduce Sparse Model Soups (SMS), a novel method for merging sparse models by initiating each prune-retrain cycle with the averaged model from the previous phase. SMS preserves sparsity, exploits sparse network benefits, is modular and fully parallelizable, and substantially improves IMP's performance. We further demonstrate that SMS can be adapted to enhance state-of-the-art pruning-during-training approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xx0ITyHp3u",
    "arxiv_id": "2306.16788",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17431,
    "title": "Un-Mixing Test-Time Normalization Statistics: Combatting Label Temporal Correlation",
    "authors": [
      "Devavrat Tomar",
      "Guillaume Vray",
      "Jean-Philippe Thiran",
      "Behzad Bozorgtabar"
    ],
    "abstract": "In an era where test-time adaptation methods increasingly rely on the nuanced manipulation of batch normalization (BN) parameters, one critical assumption often goes overlooked: that of independently and identically distributed (i.i.d.) test batches with respect to unknown labels. This assumption culminates in biased estimates of BN statistics and jeopardizes system stability under non-i.i.d. conditions. This paper pioneers a departure from the i.i.d. paradigm by introducing a groundbreaking strategy termed `$\\textbf{Un-Mix}$ing $\\textbf{T}$est-Time $\\textbf{N}$ormalization $\\textbf{S}$tatistics' (UnMix-TNS). UnMix-TNS re-calibrates the instance-wise statistics used to normalize each instance in a batch by $\\textit{mixing}$ it with multiple $\\textit{unmixed}$ statistics components, thus inherently simulating the i.i.d. environment. The key lies in our innovative online $\\textit{unmixing}$ procedure, which persistently refines these statistics components by drawing upon the closest instances from an incoming test batch. Remarkably generic in its design, UnMix-TNS seamlessly integrates with an array of state-of-the-art test-time adaptation methods and pre-trained architectures equipped with BN layers. Empirical evaluations corroborate the robustness of UnMix-TNS under varied scenarios\u2014ranging from single to continual and mixed domain shifts. UnMix-TNS stands out when handling test data streams with temporal correlation, including those with corrupted real-world non-i.i.d. streams, sustaining its efficacy even with minimal batch sizes and individual samples. Our results set a new standard for test-time adaptation, demonstrating significant improvements in both stability and performance across multiple benchmarks. Our code will be released upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xyxU99Nutg",
    "arxiv_id": "2401.08328",
    "GitHub": [
      "https://github.com/devavratTomar/unmixtns"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17430,
    "title": "DreamLLM: Synergistic Multimodal Comprehension and Creation",
    "authors": [
      "Runpei Dong",
      "Chunrui Han",
      "Yuang Peng",
      "Zekun Qi",
      "Zheng Ge",
      "Jinrong Yang",
      "Liang Zhao",
      "Jianjian Sun",
      "Hongyu Zhou",
      "Haoran Wei",
      "Xiangwen Kong",
      "Xiangyu Zhang",
      "Kaisheng Ma",
      "Li Yi"
    ],
    "abstract": "This paper presents DreamLLM, a learning framework that first achieves versatile Multimodal Large Language Models (MLLMs) empowered with frequently overlooked synergy between multimodal comprehension and creation. DreamLLM operates on two fundamental principles. The first focuses on the generative modeling of both language and image posteriors by direct sampling in the raw multimodal space. This approach circumvents the limitations and information loss inherent to external feature extractors like CLIP, and a more thorough multimodal understanding is obtained. Second, DreamLLM fosters the generation of raw, interleaved documents, modeling both text and image contents, along with unstructured layouts. This allows DreamLLM to learn all conditional, marginal, and joint multimodal distributions effectively. As a result, DreamLLM is the first MLLM capable of generating free-form interleaved content. Comprehensive experiments highlight DreamLLM's superior performance as a zero-shot multimodal generalist, reaping from the enhanced learning synergy. Anonymous project page: https://dreamllmpaper.github.io.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=y01KGvd9Bw",
    "arxiv_id": "2309.11499",
    "GitHub": [
      "https://github.com/RunpeiDong/DreamLLM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17429,
    "title": "Is Self-Repair a Silver Bullet for Code Generation?",
    "authors": [
      "Theo X. Olausson",
      "Jeevana Priya Inala",
      "Chenglong Wang",
      "Jianfeng Gao",
      "Armando Solar-Lezama"
    ],
    "abstract": "Large language models have shown remarkable aptitude in code generation, but still struggle on challenging tasks. Self-repair---in which the model debugs and fixes mistakes in its own code---has recently become a popular way to boost performance in these settings. However, only very limited studies on how and when self-repair works effectively exist in the literature, and one might wonder to what extent a model is really capable of repairing mistakes in code which was originally generated by that very same model. In this paper, we analyze Code Llama, GPT-3.5 and GPT-4's ability to perform self-repair on problems taken from HumanEval or APPS, finding that when the cost of carrying out repair is taken into account gains are often modest, vary a lot between subsets of the data, and are sometimes not present at all. We hypothesize that this is because self-repair is bottlenecked by the model's ability to provide feedback on its own code; boosting the feedback with stronger models, we observe performance gains even in settings where the model does not benefit from self-repair. Furthermore, we observe that providing the model with feedback from human participants greatly benefits repair even for GPT-4, and we provide a brief qualitative analysis as to why.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=y0GJXRungR",
    "arxiv_id": "2306.09896",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17428,
    "title": "PolyGCL: GRAPH CONTRASTIVE LEARNING via Learnable Spectral Polynomial Filters",
    "authors": [
      "Jingyu Chen",
      "Runlin Lei",
      "Zhewei Wei"
    ],
    "abstract": "Recently, Graph Contrastive Learning (GCL) has achieved significantly superior performance in self-supervised graph representation learning. However, the existing GCL technique has inherent smooth characteristics because of its low-pass GNN encoder and objective based on homophily assumption, which poses a challenge when applying it to heterophilic graphs.In supervised learning tasks, spectral GNNs with polynomial approximation excel in both homophilic and heterophilic settings by adaptively fitting graph filters of arbitrary shapes. Yet, their applications in unsupervised learning are rarely explored.Based on the above analysis, a natural question arises: \\textit{Can we incorporate the excellent properties of spectral polynomial filters into graph contrastive learning?}In this paper, we address the question by studying the necessity of introducing high-pass information for heterophily from a spectral perspective.We propose PolyGCL, a GCL pipeline that utilizes polynomial filters to achieve contrastive learning between the low-pass and high-pass views.Specifically, PolyGCL utilizes polynomials with learnable filter functions to generate different spectral views and an objective that incorporates high-pass information through a linear combination. We theoretically prove that PolyGCL outperforms previous GCL paradigms when applied to graphs with varying levels of homophily.We conduct extensive experiments on both synthetic and real-world datasets, which demonstrate the promising performance of PolyGCL on homophilic and heterophilic graphs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=y21ZO6M86t",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17425,
    "title": "Bandits with Replenishable Knapsacks: the Best of both Worlds",
    "authors": [
      "Martino Bernasconi",
      "Matteo Castiglioni",
      "Andrea Celli",
      "Federico Fusco"
    ],
    "abstract": "The bandits with knapsacks (BwK) framework models online decision-making problems in which an agent makes a sequence of decisions subject to resource consumption constraints. The traditional model assumes that each action consumes a non-negative amount of resources and the process ends when the initial budgets are fully depleted. We study a natural generalization of the BwK framework which allows non-monotonic resource utilization, i.e., resources can be replenished by a positive amount. We propose a best-of-both-worlds primal-dual template that can handle any online learning problem with replenishment for which a suitable primal regret minimizer exists. In particular, we provide the first positive results for the case of adversarial inputs by showing that our framework guarantees a constant competitive ratio $\\alpha$ when $B=\\Omega(T)$ or when the possible per-round replenishment is a positive constant. Moreover, under a stochastic input model, our algorithm yields an instance-independent $\\tilde{\\mathcal{O}}(T^{1/2})$ regret bound which complements existing instance-dependent bounds for the same setting. Finally, we provide applications of our framework to some economic problems of practical relevance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yBIJRIYTqa",
    "arxiv_id": "2306.08470",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17426,
    "title": "Adapting Large Language Models via Reading Comprehension",
    "authors": [
      "Daixuan Cheng",
      "Shaohan Huang",
      "Furu Wei"
    ],
    "abstract": "We explore how continued pre-training on domain-specific corpora influences large language models, revealing that training on the raw corpora endows the model with domain knowledge, but drastically hurts its prompting ability for question answering. Taken inspiration from human learning via reading comprehension--practice after reading improves the ability to answer questions based on the learned knowledge--we propose a simple method for transforming raw corpora into reading comprehension texts. Each raw text is enriched with a series of tasks related to its content. Our method, highly scalable and applicable to any pre-training corpora, consistently enhances performance across various tasks in three different domains: biomedicine, finance, and law. Notably, our 7B language model achieves competitive performance with domain-specific models of much larger scales, such as BloombergGPT-50B. Furthermore, we demonstrate that domain-specific reading comprehension texts can improve the model's performance even on general benchmarks, showing the potential to develop a general model across even more domains. Our model, code, and data are available at https://github.com/microsoft/LMOps.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=y886UXPEZ0",
    "arxiv_id": "2309.09530",
    "GitHub": [
      "https://github.com/microsoft/LMOps"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17424,
    "title": "Inverse Approximation Theory for Nonlinear Recurrent Neural Networks",
    "authors": [
      "Shida Wang",
      "Zhong Li",
      "Qianxiao Li"
    ],
    "abstract": "We prove an inverse approximation theorem for the approximation of nonlinear sequence-to-sequence relationships using recurrent neural networks (RNNs). This is a so-called Bernstein-type result in approximation theory, which deduces properties of a target function under the assumption that it can be effectively approximated by a hypothesis space. In particular, we show that nonlinear sequence relationships that can be stably approximated by nonlinear RNNs must have an exponential decaying memory structure - a notion that can be made precise. This extends the previously identified curse of memory in linear RNNs into the general nonlinear setting, and quantifies the essential limitations of the RNN architecture for learning sequential relationships with long-term memory. Based on the analysis, we propose a principled reparameterization method to overcome the limitations. Our theoretical results are confirmed by numerical experiments.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=yC2waD70Vj",
    "arxiv_id": "2305.19190",
    "GitHub": [
      "https://github.com/radarFudan/Curse-of-memory"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17423,
    "title": "Faithful and Efficient Explanations for Neural Networks via Neural Tangent Kernel Surrogate Models",
    "authors": [
      "Andrew William Engel",
      "Zhichao Wang",
      "Natalie Frank",
      "Ioana Dumitriu",
      "Sutanay Choudhury",
      "Anand Sarwate",
      "Tony Chiang"
    ],
    "abstract": "A recent trend in explainable AI research has focused on surrogate modeling, where neural networks are approximated as simpler ML algorithms such as kernel machines. A second trend has been to utilize kernel functions in various explain-by-example or data attribution tasks. In this work, we combine these two trends to analyze approximate empirical neural tangent kernels (eNTK) for data attribution. Approximation is critical for eNTK analysis due to the high computational cost to compute the eNTK. We define new approximate eNTK and perform novel analysis on how well the resulting kernel machine surrogate models correlate with the underlying neural network. We introduce two new random projection variants of approximate eNTK which allow users to tune the time and memory complexity of their calculation. We conclude that kernel machines using approximate neural tangent kernel as the kernel function are effective surrogate models, with the introduced trace NTK the most consistent performer.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=yKksu38BpM",
    "arxiv_id": "2305.14585",
    "GitHub": [
      "https://github.com/pnnl/projection\\_ntk"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17422,
    "title": "MAmmoTH: Building Math Generalist Models through Hybrid Instruction Tuning",
    "authors": [
      "Xiang Yue",
      "Xingwei Qu",
      "Ge Zhang",
      "Yao Fu",
      "Wenhao Huang",
      "Huan Sun",
      "Yu Su",
      "Wenhu Chen"
    ],
    "abstract": "We introduce MAmmoTH, a series of open-source large language models (LLMs) specifically tailored for general math problem-solving. The MAmmoTH models are trained on MathInstruct, our meticulously curated instruction tuning dataset. MathInstruct is compiled from 13 math datasets with intermediate rationales, six of which have rationales newly curated by us. It presents a unique hybrid of chain-of-thought (CoT) and program-of-thought (PoT) rationales, and also ensures extensive coverage of diverse fields in math. The hybrid of CoT and PoT not only unleashes the potential of tool use but also allows different thought processes for different math problems. As a result, the MAmmoTH series substantially outperform existing open-source models on nine mathematical reasoning datasets across all scales with an average accuracy gain between 16% and 32%. Remarkably, our MAmmoTH-7B model reaches 33% on MATH (a competition-level dataset), which exceeds the best open-source 7B model (WizardMath) by 23%, and the MAmmoTH-34B model achieves 44% accuracy on MATH, even surpassing GPT-4's CoT result. Our work underscores the importance of diverse problem coverage and the use of hybrid rationales in developing superior math generalist models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=yLClGs770I",
    "arxiv_id": "2309.05653",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17421,
    "title": "Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretraining",
    "authors": [
      "Licong Lin",
      "Yu Bai",
      "Song Mei"
    ],
    "abstract": "Large transformer models pretrained on offline reinforcement learning datasets have demonstrated remarkable in-context reinforcement learning (ICRL) capabilities, where they can make good decisions when prompted with interaction trajectories from unseen environments. However, when and how transformers can be trained to perform ICRL have not been theoretically well-understood. In particular, it is unclear which reinforcement-learning algorithms transformers can perform in context, and how distribution mismatch in offline training data affects the learned algorithms. This paper provides a theoretical framework that analyzes supervised pretraining for ICRL. This includes two recently proposed training methods --- algorithm distillation and decision-pretrained transformers. First, assuming model realizability, we prove the supervised-pretrained transformer will imitate the conditional expectation of the expert algorithm given the observed trajectory. The generalization error will scale with model capacity and a distribution divergence factor between the expert and offline algorithms. Second, we show transformers with ReLU attention can efficiently approximate near-optimal online reinforcement learning algorithms like LinUCB and Thompson sampling for stochastic linear bandits, and UCB-VI for tabular Markov decision processes. This provides the first quantitative analysis of the ICRL capabilities of transformers pretrained from offline trajectories.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yN4Wv17ss3",
    "arxiv_id": "2310.08566",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17420,
    "title": "Bidirectional Temporal Diffusion Model for Temporally Consistent Human Animation",
    "authors": [
      "Tserendorj Adiya",
      "Jae Shin Yoon",
      "JUNGEUN LEE",
      "Sanghun Kim",
      "Hwasup Lim"
    ],
    "abstract": "We introduce a method to generate temporally coherent human animation from a single image, a video, or a random noise.This problem has been formulated as modeling of an auto-regressive generation, i.e., to regress past frames to decode future frames.However, such unidirectional generation is highly prone to motion drifting over time, generating unrealistic human animation with significant artifacts such as appearance distortion. We claim that bidirectional temporal modeling enforces temporal coherence on a generative network by largely suppressing the appearance ambiguity.To prove our claim, we design a novel human animation framework using a denoising diffusion model: a neural network learns to generate the image of a person by denoising temporal Gaussian noises whose intermediate results are cross-conditioned bidirectionally between consecutive frames. In the experiments, our method demonstrates strong performance compared to existing unidirectional approaches with realistic temporal coherence.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yQDFsuG9HP",
    "arxiv_id": "2307.00574",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17419,
    "title": "Conversational Drug Editing Using Retrieval and Domain Feedback",
    "authors": [
      "Shengchao Liu",
      "Jiongxiao Wang",
      "Yijin Yang",
      "Chengpeng Wang",
      "Ling Liu",
      "Hongyu Guo",
      "Chaowei Xiao"
    ],
    "abstract": "Recent advancements in conversational large language models (LLMs), such as ChatGPT, have demonstrated remarkable promise in various domains, including drug discovery. However, existing works mainly focus on investigating the capabilities of conversational LLMs on chemical reactions and retrosynthesis. While drug editing, a critical task in the drug discovery pipeline, remains largely unexplored. To bridge this gap, we propose ChatDrug, a framework to facilitate the systematic investigation of drug editing using LLMs. ChatDrug jointly leverages a prompt module, a retrieval and domain feedback module, and a conversation module to streamline effective drug editing. We empirically show that ChatDrug reaches the best performance on all 39 drug editing tasks, encompassing small molecules, peptides, and proteins. We further demonstrate, through 10 case studies, that ChatDrug can successfully identify the key substructures for manipulation, generating diverse and valid suggestions for drug editing. Promisingly, we also show that ChatDrug can offer insightful explanations from a domain-specific perspective, enhancing interpretability and enabling informed decision-making.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yRrPfKyJQ2",
    "arxiv_id": "2305.18090",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17418,
    "title": "Sparse MoE with Language Guided Routing for Multilingual Machine Translation",
    "authors": [
      "Xinyu Zhao",
      "Xuxi Chen",
      "Yu Cheng",
      "Tianlong Chen"
    ],
    "abstract": "Sparse Mixture-of-Experts (SMoE) has gained increasing popularity as a promising framework for scaling up multilingual machine translation (MMT) models with negligible extra computational overheads. However, current SMoE solutions neglect the intrinsic structures of the MMT problem: ($a$) $\\textit{Linguistics Hierarchy.}$ Languages are naturally grouped according to their lingual properties like genetic families, phonological characteristics, etc; ($b$) $\\textit{Language Complexity.}$ The learning difficulties are varied for diverse languages due to their grammar complexity, available resources, etc. Therefore, routing a fixed number of experts (e.g., $1$ or $2$ experts in usual) only at the word level leads to inferior performance. To fill in the missing puzzle, we propose $\\textbf{\\texttt{Lingual-SMoE}}$ by equipping the SMoE with adaptive and linguistic-guided routing policies. Specifically, it ($1$) extracts language representations to incorporate linguistic knowledge and uses them to allocate experts into different groups; ($2$) determines the number of activated experts for each target language in an adaptive and automatic manner, according to their translation difficulties, which aims to mitigate the potential over-/under-fitting issues of learning simple/challenges translations. Sufficient experimental studies on MMT benchmarks with {$16$, $50$, $100$} language pairs and various network architectures, consistently validate the superior performance of our proposals. For instance, $\\texttt{Lingual-SMoE}$ outperforms its dense counterpart by over $5\\%$ BLEU scores on $\\texttt{OPUS-100}$ dataset. Codes are included in the supplement.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ySS7hH1smL",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17417,
    "title": "Provable Reward-Agnostic Preference-Based Reinforcement Learning",
    "authors": [
      "Wenhao Zhan",
      "Masatoshi Uehara",
      "Wen Sun",
      "Jason D. Lee"
    ],
    "abstract": "Preference-based Reinforcement Learning (PbRL) is a paradigm in which an RL agent learns to optimize a task using pair-wise preference-based feedback over trajectories, rather than explicit reward signals. While PbRL has demonstrated practical success in fine-tuning language models, existing theoretical work focuses on regret minimization and fails to capture most of the practical frameworks. In this study, we fill in such a gap between theoretical PbRL and practical algorithms by proposing a theoretical reward-agnostic PbRL framework where exploratory trajectories that enable accurate learning of hidden reward functions are acquired before collecting any human feedback. Theoretical analysis demonstrates that our algorithm requires less human feedback for learning the optimal policy under preference-based models with linear parameterization and unknown transitions, compared to the existing theoretical literature. Specifically, our framework can incorporate linear and low-rank MDPs with efficient sample complexity. Additionally, we investigate reward-agnostic RL with action-based comparison feedback and introduce an efficient querying algorithm tailored to this scenario.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=yTBXeXdbMf",
    "arxiv_id": "2305.18505",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17415,
    "title": "Bayes Conditional Distribution Estimation for Knowledge Distillation Based on Conditional Mutual Information",
    "authors": [
      "Linfeng Ye",
      "Shayan Mohajer Hamidi",
      "Renhao Tan",
      "EN-HUI YANG"
    ],
    "abstract": "It is believed that in knowledge distillation (KD), the role of the teacher is to provide an estimate for the unknown Bayes conditional probability distribution (BCPD) to be used in the student training process. Conventionally, this estimate is obtained by training the teacher using maximum log-likelihood (MLL) method. To improve this estimate for KD, in this paper we introduce the concept of conditional mutual information (CMI) into the estimation of BCPD and propose a novel estimator called the maximum CMI (MCMI) method. Specifically, in MCMI estimation, both the log-likelihood and CMI of the teacher are simultaneously maximized when the teacher is trained. In fact, maximizing the teacher's CMI value ensures that the teacher can effectively capture the contextual information within the images, and for visualizing this information, we deploy Eigen-CAM. Via conducting a thorough set of experiments, we show that by employing a teacher trained via MCMI estimation rather than one trained via MLL estimation in various state-of-the-art KD frameworks, the student's classification accuracy consistently increases, with the gain of up to 3.32\\%. This suggests that the teacher's BCPD estimate provided by MCMI method is more accurate than that provided by MLL method. In addition, we show that such improvements in the student's accuracy are more drastic in zero-shot and few-shot settings. Notably, the student's accuracy increases with the gain of up to 5.72\\% when 5\\% of the training samples are available to student (few-shot), and increases from 0\\% to as high as 84\\% for an omitted class (zero-shot).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yV6wwEbtkR",
    "arxiv_id": "2401.08732",
    "GitHub": [
      "https://github.com/iclr2024mcmi/ICLRMCMI"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17413,
    "title": "Safe Collaborative Filtering",
    "authors": [
      "Riku Togashi",
      "Tatsushi Oka",
      "Naoto Ohsaka",
      "Tetsuro Morimura"
    ],
    "abstract": "Excellent tail performance is crucial for modern machine learning tasks, such as algorithmic fairness, class imbalance, and risk-sensitive decision making, as it ensures the effective handling of challenging samples within a dataset. Tail performance is also a vital determinant of success for personalized recommender systems to reduce the risk of losing users with low satisfaction. This study introduces a \"safe\" collaborative filtering method that prioritizes recommendation quality for less-satisfied users rather than focusing on the average performance. Our approach minimizes the conditional value at risk (CVaR), which represents the average risk over the tails of users' loss. To overcome computational challenges for web-scale recommender systems, we develop a robust yet practical algorithm that extends the most scalable method, implicit alternating least squares (iALS). Empirical evaluation on real-world datasets demonstrates the excellent tail performance of our approach while maintaining competitive computational efficiency.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yarUvgEXq3",
    "arxiv_id": "2306.05292",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17412,
    "title": "Towards Assessing and Benchmarking Risk-Return Tradeoff of Off-Policy Evaluation",
    "authors": [
      "Haruka Kiyohara",
      "Ren Kishimoto",
      "Kosuke Kawakami",
      "Ken Kobayashi",
      "Kazuhide Nakata",
      "Yuta Saito"
    ],
    "abstract": "**Off-Policy Evaluation (OPE)** aims to assess the effectiveness of counterfactual policies using offline logged data and is frequently utilized to identify the top-$k$ promising policies for deployment in online A/B tests. Existing evaluation metrics for OPE estimators primarily focus on the \"accuracy\" of OPE or that of downstream policy selection, neglecting risk-return tradeoff and *efficiency* in subsequent online policy deployment. To address this issue, we draw inspiration from portfolio evaluation in finance and develop a new metric, called **SharpeRatio@k**, which measures the risk-return tradeoff and efficiency of policy portfolios formed by an OPE estimator under varying online evaluation budgets ($k$). We first demonstrate, in two example scenarios, that our proposed metric can clearly distinguish between conservative and high-stakes OPE estimators and reliably identify the most *efficient* estimator capable of forming superior portfolios of candidate policies that maximize return with minimal risk during online deployment, while existing evaluation metrics produce only degenerate results. To facilitate a quick, accurate, and consistent evaluation of OPE via SharpeRatio@k, we have also implemented the proposed metric in an open-source software. Using SharpeRatio@k and the software, we conduct a benchmark experiment of various OPE estimators regarding their risk-return tradeoff, presenting several future directions for OPE research.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ycF7mKfVGO",
    "arxiv_id": "2311.18207",
    "GitHub": [
      "https://github.com/hakuhodo-technologies/scope-rl"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17411,
    "title": "EmerNeRF: Emergent Spatial-Temporal Scene Decomposition via Self-Supervision",
    "authors": [
      "Jiawei Yang",
      "Boris Ivanovic",
      "Or Litany",
      "Xinshuo Weng",
      "Seung Wook Kim",
      "Boyi Li",
      "Tong Che",
      "Danfei Xu",
      "Sanja Fidler",
      "Marco Pavone",
      "Yue Wang"
    ],
    "abstract": "We present EmerNeRF, a simple yet powerful approach for learning spatial-temporal representations of dynamic driving scenes. Grounded in neural fields, EmerNeRF simultaneously captures scene geometry, appearance, motion, and semantics via self-bootstrapping. EmerNeRF hinges upon two core components: First, it stratifies scenes into static and dynamic fields. This decomposition emerges purely from self-supervision, enabling our model to learn from general, in-the-wild data sources. Second, EmerNeRF parameterizes an induced flow field from the dynamic field and uses this flow field to further aggregate multi-frame features, amplifying the rendering precision of dynamic objects. Coupling these three fields (static, dynamic, and flow) enables EmerNeRF to represent highly-dynamic scenes self-sufficiently, without relying on ground truth object annotations or pre-trained models for dynamic object segmentation or optical flow estimation. Our method achieves state-of-the-art performance in sensor simulation, significantly outperforming previous methods when reconstructing static (+2.39 PSNR) and dynamic (+3.25 PSNR) scenes. In addition, to bolster EmerNeRF's semantic generalization, we lift 2D visual foundation model features into 4D space-time and address a general positional bias in modern Transformers, significantly boosting 3D perception performance (e.g., 78.5% relative improvement in occupancy prediction accuracy). Finally, we construct a diverse and challenging 120-sequence dataset to benchmark neural fields under extreme and highly-dynamic settings. Visualizations, code, and data will be anonymously available at https://anonymous.4open.science/r/EmerNeRF_review-003B/",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ycv2z8TYur",
    "arxiv_id": "2311.02077",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17410,
    "title": "Variance-enlarged Poisson Learning for Graph-based Semi-Supervised Learning with Extremely Sparse Labeled Data",
    "authors": [
      "Xiong Zhou",
      "Xianming Liu",
      "Hao Yu",
      "Jialiang Wang",
      "Zeke Xie",
      "Junjun Jiang",
      "Xiangyang Ji"
    ],
    "abstract": "suffer from degenerate solutions where label functions tend to be nearly constant across unlabeled data. In this paper, we introduce Variance-enlarged Poisson Learning (VPL), a simple yet powerful framework tailored to address the challenges arising from the presence of degenerate solutions. VPL incorporates a variance-enlarged regularization term, which induces a Poisson equation specifically for unlabeled data. This intuitive approach increases the dispersion of labels from their average mean, effectively reducing the likelihood of degenerate solutions characterized by nearly constant label functions. We subsequently introduce two streamlined algorithms, V-Laplace and V-Poisson, each intricately designed to enhance Laplace and Poisson learning, respectively. Furthermore, we broaden the scope of VPL to encompass graph neural networks, introducing Variance-enlarged Graph Poisson Networks to facilitate improved label propagation. To achieve a deeper understanding of VPL's behavior, we conduct a comprehensive theoretical exploration in both discrete and variational cases. Our findings elucidate that VPL inherently amplifies the importance of connections within the same class while concurrently tempering those between different classes. We support our claims with extensive experiments, demonstrating the effectiveness of VPL and showcasing its superiority over existing methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yeeVBMDAwy",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17846,
    "title": "Video Decomposition Prior: Editing Videos Layer by Layer",
    "authors": [
      "Gaurav Shrivastava",
      "Ser-Nam Lim",
      "Abhinav Shrivastava"
    ],
    "abstract": "In the evolving landscape of video editing methodologies, a majority of  deep learning techniques are often reliant on extensive datasets of observed input and ground truth sequence pairs for optimal performance. Such reliance often falters when acquiring data becomes challenging, especially in tasks like video dehazing and relighting, where replicating identical motions and camera angles in both corrupted and ground truth sequences is complicated. Moreover, these conventional methodologies perform best when the test distribution closely mirrors the training distribution. Recognizing these challenges, this paper introduces a novel video decomposition prior `VDP' framework which derives inspiration from professional video editing practices. Our methodology does not mandate task-specific external data corpus collection, instead pivots to utilizing the motion and appearance of the input video. VDP framework decomposes a video sequence into a set of multiple RGB layers and associated opacity levels. These set of layers are then manipulated individually to obtain the desired results. We addresses tasks such as video object segmentation, dehazing, and relighting. Moreover, we introduce a novel logarithmic video decomposition formulation for video relighting tasks, setting a new benchmark over the existing methodologies. We evaluate our approach on standard video datasets like DAVIS, REVIDE, & SDSD and show qualitative results on a diverse array of internet videos.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nfMyERXNru",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17409,
    "title": "VDC: Versatile Data Cleanser based on Visual-Linguistic Inconsistency by Multimodal Large Language Models",
    "authors": [
      "Zihao Zhu",
      "Mingda Zhang",
      "Shaokui Wei",
      "Bingzhe Wu",
      "Baoyuan Wu"
    ],
    "abstract": "The role of data in building AI systems has recently been emphasized by the emerging concept of data-centric AI. Unfortunately, in the real-world, datasets may contain dirty samples, such as poisoned samples from backdoor attack, noisy labels in crowdsourcing, and even hybrids of them. The presence of such dirty samples makes the DNNs vunerable and unreliable. Hence, it is critical to detect dirty samples to improve the quality and realiability of dataset. Existing detectors only focus on detecting poisoned samples or noisy labels, that are often prone to weak generalization when dealing with dirty samples from other fields. In this paper, we find a commonality of various dirty samples is visual-linguistic inconsistency between images and associated labels.  To capture the semantic inconsistency between modalities, we propose versatile data cleanser (VDC) leveraging the surpassing capabilities of multimodal large language models (MLLM) in cross-modal alignment and reasoning. It consists of three consecutive modules: the visual question generation module to generate insightful questions about the image; the visual question answering module to acquire the semantics of the visual content by answering the questions with MLLM; followed by the visual answer evaluation module to evaluate the inconsistency. Extensive experiments demonstrate its superior performance and generalization to various categories and types of dirty samples.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ygxTuVz9eU",
    "arxiv_id": "2309.16211",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17407,
    "title": "Incentivized Truthful Communication for Federated Bandits",
    "authors": [
      "Zhepei Wei",
      "Chuanhao Li",
      "Tianze Ren",
      "Haifeng Xu",
      "Hongning Wang"
    ],
    "abstract": "To enhance the efficiency and practicality of federated bandit learning, recent advances have introduced incentives to motivate communication among clients, where a client participates only when the incentive offered by the server outweighs its participation cost. However, existing incentive mechanisms naively assume the clients are truthful: they all report their true cost and thus the higher cost one participating client claims, the more the server has to pay. Therefore, such mechanisms are vulnerable to strategic clients aiming to optimize their own utility by misreporting. To address this issue, we propose an incentive compatible (i.e., truthful) communication protocol, named Truth-FedBan, where the incentive for each participant is independent of its self-reported cost, and reporting the true cost is the only way to achieve the best utility. More importantly, Truth-FedBan still guarantees the sub-linear regret and communication cost without any overhead. In other words, the core conceptual contribution of this paper is, for the first time, demonstrating the possibility of simultaneously achieving incentive compatibility and nearly optimal regret in federated bandit learning. Extensive numerical studies further validate the effectiveness of our proposed solution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ykEixGIJYb",
    "arxiv_id": "2402.04485",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17408,
    "title": "Chain of Log-Concave Markov Chains",
    "authors": [
      "Saeed Saremi",
      "Ji Won Park",
      "Francis Bach"
    ],
    "abstract": "We introduce a theoretical framework for sampling from unnormalized densities based on a smoothing scheme that uses an isotropic Gaussian kernel with a single fixed noise scale. We prove one can decompose sampling from a density (minimal assumptions made on the density) into a sequence of sampling from log-concave conditional densities via accumulation of noisy measurements with equal noise levels. Our construction is unique in that it keeps track of a history of samples, making it non-Markovian as a whole, but it is lightweight algorithmically as the history only shows up in the form of a running empirical mean of samples. Our sampling algorithm generalizes walk-jump sampling (Saremi & Hyv\u00e4rinen, 2019). The \"walk\" phase becomes a (non-Markovian) chain of (log-concave) Markov chains. The \"jump\" from the accumulated measurements is obtained by empirical Bayes. We study our sampling algorithm quantitatively using the 2-Wasserstein metric and compare it with various Langevin MCMC algorithms. We also report a remarkable capacity of our algorithm to \"tunnel\" between modes of a distribution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yiMB2DOjsR",
    "arxiv_id": "2305.19473",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17406,
    "title": "Pre-Training and Fine-Tuning Generative Flow Networks",
    "authors": [
      "Ling Pan",
      "Moksh Jain",
      "Kanika Madan",
      "Yoshua Bengio"
    ],
    "abstract": "Generative Flow Networks (GFlowNets) are amortized samplers that learn stochastic policies to sequentially generate compositional objects from a given unnormalized reward distribution.They can generate diverse sets of high-reward objects, which is an important consideration in scientific discovery tasks. However, as they are typically trained from a given extrinsic reward function, it remains an important open challenge about how to leverage the power of pre-training and train GFlowNets in an unsupervised fashion for efficient adaptation to downstream tasks.Inspired by recent successes of unsupervised pre-training in various domains, we introduce a novel approach for reward-free pre-training of GFlowNets. By framing the training as a self-supervised problem, we propose an outcome-conditioned GFlowNet (OC-GFN) that learns to explore the candidate space. Specifically, OC-GFN learns to reach any targeted outcomes, akin to goal-conditioned policies in reinforcement learning. We show that the pre-trained OC-GFN model can allow for a direct extraction of a policy capable of sampling from any new reward functions in downstream tasks.Nonetheless, adapting OC-GFN on a downstream task-specific reward involves an intractable marginalization over possible outcomes. We propose a novel way to approximate this marginalization by learning an amortized predictor enabling efficient fine-tuning.Extensive experimental results validate the efficacy of our approach, demonstrating the effectiveness of pre-training the OC-GFN, and its ability to swiftly adapt to downstream tasks and discover modes more efficiently.This work may serve as a foundation for further exploration of pre-training strategies in the context of GFlowNets.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ylhiMfpqkm",
    "arxiv_id": "2310.03419",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17405,
    "title": "Image Background Serves as Good Proxy for Out-of-distribution Data",
    "authors": [
      "Sen Pei"
    ],
    "abstract": "Out-of-distribution (OOD) detection empowers the model trained on the closed image set to identify unknown data in the open world. Though many prior techniques have yielded considerable improvements in this research direction, two crucial obstacles still remain. Firstly, a unified perspective has yet to be presented to view the developed arts with individual designs, which is vital for providing insights into future work. Secondly, we expect sufficient natural OOD supervision to promote the generation of compact boundaries between the in-distribution (ID) and OOD data without collecting explicit OOD samples. To tackle these issues, we propose a general probabilistic framework to interpret many existing methods and an OOD-data-free model, namely $\\textbf{S}$elf-supervised $\\textbf{S}$ampling for $\\textbf{O}$OD $\\textbf{D}$etection (SSOD). SSOD efficiently exploits natural OOD signals from the ID data based on the local property of convolution. With these supervisions, it jointly optimizes the OOD detection and conventional ID classification in an end-to-end manner. Extensive experiments reveal that SSOD establishes competitive state-of-the-art performance on many large-scale benchmarks, outperforming the best previous method by a large margin, e.g., reporting $\\textbf{-6.28}$% FPR95 and $\\textbf{+0.77}$% AUROC on ImageNet, $\\textbf{-19.01}$% FPR95 and $\\textbf{+3.04}$% AUROC on CIFAR-10, and top-ranked performance on hard OOD datasets, i.e., ImageNet-O and OpenImage-O.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ym0ubZrsmm",
    "arxiv_id": "2307.00519",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17402,
    "title": "Image Translation as Diffusion Visual Programmers",
    "authors": [
      "Cheng Han",
      "James Chenhao Liang",
      "Qifan Wang",
      "MAJID RABBANI",
      "Sohail Dianat",
      "Raghuveer Rao",
      "Ying Nian Wu",
      "Dongfang Liu"
    ],
    "abstract": "We introduce the novel Diffusion Visual Programmer (DVP), a neuro-symbolic image translation framework. Our proposed DVP seamlessly embeds a condition-flexible diffusion model within the GPT architecture, orchestrating a coherent sequence of visual programs ($i.e.$, computer vision models) for various pro-symbolic steps, which span RoI identification, style transfer, and position manipulation, facilitating transparent and controllable image translation processes. Extensive experiments demonstrate DVP\u2019s remarkable performance, surpassing concurrent arts. This success can be attributed to several key features of DVP: First, DVP achieves condition-flexible translation via instance normalization, enabling the model to eliminate sensitivity caused by the manual guidance and optimally focus on textual descriptions for high-quality content generation. Second, the frame work enhances in-context reasoning by deciphering intricate high-dimensional concepts in feature spaces into more accessible low-dimensional symbols ($e.g.$, [Prompt], [RoI object]), allowing for localized, context-free editing while maintaining overall coherence. Last but not least, DVP improves systemic controllability and explainability by offering explicit symbolic representations at each programming stage, empowering users to intuitively interpret and modify results. Our research marks a substantial step towards harmonizing artificial image translation processes with cognitive intelligence, promising broader applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yozwqhIHXj",
    "arxiv_id": "2401.09742",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17400,
    "title": "Equivariant Matrix Function Neural Networks",
    "authors": [
      "Ilyes Batatia",
      "Lars Leon Schaaf",
      "Gabor Csanyi",
      "Christoph Ortner",
      "Felix Andreas Faber"
    ],
    "abstract": "Graph Neural Networks (GNNs), especially message-passing neural networks (MPNNs), have emerged as powerful architectures for learning on graphs in diverse applications. However, MPNNs face challenges when modeling non-local interactions in systems such as large conjugated molecules, metals, or amorphous materials.Although Spectral GNNs and traditional neural networks such as recurrent neural networks and transformers mitigate these challenges, they often lack extensivity, adaptability, generalizability, computational efficiency, or fail to capture detailed structural relationships or symmetries in the data. To address these concerns, we introduce Matrix Function Neural Networks (MFNs), a novel architecture that parameterizes non-local interactions through analytic matrix equivariant functions. Employing resolvent expansions offers a straightforward implementation and the potential for linear scaling with system size.The MFN architecture achieves state-of-the-art performance in standard graph benchmarks, such as the ZINC and TU datasets, and is able to capture intricate non-local interactions in quantum systems. The code and the datasets will be made public.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=yrgQdA5NkI",
    "arxiv_id": "2310.10434",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17399,
    "title": "A Quadratic Synchronization Rule for Distributed Deep Learning",
    "authors": [
      "Xinran Gu",
      "Kaifeng Lyu",
      "Sanjeev Arora",
      "Jingzhao Zhang",
      "Longbo Huang"
    ],
    "abstract": "In distributed deep learning with data parallelism, synchronizing gradients at each training step can cause a huge communication overhead, especially when many nodes work together to train large models.  Local gradient methods, such as Local SGD, address this issue by allowing workers to compute locally for $H$ steps without synchronizing with others, hence reducing communication frequency.  While $H$ has been viewed as a hyperparameter to trade optimization efficiency for communication cost, recent research indicates that setting a proper  $H$ value can lead to generalization improvement. Yet, selecting a proper $H$ is elusive. This work proposes a theory-grounded method for determining $H$, named the Quadratic Synchronization Rule (QSR), which recommends dynamically setting $H$ in proportion to $\\frac{1}{\\eta^2}$ as the learning rate $\\eta$ decays over time.  Extensive ImageNet experiments on ResNet and ViT show that local gradient methods with QSR consistently improve the test accuracy over other synchronization strategies. Compared to the standard data parallel training, QSR enables Local AdamW to cut the training time on 16 or 64 GPUs down from 26.7 to 20.2 hours or from 8.6 to 5.5 hours and, at the same time, achieves 1.16% or 0.84% higher top-1 validation accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yroyhkhWS6",
    "arxiv_id": "2310.14423",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17398,
    "title": "Empirical Analysis of Model Selection for Heterogeneous Causal Effect Estimation",
    "authors": [
      "Divyat Mahajan",
      "Ioannis Mitliagkas",
      "Brady Neal",
      "Vasilis Syrgkanis"
    ],
    "abstract": "We study the problem of model selection in causal inference, specifically for the case of conditional average treatment effect (CATE) estimation under binary treatments. Unlike model selection in machine learning, there is no perfect analogue of cross-validation as we do not observe the counterfactual potential outcome for any data point. Towards this, there have been a variety of proxy metrics proposed in the literature, that depend on auxiliary nuisance models estimated from the observed data (propensity score model, outcome regression model). However, the effectiveness of these metrics has only been studied on synthetic datasets as we can access the counterfactual data for them. We conduct an extensive empirical analysis to judge the performance of these metrics introduced in the literature, and novel ones introduced in this work, where we utilize the latest advances in generative modeling to incorporate multiple realistic datasets. Our analysis suggests novel model selection strategies based on careful hyperparameter tuning of CATE estimators and causal ensembling.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=yuy6cGt3KL",
    "arxiv_id": "2211.01939",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17397,
    "title": "Generating Pragmatic Examples to Train Neural Program Synthesizers",
    "authors": [
      "Saujas Vaduguru",
      "Daniel Fried",
      "Yewen Pu"
    ],
    "abstract": "Programming-by-example is the task of synthesizing a program that is consistent with a set of user-provided input-output examples. As examples are often an under-specification of one's intent, a good synthesizer must choose the intended program from the many that are consistent with the given set of examples. Prior work frames program synthesis as a cooperative game between a listener (that synthesizes programs) and a speaker (a user choosing examples), and shows that models of computational pragmatic inference is effective in choosing the user intended programs. However, these models requires counterfactual reasoning over a large set of programs and examples, which is infeasible in realistic program spaces. In this paper, we propose a novel way to amortize this search. We sample pairs of programs and examples via self-play between listener and speaker models, and use pragmatic inference to choose informative training examples from this sample.We then use the informative dataset to train models to improve the synthesizer's ability to disambiguate user-provided examples _without human supervision. We validate our method on the challenging task of synthesizing regular expressions from example strings, finding that our method (1) outperforms models trained without choosing pragmatic examples by 23% (a 51% relative increase) (2) matches the performance of supervised learning on a dataset of pragmatic examples provided by humans, despite using no human data in training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yxKZGQLzOP",
    "arxiv_id": "2311.05740",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17396,
    "title": "Matcher: Segment Anything with One Shot Using All-Purpose Feature Matching",
    "authors": [
      "Yang Liu",
      "Muzhi Zhu",
      "Hengtao Li",
      "Hao Chen",
      "Xinlong Wang",
      "Chunhua Shen"
    ],
    "abstract": "Powered by large-scale pre-training, vision foundation models exhibit significant potential in open-world image understanding. However, unlike large language models that excel at directly tackling various language tasks, vision foundation models require a task-specific model structure followed by fine-tuning on specific tasks. In this work, we present $\\textbf{Matcher}$, a novel perception paradigm that utilizes off-the-shelf vision foundation models to address various perception tasks. Matcher can segment anything by using an in-context example without training. Additionally, we design three effective components within the Matcher framework to collaborate with these foundation models and unleash their full potential in diverse perception tasks. Matcher demonstrates impressive generalization performance across various segmentation tasks, all without training. For example, it achieves 52.7% mIoU on COCO-20$^i$ with one example, surpassing the state-of-the-art specialist model by 1.6%. In addition, Matcher achieves 33.0% mIoU on the proposed LVIS-92$^i$ for one-shot semantic segmentation, outperforming the state-of-the-art generalist model by 14.4%. Our visualization results further showcase the open-world generality and flexibility of Matcher when applied to images in the wild.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yzRXdhk2he",
    "arxiv_id": "2305.13310",
    "GitHub": [
      "https://github.com/aim-uofa/Matcher"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17394,
    "title": "Revisit and Outstrip Entity Alignment: A Perspective of Generative Models",
    "authors": [
      "Lingbing Guo",
      "Zhuo Chen",
      "Jiaoyan Chen",
      "Yin Fang",
      "Wen Zhang",
      "Huajun Chen"
    ],
    "abstract": "Recent embedding-based methods have achieved great successes in exploiting entity alignment from knowledge graph (KG) embeddings of multiple modalities. In this paper, we study embedding-based entity alignment (EEA) from a perspective of generative models. We show that EEA shares similarities with typical generative models and prove the effectiveness of the recently developed generative adversarial network (GAN)-based EEA methods theoretically. We then reveal that their incomplete objective limits the capacity on both entity alignment and entity synthesis (i.e., generating new entities). We mitigate this problem by introducing a generative EEA (GEEA) framework with the proposed mutual variational autoencoder (M-VAE) as the generative model. M-VAE enables entity conversion between KGs and generation of new entities from random noise vectors. We demonstrate the power of GEEA with theoretical analysis and empirical experiments on both entity alignment and entity synthesis tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=z3dfuRcGAK",
    "arxiv_id": "2305.14651",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17393,
    "title": "Pre-training with Random Orthogonal Projection Image Modeling",
    "authors": [
      "Maryam Haghighat",
      "Peyman Moghadam",
      "Shaheer Mohamed",
      "Piotr Koniusz"
    ],
    "abstract": "Masked Image Modeling (MIM) is a powerful self-supervised strategy for visual pre-training without the use of labels. MIM applies random crops to input images, processes them with an encoder, and then recovers the masked inputs with a decoder, which encourages the network to capture and learn structural information about objects and scenes. The intermediate feature representations obtained from MIM are suitable for fine-tuning on downstream tasks. In this paper, we propose an Image Modeling framework based on random orthogonal projection instead of binary masking as in MIM. Our proposed Random Orthogonal Projection Image Modeling (ROPIM) reduces spatially-wise token information under guaranteed bound on the noise variance and can be considered as masking entire spatial image area under locally varying masking degrees. Since ROPIM uses a random subspace for the projection that realizes the masking step, the readily available complement of the subspace can be used during unmasking to promote recovery of removed information. In this paper, we show that using random orthogonal projection leads to superior performance compared to crop-based masking. We demonstrate state-of-the-art results on several popular benchmarks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=z4Hcegjzph",
    "arxiv_id": "2310.18737",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17392,
    "title": "Byzantine Robust Cooperative Multi-Agent Reinforcement Learning as a Bayesian Game",
    "authors": [
      "Simin Li",
      "Jun Guo",
      "Jingqiao Xiu",
      "Ruixiao Xu",
      "Xin Yu",
      "Jiakai Wang",
      "Aishan Liu",
      "Yaodong Yang",
      "Xianglong Liu"
    ],
    "abstract": "In this study, we explore the robustness of cooperative multi-agent reinforcement learning (c-MARL) against Byzantine failures, where any agent can enact arbitrary, worst-case actions due to malfunction or adversarial attack. To address the uncertainty that any agent can be adversarial, we propose a Bayesian Adversarial Robust Dec-POMDP (BARDec-POMDP) framework, which views Byzantine adversaries as nature-dictated types, represented by a separate transition. This allows agents to learn policies grounded on their posterior beliefs about the type of other agents, fostering collaboration with identified allies and minimizing vulnerability to adversarial manipulation. We define the optimal solution to the BARDec-POMDP as an ex interim robust Markov perfect Bayesian equilibrium, which we proof to exist and the corresponding policy weakly dominates previous approaches as time goes to infinity. To realize this equilibrium, we put forward a two-timescale actor-critic algorithm with almost sure convergence under specific conditions. Experiments on matrix game, Level-based Foraging and StarCraft II indicate that, our method successfully acquires intricate micromanagement skills and adaptively aligns with allies under worst-case perturbations, showing resilience against non-oblivious adversaries, random allies, observation-based attacks, and transfer-based attacks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=z6KS9D1dxt",
    "arxiv_id": "2305.12872",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17390,
    "title": "Perceptual Scales Predicted by Fisher Information Metrics",
    "authors": [
      "Jonathan Vacher",
      "Pascal Mamassian"
    ],
    "abstract": "Perception is often viewed as a process that transforms physical variables, external to an observer, into internal psychological variables. Such a process can be modeled by a function coined *perceptual scale*. The *perceptual scale* can be deduced from psychophysical measurements that consist in comparing the relative differences between stimuli (i.e. difference scaling experiments). However, this approach is often overlooked by the modeling and experimentation communities. Here, we demonstrate the value of measuring the *perceptual scale* of classical (spatial frequency, orientation) and less classical physical variables (interpolation between textures) by embedding it in recent probabilistic modeling of perception. First, we show that the assumption that an observer has an internal representation of univariate parameters such as spatial frequency or orientation while stimuli are high-dimensional does not lead to contradictory predictions when following the theoretical framework. Second, we show that the measured *perceptual scale* corresponds to the transduction function hypothesized in this framework. In particular, we demonstrate that it is related to the Fisher information of the generative model that underlies perception and we test the predictions given by the generative model of different stimuli in a set a of difference scaling experiments. Our main conclusion is that the *perceptual scale* is mostly driven by the stimulus power spectrum. Finally, we propose that this measure of *perceptual scale* is a way to push further the notion of perceptual distances by estimating the perceptual geometry of images i.e. the path between images instead of simply the distance between those.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=z7K2faBrDG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17389,
    "title": "MathCoder: Seamless Code Integration in LLMs for Enhanced Mathematical Reasoning",
    "authors": [
      "Ke Wang",
      "Houxing Ren",
      "Aojun Zhou",
      "Zimu Lu",
      "Sichun Luo",
      "Weikang Shi",
      "Renrui Zhang",
      "Linqi Song",
      "Mingjie Zhan",
      "Hongsheng Li"
    ],
    "abstract": "The recently released GPT-4 Code Interpreter has demonstrated remarkable proficiency in solving challenging math problems, primarily attributed to its ability to seamlessly reason with natural language, generate code, execute code, and continue reasoning based on the execution output. In this paper, we present a method to fine-tune open-source language models, enabling them to use code for modeling and deriving math equations and, consequently, enhancing their mathematical reasoning abilities. We propose a method of generating novel and high-quality datasets with math problems and their code-based solutions, referred to as MathCodeInstruct. Each solution interleaves $\\textit{natural language}$, $\\textit{code}$, and $\\textit{execution results}$. We also introduce a customized supervised fine-tuning and inference approach. This approach yields the MathCoder models, a family of models capable of generating code-based solutions for solving challenging math problems. Impressively, the MathCoder models achieve state-of-the-art scores among open-source LLMs on the MATH (45.2%) and GSM8K (83.9%) datasets, substantially outperforming other open-source alternatives. Notably, the MathCoder model not only surpasses ChatGPT-3.5 and PaLM-2 on GSM8K and MATH but also outperforms GPT-4 on the competition-level MATH dataset. The proposed dataset and models will be released upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=z8TW0ttBPp",
    "arxiv_id": "2310.03731",
    "GitHub": [
      "https://github.com/mathllm/MathCoder"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17385,
    "title": "CADS: Unleashing the Diversity of Diffusion Models through Condition-Annealed Sampling",
    "authors": [
      "Seyedmorteza Sadat",
      "Jakob Buhmann",
      "Derek Bradley",
      "Otmar Hilliges",
      "Romann M. Weber"
    ],
    "abstract": "While conditional diffusion models are known to have good coverage of the data distribution, they still face limitations in output diversity, particularly when sampled with a high classifier-free guidance scale for optimal image quality or when trained on small datasets. We attribute this problem to the role of the conditioning signal in inference and offer an improved sampling strategy for diffusion models that can increase generation diversity, especially at high guidance scales, with minimal loss of sample quality. Our sampling strategy anneals the conditioning signal by adding scheduled, monotonically decreasing Gaussian noise to the conditioning vector during inference to balance diversity and condition alignment. Our Condition-Annealed Diffusion Sampler (CADS) can be used with any pretrained model and sampling algorithm, and we show that it boosts the diversity of diffusion models in various conditional generation tasks. Further, using an existing pretrained diffusion model, CADS achieves a new state-of-the-art FID of 1.70 and 2.31 for class-conditional ImageNet generation  at 256$\\times$256 and 512$\\times$512 respectively.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=zMoNrajk2X",
    "arxiv_id": "2310.17347",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17384,
    "title": "Error Norm Truncation: Robust Training in the Presence of Data Noise for Text Generation Models",
    "authors": [
      "Tianjian Li",
      "Haoran Xu",
      "Philipp Koehn",
      "Daniel Khashabi",
      "Kenton Murray"
    ],
    "abstract": "Text generation models are notoriously vulnerable to errors in the training data. With the wide-spread availability of massive amounts of web-crawled data becoming more commonplace, how can we enhance the robustness of models trained on a massive amount of noisy web-crawled text? In our work, we propose Error Norm Truncation (ENT), a robust enhancement method to the standard training objective that truncates noisy data. Compared to methods that only uses the negative log-likelihood loss to estimate data quality, our method provides a more accurate estimation by considering the distribution of non-target tokens, which is often overlooked by previous work. Through comprehensive experiments across language modeling, machine translation, and text summarization, we show that equipping text generation models with ENT improves generation quality over standard training and previous soft and hard truncation methods. Furthermore, we show that our method improves the robustness of models against two of the most detrimental types of noise in machine translation, resulting in an increase of more than 2 BLEU points over the MLE baseline when up to 50\\% of noise is added to the data.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=zMvMwNvs4R",
    "arxiv_id": "2310.00840",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17382,
    "title": "Task Adaptation from Skills: Information Geometry, Disentanglement, and New Objectives for Unsupervised Reinforcement Learning",
    "authors": [
      "Yucheng Yang",
      "Tianyi Zhou",
      "Qiang He",
      "Lei Han",
      "Mykola Pechenizkiy",
      "Meng Fang"
    ],
    "abstract": "Unsupervised reinforcement learning (URL) aims to learn general skills for unseen downstream tasks. Mutual Information Skill Learning (MISL) addresses URL by maximizing the mutual information between states and skills but lacks sufficient theoretical analysis, e.g., how well its learned skills can initialize a downstream task's policy. Our new theoretical analysis shows that the diversity and separatability of learned skills are fundamentally critical to downstream task adaptation but MISL does not necessarily guarantee them. To improve MISL, we propose a novel disentanglement metric LSEPIN and build an information-geometric connection between LSEPIN and downstream task adaptation cost. For better geometric properties, we investigate a new strategy that replaces the KL divergence in information geometry with Wasserstein distance. We extend the geometric analysis to it, which leads to a novel skill-learning objective WSEP. It is theoretically justified to be helpful to task adaptation and it is capable of discovering more initial policies for downstream tasks than MISL. We further propose a Wasserstein distance-based algorithm PWSEP can theoretically discover all potentially optimal initial policies.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=zSxpnKh1yS",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17383,
    "title": "Neural Processing of Tri-Plane Hybrid Neural Fields",
    "authors": [
      "Adriano Cardace",
      "Pierluigi Zama Ramirez",
      "Francesco Ballerini",
      "Allan Zhou",
      "Samuele Salti",
      "Luigi di Stefano"
    ],
    "abstract": "Driven by the appealing properties of neural fields for storing and communicating 3D data, the problem of directly processing them to address tasks such as classification and part segmentation has emerged and has been investigated in recent works. Early approaches employ neural fields parameterized by shared networks trained on the whole dataset, achieving good task performance but sacrificing reconstruction quality.To improve the latter, later methods focus on individual neural fields parameterized as large Multi-Layer Perceptrons (MLPs), which are, however, challenging to process due to the high dimensionality of the weight space, intrinsic weight space symmetries, and sensitivity to random initialization. Hence, results turn out significantly inferior to those achieved by processing explicit representations, e.g., point clouds or meshes.In the meantime, hybrid representations, in particular based on tri-planes, have emerged as a more effective and efficient alternative to realize neural fields, but their direct processing has not been investigated yet.In this paper, we show that the tri-plane discrete data structure encodes rich information, which can be effectively processed by standard deep-learning machinery. We define an extensive benchmark covering a diverse set of fields such as occupancy, signed/unsigned distance, and, for the first time,  radiance fields. While processing a field with the same reconstruction quality, we achieve task performance far superior to frameworks that process large MLPs and, for the first time, almost on par with architectures handling explicit representations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zRkM6UcA22",
    "arxiv_id": "2310.01140",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17380,
    "title": "FROSTER: Frozen CLIP is A Strong Teacher for Open-Vocabulary Action Recognition",
    "authors": [
      "Xiaohu Huang",
      "Hao Zhou",
      "Kun Yao",
      "Kai Han"
    ],
    "abstract": "In this paper, we introduce \\textbf{FROSTER}, an effective framework for open-vocabulary action recognition. The CLIP model has achieved remarkable success in a range of image-based tasks, benefiting from its strong generalization capability stemming from pretaining on massive image-text pairs. However, applying CLIP directly to the open-vocabulary action recognition task is challenging due to the absence of temporal information in CLIP's pretraining. Further, fine-tuning CLIP on action recognition datasets may lead to overfitting and hinder its generalizability, resulting in unsatisfactory results when dealing with unseen actions.To address these issues, FROSTER employs a residual feature distillation approach to ensure that CLIP retains its generalization capability while effectively adapting to the action recognition task. Specifically, the residual feature distillation treats the frozen CLIP model as a teacher to maintain the generalizability exhibited by the original CLIP and supervises the feature learning for the extraction of video-specific features to bridge the gap between images and videos. Meanwhile, it uses a residual sub-network for feature distillation to reach a balance between the two distinct objectives of learning generalizable and video-specific features.We extensively evaluate FROSTER on open-vocabulary action recognition benchmarks under both base-to-novel and cross-dataset settings.  FROSTER consistently achieves state-of-the-art performance on all datasets across the board. Project page: \\url{https://visual-ai.github.io/froster}.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zYXFMeHRtO",
    "arxiv_id": "2402.03241",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17378,
    "title": "How do Language Models Bind Entities in Context?",
    "authors": [
      "Jiahai Feng",
      "Jacob Steinhardt"
    ],
    "abstract": "Language models (LMs) can recall facts mentioned in context, as shown by their performance on reading comprehension tasks. When the context describes facts about more than one entity, the LM has to correctly bind attributes to their corresponding entity. We show, via causal experiments, that LMs' internal activations represent binding information by exhibiting appropriate binding ID vectors at the entity and attribute positions. We further show that binding ID vectors form a subspace and often transfer across tasks. Our results demonstrate that LMs learn interpretable strategies for representing symbolic knowledge in context, and that studying context activations is a fruitful direction for understanding LM cognition.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zb3b6oKO77",
    "arxiv_id": "2310.17191",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17376,
    "title": "A ROBUST DIFFERENTIAL NEURAL ODE OPTIMIZER",
    "authors": [
      "Panagiotis Theodoropoulos",
      "Guan-Horng Liu",
      "Tianrong Chen",
      "Augustinos D Saravanos",
      "Evangelos Theodorou"
    ],
    "abstract": "Neural networks and neural ODEs tend to be vulnerable to adversarial attacks, rendering robust optimizers critical to curb the success of such attacks. In this regard, the key insight of this work is to interpret Neural ODE optimization as a min-max optimal control problem. More particularly, we present Game Theoretic Second-Order Neural Optimizer (GTSONO), a robust game theoretic optimizer based on the principles of min-max Differential Dynamic Programming.The proposed method exhibits significant computational benefits due to efficient matrix decompositions and provides convergence guarantees to local saddle points.Empirically, the robustness of the proposed optimizer is demonstrated through greater robust accuracy  compared to benchmark optimizers when trained on clean images. Additionally, its ability to provide a performance increase when adapted to an already existing adversarial defense technique is also illustrated.Finally, the superiority of the proposed update law over its gradient based counterpart highlights the potential benefits of incorporating robust optimal control paradigms into adversarial training methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zbOSJ3CATY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17373,
    "title": "Long-Term Typhoon Trajectory Prediction: A Physics-Conditioned Approach Without Reanalysis Data",
    "authors": [
      "Young-Jae Park",
      "Minseok Seo",
      "Doyi Kim",
      "Hyeri Kim",
      "Sanghoon Choi",
      "Beomkyu Choi",
      "Jeongwon Ryu",
      "Sohee Son",
      "Hae-Gon Jeon",
      "Yeji Choi"
    ],
    "abstract": "In the face of escalating climate changes, typhoon intensities and their ensuing damage have surged. Accurate trajectory prediction is crucial for effective damage control. Traditional physics-based models, while comprehensive, are computationally intensive and rely heavily on the expertise of forecasters. Contemporary data-driven methods often rely on reanalysis data, which can be considered to be the closest to the true representation of weather conditions. However, reanalysis data is not produced in real-time and requires time for adjustment since prediction models are calibrated with observational data. This reanalysis data, such as ERA5, falls short in challenging real-world situations. Optimal preparedness necessitates predictions at least 72 hours in advance, beyond the capabilities of standard physics models. In response to these constraints, we present an approach that harnesses real-time Unified Model (UM) data, sidestepping the limitations of reanalysis data. Our model provides predictions at 6-hour intervals for up to 72 hours in advance and outperforms both state-of-the-art data-driven methods and numerical weather prediction models. In line with our efforts to mitigate adversities inflicted by typhoon, we release our preprocessed PHYSICS TRACK dataset, which includes ERA5 reanalysis data, typhoon best-track, and UM forecast data. We also submit our source code and pretrained models.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ziDFH8TPPK",
    "arxiv_id": "2401.15726",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17372,
    "title": "Fast and unified path gradient estimators for normalizing flows",
    "authors": [
      "Lorenz Vaitl",
      "Ludwig Winkler",
      "Lorenz Richter",
      "Pan Kessel"
    ],
    "abstract": "Recent work shows that path gradient estimators for normalizing flows have lower variance compared to standard estimators, resulting in improved training. However, they are often prohibitively more expensive from a computational point of view and cannot be applied to maximum likelihood training in a scalable manner, which severely hinders their widespread adoption. In this work, we overcome these crucial limitations. Specifically, we propose a fast path gradient estimator which works for all normalizing flow architectures of practical relevance for sampling from an unnormalized target distribution. We then show that this estimator can also be applied to maximum likelihood training and empirically establish its superior performance for several natural sciences applications.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zlkXLb3wpF",
    "arxiv_id": "2403.15881",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17371,
    "title": "Nemesis: Normalizing the Soft-prompt Vectors of Vision-Language Models",
    "authors": [
      "Shuai Fu",
      "Xiequn Wang",
      "Qiushi Huang",
      "Yu Zhang"
    ],
    "abstract": "With the prevalence of large-scale pretrained vision-language models (VLMs), such as CLIP, soft-prompt tuning has become a popular method for adapting these models to various downstream tasks. However, few works delve into the inherent properties of learnable soft-prompt vectors, specifically the impact of their norms to the performance of VLMs. This motivates us to pose an unexplored research question: ``Do we need to normalize the soft prompts in VLMs?'' To fill this research gap, we first uncover a phenomenon, called the $\\textbf{Low-Norm Effect}$ by performing extensive corruption experiments, suggesting that reducing the norms of certain learned prompts occasionally enhances the performance of VLMs, while increasing them often degrades it. To utilize this effect, we propose a novel method named $\\textbf{N}$ormalizing th$\\textbf{e}$ soft-pro$\\textbf{m}$pt v$\\textbf{e}$ctors of vi$\\textbf{si}$on-language model$\\textbf{s}$ ($\\textbf{Nemesis}$) to normalize soft-prompt vectors in VLMs. To the best of our knowledge, our work is the first to systematically investigate the role of norms of soft-prompt vector in VLMs, offering valuable insights for future research in soft-prompt tuning.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=zmJDzPh1Dm",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17370,
    "title": "Get What You Want, Not What You Don't: Image Content Suppression for Text-to-Image Diffusion Models",
    "authors": [
      "Senmao Li",
      "Joost van de Weijer",
      "taihang Hu",
      "Fahad Khan",
      "Qibin Hou",
      "Yaxing Wang",
      "jian Yang"
    ],
    "abstract": "The success of recent text-to-image diffusion models is largely due to their capacity to be guided by a complex text prompt, which enables users to precisely describe the desired content. However, these models struggle to effectively suppress the generation of undesired content, which is explicitly requested to be omitted from the generated image in the prompt. In this paper, we analyze how to manipulate the text embeddings and remove unwanted content from them. We introduce two contributions, which we refer to as soft-weighted regularization and inference-time text embedding optimization. The first regularizes the text embedding matrix and effectively suppresses the undesired content. The second method aims to further suppress the unwanted content generation of the prompt, and encourages the generation of desired content. We evaluate our method quantitatively and qualitatively on extensive experiments, validating its effectiveness. Furthermore, our method is generalizability to both the pixel-space diffusion models (i.e. DeepFloyd-IF) and the latent-space diffusion models (i.e. Stable Diffusion).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zpVPhvVKXk",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17369,
    "title": "Enhancing Small Medical Learners with Privacy-preserving Contextual Prompting",
    "authors": [
      "Xinlu Zhang",
      "Shiyang Li",
      "Xianjun Yang",
      "Chenxin Tian",
      "Yao Qin",
      "Linda Ruth Petzold"
    ],
    "abstract": "Large language models (LLMs) demonstrate remarkable medical expertise, but data privacy concerns impede their direct use in healthcare environments. Although offering improved data privacy protection, domain-specific small language models (SLMs) often underperform LLMs, emphasizing the need for methods that reduce this performance gap while alleviating privacy concerns. In this paper, we present a simple yet effective method that harnesses LLMs' medical proficiency to boost SLM performance in medical tasks under $privacy-restricted$ scenarios. Specifically, we mitigate patient privacy issues by extracting keywords from medical data and prompting the LLM to generate a medical knowledge-intensive context by simulating clinicians' thought processes. This context serves as additional input for SLMs, augmenting their decision-making capabilities. Our method significantly enhances performance in both few-shot and full training settings across three medical knowledge-intensive tasks, achieving up to a 22.57% increase in absolute accuracy compared to SLM fine-tuning without context, and sets new state-of-the-art results in two medical tasks within privacy-restricted scenarios. Further out-of-domain testing and experiments in two general domain datasets showcase its generalizability and broad applicability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ztpy1gsUpT",
    "arxiv_id": "2305.12723",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17368,
    "title": "Out-of-Variable Generalisation for Discriminative Models",
    "authors": [
      "Siyuan Guo",
      "Jonas Bernhard Wildberger",
      "Bernhard Sch\u00f6lkopf"
    ],
    "abstract": "The ability of an agent to do well in new environments is a critical aspect of intelligence. In machine learning, this ability is known as $\\textit{strong}$ or $\\textit{out-of-distribution}$ generalization. However, merely considering differences in data distributions is inadequate for fully capturing differences between learning environments. In the present paper, we investigate $\\textit{out-of-variable}$ generalization, which pertains to an agent's generalization capabilities concerning environments with variables that were never jointly observed before. This skill closely reflects the process of animate learning: we, too, explore Nature by probing, observing, and measuring $\\textit{subsets}$ of variables at any given time. Mathematically, $\\textit{out-of-variable}$ generalization requires the efficient re-use of past marginal information, i.e., information over subsets of previously observed variables. We study this problem, focusing on prediction tasks across environments that contain overlapping, yet distinct, sets of causes. We show that after fitting a classifier, the residual distribution in one environment reveals the partial derivative of the true generating function with respect to the unobserved causal parent in that environment. We leverage this information and propose a method that exhibits non-trivial out-of-variable generalization performance when facing an overlapping, yet distinct, set of causal predictors.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zwMfg9PfPs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17367,
    "title": "Learning Mean Field Games on Sparse Graphs: A Hybrid Graphex Approach",
    "authors": [
      "Christian Fabian",
      "Kai Cui",
      "Heinz Koeppl"
    ],
    "abstract": "Learning the behavior of large agent populations is an important task for numerous research areas. Although the field of multi-agent reinforcement learning (MARL) has made significant progress towards solving these systems, solutions for many agents often remain computationally infeasible and lack theoretical guarantees. Mean Field Games (MFGs) address both of these issues and can be extended to Graphon MFGs (GMFGs) to include network structures between agents. Despite their merits, the real world applicability of GMFGs is limited by the fact that graphons only capture dense graphs. Since most empirically observed networks show some degree of sparsity, such as power law graphs, the GMFG framework is insufficient for capturing these network topologies. Thus, we introduce the novel concept of Graphex MFGs (GXMFGs) which builds on the graph theoretical concept of graphexes. Graphexes are the limiting objects to sparse graph sequences that also have other desirable features such as the small world property. Learning equilibria in these games is challenging due to the rich and sparse structure of the underlying graphs. To tackle these challenges, we design a new learning algorithm tailored to the GXMFG setup. This hybrid graphex learning approach leverages that the system mainly consists of a highly connected core and a sparse periphery. After defining the system and providing a theoretical analysis, we state our learning approach and demonstrate its learning capabilities on both synthetic graphs and real-world networks. This comparison shows that our GXMFG learning algorithm successfully extends MFGs to a highly relevant class of hard, realistic learning problems that are not accurately addressed by current MARL and MFG methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zwU9scoU4A",
    "arxiv_id": "2401.12686",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17366,
    "title": "On the generalization capacity of neural networks during generic multimodal reasoning",
    "authors": [
      "Takuya Ito",
      "Soham Dan",
      "Mattia Rigotti",
      "James Kozloski",
      "Murray Campbell"
    ],
    "abstract": "The advent of the Transformer has led to the development of large language models (LLM), which appear to demonstrate human-like capabilities. To assess the generality of this class of models and a variety of other base neural network architectures to multimodal domains, we evaluated and compared their capacity for multimodal generalization. We introduce a multimodal question-answer benchmark to evaluate three specific types of out-of-distribution (OOD) generalization performance: distractor generalization (generalization in the presence of distractors), systematic compositional generalization (generalization to new task permutations), and productive compositional generalization (generalization to more complex tasks with deeper dependencies). While we found that most architectures faired poorly on most forms of generalization (e.g., RNNs and standard Transformers), models that leveraged cross-attention mechanisms between input domains, such as the Perceiver, fared better. Our positive results demonstrate that for multimodal distractor and systematic generalization, cross-attention is an important mechanism to integrate multiple sources of information. On the other hand, all architectures failed in productive generalization, suggesting fundamental limitations of existing architectures for specific types of multimodal OOD generalization.These results demonstrate the strengths and limitations of specific architectural components underlying modern neural models for multimodal reasoning. Finally, we provide *Generic COG* (gCOG), a configurable benchmark with several multimodal generalization splits, for future studies to explore.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zyBJodMrn5",
    "arxiv_id": "2401.15030",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18268,
    "title": "GenCorres: Consistent Shape Matching via Coupled Implicit-Explicit Shape Generative Models",
    "authors": [
      "Haitao Yang",
      "Xiangru Huang",
      "Bo Sun",
      "Chandrajit L. Bajaj",
      "Qixing Huang"
    ],
    "abstract": "This paper introduces GenCorres, a novel unsupervised joint shape matching (JSM) approach. The basic idea of GenCorres is to learn a parametric mesh generator to fit an unorganized deformable shape collection while constraining deformations between adjacent synthetic shapes to preserve geometric structures such as local rigidity and local conformality. GenCorres presents three appealing advantages over existing JSM techniques. First, GenCorres performs JSM among a synthetic shape collection whose size is much bigger than the input shapes and fully leverages the data-driven power of JSM. Second, GenCorres unifies consistent shape matching and pairwise matching (i.e., by enforcing deformation priors between adjacent synthetic shapes). Third, the generator provides a concise encoding of consistent shape correspondences. However, learning a mesh generator from an unorganized shape collection is challenging. It requires a good initial fitting to each shape and can easily get trapped by local minimums. GenCorres addresses this issue by learning an implicit generator from the input shapes, which provides intermediate shapes between two arbitrary shapes. We introduce a novel approach for computing correspondences between adjacent implicit surfaces and force the correspondences to preserve geometric structures and be cycle-consistent. Synthetic shapes of the implicit generator then guide initial fittings (i.e., via template-based deformation) for learning the mesh generator. Experimental results show that GenCorres considerably outperforms state-of-the-art JSM techniques on benchmark datasets. The synthetic shapes of GenCorres preserve local geometric features and yield competitive performance gains against state-of-the-art deformable shape generators.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dGH4kHFKFj",
    "arxiv_id": "2304.10523",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17859,
    "title": "A Simple and Scalable Representation for Graph Generation",
    "authors": [
      "Yunhui Jang",
      "Seul Lee",
      "Sungsoo Ahn"
    ],
    "abstract": "Recently, there has been a surge of interest in employing neural networks for graph generation, a fundamental statistical learning problem with critical applications like molecule design and community analysis. However, most approaches encounter significant limitations when generating large-scale graphs. This is due to their requirement to output the full adjacency matrices whose size grows quadratically with the number of nodes. In response to this challenge, we introduce a new, simple, and scalable graph representation named gap encoded edge list (GEEL) that has a small representation size that aligns with the number of edges. In addition, GEEL significantly reduces the vocabulary size by incorporating the gap encoding and bandwidth restriction schemes. GEEL can be autoregressively generated with the incorporation of node positional encoding, and we further extend GEEL to deal with attributed graphs by designing a new grammar. Our findings reveal that the adoption of this compact representation not only enhances scalability but also bolsters performance by simplifying the graph generation process. We conduct a comprehensive evaluation across ten non-attributed and two molecular graph generation tasks, demonstrating the effectiveness of GEEL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nO344avRib",
    "arxiv_id": "2312.02230",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17867,
    "title": "Listen, Think, and Understand",
    "authors": [
      "Yuan Gong",
      "Hongyin Luo",
      "Alexander H. Liu",
      "Leonid Karlinsky",
      "James R. Glass"
    ],
    "abstract": "The ability of artificial intelligence (AI) systems to perceive and comprehend audio signals is crucial for many applications. Although significant progress has been made in this area since the development of AudioSet, most existing models are designed to map audio inputs to pre-defined, discrete sound label sets. In contrast, humans possess the ability to not only classify sounds into general categories, but also to listen to the finer details of the sounds, explain the reason for the predictions, think about what the sound infers, and understand the scene and what action needs to be taken, if any. Such capabilities beyond perception are not yet present in existing audio models. On the other hand, modern large language models (LLMs) exhibit emerging reasoning ability but they lack audio perception capabilities. Therefore, we ask the question: can we build a model that has both audio perception and a reasoning ability? In this paper, we propose a new audio foundation model, called LTU (Listen, Think, and Understand). To train LTU, we created a new OpenAQA-5M dataset consisting of 1.9 million closed-ended and 3.7 million open-ended, diverse (audio, question, answer) tuples, and have used an autoregressive training framework with a perception-to-understanding curriculum. LTU demonstrates strong performance and generalization ability on conventional audio tasks such as classification and captioning. More importantly, it exhibits emerging audio reasoning and comprehension abilities that are absent in existing audio models. To the best of our knowledge, LTU is one of the first multimodal large language models that focus on general audio (rather than just speech) understanding.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=nBZBPXdJlC",
    "arxiv_id": "2305.10790",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17889,
    "title": "FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning",
    "authors": [
      "Tri Dao"
    ],
    "abstract": "Scaling Transformers to longer sequence lengths has been a major problem in the last several years, promising to improve performance in language modeling and high-resolution image understanding, as well as to unlock new applications in code, audio, and video generation. The attention layer is the main bottleneck in scaling to longer sequences, as its runtime and memory increase quadratically in the sequence length. FlashAttention [5] exploits the asymmetric GPU memory hierarchy to bring significant memory saving (linear instead of quadratic) and runtime speedup (2-4\u00d7 compared to optimized baselines), with no approximation. However, FlashAttention is still not nearly as fast as optimized matrix-multiply (GEMM) operations, reaching only 25-40% of the theoretical maximum FLOPs/s. We observe that the inefficiency is due to suboptimal work partitioning between different thread blocks and warps on the GPU, causing either low-occupancy or unnecessary shared memory reads/writes. We propose FlashAttention-2, with better work partitioning to address these issues. In particular, we (1) tweak the algorithm to reduce the number of non-matmul FLOPs (2) parallelize the attention computation, even for a single head, across different thread blocks to increase occupancy, and (3) within each thread block, distribute the work between warps to reduce communication through shared memory. These yield around 2\u00d7 speedup compared to FlashAttention, reaching 50-73% of the theoretical maximum FLOPs/s on A100 and getting close to the efficiency of GEMM operations. We empirically validate that when used end-to-end to train GPT-style models, FlashAttention-2 reaches training speed of up to 225 TFLOPs/s per A100 GPU (72% model FLOPs utilization).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=mZn2Xyh9Ec",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17894,
    "title": "A Hierarchical Bayesian Model for Few-Shot Meta Learning",
    "authors": [
      "Minyoung Kim",
      "Timothy Hospedales"
    ],
    "abstract": "We propose a novel hierarchical Bayesian model for the few-shot meta learning problem. We consider episode-wise random variables to model episode-specific generative processes, where these local random variables are governed by a higher-level global random variable. The global variable captures information shared across episodes, while controlling how much the model needs to be adapted to new episodes in a principled Bayesian manner. Within our  framework, prediction on a novel episode/task can be seen as a Bayesian inference problem. For tractable training, we need to be able to relate each local episode-specific solution to the global higher-level parameters. We propose a Normal-Inverse-Wishart model, for which establishing this local-global relationship becomes feasible due to the approximate closed-form solutions for the local posterior distributions. The resulting algorithm is more attractive than the MAML in that it does not maintain a costly computational graph for the sequence of gradient descent steps in an episode. Our approach is also different from existing Bayesian meta learning methods in that rather than modeling a single random variable for all episodes, it leverages a hierarchical structure that exploits the local-global relationships desirable for principled Bayesian learning with many related tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=mQ72XRfYRZ",
    "arxiv_id": "2306.09702",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17923,
    "title": "The Expressive Power of Low-Rank Adaptation",
    "authors": [
      "Yuchen Zeng",
      "Kangwook Lee"
    ],
    "abstract": "*Low-Rank Adaptation* (LoRA), a parameter-efficient fine-tuning method that leverages low-rank adaptation of weight matrices, has emerged as a prevalent technique for fine-tuning pre-trained models such as large language models and diffusion models.Despite its huge success in practice, the theoretical underpinnings of LoRA have largely remained unexplored. This paper takes the first step to bridge this gap by theoretically analyzing the expressive power of LoRA. We prove that, for fully connected neural networks, LoRA can adapt any model $f$ to accurately represent any smaller target model $\\bar{f}$ if LoRA-rank $\\geq(\\text{width of }f) \\times \\frac{\\text{depth of }\\bar{f}}{\\text{depth of }f}$, under a mild assumption. We also quantify the approximation error when the LoRA-rank is lower than the threshold. For Transformer networks, we show any model can be adapted to a target model of the same size with rank-$(\\frac{\\text{embedding size}}{2})$ LoRA adapters.All our theoretical insights are validated by numerical experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=likXVjmh3E",
    "arxiv_id": "2310.17513",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17936,
    "title": "TokenFlow: Consistent Diffusion Features for Consistent Video Editing",
    "authors": [
      "Michal Geyer",
      "Omer Bar-Tal",
      "Shai Bagon",
      "Tali Dekel"
    ],
    "abstract": "The generative AI revolution has recently expanded to videos. Nevertheless, current state-of-the-art video models are still lagging behind image models in terms of visual quality and user control over the generated content. In this work, we present a framework that harnesses the power of a text-to-image diffusion model for the task of text-driven video editing. Specifically, given a source video and a target text-prompt, our method generates a high-quality video that adheres to the target text, while preserving the spatial layout and motion of the input video. Our method is based on a key observation that consistency in the edited video can be obtained by enforcing consistency in the diffusion feature space. We achieve this by explicitly propagating diffusion features based on inter-frame correspondences, readily available in the model. Thus, our framework does not require any training or fine-tuning, and can work in conjunction with any off-the-shelf text-to-image editing method. We demonstrate state-of-the-art editing results on a variety of real-world videos.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lKK50q2MtV",
    "arxiv_id": "2307.10373",
    "GitHub": [
      "https://github.com/omerbt/TokenFlow"
    ],
    "Space": [
      "weizmannscience/tokenflow"
    ],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17947,
    "title": "Assessing Uncertainty in Similarity Scoring: Performance & Fairness in Face Recognition",
    "authors": [
      "Jean-R\u00e9my Conti",
      "Stephan Cl\u00e9men\u00e7on"
    ],
    "abstract": "The ROC curve is the major tool for assessing not only the performance but also the fairness properties of a similarity scoring function. In order to draw reliable conclusions based on empirical ROC analysis, accurately evaluating the uncertainty level related to statistical versions of the ROC curves of interest is absolutely necessary, especially for applications with considerable societal impact such as Face Recognition.  In this article, we prove asymptotic guarantees for empirical ROC curves of similarity functions as well as for by-product metrics useful to assess fairness. We also explain that, because the false acceptance/rejection rates are of the form of U-statistics in the case of similarity scoring, the naive bootstrap approach may jeopardize the assessment procedure. A dedicated recentering technique must be used instead. Beyond the theoretical analysis carried out, various experiments using real face image datasets provide strong empirical evidence of the practical relevance of the methods promoted here, when applied to several ROC-based measures such as popular fairness metrics.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=lAhQCHuANV",
    "arxiv_id": "2211.07245",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19331,
    "title": "CoBIT: A Contrastive Bi-directional Image-Text Generation Model",
    "authors": [
      "Haoxuan You",
      "Mandy Guo",
      "Zhecan Wang",
      "Kai-Wei Chang",
      "Jason Michael Baldridge",
      "Jiahui Yu"
    ],
    "abstract": "The field of Vision-and-Language (VL) has witnessed a proliferation of pretrained foundation models. Current techniques typically employ only one type of training objective, whether it's (1) contrastive objectives (like CLIP), (2) image-to-text generative objectives (like PaLI), or (3) text-to-image generative objectives (like Parti). However, all these three objectives are mutually relevant and are all based on image-text pairs. Intuitively, the first two objectives can be considered as complementary projections between two modalities, and contrastive learning can preserve global alignment and generations facilitate fine-grained understanding. Inspired by this, we present a Contrastive Bi-directional Image-Text generation model (CoBIT) to first time unify the three pre-training objectives in one framework. Specifically, CoBIT employs a novel unicoder-decoder structure consisting of an image unicoder, a text unicoder, and a cross-modal decoder. The image/text unicoders can switch between encoding and decoding in different tasks, enabling flexibility and shared knowledge that benefits both image-to-text and text-to-image generations. CoBIT achieves superior performance in image understanding, image-text understanding (Retrieval, Captioning, VQA, SNLI-VE), and text-based content creation, particularly in zero-shot scenarios.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8ISRqgtjPc",
    "arxiv_id": "2303.13455",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17982,
    "title": "Outliers with Opposing Signals Have an Outsized Effect on Neural Network Optimization",
    "authors": [
      "Elan Rosenfeld",
      "Andrej Risteski"
    ],
    "abstract": "We identify a new phenomenon in neural network optimization which arises from the interaction of depth and a particular heavy-tailed structure in natural data. Our result offers intuitive explanations for several previously reported observations about network training dynamics, including a conceptually new cause for progressive sharpening and the edge of stability. We further draw connections to related phenomena in optimization including grokking and simplicity bias.Experimentally, we demonstrate the significant influence of paired groups of outliers in the training data with strong \\emph{opposing signals}: consistent, large magnitude features which dominate the network output and occur in both groups with similar frequency.Due to these outliers, early optimization enters a narrow valley which carefully balances the opposing groups; subsequent sharpening causes their loss to rise rapidly, oscillating between high on one group and then the other, until the overall loss spikes. We complement these experiments with a theoretical analysis of a two-layer linear network on a simple model of opposing signals. Our finding enables new qualitative predictions of training behavior which we confirm experimentally. It also provides a new lens through which to study and improve modern training practices for stochastic optimization. For instance, we identify two small modifications to Momentum SGD which result in performance that matches adaptive methods in settings where it has traditionally faltered---including on attention models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=kIZ3S3tel6",
    "arxiv_id": "2311.04163",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17998,
    "title": "From Sparse to Soft Mixtures of Experts",
    "authors": [
      "Joan Puigcerver",
      "Carlos Riquelme Ruiz",
      "Basil Mustafa",
      "Neil Houlsby"
    ],
    "abstract": "Sparse mixture of expert architectures (MoEs) scale model capacity without significant increases in training or inference costs.Despite their success, MoEs suffer from a number of issues: training instability, token dropping, inability to scale the number of experts, or ineffective finetuning.In this work, we propose Soft MoE, a fully-differentiable sparse Transformer that addresses these challenges, while maintaining the benefits of MoEs.Soft MoE performs an implicit soft assignment by passing different weighted combinations of all input tokens to each expert.As in other MoEs, experts in Soft MoE only process a subset of the (combined) tokens, enabling larger model capacity (and performance) at lower inference cost.In the context of visual recognition, Soft MoE greatly outperforms dense Transformers (ViTs) and popular MoEs (Tokens Choice and Experts Choice).Soft MoE scales well: Soft MoE Huge/14 with 128 experts in 16 MoE layers has over 40x more parameters than ViT Huge/14, with only 2% increased inference time, and substantially better quality.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=jxpsAj7ltE",
    "arxiv_id": "2308.00951",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18001,
    "title": "Language-Informed Visual Concept Learning",
    "authors": [
      "Sharon Lee",
      "Yunzhi Zhang",
      "Shangzhe Wu",
      "Jiajun Wu"
    ],
    "abstract": "Our understanding of the visual world is centered around various concept axes, characterizing different aspects of visual entities. While different concept axes can be easily specified by language, e.g. color, the exact visual nuances along each axis often exceed the limitations of linguistic articulations, e.g. a particular style of painting. In this work, our goal is to learn a language-informed visual concept representation, by simply distilling large pre-trained vision-language models. Specifically, we train a set of concept encoders to encode the information pertinent to a set of language-informed concept axes, with an objective of reproducing the input image through a pre-trained Text-to-Image (T2I) model. To encourage better disentanglement of different concept encoders, we anchor the concept embeddings to a set of text embeddings obtained from a pre-trained Visual Question Answering (VQA) model. At inference time, the model extracts concept embeddings along various axes from new test images, which can be remixed to generate images with novel compositions of visual concepts. With a lightweight test-time finetuning procedure, it can also generalize to novel concepts *unseen* at training.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=juuyW8B8ig",
    "arxiv_id": "2312.03587",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18063,
    "title": "Gradual Domain Adaptation via Gradient Flow",
    "authors": [
      "Zhan Zhuang",
      "Yu Zhang",
      "Ying Wei"
    ],
    "abstract": "Domain shift degrades classification models on new data distributions. Conventional unsupervised domain adaptation (UDA) aims to learn features that bridge labeled source and unlabeled target domains. In contrast to feature learning, gradual domain adaptation (GDA) leverages extra continuous intermediate domains with pseudo-labels to boost the source classifier. However, real intermediate domains are sometimes unavailable or ineffective. In this paper, we propose $\\textbf{G}$radual Domain Adaptation via $\\textbf{G}$radient $\\textbf{F}$low (GGF) to generate intermediate domains with preserving labels, thereby enabling us a fine-tuning method for GDA. We employ the Wasserstein gradient flow in Kullback\u2013Leibler divergence to transport samples from the source to the target domain. To simulate the dynamics, we utilize the Langevin algorithm. Since the Langevin algorithm disregards label information and introduces diffusion noise, we introduce classifier-based and sample-based potentials to avoid label switching and dramatic deviations in the sampling process. For the proposed GGF model, we analyze its generalization bound. Experiments on several benchmark datasets demonstrate the superiority of the proposed GGF method compared to state-of-the-art baselines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=iTTZFKrlGV",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18792,
    "title": "Improving LoRA in Privacy-preserving Federated Learning",
    "authors": [
      "Youbang Sun",
      "Zitao Li",
      "Yaliang Li",
      "Bolin Ding"
    ],
    "abstract": "Low-rank adaptation (LoRA) is one of the most popular task-specific parameter-efficient fine-tuning (PEFT) methods on pre-trained language models for its good performance and computational efficiency.LoRA injects a product of two trainable rank decomposition matrices over the top of each frozen pre-trained model module.However, when applied in the setting of privacy-preserving federated learning (FL), LoRA may become unstable due to the following facts: 1) the effects of data heterogeneity and multi-step local updates are non-negligible, 2) additive noise enforced on updating gradients to guarantee differential privacy (DP) can be amplified and 3) the final performance is susceptible to hyper-parameters.A key factor leading to these phenomena is the discordance between jointly optimizing the two low-rank matrices by local clients and separately aggregating them by the central server.Thus, this paper proposes an efficient and effective version of LoRA, Federated Freeze A LoRA (FFA-LoRA), to alleviate these challenges and further halve the communication cost of federated fine-tuning LLMs.The core idea of FFA-LoRA is to fix the randomly initialized non-zero matrices and only fine-tune the zero-initialized matrices.Compared to LoRA, FFA-LoRA is motivated by practical and theoretical benefits in privacy-preserved FL. Our experiments demonstrate that FFA-LoRA provides more consistent performance with better computational efficiency over vanilla LoRA in various FL tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NLPzL6HWNl",
    "arxiv_id": "2403.12313",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18109,
    "title": "FedWon: Triumphing Multi-domain Federated Learning Without Normalization",
    "authors": [
      "Weiming Zhuang",
      "Lingjuan Lyu"
    ],
    "abstract": "Federated learning (FL) enhances data privacy with collaborative in-situ training on decentralized clients. Nevertheless, FL encounters challenges due to non-independent and identically distributed (non-i.i.d) data, leading to potential performance degradation and hindered convergence. While prior studies predominantly addressed the issue of skewed label distribution, our research addresses a crucial yet frequently overlooked problem known as multi-domain FL. In this scenario, clients' data originate from diverse domains with distinct feature distributions, instead of label distributions. To address the multi-domain problem in FL, we propose a novel method called Federated Learning Without Normalizations (FedWon). FedWon draws inspiration from the observation that batch normalization (BN) faces challenges in effectively modeling the statistics of multiple domains, while existing normalization techniques possess their own limitations. In order to address these issues, FedWon eliminates the normalization layers in FL and reparameterizes convolution layers with scaled weight standardization. Through extensive experimentation on five datasets and five models, our comprehensive experimental results demonstrate that FedWon surpasses both FedAvg and the current state-of-the-art method (FedBN) across all experimental setups, achieving notable accuracy improvements of more than 10% in certain domains. Furthermore, FedWon is versatile for both cross-silo and cross-device FL, exhibiting robust domain generalization capability, showcasing strong performance even with a batch size as small as 1, thereby catering to resource-constrained devices. Additionally, FedWon can also effectively tackle the challenge of skewed label distribution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=hAYHmV1gM8",
    "arxiv_id": "2306.05879",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18111,
    "title": "Neural Network-Based Score Estimation in Diffusion Models: Optimization and Generalization",
    "authors": [
      "Yinbin Han",
      "Meisam Razaviyayn",
      "Renyuan Xu"
    ],
    "abstract": "Diffusion models have emerged as a powerful tool rivaling GANs in generating high-quality samples with improved fidelity, flexibility, and robustness. A key component of these models is to learn the score function through score matching. Despite empirical success on various tasks,  it remains unclear whether gradient-based algorithms can learn the score function with a provable accuracy. As a first step toward answering this question, this paper establishes a mathematical framework for analyzing score estimation using neural networks trained by gradient descent. Our analysis covers both the optimization and the generalization aspects of the learning procedure. In particular, we propose a parametric form to formulate the denoising score-matching problem as a regression with noisy labels. Compared to the standard supervised learning setup, the score-matching problem introduces distinct challenges, including unbounded inputs, vector-valued outputs, and an additional time variable, preventing existing techniques from being applied directly. In this paper, we show that with a properly designed neural network architecture, the score function can be accurately approximated by a reproducing kernel Hilbert space induced by neural tangent kernels. Furthermore, by applying an early-stopping rule for gradient descent and leveraging certain coupling arguments between neural network training and kernel regression, we establish  the first generalization error (sample complexity) bounds for learning the score function despite the presence of noise in the observations. Our analysis is grounded in a novel parametric form of the neural network and an innovative connection between score matching and regression analysis, facilitating the application of advanced statistical and optimization techniques.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=h8GeqOxtd4",
    "arxiv_id": "2401.15604",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18149,
    "title": "Modulated Phase Diffusor: Content-Oriented Feature Synthesis for Detecting Unknown Objects",
    "authors": [
      "Aming WU",
      "Cheng Deng"
    ],
    "abstract": "To promote the safe deployment of object detectors, a task of unsupervised out-of-distribution object detection (OOD-OD) is recently proposed, aiming to detect unknown objects during training without reliance on any auxiliary OOD data. To alleviate the impact of lacking OOD data, for this task, one feasible solution is to exploit the known in-distribution (ID) data to synthesize proper OOD information for supervision, which strengthens detectors' discrimination. From the frequency perspective, since the phase generally reflects the content of the input, in this paper, we explore leveraging the phase of ID features to generate expected OOD features involving different content. And a method of Modulated Phase Diffusion (MPD) is proposed, containing a shared forward and two different reverse processes. Specifically, after calculating the phase of the extracted features, to prevent the rapid loss of content in the phase, the forward process gradually performs Gaussian Average on the phase instead of adding noise. The averaged phase and original amplitude are combined to obtain the features taken as the input of the reverse process. Next, one OOD branch is defined to synthesize virtual OOD features by continually enlarging the content discrepancy between the OOD features and original ones. Meanwhile, another modulated branch is designed to generate augmented features owning a similar phase as the original features by scaling and shifting the OOD branch. Both original and augmented features are used for training, enhancing the discrimination. Experimental results on OOD-OD, incremental object detection, and open-set object detection demonstrate the superiorities of our method. The source code will be released at https://github.com/AmingWu/MPD.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gHAr7ZA1OL",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18159,
    "title": "InfoCon: Concept Discovery with Generative and Discriminative Informativeness",
    "authors": [
      "Ruizhe Liu",
      "Qian Luo",
      "Yanchao Yang"
    ],
    "abstract": "We focus on the self-supervised discovery of manipulation concepts that can be adapted and reassembled to address various robotic tasks. We propose that the decision to conceptualize a physical procedure should not depend on how we name it (semantics) but rather on the significance of the informativeness in its representation regarding the low-level physical state and state changes. We model manipulation concepts -- discrete symbols -- as generative and discriminative goals and derive metrics that can autonomously link them to meaningful sub-trajectories from noisy, unlabeled demonstrations. Specifically, we employ a trainable codebook containing encodings --symbols -- capable of synthesizing the end-state of a sub-trajectory given the current state (generative informativeness). Moreover, the encoding corresponding to a particular sub-trajectory should differentiate the state within and outside it and confidently predict the subsequent action based on the gradient of its discriminative score (discriminative informativeness). These metrics, which do not rely on human annotation, can be seamlessly integrated into a VQ-VAE framework, enabling the partitioning of demonstrations into semantically consistent sub-trajectories, fulfilling the purpose of discovering manipulation concepts and the corresponding (sub)-goal states. We evaluate the effectiveness of the learned concepts by training policies that utilize them as guidance, demonstrating superior performance compared to other baselines. Additionally, our discovered manipulation concepts compare favorably to human-annotated ones, while saving much manual effort. The code and trained models will be made public.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=g6eCbercEc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18166,
    "title": "Improved Probabilistic Image-Text Representations",
    "authors": [
      "Sanghyuk Chun"
    ],
    "abstract": "Image-Text Matching (ITM) task, a fundamental vision-language (VL) task, suffers from the inherent ambiguity caused by the multiplicity and the imperfect annotations. Deterministic functions are not sufficiently powerful to capture ambiguity, prompting a focus on probabilistic embeddings to tackle the challenge. However, the existing probabilistic ITM approach encounters two drawbacks; heavy computations due to expensive Monte Carlo approximation and the loss saturation under abundant false negatives. To overcome the issues, we propose improved Probabilistic Cross-Modal Embeddings (PCME++) by introducing a new probabilistic distance with a closed-form solution. We propose two optimization techniques to enhance PCME++ further; first, we incorporate pseudo-positives to prevent the loss saturation problem under massive false negatives; second, we apply mixed sample data augmentation for probabilistic matching. Our experiments on MS-COCO Caption and two extended benchmarks, CxC and ECCV Caption, demonstrate the effectiveness of PCME++ compared to state-of-the-art ITM methods. We also evaluate the robustness of PCME++ under noisy image-text correspondences. In addition, we show the potential applicability of PCME++ in automatic prompt tuning for zero-shot classification. Code is available at https://github.com/naver-ai/pcmepp",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ft1mr3WlGM",
    "arxiv_id": "2305.18171",
    "GitHub": [
      "https://github.com/naver-ai/pcmepp"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18171,
    "title": "Circuit Component Reuse Across Tasks in Transformer Language Models",
    "authors": [
      "Jack Merullo",
      "Carsten Eickhoff",
      "Ellie Pavlick"
    ],
    "abstract": "Recent work in mechanistic interpretability has shown that behaviors in language models can be successfully reverse-engineered through circuit analysis. A common criticism, however, is that each circuit is task-specific, and thus such analysis cannot contribute to understanding the models at a higher level. In this work, we present evidence that insights (both low-level findings about specific heads and higher-level findings about general algorithms) can indeed generalize across tasks. Specifically, we study the circuit discovered in (Wang, 2022) for the Indirect Object Identification (IOI) task and 1.) show that it reproduces on a larger GPT2 model, and 2.) that it is mostly reused to solve a seemingly different task: Colored Objects (Ippolito & Callison-Burch, 2023). We provide evidence that the process underlying both tasks is functionally very similar, and contains about a 78% overlap in in-circuit attention heads. We further present a proof-of-concept intervention experiment, in which we adjust four attention heads in middle layers in order to \u2018repair\u2019 the Colored Objects circuit and make it behave like the IOI circuit. In doing so, we boost accuracy from 49.6% to 93.7% on the Colored Objects task and explain most sources of error. The intervention affects downstream attention heads in specific ways predicted by their interactions in the IOI circuit, indicating that this subcircuit behavior is invariant to the different task inputs. Overall, our results provide evidence that it may yet be possible to explain large language models' behavior in terms of a relatively small number of interpretable task-general algorithmic building blocks and computational components.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=fpoAYV6Wsk",
    "arxiv_id": "2310.08744",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18180,
    "title": "Federated Q-Learning: Linear Regret Speedup with Low Communication Cost",
    "authors": [
      "Zhong Zheng",
      "Fengyu Gao",
      "Lingzhou Xue",
      "Jing Yang"
    ],
    "abstract": "In this paper, we consider federated reinforcement learning for tabular episodic Markov Decision Processes (MDP) where, under the coordination of a central server, multiple agents collaboratively explore the environment and learn an optimal policy without sharing their raw data.  While linear speedup in the number of agents has been achieved for some metrics, such as convergence rate and sample complexity, in similar settings, it is unclear whether it is possible to design a *model-free* algorithm to achieve linear *regret* speedup with low communication cost. We propose two federated Q-Learning algorithms termed as FedQ-Hoeffding and FedQ-Bernstein, respectively, and show that the corresponding total regrets achieve a linear speedup compared with their single-agent counterparts, while the communication cost scales logarithmically in the total number of time steps $T$. Those results rely on an event-triggered synchronization mechanism between the agents and the server, a novel step size selection when the server aggregates the local estimates of the state-action values to form the global estimates, and a set of new concentration inequalities to bound the sum of non-martingale differences. This is the first work showing that linear regret speedup and logarithmic communication cost can be achieved by model-free algorithms in federated reinforcement learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=fe6ANBxcKM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18210,
    "title": "Fully Hyperbolic Convolutional Neural Networks for Computer Vision",
    "authors": [
      "Ahmad Bdeir",
      "Kristian Schwethelm",
      "Niels Landwehr"
    ],
    "abstract": "Real-world visual data exhibit intrinsic hierarchical structures that can be represented effectively in hyperbolic spaces. Hyperbolic neural networks (HNNs) are a promising approach for learning feature representations in such spaces. However, current HNNs in computer vision rely on Euclidean backbones and only project features to the hyperbolic space in the task heads, limiting their ability to fully leverage the benefits of hyperbolic geometry. To address this, we present HCNN, a fully hyperbolic convolutional neural network (CNN) designed for computer vision tasks. Based on the Lorentz model, we generalize fundamental components of CNNs and propose novel formulations of the convolutional layer, batch normalization, and multinomial logistic regression. Experiments on standard vision tasks demonstrate the promising performance of our HCNN framework in both hybrid and fully hyperbolic settings. Overall, we believe our contributions provide a foundation for developing more powerful HNNs that can better represent complex structures found in image data. Our code is publicly available at https://github.com/kschwethelm/HyperbolicCV.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ekz1hN5QNh",
    "arxiv_id": "2303.15919",
    "GitHub": [
      "https://github.com/kschwethelm/HyperbolicCV"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18213,
    "title": "Turning large language models into cognitive models",
    "authors": [
      "Marcel Binz",
      "Eric Schulz"
    ],
    "abstract": "Large language models are powerful systems that excel at many tasks, ranging from translation to mathematical reasoning. Yet, at the same time, these models often show unhuman-like characteristics. In the present paper, we address this gap and ask whether large language models can be turned into cognitive models. We find that -- after finetuning them on data from psychological experiments -- these models offer accurate representations of human behavior, even outperforming traditional cognitive models in two decision-making domains. In addition, we show that their representations contain the information necessary to model behavior on the level of individual subjects. Finally, we demonstrate that finetuning on multiple tasks enables large language models to predict human behavior in a previously unseen task. Taken together, these results suggest that large, pre-trained models can be adapted to become models of human cognition, which opens up future research directions toward building more general cognitive models.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=eiC4BKypf1",
    "arxiv_id": "2306.03917",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18219,
    "title": "SaNN: Simple Yet Powerful Simplicial-aware Neural Networks",
    "authors": [
      "Sravanthi Gurugubelli",
      "Sundeep Prabhakar Chepuri"
    ],
    "abstract": "Simplicial neural networks (SNNs) are deep models for higher-order graph representation learning. SNNs learn low-dimensional embeddings of simplices in a simplicial complex by aggregating features of their respective upper, lower, boundary, and coboundary adjacent simplices. The aggregation in SNNs is carried out during training. Since the number of simplices of various orders in a simplicial complex is significantly large, the memory and training-time requirement in SNNs is enormous. In this work, we propose a scalable simplicial-aware neural network (SaNN) model with a constant run-time and memory requirements independent of the size of the simplicial complex and the density of interactions in it. SaNN is based on pre-aggregated simplicial-aware features as inputs to a neural network, so it has a strong simplicial-structural inductive bias. We provide theoretical conditions under which SaNN is provably more powerful than the Weisfeiler-Lehman (WL) graph isomorphism test and as powerful as the simplicial Weisfeiler-Lehman (SWL) test. We also show that SaNN is permutation and orientation equivariant and satisfies simplicial-awareness of the highest order in a simplicial complex. We demonstrate via numerical experiments that despite being computationally economical, the proposed model achieves state-of-the-art performance in predicting trajectories,  simplicial closures, and classifying graphs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=eUgS9Ig8JG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18233,
    "title": "The Unreasonable Effectiveness of Linear Prediction as a Perceptual Metric",
    "authors": [
      "Daniel Severo",
      "Lucas Theis",
      "Johannes Ball\u00e9"
    ],
    "abstract": "We show how perceptual embeddings of the visual system can be constructed at inference-time with no training data or deep neural network features. Our perceptual embeddings are solutions to a weighted least squares (WLS) problem, defined at the pixel-level, and solved at inference-time, that can capture global and local image characteristics. The distance in embedding space is used to define a perceptual similary metric which we call \\emph{LASI: Linear Autoregressive Similarity Index}. Experiments on full-reference image quality assessment datasets show LASI performs competitively with learned deep feature based methods like LPIPS \\citep{zhang2018unreasonable} and PIM \\citep{bhardwaj2020unsupervised}, at a similar computational cost to hand-crafted methods such as MS-SSIM \\citep{wang2003multiscale}. We found that increasing the dimensionality of the embedding space consistently reduces the WLS loss while increasing performance on perceptual tasks, at the cost of increasing the computational complexity. LASI is fully differentiable, scales cubically with the number of embedding dimensions, and can be parallelized at the pixel-level. A Maximum Differentiation (MAD) competition \\citep{wang2008maximum} between LASI and LPIPS shows that both methods are capable of finding failure points for the other, suggesting these metrics can be combined.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=e4FG5PJ9uC",
    "arxiv_id": "2310.05986",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18484,
    "title": "GNNBoundary: Towards Explaining Graph Neural Networks through the Lens of Decision Boundaries",
    "authors": [
      "Xiaoqi Wang",
      "Han Wei Shen"
    ],
    "abstract": "While Graph Neural Networks (GNNs) have achieved remarkable performance on various machine learning tasks on graph data, they also raised questions regarding their transparency and interpretability. Recently, there have been extensive research efforts in explaining the decision-making process of GNNs. These efforts often focus on explaining why a certain prediction is being made for a particular instance, or what discriminative features the GNNs try to detect for each class. However, to the best of our knowledge, there is no existing study on understanding the decision boundaries of GNNs, even though the decision-making process of GNNs is directly determined by the decision boundaries. To bridge this research gap, we propose a model-level explainability method called GNNBoundary, which attempts to gain deeper insights into the decision boundaries of graph classifiers. Specifically, we first develop an algorithm to identify the pairs of classes whose decision regions are adjacent. For an adjacent class pair, the near-boundary graphs between them are effectively generated by optimizing a novel objective function specifically designed for the purpose of boundary graph generation. Thus, by analyzing the near-boundary graphs, the important characteristics of decision boundaries can be uncovered. To evaluate the efficacy of GNNBoundary, we conduct experiments on both synthetic datasets and public real-world datasets. The results have demonstrated that, through the analysis of faithful near-boundary graphs generated by GNNBoundary, we can thoroughly assess the robustness and generalizability of the explained GNNs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WIzzXCVYiH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18249,
    "title": "Neural Snowflakes: Universal Latent Graph Inference via Trainable Latent Geometries",
    "authors": [
      "Haitz S\u00e1ez de Oc\u00e1riz Borde",
      "Anastasis Kratsios"
    ],
    "abstract": "The inductive bias of a graph neural network (GNN) is largely encoded in its specified graph. Latent graph inference relies on latent geometric representations to dynamically rewire or infer a GNN's graph to maximize the GNN's predictive downstream performance, but it lacks solid theoretical foundations in terms of embedding-based representation guarantees. This paper addresses this issue by introducing a trainable deep learning architecture, coined \\textit{neural snowflake}, that can adaptively implement fractal-like metrics on $\\mathbb{R}^d$. We prove that any given finite weights graph can be isometrically embedded by a standard MLP encoder. Furthermore, when the latent graph can be represented in the feature space of a sufficiently regular kernel, we show that the combined neural snowflake and MLP encoder do not succumb to the curse of dimensionality by using only a low-degree polynomial number of parameters in the number of nodes. This implementation enables a low-dimensional isometric embedding of the latent graph. We conduct synthetic experiments to demonstrate the superior metric learning capabilities of neural snowflakes when compared to more familiar spaces like Euclidean space.  Additionally, we carry out latent graph inference experiments on graph benchmarks. Consistently, the neural snowflake model achieves predictive performance that either matches or surpasses that of the state-of-the-art latent graph inference models. Importantly, this performance improvement is achieved without requiring random search for optimal latent geometry. Instead, the neural snowflake model achieves this enhancement in a differentiable manner.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=djM3WzpOmK",
    "arxiv_id": "2310.15003",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18262,
    "title": "TUVF: Learning Generalizable Texture UV Radiance Fields",
    "authors": [
      "An-Chieh Cheng",
      "Xueting Li",
      "Sifei Liu",
      "Xiaolong Wang"
    ],
    "abstract": "Textures are a vital aspect of creating visually appealing and realistic 3D models. In this paper, we study the problem of generating high-fidelity texture given shapes of 3D assets, which has been relatively less explored compared with generic 3D shape modeling. Our goal is to facilitate a controllable texture generation process, such that one texture code can correspond to a particular appearance style independent of any input shapes from a category. We introduce Texture UV Radiance Fields (TUVF) that generate textures in a learnable UV sphere space rather than directly on the 3D shape. This allows the texture to be disentangled from the underlying shape and transferable to other shapes that share the same UV space, i.e., from the same category. We integrate the UV sphere space with the radiance field, which provides a more efficient and accurate representation of textures than traditional texture maps. We perform our experiments on synthetic and real-world object datasets where we achieve not only realistic synthesis but also substantial improvements over state-of-the-arts on texture controlling and editing.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=dN4vpVTvWX",
    "arxiv_id": "2305.03040",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18280,
    "title": "On Differentially Private Federated Linear Contextual Bandits",
    "authors": [
      "Xingyu Zhou",
      "Sayak Ray Chowdhury"
    ],
    "abstract": "We consider cross-silo federated linear contextual bandit (LCB) problem under differential privacy, where multiple silos interact with their respective local users and communicate via a central server to realize collaboration without sacrificing each user's privacy. We identify three issues in the state-of-the-art~\\citep{dubey2020differentially}: (i) failure of claimed privacy protection, (ii) incorrect regret bound due to noise miscalculation and (iii) ungrounded communication cost. To resolve these issues, we take a two-step approach. First, we design an algorithmic framework consisting of a generic federated LCB algorithm and flexible privacy protocols. Then, leveraging the proposed framework, we study federated LCBs under two different privacy constraints. We first establish privacy and regret guarantees under silo-level local differential privacy, which fix the issues present in state-of-the-art algorithm.To further improve the regret performance, we next consider shuffle model of differential privacy, under which we show that our algorithm can achieve nearly ``optimal'' regret without a trusted server. We accomplish this via two different schemes --  one relies on a new result on privacy amplification via shuffling for DP mechanisms and another one leverages the integration of a shuffle protocol for vector sum into the tree-based mechanism, both of which might be of independent interest. Finally, we support our theoretical results withnumerical evaluations over contextual bandit instances generated from both synthetic and real-life data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=cuAxSHcsSX",
    "arxiv_id": "2302.13945",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18332,
    "title": "Future Language Modeling from Temporal Document History",
    "authors": [
      "Changmao Li",
      "Jeffrey Flanigan"
    ],
    "abstract": "Predicting the future is of great interest across many aspects of human activity.  Businesses are interested in future trends, traders are interested in future stock prices, and companies are highly interested in future technological breakthroughs.  While there are many automated systems for predicting future numerical data, such as weather, stock prices, and demand for products, there is relatively little work in automatically predicting textual data.  Humans are interested in textual data predictions because it is a natural format for our consumption, and experts routinely make predictions in a textual format (Christensen et al., 2004; Tetlock & Gardner, 2015; Frick, 2015). However, there has been relatively little formalization of this general problem in the machine learning or natural language processing communities.  To address this gap, we introduce the task of future language modeling: probabilistic modeling of texts in the future based on a temporal history of texts.  To our knowledge, our work is the first work to formalize the task of predicting the future in this way.  We show that it is indeed possible to build future language models that improve upon strong non-temporal language model baselines, opening the door to working on this important, and widely applicable problem.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bRLed9prWC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18342,
    "title": "Learning model uncertainty as variance-minimizing instance weights",
    "authors": [
      "Nishant Jain",
      "Karthikeyan Shanmugam",
      "Pradeep Shenoy"
    ],
    "abstract": "Predictive uncertainty--a model\u2019s self-awareness regarding its accuracy on an input--is key for both building robust models via training interventions and for test-time applications such as selective classification. We propose a novel instance-conditional reweighting approach that captures predictive uncertainty using an auxiliary network, and unifies these train- and test-time applications. The auxiliary network is trained using a meta-objective in a bilevel optimization framework. A key contribution of our proposal is the meta-objective of minimizing dropout variance, an approximation of Bayesian predictive uncertainty, We show in controlled experiments that we effectively capture diverse specific notions of uncertainty through this meta-objective, while previous approaches only capture certain aspects. These results translate to significant gains in real-world settings\u2013selective classification, label noise, domain adaptation, calibration\u2013and across datasets\u2013Imagenet, Cifar100, diabetic retinopathy, Camelyon, WILDs, Imagenet-C,-A,-R, Clothing-1.6M, etc. For Diabetic Retinopathy, we see upto 3.4\\%/3.3\\% accuracy & AUC gains over SOTA in selective classification. We also improve upon large-scale pretrained models such as PLEX.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=bDWXhzZT40",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18362,
    "title": "On the Posterior Distribution in Denoising: Application to Uncertainty Quantification",
    "authors": [
      "Hila Manor",
      "Tomer Michaeli"
    ],
    "abstract": "Denoisers play a central role in many applications, from noise suppression in low-grade imaging sensors, to empowering score-based generative models. The latter category of methods makes use of Tweedie's formula, which links the posterior mean in Gaussian denoising (*i*.*e*., the minimum MSE denoiser) with the score of the data distribution. Here, we derive a fundamental relation between the higher-order central moments of the posterior distribution, and the higher-order derivatives of the posterior mean. We harness this result for uncertainty quantification of pre-trained denoisers. Particularly, we show how to efficiently compute the principal components of the posterior distribution for any desired region of an image, as well as to approximate the full marginal distribution along those (or any other) one-dimensional directions. Our method is fast and memory-efficient, as it does not explicitly compute or store the high-order moment tensors and it requires no training or fine tuning of the denoiser. Code and examples are available on the project [website](https://hilamanor.github.io/GaussianDenoisingPosterior/).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=adSGeugiuj",
    "arxiv_id": "2309.13598",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18365,
    "title": "Multi-Task Reinforcement Learning with Mixture of Orthogonal Experts",
    "authors": [
      "Ahmed Hendawy",
      "Jan Peters",
      "Carlo D'Eramo"
    ],
    "abstract": "Multi-Task Reinforcement Learning (MTRL) tackles the long-standing problem of endowing agents with skills that generalize across a variety of problems. To this end, sharing representations plays a fundamental role in capturing both unique and common characteristics of the tasks. Tasks may exhibit similarities in terms of skills, objects, or physical properties while leveraging their representations eases the achievement of a universal policy. Nevertheless, the pursuit of learning a shared set of diverse representations is still an open challenge. In this paper, we introduce a novel approach for representation learning in MTRL that encapsulates common structures among the tasks using orthogonal representations to promote diversity. Our method, named Mixture Of Orthogonal Experts (MOORE), leverages a Gram-Schmidt process to shape a shared subspace of representations generated by a mixture of experts. When task-specific information is provided, MOORE generates relevant representations from this shared subspace. We assess the effectiveness of our approach on two MTRL benchmarks, namely MiniGrid and MetaWorld, showing that MOORE surpasses related baselines and establishes a new state-of-the-art result on MetaWorld.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=aZH1dM3GOX",
    "arxiv_id": "2311.11385",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18376,
    "title": "Unveiling Options with Neural Network Decomposition",
    "authors": [
      "Mahdi Alikhasi",
      "Levi Lelis"
    ],
    "abstract": "In reinforcement learning, agents often learn policies for specific tasks without the ability to generalize this knowledge to related tasks. This paper introduces an algorithm that attempts to address this limitation by decomposing neural networks encoding policies for Markov Decision Processes into reusable sub-policies, which are used to synthesize temporally extended actions, or options. We consider neural networks with piecewise linear activation functions, so that they can be mapped to an equivalent tree that is similar to oblique decision trees. Since each node in such a tree serves as a function of the input of the tree, each sub-tree is a sub-policy of the main policy. We turn each of these sub-policies into options by wrapping it with while-loops of varied number of iterations. Given the large number of options, we propose a selection mechanism based on minimizing the Levin loss for a uniform policy on these options. Empirical results in two grid-world domains where exploration can be difficult confirm that our method can identify useful options, thereby accelerating the learning process on similar but different tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=a8VETFwcVR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18387,
    "title": "Towards the Fundamental Limits of Knowledge Transfer over Finite Domains",
    "authors": [
      "Qingyue Zhao",
      "Banghua Zhu"
    ],
    "abstract": "We characterize the statistical efficiency of knowledge transfer through $n$ samples from a teacher to a probabilistic student classifier with input space $\\mathcal{S}$ over labels $\\mathcal{A}$. We show that privileged information at three progressive levels accelerates the transfer. At the first level, only samples with hard labels are known, via which the maximum likelihood estimator attains the minimax rate $\\sqrt{{|\\mathcal{S}||\\mathcal{A}|}/{n}}$. The second level has the teacher probabilities of sampled labels available in addition, which turns out to boost the convergence rate lower bound to ${{|\\mathcal{S}||\\mathcal{A}|}/{n}}$. However, under this second data acquisition protocol, minimizing a naive adaptation of the cross-entropy loss results in an asymptotically biased student. We overcome this limitation and achieve the fundamental limit by using a novel empirical variant of the squared error logit loss. The third level further equips the student with the soft labels (complete logits) on $\\mathcal{A}$ given every sampled input, thereby provably enables the student to enjoy a rate ${|\\mathcal{S}|}/{n}$ free of $|\\mathcal{A}|$. We find any Kullback-Leibler divergence minimizer to be optimal in the last case. Numerical simulations distinguish the four learners and corroborate our theory.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Zh2iqiOtMt",
    "arxiv_id": "2310.07838",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18391,
    "title": "Bayesian Bi-clustering of Neural Spiking Activity with Latent Structures",
    "authors": [
      "Ganchao Wei"
    ],
    "abstract": "Modern neural recording techniques allow neuroscientists to obtain spiking activity of multiple neurons from different brain regions over long time periods, which requires new statistical methods to be developed for understanding structure of the large-scale data. In this paper, we develop a bi-clustering method to cluster the neural spiking activity spatially and temporally, according to their low-dimensional latent structures. The spatial (neuron) clusters are defined by the latent trajectories within each neural population, while the temporal (state) clusters are defined by (populationally) synchronous local linear dynamics shared with different periods. To flexibly extract the bi-clustering structure, we build the model non-parametrically, and develop an efficient Markov chain Monte Carlo (MCMC) algorithm to sample the posterior distributions of model parameters. Validating our proposed MCMC algorithm through simulations, we find the method can recover unknown parameters and true bi-clustering structures successfully. We then apply the proposed bi-clustering method to multi-regional neural recordings under different experiment settings, where we find that simultaneously considering latent trajectories and spatial-temporal clustering structures can provide us with a more accurate and interpretable result. Overall, the proposed method provides scientific insights for large-scale (counting) time series with elongated recording periods, and it can potentially have application beyond neuroscience.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZYm1Ql6udy",
    "arxiv_id": "2309.02213",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18392,
    "title": "Effective Data Augmentation With Diffusion Models",
    "authors": [
      "Brandon Trabucco",
      "Kyle Doherty",
      "Max A Gurinas",
      "Ruslan Salakhutdinov"
    ],
    "abstract": "Data augmentation is one of the most prevalent tools in deep learning, underpinning many recent advances, including those from classification, generative models, and representation learning. The standard approach to data augmentation combines simple transformations like rotations and flips to generate new images from existing ones. However, these new images lack diversity along key semantic axes present in the data. Current augmentations cannot alter the high-level semantic attributes, such as animal species present in a scene, to enhance the diversity of data. We address the lack of diversity in data augmentation with image-to-image transformations parameterized by pre-trained text-to-image diffusion models. Our method edits images to change their semantics using an off-the-shelf diffusion model, and generalizes to novel visual concepts from a few labelled examples. We evaluate our approach on few-shot image classification tasks, and on a real-world weed recognition task, and observe an improvement in accuracy in tested domains.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZWzUA9zeAg",
    "arxiv_id": "2302.07944",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18395,
    "title": "How to Fine-Tune Vision Models with SGD",
    "authors": [
      "Ananya Kumar",
      "Ruoqi Shen",
      "Sebastien Bubeck",
      "Suriya Gunasekar"
    ],
    "abstract": "SGD and AdamW are the two most used optimizers for fine-tuning large neural networks in computer vision. When the two methods perform the same, SGD is preferable because it uses less memory (12 bytes/parameter with momentum and 8 bytes/parameter without) than AdamW (16 bytes/parameter). However, on a suite of downstream tasks, especially those with distribution shifts, we find that fine-tuning with AdamW performs substantially better than SGD on modern Vision Transformer and ConvNeXt models. We find that large gaps in performance between SGD and AdamW occur when the fine-tuning gradients in the first \"embedding\" layer are much larger than in the rest of the model. Our analysis suggests an easy fix that works consistently across datasets and models: freezing the embedding layer (less than 1% of the parameters) leads to SGD with or without momentum performing slightly better than AdamW while using less memory (e.g., on ViT-L, SGD uses 33% less GPU memory). Our insights result in state-of-the-art accuracies on five popular distribution shift benchmarks: WILDS-FMoW, WILDS-Camelyon, BREEDS-Living-17, Waterbirds, and DomainNet.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ZTssMmhC2X",
    "arxiv_id": "2211.09359",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18417,
    "title": "Adversarial Causal Bayesian Optimization",
    "authors": [
      "Scott Sussex",
      "Pier Giuseppe Sessa",
      "Anastasia Makarova",
      "Andreas Krause"
    ],
    "abstract": "In Causal Bayesian Optimization (CBO), an agent intervenes on an unknown structural causal model to maximize a downstream reward variable. In this paper, we consider the generalization where other agents or external events also intervene on the system, which is key for enabling adaptiveness to non-stationarities such as weather changes, market forces, or adversaries. We formalize this generalization of CBO as Adversarial Causal Bayesian Optimization (ACBO) and introduce the first algorithm for ACBO with bounded regret: Causal Bayesian Optimization with Multiplicative Weights (CBO-MW). Our approach combines a classical online learning strategy with causal modeling of the rewards. To achieve this, it computes optimistic counterfactual reward estimates by propagating uncertainty through the causal graph. We derive regret bounds for CBO-MW that naturally depend on graph-related quantities. We further propose a scalable implementation for the case of combinatorial interventions and submodular rewards. Empirically, CBO-MW outperforms non-causal and non-adversarial Bayesian optimization methods on synthetic environments and environments based on real-word data. Our experiments include a realistic demonstration of how CBO-MW can be used to learn users' demand patterns in a shared mobility system and reposition vehicles in strategic areas.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YcW8i9VCf5",
    "arxiv_id": "2307.16625",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18428,
    "title": "Active Test-Time Adaptation: Theoretical Analyses and An Algorithm",
    "authors": [
      "Shurui Gui",
      "Xiner Li",
      "Shuiwang Ji"
    ],
    "abstract": "Test-time adaptation (TTA) addresses distribution shifts for streaming test data in unsupervised settings. Currently, most TTA methods can only deal with minor shifts and rely heavily on heuristic and empirical studies.   To advance TTA under domain shifts, we propose the novel problem setting of active test-time adaptation (ATTA) that integrates active learning within the fully TTA setting.  We provide a learning theory analysis, demonstrating that incorporating limited labeled test instances enhances overall performances across test domains with a theoretical guarantee. We also present a sample entropy balancing for implementing ATTA while avoiding catastrophic forgetting (CF). We introduce a simple yet effective ATTA algorithm, known as SimATTA, using real-time sample selection techniques. Extensive experimental results confirm consistency with our theoretical analyses and show that the proposed ATTA method yields substantial performance improvements over TTA methods while maintaining efficiency and shares similar effectiveness to the more demanding active domain adaptation (ADA) methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=YHUGlwTzFB",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18438,
    "title": "Quantifying and Enhancing Multi-modal Robustness with Modality Preference",
    "authors": [
      "Zequn Yang",
      "Yake Wei",
      "Ce Liang",
      "Di Hu"
    ],
    "abstract": "Multi-modal models have shown a promising capability to effectively integrate information from various sources, yet meanwhile, they are found vulnerable to pervasive perturbations, such as uni-modal attacks and missing conditions. To counter these perturbations, robust multi-modal representations are highly expected, which are positioned well away from the discriminative multi-modal decision boundary. In this paper, different from conventional empirical studies, we focus on a commonly used joint multi-modal framework and theoretically discover that larger uni-modal representation margins and more reliable integration for modalities are essential components for achieving higher robustness. This discovery can further explain the limitation of multi-modal robustness and the phenomenon that multi-modal models are often vulnerable to attacks on the specific modality. Moreover, our analysis reveals how the widespread issue, that the model has different preferences for modalities, limits the multi-modal robustness by influencing the essential components and could lead to attacks on the specific modality highly effective. Inspired by our theoretical finding, we introduce a training procedure called Certifiable Robust Multi-modal Training (CRMT), which can alleviate this influence from modality preference and explicitly regulate essential components to significantly improve robustness in a certifiable manner. Our method demonstrates substantial improvements in performance and robustness compared with existing methods. Furthermore, our training procedure can be easily extended to enhance other robust training strategies, highlighting its credibility and flexibility.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XyrB1Ay44j",
    "arxiv_id": "2402.06244",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18456,
    "title": "Debiasing Algorithm through Model Adaptation",
    "authors": [
      "Tomasz Limisiewicz",
      "David Mare\u010dek",
      "Tom\u00e1\u0161 Musil"
    ],
    "abstract": "Large language models are becoming the go-to solution for various language tasks.However, with growing capacity, models are prone to rely on spurious correlations stemming from biases and stereotypes present in the training data.This work proposes a novel method for detecting and mitigating gender bias in language models.We perform causal analysis to identify problematic model components and discover that mid-upper feed-forward layers are most prone to convey biases.Based on the analysis results, we adapt the model by multiplying these layers by a linear projection.Our titular method DAMA significantly decreases bias as measured by diverse metrics while maintaining the model's performance on downstream tasks.We release code for our method and models, which retrain LLaMA's state-of-the-art performance while being significantly less biased.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XIZEFyVGC9",
    "arxiv_id": "2310.18913",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18457,
    "title": "GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data",
    "authors": [
      "Sascha Marton",
      "Stefan L\u00fcdtke",
      "Christian Bartelt",
      "Heiner Stuckenschmidt"
    ],
    "abstract": "Despite the success of deep learning for text and image data, tree-based ensemble models are still state-of-the-art for machine learning with heterogeneous tabular data. However, there is a significant need for tabular-specific gradient-based methods due to their high flexibility. In this paper, we propose $\\text{GRANDE}$, $\\text{GRA}$die$\\text{N}$t-Based $\\text{D}$ecision Tree $\\text{E}$nsembles, a novel approach for learning hard, axis-aligned decision tree ensembles using end-to-end gradient descent. GRANDE is based on a dense representation of tree ensembles, which affords to use backpropagation with a straight-through operator to jointly optimize all model parameters. Our method combines axis-aligned splits, which is a useful inductive bias for tabular data, with the flexibility of gradient-based optimization. Furthermore, we introduce an advanced instance-wise weighting that facilitates learning representations for both, simple and complex relations, within a single model. We conducted an extensive evaluation on a predefined benchmark with 19 classification datasets and demonstrate that our method outperforms existing gradient-boosting and deep learning frameworks on most datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=XEFWBxi075",
    "arxiv_id": "2309.17130",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18463,
    "title": "RingAttention with Blockwise Transformers for Near-Infinite Context",
    "authors": [
      "Hao Liu",
      "Matei Zaharia",
      "Pieter Abbeel"
    ],
    "abstract": "Transformers have emerged as the architecture of choice for for many state-of-the-art AI models, showcasing exceptional performance across a wide range of AI applications. However, the memory demands imposed by Transformers limit their ability to handle long sequences, thereby creating challenges for tasks involving extended sequences or long-term dependencies. We present a distinct approach, Ring Attention, which leverages blockwise computation of self-attention to distribute long sequences across multiple devices while concurrently overlapping the communication of key-value blocks between devices through blockwise attention computation. By processing longer input sequences while maintaining memory efficiency, Ring Attention enables training and inference of sequences that exceed 100 million tokens in length, allowing length to scale proportionally with the number of devices, effectively eliminating the memory constraints imposed by individual devices. Extensive experiments on language modeling tasks demonstrate the effectiveness of Ring Attention in reducing memory requirements and improving performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WsRHpHH4s0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18464,
    "title": "A Statistical Analysis of Wasserstein Autoencoders for Intrinsically Low-dimensional Data",
    "authors": [
      "Saptarshi Chakraborty",
      "Peter Bartlett"
    ],
    "abstract": "Variational Autoencoders (VAEs) have gained significant popularity among researchers as a powerful tool for understanding unknown distributions based on limited samples. This popularity stems partly from their impressive performance and partly from their ability to provide meaningful feature representations in the latent space. Wasserstein Autoencoders (WAEs), a variant of VAEs, aim to not only improve model efficiency but also interpretability. However, there has been limited focus on analyzing their statistical guarantees. The matter is further complicated by the fact that the data distributions to which WAEs are applied - such as natural images - are often presumed to possess an underlying low-dimensional structure within a high-dimensional feature space, which current theory does not adequately account for, rendering known bounds inefficient. To bridge the gap between the theory and practice of WAEs, in this paper, we show that WAEs can learn the data distributions when the network architectures are properly chosen. We show that the convergence rates of the expected excess risk in the number of samples for WAEs are independent of the high feature dimension, instead relying only on the intrinsic dimension of the data distribution.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WjRPZsfeBO",
    "arxiv_id": "2402.15710",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18467,
    "title": "Light Schr\u00f6dinger Bridge",
    "authors": [
      "Alexander Korotin",
      "Nikita Gushchin",
      "Evgeny Burnaev"
    ],
    "abstract": "Despite the recent advances in the field of computational Schrodinger Bridges (SB), most existing SB solvers are still heavy-weighted and require complex optimization of several neural networks. It turns out that there is no principal solver which plays the role of simple-yet-effective baseline for SB just like, e.g., $k$-means method in clustering, logistic regression in classification or Sinkhorn algorithm in discrete optimal transport. We address this issue and propose a novel fast and simple SB solver. Our development is a smart combination of two ideas which recently appeared in the field: (a) parameterization of the Schrodinger potentials with sum-exp quadratic functions and (b) viewing the log-Schrodinger potentials as the energy functions. We show that combined together these ideas yield a lightweight, simulation-free and theoretically justified SB solver with a simple straightforward optimization objective. As a result, it allows solving SB in moderate dimensions in a matter of minutes on CPU without a painful hyperparameter selection. Our light solver resembles the Gaussian mixture model which is widely used for density estimation. Inspired by this similarity, we also prove an important theoretical result showing that our light solver is a universal approximator of SBs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=WhZoCLRWYJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18487,
    "title": "Modeling Boundedly Rational Agents with Latent Inference Budgets",
    "authors": [
      "Athul Paul Jacob",
      "Abhishek Gupta",
      "Jacob Andreas"
    ],
    "abstract": "We study the problem of modeling a population of agents pursuing unknown goals subject to unknown computational constraints. In standard models of bounded rationality, sub-optimal decision-making is simulated by adding homoscedastic noise to optimal decisions rather than actually simulating constrained inference. In this work, we introduce a latent inference budget model (L-IBM) that models these constraints explicitly, via a latent variable (inferred jointly with a model of agents\u2019 goals) that controls the runtime of an iterative inference algorithm. L-IBMs make it possible to learn agent models using data from diverse populations of suboptimal actors. In three modeling tasks\u2014inferring navigation goals from routes, inferring communicative intents from human utterances, and predicting next moves in human chess games\u2014we show that L-IBMs match or outperforms Boltzmann models of decision-making under uncertainty. Moreover, the inferred inference budgets are themselves meaningful, efficient to compute, and correlated with measures of player skill, partner skill and task difficulty.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=W3VsHuga3j",
    "arxiv_id": "2312.04030",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18489,
    "title": "A Unified Sampling Framework for Solver Searching of Diffusion Probabilistic Models",
    "authors": [
      "Enshu Liu",
      "Xuefei Ning",
      "Huazhong Yang",
      "Yu Wang"
    ],
    "abstract": "Recent years have witnessed the rapid progress and broad application of diffusion probabilistic models (DPMs). Sampling from DPMs can be viewed as solving an ordinary differential equation (ODE). Despite the promising performance, the generation of DPMs usually consumes much time due to the large number of function evaluations (NFE). Though recent works have accelerated the sampling to around 20 steps with high-order solvers, the sample quality with less than 10 NFE can still be improved. In this paper, we propose a unified sampling framework (USF) to study the optional strategies for solver. Under this framework, we further reveal that taking different solving strategies at different timesteps may help further decrease the truncation error, and a carefully designed \\emph{solver schedule} has the potential to improve the sample quality by a large margin. Therefore, we propose a new sampling framework based on the exponential integral formulation that allows free choices of solver strategy at each step and design specific decisions for the framework. Moreover, we propose $S^3$, a predictor-based search method that automatically optimizes the solver schedule to get a better time-quality trade-off of sampling. We demonstrate that $S^3$ can find outstanding solver schedules which outperform the state-of-the-art sampling methods on CIFAR-10, CelebA, ImageNet-64, and LSUN-Bedroom datasets. Specifically, we achieve 3.09 FID with 9 NFE and 7.65 FID with 5 NFE on CIFAR-10 dataset, outperforming the SOTA method significantly. We further apply $S^3$ to Stable-Diffusion model and get an acceleration ratio of 2$\\times$, showing the feasibility of sampling in very few steps without retraining of the neural network.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=W2d3LZbhhI",
    "arxiv_id": "2312.07243",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18501,
    "title": "HYPO: Hyperspherical Out-Of-Distribution Generalization",
    "authors": [
      "Haoyue Bai",
      "Yifei Ming",
      "Julian Katz-Samuels",
      "Yixuan Li"
    ],
    "abstract": "Out-of-distribution (OOD) generalization is critical for machine learning models deployed in the real world. However, achieving this can be fundamentally challenging, as it requires the ability to learn invariant features across different domains or environments. In this paper, we propose a novel framework HYPO (HYPerspherical OOD generalization) that provably learns domain-invariant representations in a hyperspherical space. In particular, our hyperspherical learning algorithm is guided by intra-class variation and inter-class separation principles\u2014ensuring that features from the same class (across different training domains) are closely aligned with their class prototypes, while different class prototypes are maximally separated. We further provide theoretical justifications on how our prototypical learning objective improves the OOD generalization bound. Through extensive experiments on challenging OOD benchmarks, we demonstrate that our approach outperforms competitive baselines and achieves superior performance. Code is available at https://github.com/deeplearning-wisc/hypo.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=VXak3CZZGC",
    "arxiv_id": "2402.07785",
    "GitHub": [
      "https://github.com/deeplearning-wisc/hypo"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18533,
    "title": "Respect the model: Fine-grained and Robust Explanation with Sharing Ratio Decomposition",
    "authors": [
      "Sangyu Han",
      "Yearim Kim",
      "Nojun Kwak"
    ],
    "abstract": "The truthfulness of existing explanation methods in authentically elucidating theunderlying model\u2019s decision-making process has been questioned. Existing meth-ods have deviated from faithfully representing the model, thus susceptible toadversarial attacks. To address this, we propose a novel eXplainable AI (XAI)method called SRD (Sharing Ratio Decomposition), which sincerely reflects themodel\u2019s inference process, resulting in significantly enhanced robustness in ourexplanations. Different from the conventional emphasis on the neuronal level, weadopt a vector perspective to consider the intricate nonlinear interactions betweenfilters. We also introduce an interesting observation termed Activation-Pattern-Only Prediction (APOP), letting us emphasize the importance of inactive neuronsand redefine relevance encapsulating all relevant information including both activeand inactive neurons. Our method, SRD, allows for the recursive decomposition ofa Pointwise Feature Vector (PFV), providing a high-resolution Effective ReceptiveField (ERF) at any layer.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=U7VW3KBm34",
    "arxiv_id": "2402.03348",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18536,
    "title": "Sin3DM: Learning a Diffusion Model from a Single 3D Textured Shape",
    "authors": [
      "Rundi Wu",
      "Ruoshi Liu",
      "Carl Vondrick",
      "Changxi Zheng"
    ],
    "abstract": "Synthesizing novel 3D models that resemble the input example as long been pursued by graphics artists and machine learning researchers. In this paper, we present Sin3DM, a diffusion model that learns the internal patch distribution from a single 3D textured shapeand generates high-quality variations with fine geometry and texture details. Training a diffusion model directly in 3D would induce large memory and computational cost. Therefore, we first compress the input into a lower-dimensional latent space and then train a diffusion model on it. Specifically, we encode the input 3D textured shape into triplane feature maps that represent the signed distance and texture fields of the input. The denoising network of our diffusion model has a limited receptive field to avoid overfitting, and uses triplane-aware 2D convolution blocks to improve the result quality. Aside from randomly generating new samples, our model also facilitates applications such as retargeting, outpainting and local editing. Through extensive qualitative and quantitative evaluation, we show that our method outperforms prior methods in generation quality of 3D shapes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=U0IOMStUQ8",
    "arxiv_id": "2305.15399",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18560,
    "title": "On the Foundations of Shortcut Learning",
    "authors": [
      "Katherine Hermann",
      "Hossein Mobahi",
      "Thomas FEL",
      "Michael Curtis Mozer"
    ],
    "abstract": "Deep-learning models can extract a rich assortment of features from data. Which features a model uses depends not only on *predictivity*---how reliably a feature indicates train-set labels---but also on *availability*---how easily the feature can be extracted, or leveraged, from inputs. The literature on shortcut learning has noted examples in which models privilege one feature over another, for example texture over shape and image backgrounds over foreground objects. Here, we test hypotheses about which input properties are more available to a model, and systematically study how predictivity and availability interact to shape models' feature use. We construct a minimal, explicit generative framework for synthesizing classification datasets with two latent features that vary in predictivity and in factors we hypothesize to relate to availability, and quantify a model's shortcut bias---its over-reliance on the shortcut (more available, less predictive) feature at the expense of the core (less available, more predictive) feature. We find that linear models are relatively unbiased, but introducing a single hidden layer with ReLU or Tanh units yields a bias. Our empirical findings are consistent with a theoretical account based on Neural Tangent Kernels. Finally, we study how models used in practice trade off predictivity and availability in naturalistic datasets, discovering availability manipulations which increase models' degree of shortcut bias. Taken together, these findings suggest that the propensity to learn shortcut features is a fundamental characteristic of deep nonlinear architectures warranting systematic study given its role in shaping how models solve tasks.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Tj3xLVuE9f",
    "arxiv_id": "2310.16228",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18584,
    "title": "Emergent Communication with Conversational Repair",
    "authors": [
      "Mitja Nikolaus"
    ],
    "abstract": "Research on conversation has put emphasis on the importance of a multi-level communication system, in which the interlocutors aim to establish and maintain common ground. In natural conversations, repair mechanisms such as clarification requests are frequently used to improve mutual understanding.Here we explore the effects of conversational repair on languages emerging in signaling games. We extend the basic Lewis signaling game setup with a feedback channel that allows for the transmission of messages backwards from the receiver to the sender. Further, we add noise to the communication channel so that repair mechanisms become necessary for optimal performance.We find that for models that were trained with a feedback channel the sender agents produce less compositional messages. However, they still achieve a substantially higher generalization performance, putting to question the role of compositionality for generalization.These findings generalize also to a more realistic case involving naturalistic images in a guessing game setup.More broadly, this study provides an important step towards the creation of signaling games that more closely resemble the conditions under which human languages emerged.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Sy8upuD6Bw",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18613,
    "title": "THOUGHT PROPAGATION: AN ANALOGICAL APPROACH TO COMPLEX REASONING WITH LARGE LANGUAGE MODELS",
    "authors": [
      "Junchi Yu",
      "Ran He",
      "Zhitao Ying"
    ],
    "abstract": "Large Language Models (LLMs) have achieved remarkable success in reasoning tasks with the development of prompting methods. However, existing prompting approaches cannot reuse insights of solving similar problems and suffer from accumulated errors in multi-step reasoning, since they prompt LLMs to reason \\textit{from scratch}.To address these issues, we propose \\textbf{\\textit{Thought Propagation} (TP)}, which explores the analogous problems and leverages their solutions to enhance the complex reasoning ability of LLMs.These analogous problems are related to the input one, with reusable solutions and problem-solving strategies.Thus, it is promising to propagate insights of solving previous analogous problems to inspire new problem-solving. To achieve this, TP first prompts LLMs to propose and solve a set of analogous problems that are related to the input one. Then, TP reuses the results of analogous problems to directly yield a new solution or derive a knowledge-intensive plan for execution to amend the initial solution obtained from scratch.TP is compatible with existing prompting approaches, allowing plug-and-play generalization and enhancement in a wide range of tasks without much labor in task-specific prompt engineering. Experiments across three challenging tasks demonstrate TP enjoys a substantial improvement over the baselines by an average of 12\\% absolute increase in finding the optimal solutions in Shortest-path Reasoning, 13\\% improvement of human preference in Creative Writing, and 15\\% enhancement in the task completion rate of LLM-Agent Planning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SBoRhRCzM3",
    "arxiv_id": "2310.03965",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18620,
    "title": "SmartPlay : A Benchmark for LLMs as Intelligent Agents",
    "authors": [
      "Yue Wu",
      "Xuan Tang",
      "Tom Mitchell",
      "Yuanzhi Li"
    ],
    "abstract": "Recent large language models (LLMs) have demonstrated great potential toward intelligent agents and next-gen automation, but there currently lacks a systematic benchmark for evaluating LLMs' abilities as agents. We introduce SmartPlay: both a challenging benchmark and a methodology for evaluating LLMs as agents. SmartPlay consists of 6 different games, including Rock-Paper-Scissors, Tower of Hanoi, Minecraft. Each game features a unique setting, providing up to 20 evaluation settings and infinite environment variations. Each game in SmartPlay uniquely challenges a subset of 9 important capabilities of an intelligent LLM agent, including reasoning with object dependencies, planning ahead, spatial reasoning, learning from history, and understanding randomness. The distinction between the set of capabilities each game test allows us to analyze each capability separately.SmartPlay serves not only as a rigorous testing ground for evaluating the overall performance of LLM agents but also as a road-map for identifying gaps in current methodologies. We release our benchmark at github.com/LLMsmartplay/SmartPlay",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=S2oTVrlcp3",
    "arxiv_id": "2310.01557",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18630,
    "title": "On Error Propagation of Diffusion Models",
    "authors": [
      "Yangming Li",
      "Mihaela van der Schaar"
    ],
    "abstract": "Although diffusion models (DMs) have shown promising performances in a number of tasks (e.g., speech synthesis and image generation), they might suffer from error propagation because of their sequential structure. However, this is not certain because some sequential models, such as Conditional Random Field (CRF), are free from this problem. To address this issue, we develop a theoretical framework to mathematically formulate error propagation in the architecture of DMs, The framework contains three elements, including modular error, cumulative error, and propagation equation. The modular and cumulative errors are related by the equation, which interprets that DMs are indeed affected by error propagation. Our theoretical study also suggests that the cumulative error is closely related to the generation quality of DMs. Based on this finding, we apply the cumulative error as a regularization term to reduce error propagation. Because the term is computationally intractable, we derive its upper bound and design a bootstrap algorithm to efficiently estimate the bound for optimization. We have conducted extensive experiments on multiple image datasets, showing that our proposed regularization reduces error propagation, significantly improves vanilla DMs, and outperforms previous baselines.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RtAct1E2zS",
    "arxiv_id": "2308.05021",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18697,
    "title": "Making RL with Preference-based Feedback Efficient via Randomization",
    "authors": [
      "Runzhe Wu",
      "Wen Sun"
    ],
    "abstract": "RL algorithms that learn from human feedback (RLHF) need to be efficient in terms of *statistical complexity, computational complexity, and query complexity*. In this work, we consider the RLHF setting where the feedback is given in the format of preferences over pairs of trajectories. In the linear MDP model, by using randomization in algorithm design, we present an algorithm that is sample efficient (i.e., has near-optimal worst-case regret bounds) and has polynomial running time (i.e., computational complexity is polynomial with respect to relevant parameters). Our algorithm further minimizes the query complexity through a novel randomized active learning procedure.  Particularly, our algorithm demonstrates a near-optimal tradeoff between the regret bound and the query complexity. To extend the results to more general nonlinear function approximation, we design a model-based randomized algorithm inspired by the idea of Thompson sampling. Our algorithm minimizes Bayesian regret bound and query complexity, again achieving a near-optimal tradeoff between these two quantities. Computation-wise, similar to the prior Thompson sampling algorithms under the regular RL setting, the main computation primitives of our algorithm are Bayesian supervised learning oracles which have been heavily investigated on the empirical side when applying Thompson sampling algorithms to RL benchmark problems.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Pe2lo3QOvo",
    "arxiv_id": "2310.14554",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18701,
    "title": "Synapse: Trajectory-as-Exemplar Prompting with Memory for Computer Control",
    "authors": [
      "Longtao Zheng",
      "Rundong Wang",
      "Xinrun Wang",
      "Bo An"
    ],
    "abstract": "Building agents with large language models (LLMs) for computer control is a burgeoning research area, where the agent receives computer states and performs actions to complete complex tasks. Previous computer agents have demonstrated the benefits of in-context learning (ICL); however, their performance is hindered by several issues. First, the limited context length of LLMs and complex computer states restrict the number of exemplars, as a single webpage can consume the entire context. Second, the exemplars in current methods, such as high-level plans and multi-choice questions, cannot represent complete trajectories, leading to suboptimal performance in long-horizon tasks. Third, existing computer agents rely on task-specific exemplars and overlook the similarity among tasks, resulting in poor generalization to novel tasks. To address these challenges, we introduce Synapse, a computer agent featuring three key components: i) state abstraction, which filters out task-irrelevant information from raw states, allowing more exemplars within the limited context, ii) trajectory-as-exemplar prompting, which prompts the LLM with complete trajectories of the abstracted states and actions to improve multi-step decision-making, and iii) exemplar memory, which stores the embeddings of exemplars and retrieves them via similarity search for generalization to novel tasks. We evaluate Synapse on MiniWoB++, a standard task suite, and Mind2Web, a real-world website benchmark. In MiniWoB++, Synapse achieves a 99.2% average success rate (a 10% relative improvement) across 64 tasks using demonstrations from only 48 tasks. Notably, Synapse is the first ICL method to solve the book-flight task in MiniWoB++. Synapse also exhibits a 56% relative improvement in average step success rate over the previous state-of-the-art prompting scheme in Mind2Web.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Pc8AU1aF5e",
    "arxiv_id": "2306.07863",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18710,
    "title": "Embarrassingly Simple Dataset Distillation",
    "authors": [
      "Yunzhen Feng",
      "Shanmukha Ramakrishna Vedantam",
      "Julia Kempe"
    ],
    "abstract": "Dataset distillation extracts a small set of synthetic training samples from a large dataset with the goal of achieving competitive performance on test data when trained on this sample. In this work, we tackle dataset distillation at its core by treating it directly as a bilevel optimization problem. Re-examining the foundational back-propagation through time method, we study the pronounced variance in the gradients, computational burden, and long-term dependencies. We introduce an improved method: Random Truncated Backpropagation Through Time (RaT-BPTT) to address them. RaT-BPTT incorporates a truncation coupled with a random window, effectively stabilizing the gradients and speeding up the optimization while covering long dependencies. This allows us to establish new state-of-the-art for a variety of standard dataset benchmarks. A deeper dive into the nature of distilled data unveils pronounced intercorrelation. In particular, subsets of distilled datasets tend to exhibit much worse performance than directly distilled smaller datasets of the same size. Leveraging RaT-BPTT, we devise a boosting mechanism that generates distilled datasets that contain subsets with near optimal performance across different data budgets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=PLoWVP7Mjc",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18722,
    "title": "TD-MPC2: Scalable, Robust World Models for Continuous Control",
    "authors": [
      "Nicklas Hansen",
      "Hao Su",
      "Xiaolong Wang"
    ],
    "abstract": "TD-MPC is a model-based reinforcement learning (RL) algorithm that performs local trajectory optimization in the latent space of a learned implicit (decoder-free) world model. In this work, we present TD-MPC2: a series of improvements upon the TD-MPC algorithm. We demonstrate that TD-MPC2 improves significantly over baselines across 104 online RL tasks spanning 4 diverse task domains, achieving consistently strong results with a single set of hyperparameters. We further show that agent capabilities increase with model and data size, and successfully train a single 317M parameter agent to perform 80 tasks across multiple task domains, embodiments, and action spaces. We conclude with an account of lessons, opportunities, and risks associated with large TD-MPC2 agents.Explore videos, models, data, code, and more at https://tdmpc2.com",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=Oxh5CstDJU",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18727,
    "title": "Learning From Simplicial Data Based on Random Walks and 1D Convolutions",
    "authors": [
      "Florian Frantzen",
      "Michael T Schaub"
    ],
    "abstract": "Triggered by limitations of graph-based deep learning methods in terms of computational expressivity and model flexibility, recent years have seen a surge of interest in computational models that operate on higher-order topological domains such as hypergraphs and simplicial complexes. While the increased expressivity of these models can indeed lead to a better classification performance and a more faithful representation of the underlying system, the computational cost of these higher-order models can increase dramatically. To this end, we here explore a simplicial complex neural network learning architecture based on random walks and fast 1D convolutions (SCRaWl), in which we can adjust the increase in computational cost by varying the length and number of random walks considered while accounting for higher-order relationships. Importantly, due to the random walk-based design, the expressivity of the proposed architecture is provably incomparable to that of existing message-passing simplicial neural networks. We empirically evaluate SCRaWl on real-world datasets and show that it outperforms other simplicial neural networks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=OsGUnYOzii",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18774,
    "title": "A General Framework for User-Guided Bayesian Optimization",
    "authors": [
      "Carl Hvarfner",
      "Frank Hutter",
      "Luigi Nardi"
    ],
    "abstract": "The optimization of expensive-to-evaluate black-box functions is prevalent in various scientific disciplines. Bayesian optimization is an automatic, general and sample-efficient method to solve these problems with minimal knowledge of the the underlying function dynamics. However, the ability of Bayesian optimization to incorporate prior knowledge or beliefs about the function at hand in order to accelerate the optimization is limited, which reduces its appeal for knowledgeable practitioners with tight  budgets. To allow domain experts to customize the optimization routine, we propose ColaBO, the first Bayesian-principled framework for incorporating prior beliefs beyond the typical kernel structure, such as the likely location of the optimizer or the optimal value. The generality of ColaBO makes it applicable across different Monte Carlo acquisition functions and types of user beliefs. We empirically demonstrate ColaBO's ability to substantially accelerate optimization when the prior information is accurate, and to retain approximately default performance when it is misleading.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=NjU0jtXcYn",
    "arxiv_id": "2311.14645",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18788,
    "title": "Image Inpainting via Tractable Steering of Diffusion Models",
    "authors": [
      "Anji Liu",
      "Mathias Niepert",
      "Guy Van den Broeck"
    ],
    "abstract": "Diffusion models are the current state of the art for generating photorealistic images. Controlling the sampling process for constrained image generation tasks such as inpainting, however,  remains challenging since exact conditioning on such constraints is intractable. While existing methods use various techniques to approximate the constrained posterior, this paper proposes to exploit the ability of Tractable Probabilistic Models (TPMs) to exactly and efficiently compute the constrained posterior, and to leverage this signal to steer the denoising process of diffusion models. Specifically, this paper adopts a class of expressive TPMs termed Probabilistic Circuits (PCs). Building upon prior advances, we further scale up PCs and make them capable of guiding the image generation process of diffusion models. Empirical results suggest that our approach can consistently improve the overall quality and semantic coherence of inpainted images across three natural image datasets (i.e., CelebA-HQ, ImageNet, and LSUN) with only ~10% additional computational overhead brought by the TPM. Further, with the help of an image encoder and decoder, our method can readily accept semantic constraints on specific regions of the image, which opens up the potential for more controlled image generation tasks. In addition to proposing a new framework for constrained image generation, this paper highlights the benefit of more tractable models and motivates the development of expressive TPMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NSIVHTbZBR",
    "arxiv_id": "2401.03349",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18790,
    "title": "Hindsight PRIORs for Reward Learning from Human Preferences",
    "authors": [
      "Mudit Verma",
      "Katherine Metcalf"
    ],
    "abstract": "Preference based Reinforcement Learning (PbRL) removes the need to hand specify a reward function by learning one from preference feedback over policy behaviors. Current approaches to PbRL do not address the credit assignment problem inherent in determining which parts of a behavior most contributed to a preference resulting in data intensive approaches and subpar reward models. We address such limitations by introducing a credit assignment strategy (PRIOR) that uses a forward dynamics world model to approximate state importance within a trajectory and then guides rewards to be proportional to state importance through an auxiliary predicted return redistribution objective. Incorporating state importance into reward learning improves the speed of policy learning, overall policy performance, and reward recovery on both locomotion and manipulation tasks. For example, PRIOR achieves 80% success rate with half the amount of data compared to baselines. The performance gains and our ablations demonstrate the benefits even a simple credit assignment strategy can have on reward learning and that state importance in forward dynamics prediction is a strong proxy for a state's contribution to a preference decision.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=NLevOah0CJ",
    "arxiv_id": "2210.09151",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18839,
    "title": "AMAGO: Scalable In-Context Reinforcement Learning for Adaptive Agents",
    "authors": [
      "Jake Grigsby",
      "Linxi Fan",
      "Yuke Zhu"
    ],
    "abstract": "We introduce AMAGO, an in-context Reinforcement Learning (RL) agent that uses sequence models to tackle the challenges of generalization, long-term memory, and meta-learning. Recent works have shown that off-policy learning can make in-context RL with recurrent policies viable. Nonetheless, these approaches require extensive tuning and limit scalability by creating key bottlenecks in agents' memory capacity, planning horizon, and model size. AMAGO revisits and redesigns the off-policy in-context approach to successfully train long-sequence Transformers over entire rollouts in parallel with end-to-end RL. Our agent is scalable and applicable to a wide range of problems, and we demonstrate its strong performance empirically in meta-RL and long-term memory domains. AMAGO's focus on sparse rewards and off-policy data also allows in-context learning to extend to goal-conditioned problems with challenging exploration. When combined with a multi-goal hindsight relabeling scheme, AMAGO can solve a previously difficult category of open-world domains, where agents complete many possible instructions in procedurally generated environments.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=M6XWoEdmwf",
    "arxiv_id": "2310.09971",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18840,
    "title": "The Curse of Diversity in Ensemble-Based Exploration",
    "authors": [
      "Zhixuan Lin",
      "Pierluca D'Oro",
      "Evgenii Nikishin",
      "Aaron Courville"
    ],
    "abstract": "We uncover a surprising phenomenon in deep reinforcement learning: training a diverse ensemble of data-sharing agents -- a well-established exploration strategy -- can significantly impair the performance of the individual ensemble members when compared to standard single-agent training. Through careful analysis, we attribute the degradation in performance to the low proportion of self-generated data in the shared training data for each ensemble member, as well as the inefficiency of the individual ensemble members to learn from such highly off-policy data. We thus name this phenomenon *the curse of diversity*. We find that several intuitive solutions -- such as a larger replay buffer or a smaller ensemble size -- either fail to consistently mitigate the performance loss or undermine the advantages of ensembling. Finally, we demonstrate the potential of representation learning to counteract the curse of diversity with a novel method named Cross-Ensemble Representation Learning (CERL) in both discrete and continuous control domains. Our work offers valuable insights into an unexpected pitfall in ensemble-based exploration and raises important caveats for future applications of similar approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=M3QXCOTTk4",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18845,
    "title": "InstructScene: Instruction-Driven 3D Indoor Scene Synthesis with Semantic Graph Prior",
    "authors": [
      "Chenguo Lin",
      "Yadong MU"
    ],
    "abstract": "Comprehending natural language instructions is a charming property for 3D indoor scene synthesis systems. Existing methods suffer from directly modeling the object distributions within a scene, thereby hindering the controllability of generation. We introduce InstructScene, a novel generative framework that integrates a semantic graph prior and a layout decoder to improve controllability and fidelity for 3D scene synthesis. The proposed semantic graph prior jointly learns indoor scene appearance and layout distributions, exhibiting versatility across various generative tasks. To facilitate the benchmarking for text-driven 3D scene synthesis, we curate a high-quality dataset of scene-instruction pairs with large language and multimodal models. Extensive experimental results reveal that the proposed method surpasses existing state-of-the-art approaches by a large margin. Thorough ablation studies confirm the efficacy of crucial design components. Both our code and dataset will be publicly available after the review period.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=LtuRgL03pI",
    "arxiv_id": "2402.04717",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18858,
    "title": "Fast Value Tracking for Deep Reinforcement Learning",
    "authors": [
      "Frank Shih",
      "Faming Liang"
    ],
    "abstract": "Reinforcement learning tackles sequential decision-making problems by designing an agent that interacts with the environment. However, existing algorithms often treat the problem as static, calculating a point estimator for model parameters to achieve maximal expected reward (also known as value function) for the agent. They tend to overlook the stochastic nature of the agent-environment interaction system and the importance of uncertainty quantification associated with the model parameters. In our research, leveraging the Kalman filtering paradigm, we introduce a novel and scalable sampling algorithm called Langevinized Kalman Temporal-Difference (LKTD) for deep reinforcement learning. This algorithm, grounded in stochastic gradient Markov chain Monte Carlo (SGMCMC), efficiently draws samples from the posterior distribution of deep neural network parameters. Under mild conditions, we prove that the posterior samples generated by the LKTD algorithm converge to a stationary distribution. This convergence not only enables us to quantify uncertainties associated with the value function and model parameters, but also allows us to monitor these uncertainties during policy updates throughout the training phase. The LKTD algorithm paves the way for more robust and adaptable reinforcement learning approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LZIOBA2oDU",
    "arxiv_id": "2403.13178",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18868,
    "title": "SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruning",
    "authors": [
      "Lei You",
      "Hei Victor Cheng"
    ],
    "abstract": "This study addresses the challenge of inaccurate gradients in computing the empirical Fisher Information Matrix during network pruning. We introduce SWAP, a formulation of Entropic Wasserstein regression (EWR) for network pruning, capitalizing on the geometric properties of the optimal transport problem. The \u201cswap\u201d of the commonly used linear regression with the EWR in optimization is analytically demonstrated to offer noise mitigation effects by incorporating neighborhood interpolation across data points with only marginal additional computational cost. The unique strength of SWAP is its intrinsic ability to balance noise reduction and covariance information preservation effectively. Extensive experiments performed on various networks and datasets show comparable performance of SWAP with state-of-the-art (SoTA) network pruning algorithms. Our proposed method outperforms the SoTA when the network size or the target sparsity is large, the gain is even larger with the existence of noisy gradients, possibly from noisy data, analog memory, or adversarial attacks. Notably, our proposed method achieves a gain of 6% improvement in accuracy and 8% improvement in testing loss for MobileNetV1 with less than one-fourth of the network parameters remaining.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=LJWizuuBUy",
    "arxiv_id": "2310.04918",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18913,
    "title": "Diving Segmentation Model into Pixels",
    "authors": [
      "Chen Gan",
      "Zihao Yin",
      "Kelei He",
      "Yang Gao",
      "Junfeng Zhang"
    ],
    "abstract": "More distinguishable and consistent pixel features for each category will benefit the semantic segmentation under various settings.Existing efforts to mine better pixel-level features attempt to explicitly model the categorical distribution, which fails to achieve optimal due to the significant pixel feature variance.Moreover, prior research endeavors have scarcely delved into the thorough analysis and meticulous handling of pixel-level variances, leaving semantic segmentation at a coarse granularity.In this work, We analyze the causes of pixel-level variance and raise the concept of $\\textbf{pixel learning}$ to concentrate on the tailored learning process of pixels, handle pixel-level variance, and enhance the segmentation model's per-pixel recognition capability.Under the context of the pixel learning scheme, each image is viewed as a distribution of pixels, and pixel learning aims to pursue consistent pixel representation inside an image, continuously align pixels from different images (distributions), and eventually achieve consistent pixel representation for each category.We proposed a pure pixel-level learning framework, namely PiXL, which consists of a pixel partition module to divide pixels into sub-domains, a prototype generation, a selection module to prepare targets for subsequent alignment, and a pixel alignment module to guarantee pixel feature consistency intra- and inter-images.Extensive evaluations of multiple learning paradigms, including unsupervised domain adaptation and semi-/fully-supervised segmentation, show that PiXL outperforms state-of-the-art performances, especially when annotated images are scarce.Visualization of the embedding space further demonstrates that pixel learning attains a superior representation of pixel features.The code will be available upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=KBo7Z5aTV0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18923,
    "title": "Exploring Weight Balancing on Long-Tailed Recognition Problem",
    "authors": [
      "Naoya Hasegawa",
      "Issei Sato"
    ],
    "abstract": "Recognition problems in long-tailed data, in which the sample size per class is heavily skewed, have gained importance because the distribution of the sample size per class in a dataset is generally exponential unless the sample size is intentionally adjusted. Various methods have been devised to address these problems.Recently, weight balancing, which combines well-known classical regularization techniques with two-stage training, has been proposed. Despite its simplicity, it is known for its high performance compared with existing methods devised in various ways.However, there is a lack of understanding as to why this method is effective for long-tailed data. In this study, we analyze weight balancing by focusing on neural collapse and the cone effect at each training stage and found that it can be decomposed into an increase in Fisher's discriminant ratio of the feature extractor caused by weight decay and cross entropy loss and implicit logit adjustment caused by weight decay and class-balanced loss. Our analysis enables the training method to be further simplified by reducing the number of training stages to one while increasing accuracy.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JsnR0YO4Fq",
    "arxiv_id": "2305.16573",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18960,
    "title": "Towards Generative Abstract Reasoning: Completing Raven\u2019s Progressive Matrix via Rule Abstraction and Selection",
    "authors": [
      "Fan Shi",
      "Bin Li",
      "Xiangyang Xue"
    ],
    "abstract": "Endowing machines with abstract reasoning ability has been a long-term research topic in artificial intelligence. Raven's Progressive Matrix (RPM) is widely used to probe abstract visual reasoning in machine intelligence, where models need to understand the underlying rules and select the missing bottom-right images out of candidate sets to complete image matrices. The participators can display powerful reasoning ability by inferring the underlying attribute-changing rules and imagining the missing images at arbitrary positions.  However, existing solvers can hardly manifest such an ability in realistic RPM problems. In this paper, we propose a conditional generative model to solve answer generation problems through Rule AbstractIon and SElection (RAISE) in the latent space. RAISE encodes image attributes as latent concepts and decomposes underlying rules into atomic rules by means of concepts, which are abstracted as global learnable parameters. When generating the answer, RAISE selects proper atomic rules out of the global knowledge set for each concept and composes them into the integrated rule of an RPM. In most configurations, RAISE outperforms the compared generative solvers in tasks of generating bottom-right and arbitrary-position answers. We test RAISE in the odd-one-out task and two held-out configurations to demonstrate how learning decoupled latent concepts and atomic rules helps find the image breaking the underlying rules and handle RPMs with unseen combinations of rules and attributes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IcR1OOFzxm",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18961,
    "title": "HIFA: High-fidelity Text-to-3D Generation with Advanced Diffusion Guidance",
    "authors": [
      "Junzhe Zhu",
      "Peiye Zhuang",
      "Sanmi Koyejo"
    ],
    "abstract": "The advancements in automatic text-to-3D generation have been remarkable. Most existing methods use pre-trained text-to-image diffusion models to optimize 3D representations like Neural Radiance Fields (NeRFs) via latent-space denoising score matching. Yet, these methods often result in artifacts and inconsistencies across different views due to their suboptimal optimization approaches and limited understanding of 3D geometry. Moreover, the inherent constraints of NeRFs in rendering crisp geometry and stable textures usually lead to a two-stage optimization to attain high-resolution details. This work proposes holistic sampling and smoothing approaches to achieve high-quality text-to-3D generation, all in a single-stage optimization. We compute denoising scores in the text-to-image diffusion model's latent and image spaces. Instead of randomly sampling timesteps (also referred to as noise levels in denoising score matching), we introduce a novel timestep annealing approach that progressively reduces the sampled timestep throughout optimization. To generate high-quality renderings in a single-stage optimization, we propose regularization for the variance of z-coordinates along NeRF rays. To address texture flickering issues in NeRFs, we introduce a kernel smoothing technique that refines importance sampling weights coarse-to-fine, ensuring accurate and thorough sampling in high-density regions. Extensive experiments demonstrate the superiority of our method over previous approaches, enabling the generation of highly detailed and view-consistent 3D assets through a single-stage training process.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IZMPWmcS3H",
    "arxiv_id": "2305.18766",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18966,
    "title": "Adversarial Feature Map Pruning for Backdoor",
    "authors": [
      "Dong HUANG",
      "Qingwen Bu"
    ],
    "abstract": "Deep neural networks have been widely used in many critical applications, such as autonomous vehicles and medical diagnosis. However, their security is threatened by backdoor attack, which is achieved by adding artificial patterns to specific training data. Existing defense strategies primarily focus on using reverse engineering to reproduce the backdoor trigger generated by attackers and subsequently repair the DNN model by adding the trigger into inputs and fine-tuning the model with ground-truth labels. However, once the trigger generated by the attackers is complex and invisible, the defender can not successfully reproduce the trigger. Consequently, the DNN model will not be repaired since the trigger is not effectively removed.In this work, we propose Adversarial Feature Map Pruning for Backdoor (FMP) to mitigate backdoor from the DNN. Different from existing defense strategies, which focus on reproducing backdoor triggers, FMP tries to prune the backdoor feature maps, which are trained to extract backdoor information from the inputs. After pruning these backdoor feature maps, FMP will fine-tune the model with a secure subset of training data. Our experiments demonstrate that, compared to existing defense strategies, FMP can effectively reduce the Attack Success Rate (ASR) even against the most complex and invisible attack triggers (e.g., FMP decreases the ASR to 2.86\\% in CIFAR10, 19.2\\%-65.41\\% lower than previous arts). Second, unlike conventional defense methods that tend to exhibit low Robust Accuracy (i.e., the model's accuracy on the poisoned data), FMP achieves higher RA, indicating its superiority in maintaining model performance while mitigating the effects of backdoor attacks (e.g., FMP obtains 87.40\\% RA in CIFAR10). Third, compared to existing feature map pruning techniques, FMP can cover more backdoor feature maps (e.g., FMP removes 83.33\\% of backdoor feature maps from the model in the CIFAR10 \\& BadNet scenario).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=IOEEDkla96",
    "arxiv_id": "2307.11565",
    "GitHub": [
      "https://github.com/retsuh-bqw/FMP"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18974,
    "title": "Understanding Domain Generalization: A Noise Robustness Perspective",
    "authors": [
      "Rui Qiao",
      "Bryan Kian Hsiang Low"
    ],
    "abstract": "Despite the rapid development of machine learning algorithms for domain generalization (DG), there is no clear empirical evidence that the existing DG algorithms outperform the classic empirical risk minimization (ERM) across standard benchmarks. To better understand this phenomenon, we investigate whether there are benefits of DG algorithms over ERM through the lens of label noise.Specifically, our finite-sample analysis reveals that label noise exacerbates the effect of spurious correlations for ERM, undermining generalization. Conversely, we illustrate that DG algorithms exhibit implicit label-noise robustness during finite-sample training even when spurious correlation is present.Such desirable property helps mitigate spurious correlations and improve generalization in synthetic experiments. However, additional comprehensive experiments on real-world benchmark datasets indicate that label-noise robustness does not necessarily translate to better performance compared to ERM. We conjecture that the failure mode of ERM arising from spurious correlations may be less pronounced in practice. Our code is available at https://github.com/qiaoruiyt/NoiseRobustDG",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=I2mIxuXA72",
    "arxiv_id": "2401.14846",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18981,
    "title": "Can Transformers Capture Spatial Relations between Objects?",
    "authors": [
      "Chuan Wen",
      "Dinesh Jayaraman",
      "Yang Gao"
    ],
    "abstract": "Spatial relationships between objects represent key scene information for humans to understand and interact with the world. To study the capability of current computer vision systems to recognize physically grounded spatial relations, we start by proposing precise relation definitions that permit consistently annotating a benchmark dataset. Despite the apparent simplicity of this task relative to others in the recognition literature, we observe that existing approaches perform poorly on this benchmark. We propose new approaches exploiting the long-range attention capabilities of transformers for this task, and evaluating key design principles. We identify a simple \"RelatiViT\" architecture and demonstrate that it outperforms all current approaches. To our knowledge, this is the first method to convincingly outperform naive baselines on spatial relation prediction in in-the-wild settings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HgZUcwFhjr",
    "arxiv_id": "2403.00729",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18995,
    "title": "Compositional Conservatism: A Transductive Approach in Offline Reinforcement Learning",
    "authors": [
      "Yeda Song",
      "Dongwook Lee",
      "Gunhee Kim"
    ],
    "abstract": "Offline Reinforcement learning (RL) is a compelling framework for learning optimal policies without additional environmental interaction.   Nevertheless, offline RL inevitably faces the problem of distributional shifts, where the states and actions encountered during policy execution are not in the training dataset.   A common solution involves incorporating conservatism into either the policy or value function, which serves as a safeguard against uncertainties and unknowns.   In this paper, we also focus on achieving the same objectives of conservatism but from a different perspective.   We propose COmpositional COnservatism with Anchor-seeking ($\\text{\\textit{COCOA}}$) for offline RL, an approach that pursues conservatism in a compositional manner on top of the transductive reparameterization (Netanyahuet al., 2023).   In this reparameterization, the input variable (the state in our case) is viewed as the combination of an anchor and its difference from the original input.   Independently of and agnostically to the prevalent $\\text{\\textit{behavioral}}$ conservatism in offline RL, COCOA learns to seek both in-distribution anchors and differences with the learned dynamics model, encouraging conservatism in the $\\text{\\textit{compositional input space}}$ for the function approximators of the Q-function and policy.Our experimental results show that our method generally improves the performance of four state-of-the-art offline RL algorithms on the D4RL benchmark.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HRkyLbBRHI",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18997,
    "title": "Symmetric Basis Convolutions for Learning Lagrangian Fluid Mechanics",
    "authors": [
      "Rene Winchenbach",
      "Nils Thuerey"
    ],
    "abstract": "Learning physical simulations has been an essential and central aspect of many recent research efforts in machine learning, particularly for Navier-Stokes-based fluid mechanics. Classic numerical solvers have traditionally been computationally expensive and challenging to use in inverse problems, whereas Neural solvers aim to address both concerns through machine learning. We propose a general formulation for continuous convolutions using separable basis functions as a superset of existing methods and evaluate a large set of basis functions in the context of (a) a compressible 1D SPH simulation, (b) a weakly compressible 2D SPH simulation, and (c) an incompressible 2D SPH Simulation. We demonstrate that even and odd symmetries included in the basis functions are key aspects of stability and accuracy.Our broad evaluation shows that Fourier-based continuous convolutions outperform all other architectures regarding accuracy and generalization. Finally, using these Fourier-based networks, we show that prior inductive biases, such as window functions, are no longer necessary. An implementation of our approach, as well as complete datasets and solver implementations, is available at REDACTED FOR DOUBLE-BLIND REVIEW.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=HKgRwNhI9R",
    "arxiv_id": "2403.16680",
    "GitHub": [
      "https://github.com/tum-pbs/SFBC"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19011,
    "title": "A Benchmark Study on Calibration",
    "authors": [
      "Linwei Tao",
      "Younan Zhu",
      "Haolan Guo",
      "Minjing Dong",
      "Chang Xu"
    ],
    "abstract": "Deep neural networks are increasingly utilized in various machine learning tasks. However, as these models grow in complexity, they often face calibration issues, despite enhanced prediction accuracy. Many studies have endeavored to improve calibration performance through the use of specific loss functions, data preprocessing and training frameworks. Yet, investigations into calibration properties have been somewhat overlooked. Our study leverages the Neural Architecture Search (NAS) search space, offering an exhaustive model architecture space for thorough calibration properties exploration. We specifically create a model calibration dataset. This dataset evaluates 90 bin-based and 12 additional calibration measurements across 117,702 unique neural networks within the widely employed NATS-Bench search space. Our analysis aims to answer several longstanding questions in the field, using our proposed dataset: (i) Can model calibration be generalized across different datasets? (ii) Can robustness be used as a calibration measurement? (iii) How reliable are calibration metrics? (iv) Does a post-hoc calibration method affect all models uniformly? (v) How does calibration interact with accuracy? (vi) What is the impact of bin size on calibration measurement? (vii) Which architectural designs are beneficial for calibration? Additionally, our study bridges an existing gap by exploring calibration within NAS. By providing this dataset, we enable further research into NAS calibration. As far as we are aware, our research represents the first large-scale investigation into calibration properties and the premier study of calibration issues within NAS.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GzNhzX9kVa",
    "arxiv_id": "2308.11838",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19022,
    "title": "REValueD: Regularised Ensemble Value-Decomposition for Factorisable Markov Decision Processes",
    "authors": [
      "David Ireland",
      "Giovanni Montana"
    ],
    "abstract": "Discrete-action reinforcement learning algorithms often falter in tasks with high-dimensional discrete action spaces due to the vast number of possible actions. A recent advancement leverages value-decomposition, a concept from multi-agent reinforcement learning, to tackle this challenge. This study delves deep into the effects of this value-decomposition, revealing that whilst it curtails the over-estimation bias inherent to Q-learning algorithms, it amplifies target variance. To counteract this, we present an ensemble of critics to mitigate target variance. Moreover, we introduce a regularisation loss that helps to mitigate the effects that exploratory actions in one dimension can have on the value of optimal actions in other dimensions. Our novel algorithm, REValueD, tested on discretised versions of the DeepMind Control Suite tasks, showcases superior performance, especially in the challenging humanoid and dog tasks. We further dissect the factors influencing REValueD's performance, evaluating the significance of the regularisation loss and the scalability of REValueD with increasing sub-actions per dimension.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Gf15GsnfTy",
    "arxiv_id": "2401.08850",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19030,
    "title": "Noisy Interpolation Learning with Shallow Univariate ReLU Networks",
    "authors": [
      "Nirmit Joshi",
      "Gal Vardi",
      "Nathan Srebro"
    ],
    "abstract": "Understanding how overparameterized neural networks generalize despite perfect interpolation of noisy training data is a fundamental question. Mallinar et. al. (2022) noted that neural networks seem to often exhibit ``tempered overfitting'', wherein the population risk does not converge to the Bayes optimal error, but neither does it approach infinity, yielding non-trivial generalization. However, this has not been studied rigorously.  We provide the first rigorous analysis of the overfiting behaviour of regression with minimum norm ($\\ell_2$ of weights), focusing on univariate two-layer ReLU networks.  We show overfitting is tempered (with high probability) when measured with respect to the $L_1$ loss, but also show that the situation is more complex than suggested by Mallinar et. al., and overfitting is catastrophic with respect to the $L_2$ loss, or when taking an expectation over the training set.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=GTUoTJXPBf",
    "arxiv_id": "2307.15396",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19045,
    "title": "GeneOH Diffusion: Towards Generalizable Hand-Object Interaction Denoising via Denoising Diffusion",
    "authors": [
      "Xueyi Liu",
      "Li Yi"
    ],
    "abstract": "In this work, we tackle the challenging problem of denoising hand-object interactions (HOI). Given an erroneous interaction sequence, the objective is to refine the incorrect hand trajectory to remove interaction artifacts for a perceptually realistic sequence.  This challenge involves intricate interaction noise, including unnatural hand poses and incorrect hand-object relations, alongside the necessity for robust generalization to new interactions and diverse noise patterns. We tackle those challenges through a novel approach, **GeneOH Diffusion**, incorporating two key designs: an innovative contact-centric HOI representation named GeneOH and a new domain-generalizable denoising scheme. The contact-centric representation GeneOH informatively parameterizes the HOI process, facilitating enhanced generalization across various HOI scenarios. The new denoising scheme consists of a canonical denoising model trained to project noisy data samples from a whitened noise space to a clean data manifold and a \"denoising via diffusion\" strategy which can handle input trajectories with various noise patterns by first diffusing them to align with the whitened noise space and cleaning via the canonical denoiser. Extensive experiments on four benchmarks with significant domain variations demonstrate the superior effectiveness of our method. GeneOH Diffusion also shows promise for various downstream applications. An anonymous website for introducing the work is available at [Geneoh-Diffusion](https://geneoh-diffusion.github.io/Geneoh-Diffusion/).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FvK2noilxT",
    "arxiv_id": "2402.14810",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19056,
    "title": "Does Writing with Language Models Reduce Content Diversity?",
    "authors": [
      "Vishakh Padmakumar",
      "He He"
    ],
    "abstract": "Large language models (LLMs) have led to a surge in collaborative writing with model assistance. As different users incorporate suggestions from the same model, there is a risk of decreased diversity in the produced content, potentially limiting diverse perspectives in public discourse. In this work, we measure the impact of co-writing on diversity via a controlled experiment, where users write argumentative essays in three setups---using a base LLM (GPT3), a feedback-tuned LLM (InstructGPT), and writing without model help. We develop a set of diversity metrics and find that writing with InstructGPT (but not the GPT3) results in a statistically significant reduction in diversity. Specifically, it increases the similarity between the writings of different authors and reduces the overall lexical and content diversity. We additionally find that this effect is mainly attributable to InstructGPT contributing less diverse text to co-written essays. In contrast, the user-contributed text remains unaffected by model collaboration. This suggests that the recent improvement in generation quality from adapting models to human feedback might come at the cost of more homogeneous and less diverse content.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Feiz5HtCD0",
    "arxiv_id": "2309.05196",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19070,
    "title": "Denoising Diffusion Bridge Models",
    "authors": [
      "Linqi Zhou",
      "Aaron Lou",
      "Samar Khanna",
      "Stefano Ermon"
    ],
    "abstract": "Diffusion models are powerful generative models that map noise to data using stochastic processes. However, for many applications such as image editing, the model input comes from a distribution that is not random noise. As such, diffusion models must rely on cumbersome methods like guidance or projected sampling to incorporate this information in the generative process. In our work, we propose Denoising Diffusion Bridge Models (DDBMs), a natural alternative to this paradigm based on *diffusion bridges*, a family of processes that interpolate between two paired distributions given as endpoints. Our method learns the score of the diffusion bridge from data and maps from one endpoint distribution to the other by solving a (stochastic) differential equation based on the learned score. Our method naturally unifies several classes of generative models, such as score-based diffusion models and OT-Flow-Matching, allowing us to adapt existing design and architectural choices to our more general problem. Empirically, we apply DDBMs to challenging image datasets in both pixel and latent space. On standard image translation problems, DDBMs achieve significant improvement over baseline methods, and, when we reduce the problem to image generation by setting the source distribution to random noise, DDBMs achieve comparable FID scores to state-of-the-art methods despite being built for a more general task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=FKksTayvGo",
    "arxiv_id": "2309.16948",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19096,
    "title": "L2MAC: Large Language Model Automatic Computer for Extensive Code Generation",
    "authors": [
      "Samuel Holt",
      "Max Ruiz Luyten",
      "Mihaela van der Schaar"
    ],
    "abstract": "Transformer-based large language models (LLMs) are constrained by the fixed context window of the underlying transformer architecture, hindering their ability to produce long and logically consistent code. Memory-augmented LLMs are a promising solution, but current approaches cannot handle long code generation tasks since they (1) only focus on reading memory and reduce its evolution to the concatenation of new memories or (2) use very specialized memories that cannot adapt to other domains. This paper presents L2MAC, the first practical LLM-based stored-program automatic computer for long and consistent code generation. Its memory has two components: the instruction registry, which is populated with a prompt program to solve the user-given task, and a file store, which will contain the final and intermediate outputs. Each instruction is executed by a separate LLM instance, whose context is managed by a control unit capable of precise memory reading and writing to ensure effective interaction with the file store. These components enable L2MAC to generate virtually unbounded code structures, bypassing the constraints of the finite context window while producing code that fulfills complex user-specified requirements. We empirically show that L2MAC succeeds in generating large code bases for system design tasks where other coding methods fall short in implementing user requirements and provide insight into the reasons for this performance gap.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=EhrzQwsV4K",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19131,
    "title": "Scalable Monotonic Neural Networks",
    "authors": [
      "Hyunho Kim",
      "Jong-Seok Lee"
    ],
    "abstract": "In this research, we focus on the problem of learning monotonic neural networks, as preserving the monotonicity of a model with respect to a subset of inputs is crucial for practical applications across various domains. Although several methods have recently been proposed to address this problem, they have limitations such as not guaranteeing monotonicity in certain cases, requiring additional inference time, lacking scalability with increasing network size and number of monotonic inputs, and manipulating network weights during training. To overcome these limitations, we introduce a simple but novel architecture of the partially connected network which incorporates a 'scalable monotonic hidden layer' comprising three units: the exponentiated unit, ReLU unit, and confluence unit. This allows for the repetitive integration of the scalable monotonic hidden layers without other structural constraints. Consequently, our method offers ease of implementation and rapid training through the conventional error-backpropagation algorithm. We accordingly term this method as Scalable Monotonic Neural Networks (SMNN). Numerical experiments demonstrated that our method achieved comparable prediction accuracy to the state-of-the-art approaches while effectively addressing the aforementioned weaknesses.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DjIsNDEOYX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19140,
    "title": "The LLM Surgeon",
    "authors": [
      "Tycho F. A. van der Ouderaa",
      "Markus Nagel",
      "Mart Van Baalen",
      "Tijmen Blankevoort"
    ],
    "abstract": "State-of-the-art language models are becoming increasingly large in an effort to achieve the highest performance on large corpora of available textual data. However, the sheer size of the Transformer architectures makes it difficult to deploy models within computational, environmental or device-specific constraints. We explore data-driven compression of existing pretrained models as an alternative to training smaller models from scratch. To do so, we scale Kronecker-factored curvature approximations of the target loss landscape to large language models. In doing so, we can compute both the dynamic allocation of structures that can be removed as well as updates of remaining weights that account for the removal. We provide a general framework for unstructured, semi-structured and structured pruning and improve upon weight updates to capture more correlations between weights, while remaining computationally efficient. Experimentally, our method can prune rows and columns from a range of OPT models and Llamav2-7B by 20\\%-30\\%, with a negligible loss in performance, and achieve state-of-the-art results in unstructured and semi-structured pruning of large language models. We will open source our code on GitHub upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DYIIRgwg2i",
    "arxiv_id": "2312.17244",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19195,
    "title": "Causal-StoNet: Causal Inference for High-Dimensional Complex Data",
    "authors": [
      "Yaxin Fang",
      "Faming Liang"
    ],
    "abstract": "With the advancement of data science, the collection of increasingly complex datasets has become commonplace. In such datasets, the data dimension can be extremely high, and the underlying data generation process can be unknown and highly nonlinear. As a result, the task of making causal inference with high-dimensional complex data has become a fundamental problem in many disciplines, such as medicine, econometrics, and social science. However, the existing methods for causal inference are frequently developed under the assumption that the data dimension is low or that the underlying data generation process is linear or approximately linear. To address these challenges, this paper proposes a novel stochastic deep learning approach for conducting causal inference with high-dimensional complex data. The proposed approach is based on some deep learning techniques, including sparse deep learning theory and stochastic neural networks, that have been developed in recent literature. By using these techniques, the proposed approach can address both the high dimensionality and unknown data generation process in a coherent way. Furthermore, the proposed approach can also be used when missing values are present in the datasets.  Extensive numerical studies indicate that the proposed approach outperforms existing ones.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BtZ7vCt5QY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19204,
    "title": "Continual Momentum Filtering on Parameter Space for Online Test-time Adaptation",
    "authors": [
      "Jae-Hong Lee",
      "Joon-Hyuk Chang"
    ],
    "abstract": "Deep neural networks (DNNs) have revolutionized tasks such as image classification and speech recognition but often falter when training and test data diverge in distribution. External factors, from weather effects on images to varied speech environments, can cause this discrepancy, compromising DNN performance. Online test-time adaptation (OTTA) methods present a promising solution, recalibrating models in real-time during the test stage without requiring historical data. However, the OTTA paradigm is imperfect, often falling prey to issues such as catastrophic forgetting due to its reliance on noisy, self-trained predictions. Although some contemporary strategies mitigate this by tying adaptations to the static source model, this restricts model flexibility. This paper introduces a continual momentum filtering (CMF) framework, leveraging the Kalman filter (KF) to strike a balance between model adaptability and information retention. The CMF intertwines optimization via stochastic gradient descent with a KF-based inference process. This methodology not only aids in averting catastrophic forgetting but also provides high adaptability to shifting data distributions. We validate our framework on various OTTA scenarios and real-world situations regarding covariate and label shifts, and the CMF consistently shows superior performance compared to state-of-the-art methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BllUWdpIOA",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19222,
    "title": "Equivariant Scalar Fields for Molecular Docking with Fast Fourier Transforms",
    "authors": [
      "Bowen Jing",
      "Tommi S. Jaakkola",
      "Bonnie Berger"
    ],
    "abstract": "Molecular docking is critical to structure-based virtual screening, yet the throughput of such workflows is limited by the expensive optimization of scoring functions involved in most docking algorithms. We explore how machine learning can accelerate this process by learning a scoring function with a functional form that allows for more rapid optimization. Specifically, we define the scoring function to be the cross-correlation of multi-channel ligand and protein scalar fields parameterized by equivariant graph neural networks, enabling rapid optimization over rigid-body degrees of freedom with fast Fourier transforms. Moreover, the runtime of our approach can be amortized at several levels of abstraction, and is particularly favorable for virtual screening settings with a common binding pocket. We benchmark our scoring functions on two simplified docking-related tasks: decoy pose scoring and rigid conformer docking. Our method attains similar but faster performance on crystal structures compared to the Vina and Gnina scoring functions, and is more robust on computationally predicted structures.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BIveOmD1Nh",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19227,
    "title": "A Unified and General Framework for Continual Learning",
    "authors": [
      "Zhenyi Wang",
      "Yan Li",
      "Li Shen",
      "Heng Huang"
    ],
    "abstract": "Continual Learning (CL) focuses on learning from dynamic and changing data distributions while retaining previously acquired knowledge. Various methods have been developed to address the challenge of catastrophic forgetting, including regularization-based, Bayesian-based, and memory-replay-based techniques. However, these methods lack a unified framework and common terminology for describing their approaches. This research aims to bridge this gap by introducing a comprehensive and overarching framework that encompasses and reconciles these existing methodologies. Notably, this new framework is capable of encompassing established CL approaches as special instances within a unified and general optimization objective.An intriguing finding is that despite their diverse origins, these methods share common mathematical structures. This observation highlights the compatibility of these seemingly distinct techniques, revealing their interconnectedness through a shared underlying optimization objective.Moreover, the proposed general framework introduces an innovative concept called refresh learning, specifically designed to enhance the CL performance. This novel approach draws inspiration from neuroscience, where the human brain often sheds outdated information to improve the retention of crucial knowledge and facilitate the acquisition of new information. In essence, refresh learning operates by initially unlearning current data and subsequently relearning it. It serves as a versatile plug-in that seamlessly integrates with existing CL methods, offering an adaptable and effective enhancement to the learning process. Extensive experiments on CL benchmarks and theoretical analysis demonstrate the effectiveness of the proposed refresh learning.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=BE5aK0ETbp",
    "arxiv_id": "2403.13249",
    "GitHub": [
      "https://github.com/joey-wang123/CL-refresh-learning"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19265,
    "title": "Coeditor: Leveraging Repo-level Diffs for Code Auto-editing",
    "authors": [
      "Jiayi Wei",
      "Greg Durrett",
      "Isil Dillig"
    ],
    "abstract": "Developers often dedicate significant time to maintaining and refactoring existing code. However, most prior work on generative models for code focuses solely on creating new code, overlooking the distinctive needs of editing existing code. In this work, we explore a multi-round code auto-editing setting, aiming to predict edits to a code region based on recent changes within the same codebase. Our model, Coeditor, is a fine-tuned language model specifically designed for code editing tasks. We represent code changes using a line diff format and employ static analysis to form large customized model contexts, ensuring the availability of appropriate information for prediction. We collect a code editing dataset from the commit histories of 1650 open-source Python projects for training and evaluation. In a simplified single-round, single-edit task, Coeditor significantly outperforms GPT-3.5 and SOTA open-source code completion models (bringing exact-match accuracy from 34.7 up to 60.4), demonstrating the benefits of incorporating editing history for code completion. In a multi-round, multi-edit setting, we observe substantial gains by iteratively conditioning on additional user edits. We have open-sourced our code, data, and model weights to encourage future research and have released a VSCode extension powered by our model for interactive IDE usage.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=ALVwQjZRS8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19278,
    "title": "Leveraging Generative Models for Unsupervised Alignment of Neural Time Series Data",
    "authors": [
      "Ayesha Vermani",
      "Il Memming Park",
      "Josue Nassar"
    ],
    "abstract": "Large scale inference models are widely used in neuroscience to extract latent representations from high-dimensional neural recordings. Due to the statistical heterogeneities between sessions and animals, a new model is trained from scratch to infer the underlying dynamics for each new dataset. This is computationally expensive and does not fully leverage all the available data. Moreover, as these models get more complex, they can be challenging to train. In parallel, it is becoming common to use pre-trained models in the machine learning community for few shot and transfer learning. One major hurdle that prevents the re-use of generative models in neuroscience is the complex spatio-temporal structure of neural dynamics within and across animals. Interestingly, the underlying dynamics identified from different datasets on the same task are qualitatively similar. In this work, we exploit this observation and propose a source-free and unsupervised alignment approach that utilizes the learnt dynamics and enables the re-use of trained generative models. We validate our approach on simulations and show the efficacy of the alignment on neural recordings from the motor cortex obtained during a reaching task.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=9zhHVyLY4K",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17401,
    "title": "In defense of parameter sharing for model-compression",
    "authors": [
      "Aditya Desai",
      "Anshumali Shrivastava"
    ],
    "abstract": "When considering a model architecture, there are several ways to reduce its memory footprint. Historically, popular approaches included selecting smaller architectures and creating sparse networks through pruning. More recently, randomized parameter-sharing (RPS) methods have gained traction for model compression atstart of training. In this paper, we comprehensively assess the trade-off betweenmemory and accuracy across RPS, pruning techniques, and building smaller models. Our findings demonstrate that RPS, which is both data and model-agnostic, consistently outperforms smaller models and all moderately informed pruning strategies, such as MAG, SNIP, SYNFLOW, and GRASP, across the entire compression range. This advantage becomes particularly pronounced in higher compression scenarios. Notably, even when compared to highly informed pruning techniques like Lottery Ticket Rewinding (LTR), RPS exhibits superior performance in high compression settings. This points out inherent capacity advantage that RPS enjoys over sparse models. Theoretically, we establish RPS as a superiortechnique in terms of memory-efficient representation when compared to pruningfor linear models. This paper argues in favor of paradigm shift towards RPS basedmodels. During our rigorous evaluation of RPS, we identified issues in the state-of-the-art RPS technique ROAST, specifically regarding stability (ROAST\u2019s sensitivity to initialization hyperparameters, often leading to divergence) and Pareto-continuity (ROAST\u2019s inability to recover the accuracy of the original model at zerocompression). We provably address both of these issues. We refer to the modifiedRPS, which incorporates our improvements, as STABLE-RPS",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ypAT2ixD4X",
    "arxiv_id": "2310.11611",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19307,
    "title": "SPDER: Semiperiodic Damping-Enabled Object Representation",
    "authors": [
      "Kathan Shah",
      "Chawin Sitawarin"
    ],
    "abstract": "We present a neural network architecture designed to naturally learn a positional embedding and overcome the spectral bias towards lower frequencies faced by conventional implicit neural representation networks. Our proposed architecture, SPDER, is a simple MLP that uses an activation function composed of a sinusoidal multiplied by a sublinear function, called the damping function. The sinusoidal enables the network to automatically learn the positional embedding of an input coordinate while the damping passes on the actual coordinate value by preventing it from being projected down to within a finite range of values. Our results indicate that SPDERs speed up training by 10 times and converge to losses 1,500 to 50,000 times lower than that of the state-of-the-art for image representation. SPDER is also state-of-the-art in audio representation. The superior representation capability allows SPDER to also excel on multiple downstream tasks such as image super-resolution and video frame interpolation. We provide intuition as to why SPDER significantly improves fitting compared to that of other INR methods while requiring no hyperparameter tuning or preprocessing.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=92btneN9Wm",
    "arxiv_id": "2306.15242",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19320,
    "title": "Amortized Network Intervention to Steer the Excitatory Point Processes",
    "authors": [
      "Zitao Song",
      "Wendi Ren",
      "Shuang Li"
    ],
    "abstract": "We tackle the challenge of large-scale network intervention for guiding excitatory point processes, such as infectious disease spread or traffic congestion control. Our model-based reinforcement learning utilizes neural ODEs to capture how the networked excitatory point processes will evolve subject to the time-varying changes in network topology. Our approach incorporates Gradient-Descent based Model Predictive Control (GD-MPC), offering policy flexibility to accommodate prior knowledge and constraints. To address the intricacies of planning and overcome the high dimensionality inherent to such decision-making problems, we design an Amortize Network Interventions (ANI) framework, allowing for the pooling of optimal policies from history and other contexts, while ensuring a permutation equivalent property. This property enables efficient knowledge transfer and sharing across diverse contexts. Our approach has broad applications, from curbing infectious disease spread to reducing carbon emissions through traffic light optimization, and thus has the potential to address critical societal and environmental challenges.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8g26Yv1EOu",
    "arxiv_id": "2310.04159",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19328,
    "title": "MgNO: Efficient Parameterization of Linear Operators via Multigrid",
    "authors": [
      "Juncai He",
      "Xinliang Liu",
      "Jinchao Xu"
    ],
    "abstract": "In this work, we propose a concise neural operator architecture for operator learning. Drawing an analogy with a conventional fully connected neural network, we define the neural operator as follows: the output of the $i$-th neuron in a nonlinear operator layer is defined by $\\mathcal O_i(u) =  \\sigma\\left( \\sum_j \\mathcal W_{ij} u + \\mathcal B_{ij}\\right)$. Here, $\\mathcal W_{ij}$ denotes the bounded linear operator connecting $j$-th input neuron to $i$-th output neuron, and the bias $\\mathcal B_{ij}$ takes the form of a function rather than a scalar. Given its new universal approximation property, the efficient parameterization of the bounded linear operators between two neurons (Banach spaces) plays a critical role. As a result, we introduce MgNO, utilizing multigrid structures to parameterize these linear operators between neurons.  This approach offers both mathematical rigor and practical expressivity. Additionally, MgNO obviates the need for conventional lifting and projecting operators typically required in previous neural operators. Moreover, it seamlessly accommodates diverse boundary conditions. Our empirical observations reveal that MgNO exhibits superior ease of training compared to CNN-based models, while also displaying a reduced susceptibility to overfitting when contrasted with spectral-type neural operators. We demonstrate the efficiency and accuracy of our method with consistently state-of-the-art performance on different types of partial differential equations (PDEs).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=8OxL034uEr",
    "arxiv_id": "2310.19809",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19337,
    "title": "Local Graph Clustering with Noisy Labels",
    "authors": [
      "Artur Back de Luca",
      "Kimon Fountoulakis",
      "Shenghao Yang"
    ],
    "abstract": "The growing interest in machine learning problems over graphs with additional node information such as texts, images, or labels has popularized methods that require the costly operation of processing the entire graph. Yet, little effort has been made to the development of fast local methods (i.e. without accessing the entire graph) that extract useful information from such data. To that end, we propose a study of local graph clustering using noisy node labels as a proxy for additional node information. In this setting, nodes receive initial binary labels based on cluster affiliation: 1 if they belong to the target cluster and 0 otherwise. Subsequently, a fraction of these labels is flipped. We investigate the benefits of incorporating noisy labels for local graph clustering. By constructing a weighted graph with such labels, we study the performance of graph diffusion-based local clustering method on both the original and the weighted graphs. From a theoretical perspective, we consider recovering an unknown target cluster with a single seed node in a random graph with independent noisy node labels. We provide sufficient conditions on the label noise under which, with high probability, using diffusion in the weighted graph yields a more accurate recovery of the target cluster. This approach proves more effective than using the given labels alone or using diffusion in the label-free original graph. Empirically, we show that reliable node labels can be obtained with just a few samples from an attributed graph. Moreover, utilizing these labels via diffusion in the weighted graph leads to significantly better local clustering performance across several real-world datasets, improving F1 scores by up to 13\\%.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=89A5c6enfc",
    "arxiv_id": "2310.08031",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19351,
    "title": "Belief-Enriched Pessimistic Q-Learning against Adversarial State Perturbations",
    "authors": [
      "Xiaolin Sun",
      "Zizhan Zheng"
    ],
    "abstract": "Reinforcement learning (RL) has achieved phenomenal success in various domains. However, its data-driven nature also introduces new vulnerabilities that can be exploited by malicious opponents. Recent work shows that a well-trained RL agent can be easily manipulated by strategically perturbing its state observations at the test stage. Existing solutions either introduce a regularization term to improve the smoothness of the trained policy against perturbations or alternatively train the agent's policy and the attacker's policy. However, the former does not provide sufficient protection against strong attacks, while the latter is computationally prohibitive for large environments. In this work, we propose a new robust RL algorithm for deriving a pessimistic policy to safeguard against an agent's uncertainty about true states. This approach is further enhanced with belief state inference and diffusion-based state purification to reduce uncertainty. Empirical results show that our approach obtains superb performance under strong attacks and has a comparable training overhead with regularization-based methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7gDENzTzw1",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19365,
    "title": "A Foundation Model for Error Correction Codes",
    "authors": [
      "Yoni Choukroun",
      "Lior Wolf"
    ],
    "abstract": "In recent years, Artificial Intelligence has undergone a paradigm shift with the rise of foundation models, which are trained on large amounts of data, typically in a self-supervised way, and can then be adapted to a wide range of downstream tasks. In this work, we propose the first foundation model for Error Correction Codes. This model is trained on multiple codes and can then be applied to an unseen code. To enable this, we extend the Transformer architecture in multiple ways: (1) a code-invariant initial embedding, which is also position- and length-invariant, (2) a learned modulation of the attention maps that is conditioned on the Tanner graph, and (3) a length-invariant code-aware noise prediction module that is based on the parity-check matrix. The proposed architecture is trained on multiple short- and medium-length codes and is able to generalize to unseen codes. Its performance on these codes matches and even outperforms the state of the art, despite having a smaller capacity than the leading code-specific transformers. The suggested framework therefore demonstrates, for the first time, the benefits of learning a universal decoder rather than a neural decoder optimized for a given code.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7KDuQPrAF3",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19368,
    "title": "SLiMe: Segment Like Me",
    "authors": [
      "Aliasghar Khani",
      "Saeid Asgari",
      "Aditya Sanghi",
      "Ali Mahdavi Amiri",
      "Ghassan Hamarneh"
    ],
    "abstract": "Significant strides have been made using large vision-language models, like Stable Diffusion (SD), for a variety of downstream tasks, including image generation, image editing, and 3D shape generation. Inspired by these advancements, we explore leveraging these vision-language models for segmenting images at any desired granularity using as few as one annotated sample. We propose SLiMe, which frames this problem as an optimization task. Specifically, given a single image and its segmentation mask, we first extract our novel \u201cweighted accumulated self-attention map\u201d along with cross-attention map from the SD prior. Then, using these extracted maps, the text embeddings of SD are optimized to highlight the segmented region in these attention maps, which in turn can be used to derive new segmentation results. Moreover, leveraging additional training data when available, i.e. few-shot, improves the performance of SLiMe. We performed comprehensive experiments examining various design factors and showed that SLiMe outperforms other existing one-shot and few-shot segmentation methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7FeIRqCedv",
    "arxiv_id": "2309.03179",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19420,
    "title": "MiniLLM: Knowledge Distillation of Large Language Models",
    "authors": [
      "Yuxian Gu",
      "Li Dong",
      "Furu Wei",
      "Minlie Huang"
    ],
    "abstract": "Knowledge Distillation (KD) is a promising technique for reducing the high computational demand of large language models (LLMs). However, previous KD methods are primarily applied to white-box classification models or training small models to imitate black-box model APIs like ChatGPT. How to effectively distill the knowledge of white-box LLMs into small models is still under-explored, which becomes more important with the prosperity of open-source LLMs. In this work, we propose a KD approach that distills LLMs into smaller language models. We first replace the forward Kullback-Leibler divergence (KLD) objective in the standard KD approaches with reverse KLD, which is more suitable for KD on generative language models, to prevent the student model from overestimating the low-probability regions of the teacher distribution. Then, we derive an effective optimization approach to learn this objective. The student models are named MiniLLM. Extensive experiments in the instruction-following setting show that MiniLLM generates more precise responses with higher overall quality, lower exposure bias, better calibration, and higher long-text generation performance than the baselines. Our method is scalable for different model familieswith 120M to 13B parameters. Our code, data, and model checkpoints can be found in https://github.com/microsoft/LMOps/tree/main/minillm.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5h0qf7IBZZ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19426,
    "title": "TEDDY: Trimming Edges with Degree-based Discrimination Strategy",
    "authors": [
      "Hyunjin Seo",
      "Jihun Yun",
      "Eunho Yang"
    ],
    "abstract": "Since the pioneering work on the lottery ticket hypothesis for graph neural networks (GNNs) was proposed in Chen et al. (2021), the study on finding graph lottery tickets (GLT) has become one of the pivotal focus in GNN community, inspiring researchers to discover sparser GLT while achieving comparable performance to original dense networks. In parallel, the graph structure has gained substantial attention as a crucial factor in GNN training dynamics, also elucidated by several recent studies. Despite this, contemporary studies on GLT, in general, have not fully exploited inherent pathways in the graph structure and identified tickets in an iterative manner, which is time-consuming and inefficient. To address these limitations, we introduce TEDDY, a one-shot edge sparsification framework that leverages structural information by incorporating edge-degree information. Followed by edge sparsification, we encourage the parameter sparsity during training via simple projected gradient descent on the $\\ell_0$ ball. Given the target sparsity levels for both the graph structure and the model parameters, our TEDDY facilitates efficient and rapid realization of GLT within a single training. Remarkably, our experimental results demonstrate that TEDDY significantly surpasses conventional iterative approaches in generalization, even when conducting one-shot sparsification that solely utilizes graph structures, without taking node features into account.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5RUf9nEdyC",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19440,
    "title": "Towards Identifiable Unsupervised Domain Translation: A Diversified Distribution Matching Approach",
    "authors": [
      "Sagar Shrestha",
      "Xiao Fu"
    ],
    "abstract": "Unsupervised domain translation (UDT) is often realized by generative adversarial network (GAN)-based probability distribution matching of the source and target domains. CycleGAN stands as arguably the most representative approach among this line of work. However, it was noticed in recent works that CycleGAN and variants could fail to identify the desired translation function and produce content-misaligned translations. This limitation arises due to the presence of multiple translation functions---referred to as ``measure-preserving automorphism\" (MPA)---in the solution space of the learning criteria. Despite the awareness of such identifiability issues, solutions have remained elusive. This study delves into the core identifiability challenge and introduces an MPA elimination theory. Our analysis shows that MPA is unlikely to exist, if multiple pairs of diverse cross-domain conditional distributions are aligned by the learning criterion. Our theory leads to a UDT learner using distribution matching over auxiliary variable-induced subsets of the domains---other than over the entire source/target domains as in the classical setting. The proposed framework is the first to rigorously establish identifiability of the desired translation function for UDT, to our best knowledge. Experiments corroborate with our theoretical claims.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=55uj7mU7Cv",
    "arxiv_id": "2401.09671",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19451,
    "title": "Diffusion-TS: Interpretable Diffusion for General Time Series Generation",
    "authors": [
      "Xinyu Yuan",
      "Yan Qiao"
    ],
    "abstract": "Denoising diffusion probabilistic models (DDPMs) are becoming the leading paradigm for generative models. It has recently shown breakthroughs in audio synthesis and time series imputation. However, little attention has been given to leveraging the powerful generative ability for general time series production. In this paper, we propose Diffusion-TS, the first DDPM-based framework that generates multivariate time series samples of high quality by using an encoder-decoder Transformer with disentangled temporal representations, in which the decomposition technique guides Diffusion-TS to capture the semantic meaning of time series while Transformers mine detailed sequential information from the noisy model input. For more interpretable and accurate pattern modeling, we train the model to directly reconstruct the sample instead of the noise in each diffusion step, combining a Fourier-based loss term. In addition, it is shown that the proposed Diffusion-TS can be easily extended to conditional generation tasks, such as forecasting and imputation, without any model changes. This also motivates us to further explore the performance of Diffusion-TS under irregular settings. Finally, through qualitative and quantitative experiments, results show that Diffusion-TS achieves the state-of-the-art results on various realistic analyses of time series. Our code and models are attached in the supplementary material and will be made publicly available.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4h1apFjO99",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19487,
    "title": "Brain decoding: toward real-time reconstruction of visual perception",
    "authors": [
      "Yohann Benchetrit",
      "Hubert Banville",
      "Jean-Remi King"
    ],
    "abstract": "In the past five years, the use of generative and foundational AI systems has greatly improved the decoding of brain activity. Visual perception, in particular, can now be decoded from functional Magnetic Resonance Imaging (fMRI) with remarkable fidelity. This neuroimaging technique, however, suffers from a limited temporal resolution ($\\approx$0.5\\,Hz) and thus fundamentally constrains its real-time usage. Here, we propose an alternative approach based on magnetoencephalography (MEG), a neuroimaging device capable of measuring brain activity with high temporal resolution ($\\approx$5,000 Hz). For this, we develop an MEG decoding model trained with both contrastive and regression objectives and consisting of three modules: i) pretrained embeddings obtained from the image, ii) an MEG module trained end-to-end and iii) a pretrained image generator. Our results are threefold: Firstly, our MEG decoder shows a 7X improvement of image-retrieval over classic linear decoders. Second, late brain responses to images are best decoded with DINOv2, a recent foundational image model. Third, image retrievals and generations both suggest that MEG signals primarily contain high-level visual features, whereas the same approach applied to 7T fMRI also recovers low-level features. Overall, these results provide an important step towards the decoding - in real time - of the visual processes continuously unfolding within the human brain.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3y1K6buO8c",
    "arxiv_id": "2310.19812",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19504,
    "title": "Why is SAM Robust to Label Noise?",
    "authors": [
      "Christina Baek",
      "J Zico Kolter",
      "Aditi Raghunathan"
    ],
    "abstract": "Sharpness-Aware Minimization (SAM) is most known for achieving state-of the-art performances on natural image and language tasks. However, its most pronounced improvements (of tens of percent) is rather in the presence of label noise. Understanding SAM's label noise robustness requires a departure from characterizing the robustness of minimas lying in ``flatter'' regions of the loss landscape. In particular, the peak performance occurs with early stopping, far before the loss converges. We decompose SAM's robustness into two effects: one induced by changes to the logit term and the other induced by changes to the network Jacobian. The first can be observed in linear logistic regression where SAM provably upweights the gradient contribution from clean examples. Although this explicit upweighting is also observable in neural networks, when we intervene and modify SAM to remove this effect, surprisingly, we see no visible degradation in performance. We infer that SAM's effect in deeper networks is instead explained entirely by the effect SAM has on the network Jacobian. We theoretically derive the explicit regularization induced by this Jacobian effect in two layer linear networks. Motivated by our analysis, we see that cheaper alternatives to SAM that explicitly induce these regularization effects largely recover the benefits even in deep networks trained on real-world datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3aZCPl3ZvR",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19507,
    "title": "Continual Learning in the Presence of Spurious Correlations: Analyses and a Simple Baseline",
    "authors": [
      "Donggyu Lee",
      "Sangwon Jung",
      "Taesup Moon"
    ],
    "abstract": "Most continual learning (CL) algorithms have focused on tackling the stability- plasticity dilemma, that is, the challenge of preventing the forgetting of past tasks while learning new ones. However, we argue that they have overlooked the impact of knowledge transfer when the training dataset of a certain task is biased \u2014 namely, when the dataset contains some spurious correlations that can overly influence the prediction rule of a model. In that case, how would the dataset bias of a certain task affect prediction rules of a CL model for the future or past tasks? In this work, we carefully design systematic experiments using three benchmark datasets to answer the question from our empirical findings. Specifically, we first show through two-task CL experiments that standard CL methods, which are oblivious of the dataset bias, can transfer bias from one task to another, both forward and backward. Moreover, we find out this transfer is exacerbated depending on whether the CL methods focus on stability or plasticity. We then present that the bias is also transferred and even accumulates in longer task sequences. Finally, we offer a standardized experiment setup and a simple, yet strong plug-in baseline method, dubbed as Group-class Balanced Greedy Sampling (BGS). These resources can be utilized for the development of more advanced bias-aware CL methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=3Y7r6xueJJ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19516,
    "title": "GIO: Gradient Information Optimization for Training Dataset Selection",
    "authors": [
      "Dante Everaert",
      "Christopher Potts"
    ],
    "abstract": "It is often advantageous to train models on a subset of the available train examples, because the examples are of variable quality or because one would like to train with fewer examples, without sacrificing performance. We present Gradient Information Optimization (GIO), a scalable, task-agnostic approach to this data selection problem that requires only a small set of (unlabeled) examples representing a target distribution. GIO begins from a natural, information-theoretic objective that is intractable in practice. Our contribution is in showing that it can be made highly scalable through a simple relaxation of the objective and a highly efficient implementation. In experiments with machine translation, spelling correction, and image recognition, we show that GIO delivers outstanding results with very small train sets. These findings are robust to different representation models and hyperparameters for GIO itself. GIO is task- and domain-agnostic and can be applied out-of-the-box to new datasets and domains.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=3NnfJnbJT2",
    "arxiv_id": "2306.11670",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17374,
    "title": "Rigid Protein-Protein Docking via Equivariant Elliptic-Paraboloid Interface Prediction",
    "authors": [
      "Ziyang Yu",
      "Wenbing Huang",
      "Yang Liu"
    ],
    "abstract": "The study of rigid protein-protein docking plays an essential role in a variety of tasks such as drug design and protein engineering. Recently, several learning-based methods have been proposed for the task, exhibiting much faster docking speed than those computational methods. In this paper, we propose a novel learning-based method called ElliDock, which predicts an elliptic paraboloid to represent the protein-protein docking interface. To be specific, our model estimates elliptic paraboloid interfaces for the two input proteins respectively, and obtains the roto-translation transformation for docking by making two interfaces coincide. By its design, ElliDock is independently equivariant with respect to arbitrary rotations/translations of the proteins, which is an indispensable property to ensure the generalization of the docking process. Experimental evaluations show that ElliDock achieves the fastest inference time among all compared methods, and outperforms state-of-the-art learning-based methods, like DiffDock-PP and Alphafold-Multimer, for particularly antibody-antigen docking.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zgQ0PHeGnL",
    "arxiv_id": "2401.08986",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17387,
    "title": "SetCSE: Set Operations using Contrastive Learning of Sentence Embeddings",
    "authors": [
      "Kang Liu"
    ],
    "abstract": "Taking inspiration from Set Theory, we introduce SetCSE, an innovative information retrieval framework. SetCSE employs sets to represent complex semantics and incorporates well-defined operations for structured information querying within the provided context. In alignment with this framework, we introduce an inter-set contrastive learning objective to enhance language model comprehension concerning the given semantics. Additionally, we present a suite of operations that leverage the enhanced sentence embeddings for querying, including SetCSE intersection, difference, and operation series. Throughout this paper, we demonstrate that SetCSE adheres to the conventions of natural language expression, provides a significant enhancement in the discriminatory capability of underlying language models, and enables numerous information retrieval tasks involving complex and intricate prompts that cannot be achieved using existing search methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zEHGSN8Hy8",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17391,
    "title": "An Efficient Tester-Learner for Halfspaces",
    "authors": [
      "Aravind Gollakota",
      "Adam Klivans",
      "Konstantinos Stavropoulos",
      "Arsen Vasilyan"
    ],
    "abstract": "We give the first efficient algorithm for learning halfspaces in the testable learning model recently defined by Rubinfeld and Vasilyan [2022]. In this model, a learner certifies that the accuracy of its output hypothesis is near optimal whenever the training set passes an associated test, and training sets drawn from some target distribution must pass the test. This model is more challenging than distribution-specific agnostic or Massart noise models where the learner is allowed to fail arbitrarily if the distributional assumption does not hold. We consider the setting where the target distribution is the standard Gaussian in $d$ dimensions and the label noise is either Massart or adversarial (agnostic). For Massart noise, our tester-learner runs in polynomial time and outputs a hypothesis with (information-theoretically optimal) error $\\mathrm{opt}+\\epsilon$ (and extends to any fixed strongly log-concave target distribution). For adversarial noise, our tester-learner obtains error $O(\\mathrm{opt})+\\epsilon$ in polynomial time. Prior work on testable learning ignores the labels in the training set and checks that the empirical moments of the covariates are close to the moments of the base distribution. Here we develop new tests of independent interest that make critical use of the labels and combine them with the moment-matching approach of Gollakota et al. [2022]. This enables us to implement a testable variant of the algorithm of Diakonikolas et al. [2020a, 2020b] for learning noisy halfspaces using nonconvex SGD.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=z6n1fKMMC1",
    "arxiv_id": "2302.14853",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17403,
    "title": "Achieving Fairness in Multi-Agent MDP Using Reinforcement Learning",
    "authors": [
      "Peizhong Ju",
      "Arnob Ghosh",
      "Ness Shroff"
    ],
    "abstract": "Fairness plays a crucial role in various multi-agent systems (e.g., communication networks, financial markets, etc.). Many multi-agent dynamical interactions can be cast as Markov Decision Processes (MDPs). While existing research has focused on studying fairness in known environments, the exploration of fairness in such systems for unknown environments remains open. In this paper, we propose a  Reinforcement Learning (RL) approach to achieve fairness in multi-agent finite-horizon episodic MDPs. Instead of maximizing the sum of individual agents' value functions, we introduce a fairness function that ensures equitable rewards across agents. Since the classical Bellman's equation does not hold when the sum of individual value functions is not maximized, we cannot use traditional approaches. Instead, in order to explore, we maintain a confidence bound of the unknown environment and then propose an online convex optimization based approach to obtain a policy constrained to this confidence region. We show that such an approach achieves sub-linear regret in terms of the number of episodes. Additionally, we provide a probably approximately correct (PAC) guarantee based on the obtained regret bound. We also propose an offline RL algorithm and bound the optimality gap with respect to the optimal fair solution. To mitigate computational complexity, we introduce a policy-gradient type method for the fair objective. Simulation experiments also demonstrate the efficacy of our approach.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yoVq2BGQdP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17414,
    "title": "Hybrid Sharing for Multi-Label Image Classification",
    "authors": [
      "Zihao Yin",
      "Chen Gan",
      "Kelei He",
      "Yang Gao",
      "Junfeng Zhang"
    ],
    "abstract": "Existing multi-label classification methods have long suffered from label heterogeneity, where learning a label obscures another. By modeling multi-label classification as a multi-task problem, the problem can be regarded as a negative transfer that makes it difficult to simultaneously enhance performance across multiple tasks. In this work, we proposed the Hybrid Sharing Query (HSQ), a transformer-based model that introduces the mixture-of-experts architecture to image multi-label classification. Our approach is designed to leverage label correlations while mitigating heterogeneity effectively. To this end, our model is incorporated with a fusion expert framework that enables HSQ to optimally combine the strengths of task-specialized experts with shared experts, ultimately enhancing multi-label classification performance across most labels. We conducted extensive experiments on two benchmark datasets. The results demonstrate that the proposed method achieves state-of-the-art performance and yields simultaneous improvements across most labels. The code will be available upon acceptance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=yVJd8lKyVX",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17432,
    "title": "Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods",
    "authors": [
      "Zijian Liu",
      "Zhengyuan Zhou"
    ],
    "abstract": "In the past several years, the convergence of the last iterate of the Stochastic Gradient Descent (SGD) algorithm has triggered people's great interest due to its good performance in practice but lack of theoretical understanding. For Lipschtiz and convex functions, different works have established the optimal $O(\\log(1/\\delta)\\log T/\\sqrt{T})$ or $O(\\sqrt{\\log(1/\\delta)/T})$ high-probability convergence rates for the final iterate, where $T$ is the time horizon and $\\delta$ is the failure probability. However, to prove these bounds, all the existing works are limited to compact domains, and almost all of them also require almost surely bounded noises. It is natural to ask whether the last iterate of SGD can still guarantee the optimal convergence rate but without these two restrictive assumptions. Besides this important question, there are still lots of theoretical problems lacking an answer. For example, compared with the last iterate convergence of SGD for non-smooth problems, only very few results for smooth optimization have yet been developed. Additionally, the existing results are all limited to a single objective and the standard Euclidean norm. It still remains unclear whether the last-iterative convergence can be provably extended to wider composite optimization and non-Euclidean norms. In this work, to address the issues mentioned above, we revisit the last-iterative convergence of stochastic gradient methods and provide the first unified way to prove the convergence rates both in expectation and in high probability to accommodate general domains, composite objectives, non-Euclidean norms, Lipschitz conditions, smoothness and (strong) convexity simultaneously.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=xxaEhwC1I4",
    "arxiv_id": "2312.08531",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17476,
    "title": "On the Effect of Batch Size in Byzantine-Robust Distributed Learning",
    "authors": [
      "Yi-Rui Yang",
      "Chang-Wei Shi",
      "Wu-Jun Li"
    ],
    "abstract": "Byzantine-robust distributed learning (BRDL), in which computing devices are likely to behave abnormally due to accidental failures or malicious attacks, has recently become a hot research topic. However, even in the independent and identically distributed (i.i.d.) case, existing BRDL methods will suffer a significant drop on model accuracy due to the large variance of stochastic gradients. Increasing batch sizes is a simple yet effective way to reduce the variance. However, when the total number of gradient computation is fixed, a too-large batch size will lead to a too-small iteration number (update number), which may also degrade the model accuracy. In view of this challenge, we mainly study the effect of batch size when the total number of gradient computation is fixed in this work. In particular, we show that when the total number of gradient computation is fixed, the optimal batch size corresponding to the tightest theoretical upper bound in BRDL increases with the fraction of Byzantine workers. Therefore, compared to the case without attacks, a larger batch size is preferred when under Byzantine attacks. Motivated by the theoretical finding, we propose a novel method called Byzantine-robust stochastic gradient descent with normalized momentum (ByzSGDnm) in order to further increase model accuracy in BRDL. We theoretically prove the convergence of ByzSGDnm for general non-convex cases under Byzantine attacks. Empirical results show that when under Byzantine attacks, compared to the cases of small batch sizes, setting a relatively large batch size can significantly increase the model accuracy, which is consistent with our theoretical results. Moreover, ByzSGDnm can achieve higher model accuracy than existing BRDL methods when under deliberately crafted attacks. In addition, we empirically show that increasing batch sizes has the bonus of training acceleration.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wriKDQqiOQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17477,
    "title": "Benchmarking Algorithms for Federated Domain Generalization",
    "authors": [
      "Ruqi Bai",
      "Saurabh Bagchi",
      "David I. Inouye"
    ],
    "abstract": "While prior federated learning (FL) methods mainly consider client heterogeneity, we focus on the *Federated Domain Generalization (DG)* task, which introduces train-test heterogeneity in the FL context.Existing evaluations in this field are limited in terms of the scale of the clients and dataset diversity.Thus, we propose a Federated DG benchmark that aim to test the limits of current methods with high client heterogeneity, large numbers of clients, and diverse datasets. Towards this objective, we introduce a novel data partitioning method that allows us to distribute any domain dataset among few or many clients while controlling client heterogeneity. We then introduce and apply our methodology to evaluate $13$ Federated DG methods, which include centralized DG methods adapted to the FL context, FL methods that handle client heterogeneity, and methods designed specifically for Federated DG on $7$ datasets.Our results suggest that, despite some progress, significant performance gaps remain in Federated DG, especially when evaluating with a large number of clients, high client heterogeneity, or more realistic datasets.  Furthermore, our extendable benchmark code will be publicly released to aid in benchmarking future Federated DG approaches.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=wprSv7ichW",
    "arxiv_id": "2307.04942",
    "GitHub": [
      "https://github.com/inouye-lab/FedDG_Benchmark"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17496,
    "title": "Batch normalization is sufficient for universal function approximation in CNNs",
    "authors": [
      "Rebekka Burkholz"
    ],
    "abstract": "Layer normalization, for which Batch Normalization (BN) is a popular choice, is an integral part of many deep learning architectures and contributes significantly to the learning success. We provide a partial explanation for this phenomenon by proving that training normalization layers alone is already sufficient for universal function approximation if the number of available, potentially random features matches or exceeds the weight parameters of the target networks that can be expressed. Our bound on the number of required features does not only improve on a recent result for fully-connected feed-forward architectures but also applies to CNNs with and without residual connections and almost arbitrary activation functions (which include ReLUs). Our explicit construction of a given target network solves a depth-width trade-off that is driven by architectural constraints and can explain why switching off entire neurons can have representational benefits, as has been observed empirically. To validate our theory, we explicitly match target networks that outperform experimentally obtained networks with trained BN parameters by utilizing a sufficient number of random features.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=wOSYMHfENq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18819,
    "title": "The Need for Speed: Pruning Transformers with One Recipe",
    "authors": [
      "Samir Khaki",
      "Konstantinos N Plataniotis"
    ],
    "abstract": "We introduce the $\\textbf{O}$ne-shot $\\textbf{P}$runing $\\textbf{T}$echnique for $\\textbf{I}$nterchangeable $\\textbf{N}$etworks ($\\textbf{OPTIN}$) framework as a tool to increase the efficiency of pre-trained transformer architectures $\\textit{without requiring re-training}$. Recent works have explored improving transformer efficiency, however often incur computationally expensive re-training procedures or depend on architecture-specific characteristics, thus impeding practical wide-scale adoption. To address these shortcomings, the OPTIN framework leverages intermediate feature distillation, capturing the long-range dependencies of model parameters (coined $\\textit{trajectory}$), to produce state-of-the-art results on natural language, image classification, transfer learning, and semantic segmentation tasks $\\textit{without re-training}$. Given a FLOP constraint, the OPTIN framework will compress the network while maintaining competitive accuracy performance and improved throughput. Particularly, we show a $\\leq 2$% accuracy degradation from NLP baselines and a $0.5$% improvement from state-of-the-art methods on image classification at competitive FLOPs reductions. We further demonstrate the generalization of tasks and architecture with comparative performance using Mask2Former for semantic segmentation and cnn-style networks. OPTIN presents one of the first one-shot efficient frameworks for compressing transformer architectures that generalizes well across different class domains, in particular: natural language and image-related tasks, without $\\textit{re-training}$.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=MVmT6uQ3cQ",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19188,
    "title": "Str2Str: A Score-based Framework for Zero-shot Protein Conformation Sampling",
    "authors": [
      "Jiarui Lu",
      "Bozitao Zhong",
      "Zuobai Zhang",
      "Jian Tang"
    ],
    "abstract": "The dynamic nature of proteins is crucial for determining their biological functions and properties, for which Monte Carlo (MC) and molecular dynamics (MD) simulations stand as predominant tools to study such phenomena. By utilizing empirically derived force fields, MC or MD simulations explore the conformational space through numerically evolving the system via Markov chain or Newtonian mechanics. However, the high-energy barrier of the force fields can hamper the exploration of both methods by the rare event, resulting in inadequately sampled ensemble without exhaustive running. Existing learning-based approaches perform direct sampling yet heavily rely on target-specific simulation data for training, which suffers from high data acquisition cost and poor generalizability. Inspired by simulated annealing, we propose Str2Str, a novel structure-to-structure translation framework capable of zero-shot conformation sampling with roto-translation equivariant property. Our method leverages an amortized denoising score matching objective trained on general crystal structures and has no reliance on simulation data during both training and inference. Experimental results across several benchmarking protein systems demonstrate that Str2Str outperforms previous state-of-the-art generative structure prediction models and can be orders of magnitude faster compared with long MD simulations.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=C4BikKsgmK",
    "arxiv_id": "2306.03117",
    "GitHub": [
      "https://github.com/lujiarui/Str2Str"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19439,
    "title": "How to Catch an AI Liar: Lie Detection in Black-Box LLMs by Asking Unrelated Questions",
    "authors": [
      "Lorenzo Pacchiardi",
      "Alex James Chan",
      "S\u00f6ren Mindermann",
      "Ilan Moscovitz",
      "Alexa Yue Pan",
      "Yarin Gal",
      "Owain Evans",
      "Jan M. Brauner"
    ],
    "abstract": "Large language models (LLMs) can \u201clie\u201d, which we define as outputting false statements despite \u201cknowing\u201d the truth in a demonstrable sense. An example is an LLM instructed to spread misinformation. Here, we conduct an initial exploration into the feasibility of lie detection for LLMs. We develop a simple lie detector that requires neither access to the LLM\u2019s activations (black-box) nor ground-truth knowledge of the fact in question. The detector works by asking a predefined set of unrelated follow-up questions after a suspected lie, and feeding the LLM\u2019s yes/no answers into a logistic regression classifier. Despite its simplicity, this lie detector is highly accurate and surprisingly general. When trained on examples from a single setting\u2014prompting GPT-3.5 to lie about factual questions\u2014the detector generalises out-of-distribution to (1) other LLM architectures, (2) LLMs fine-tuned to lie, (3) sycophantic lies, and (4) lies emerging in real-life scenarios such as sales. These results indicate that LLMs have distinctive lie-related behavioural patterns, consistent across architectures and contexts, which could enable general-purpose lie detection",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=567BjxgaTp",
    "arxiv_id": "2309.15840",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17538,
    "title": "Fine-Tuned Language Models Generate Stable Inorganic Materials as Text",
    "authors": [
      "Nate Gruver",
      "Anuroop Sriram",
      "Andrea Madotto",
      "Andrew Gordon Wilson",
      "C. Lawrence Zitnick",
      "Zachary Ward Ulissi"
    ],
    "abstract": "Deep learning models have drastically accelerated materials discovery by accelerating predictive computational simulations like density functional theory (DFT).  Large open computational materials databases such as the Materials Project or OQMD contain O($10^6$) known structures, and it is now straightforward to search those databases for materials with exciting properties. However, these databases are limited to experimentally known materials or candidates discovered in high-throughput computational campaigns. Many state-of-the-art engineering advances in solar photovaltaics, battery electrodes, and catalysts are made by discovering materials with outstanding properties that have not yet been discovered. Generative models are a natural solution to expand families of interest through sampling. While popular methods are typically constructed from variational autoencoders or diffusion models, we propose fine-tuning large language models for generation of stable materials. While unorthodox, fine-tuning large language models on text-encoded atomistic data is simple to implement yet reliable, with around 90\\% of sampled structures obeying physical constraints on atom positions and charges. Using energy of hull calculations from both learned ML potentials and gold-standard DFT calculations, we show that our strongest model (fine-tuned  LLaMA-2 70B) can generate materials predicted to be metastable at about twice the rate (49\\% vs 28\\%) of CDVAE, a competing diffusion model. Because of text prompting's inherent flexibility, our models can simultaneously be used for unconditional generation of stable material, infilling of partial structures and text-conditional generation. Finally, we show that language models' ability to capture key symmetries of crystal structures improves with model scale, suggesting that the biases of pretrained LLMs are surprisingly well-suited for atomistic data.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vN9fpfqoP1",
    "arxiv_id": "2402.04379",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18599,
    "title": "OWL: A Large Language Model for IT Operations",
    "authors": [
      "Hongcheng Guo",
      "Jian Yang",
      "Jiaheng Liu",
      "Liqun Yang",
      "Linzheng Chai",
      "Jiaqi Bai",
      "Junran Peng",
      "Xiaorong Hu",
      "Chao Chen",
      "Dongfeng Zhang",
      "xu Shi",
      "Tieqiao Zheng",
      "liangfan zheng",
      "Bo Zhang",
      "Ke Xu",
      "Zhoujun Li"
    ],
    "abstract": "With the rapid advancement of IT operations, managing and analyzing large data volumes efficiently for practical applications has become increasingly critical. Natural Language Processing (NLP) techniques have demonstrated remarkable capabilities in various tasks, including named entity recognition, machine translation, and dialogue systems. Recently, Large Language Models (LLMs) have achieved significant improvements across various domain-specific areas. However, there is a noticeable gap in the development of specialized Large Language Models (LLMs) tailored for IT operations. In this paper, we introduce the OWL, a large language model trained on our constructed Owl-Instruct with a wide range of IT-related information. Specifically, limited by the maximum input length, we propose the \\textbf{H}omogeneous \\textbf{M}arkov \\textbf{C}ontext \\textbf{E}xtension method (HMCE). The mixture-of-adapter strategy is leveraged to improve the parameter-efficient tuning across different domains or tasks.Further, we evaluate the performance of OWL on the Owl-Bench established by us and open IT-related benchmarks. OWL  demonstrates superior performance results on IT tasks, which outperforms existing models by significant margins. Moreover, we hope that the findings of our work will provide more insights to revolutionize the techniques of IT operations with specialized LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=SZOQ9RKYJu",
    "arxiv_id": "2309.09298",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19437,
    "title": "Image2Sentence based Asymmetrical Zero-shot Composed Image Retrieval",
    "authors": [
      "Yongchao Du",
      "Min Wang",
      "Wengang Zhou",
      "Shuping Hui",
      "Houqiang Li"
    ],
    "abstract": "The task of composed image retrieval (CIR) aims to retrieve images based on the query image and the text describing the users' intent. Existing methods have made great progress with the advanced large vision-language (VL) model in CIR task, however, they generally suffer from two main issues: lack of labeled triplets for model training and difficulty of deployment on resource-restricted environments when deploying the large vision-language model. To tackle the above problems, we propose Image2Sentence based Asymmetric zero-shot composed image retrieval (ISA), which takes advantage of the VL model and only relies on unlabeled images for composition learning. In the framework, we propose a new adaptive token learner that maps an image to a sentence in the word embedding space of VL model.  The sentence adaptively captures discriminative visual information and is further integrated with the text modifier. An asymmetric structure is devised for flexible deployment, in which the lightweight model is adopted for the query side while the large VL model is deployed on the gallery side. The global contrastive distillation and the local alignment regularization are adopted for the alignment between the light model and the VL model for CIR task.  Our experiments demonstrate that the proposed ISA could better cope with the real retrieval scenarios and further improve retrieval accuracy and efficiency.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=5BXAXOpaWu",
    "arxiv_id": "2403.01431",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17747,
    "title": "DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning",
    "authors": [
      "Jing Xiong",
      "Zixuan Li",
      "Chuanyang Zheng",
      "Zhijiang Guo",
      "Yichun Yin",
      "Enze Xie",
      "Zhicheng YANG",
      "Qingxing Cao",
      "Haiming Wang",
      "Xiongwei Han",
      "Jing Tang",
      "Chengming Li",
      "Xiaodan Liang"
    ],
    "abstract": "Recent advances in natural language processing, primarily propelled by Large Language Models (LLMs), have showcased their remarkable capabilities grounded in in-context learning. A promising avenue for guiding LLMs in intricate reasoning tasks involves the utilization of intermediate reasoning steps within the Chain-of-Thought (CoT) paradigm. Nevertheless, the central challenge lies in the effective selection of exemplars for facilitating in-context learning. In this study, we introduce a framework that leverages Dual Queries and Low-rank approximation Re-ranking (DQ-LoRe) to automatically select exemplars for in-context learning. Dual Queries first query LLM to obtain LLM-generated knowledge such as CoT, then query the retriever to obtain the final exemplars via both question and the knowledge. Moreover, for the second query, LoRe employs dimensionality reduction techniques to refine exemplar selection, ensuring close alignment with the input question's knowledge. Through extensive experiments, we demonstrate that DQ-LoRe significantly outperforms prior state-of-the-art methods in the automatic selection of exemplars for GPT-4, enhancing performance from 92.5\\% to 94.2\\%. Our comprehensive analysis further reveals that DQ-LoRe consistently outperforms retrieval-based approaches in terms of both performance and adaptability, especially in scenarios characterized by distribution shifts. DQ-LoRe pushes the boundaries of in-context learning and opens up new avenues for addressing complex reasoning challenges.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qAoxvePSlq",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19435,
    "title": "Physics-Regulated Deep Reinforcement Learning: Invariant Embeddings",
    "authors": [
      "Hongpeng Cao",
      "Yanbing Mao",
      "Lui Sha",
      "Marco Caccamo"
    ],
    "abstract": "This paper proposes the Phy-DRL: a physics-regulated deep reinforcement learning (DRL) framework for safety-critical autonomous systems. The designs of Phy-DRL are based on three invariant-embedding principles: i) residual action policy (i.e., integrating data-driven-DRL action policy and physics-model-based action policy), ii) safety-embedded reward, and iii) physics-model-guided neural network (NN) editing, including link editing and activation editing. Theoretically, the Phy-DRL exhibits 1) mathematically-provable safety guarantee, and 2) strict compliance of critic and actor networks with physics knowledge about the action-value function and action policy.  Finally, we evaluate the Phy-DRL on a cart-pole system and a quadruped robot. The experiments validate our theoretical results and demonstrate that Phy-DRL features guaranteed safety compared to purely data-driven DRL and solely model-based design, while offering remarkably fewer learning parameters, and fast and stable training.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=5Dwqu5urzs",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19434,
    "title": "The Effective Horizon Explains Deep RL Performance in Stochastic Environments",
    "authors": [
      "Cassidy Laidlaw",
      "Banghua Zhu",
      "Stuart Russell",
      "Anca Dragan"
    ],
    "abstract": "Reinforcement learning (RL) theory has largely focused on proving minimax sample complexity bounds. These require strategic exploration algorithms that use relatively limited function classes for representing the policy or value function. Our goal is to explain why deep RL algorithms often perform well in practice, despite using random exploration and much more expressive function classes like neural networks. Our work arrives at an explanation by showing that many stochastic MDPs can be solved by performing only a few steps of value iteration on the random policy\u2019s Q function and then acting greedily. When this is true, we find that it is possible to separate the exploration and learning components of RL, making it much easier to analyze. We introduce a new RL algorithm, SQIRL, that iteratively learns a near-optimal policy by exploring randomly to collect rollouts and then performing a limited number of steps of fitted-Q iteration over those roll- outs. We find that any regression algorithm that satisfies basic in-distribution generalization properties can be used in SQIRL to efficiently solve common MDPs. This can explain why deep RL works with complex function approximators like neural networks, since it is empirically established that neural networks generalize well in-distribution. Furthermore, SQIRL explains why random exploration works well in practice, since we show many environments can be solved by effectively estimating the random policy\u2019s Q-function and then applying zero or a few steps of value iteration. We leverage SQIRL to derive instance-dependent sample complexity bounds for RL that are exponential only in an \u201ceffective horizon\u201d of lookahead\u2014which is typically much smaller than the full horizon\u2014and on the complexity of the class used for function approximation. Empirically, we also find that SQIRL performance strongly correlates with PPO and DQN performance in a variety of stochastic environments, supporting that our theoretical analysis is predictive of practical performance.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=5ES5Hdlbxw",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19433,
    "title": "Weatherproofing Retrieval for Localization with Generative AI and Geometric Consistency",
    "authors": [
      "Yannis Kalantidis",
      "Mert B\u00fclent Sar\u0131y\u0131ld\u0131z",
      "Rafael S. Rezende",
      "Philippe Weinzaepfel",
      "Diane Larlus",
      "Gabriela Csurka"
    ],
    "abstract": "State-of-the-art visual localization approaches generally rely on a first image retrieval step whose role is crucial. Yet, retrieval often struggles when facing varying conditions, due to e.g. weather or time of day, with dramatic consequences on the visual localization accuracy. In this paper, we improve this retrieval step and tailor it to the final localization task. Among the several changes we advocate for, we propose to synthesize variants of the training set images, obtained from generative text-to-image models, in order to automatically expand the training set towards a number of nameable variations that particularly hurt visual localization. After expanding the training set, we propose a training approach that leverages the specificities and the underlying geometry of this mix of real and synthetic images. We experimentally show that those changes translate into large improvements for the most challenging visual localization datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5EniAcsO7f",
    "arxiv_id": "2402.09237",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19432,
    "title": "When Scaling Meets LLM Finetuning: The Effect of Data, Model and Finetuning Method",
    "authors": [
      "Biao Zhang",
      "Zhongtao Liu",
      "Colin Cherry",
      "Orhan Firat"
    ],
    "abstract": "While large language models (LLMs) often adopt finetuning to unlock their capabilities for downstream applications, our understanding on the inductive biases (especially the scaling properties) of different finetuning methods is still limited. To fill this gap, we conduct systematic experiments studying whether and how different scaling factors, including LLM model size, pretraining data size, new finetuning parameter size and finetuning data size, affect the finetuning performance. We consider two types of finetuning \u2013 full-model tuning (FMT) and parameter efficient tuning (PET, including prompt tuning and LoRA), and explore their scaling behaviors in the data-limited regime where the LLM model size substantially outweighs the finetuning data size. Based on two sets of pretrained bilingual LLMs from 1B to 16B and experiments on bilingual machine translation and multilingual summarization benchmarks, we find that 1) LLM finetuning follows a powerbased multiplicative joint scaling law between finetuning data size and each other scaling factor; 2) LLM finetuning benefits more from LLM model scaling than pretraining data scaling, and PET parameter scaling is generally ineffective; and 3) the optimal finetuning method is highly task- and finetuning data-dependent. We hope our findings could shed light on understanding, selecting and developing LLM finetuning methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5HCnKDeTws",
    "arxiv_id": "2402.17193",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19431,
    "title": "An Intuitive Multi-Frequency Feature Representation for SO(3)-Equivariant Networks",
    "authors": [
      "Dongwon Son",
      "Jaehyung Kim",
      "Sanghyeon Son",
      "Beomjoon Kim"
    ],
    "abstract": "The usage of 3D vision algorithms, such as shape reconstruction, remains limited because they require inputs to be at a fixed canonical rotation. Recently, a simple equivariant network, Vector Neuron (VN) has been proposed that can be easily used with the state-of-the-art 3D neural network (NN) architectures. However, its performance is limited because it is designed to use only three-dimensional features, which is insufficient to capture the details present in 3D data. In this paper, we introduce an equivariant feature representation for mapping a 3D point to a high-dimensional feature space. Our feature can discern multiple frequencies present in 3D data, which, as shown by Tancik et al. (2020), is the key to designing an expressive feature for 3D vision tasks. Our representation can be used as an input to VNs, and the results demonstrate that with our feature representation, VN captures more details, overcoming the limitation raised in its original paper.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5JWAOLBxwp",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19430,
    "title": "Implicit Neural Representation Inference for Low-Dimensional Bayesian Deep Learning",
    "authors": [
      "Panagiotis Dimitrakopoulos",
      "Giorgos Sfikas",
      "Christophoros Nikou"
    ],
    "abstract": "Bayesian inference is the standard for providing full predictive distributions with well calibrated uncertainty estimates.However, scaling to a modern, overparameterized deep learning setting typically comes at the cost of severe and restrictive approximations, sacrificing model predictive strength.With our approach, we factor model parameters as a function of deterministic and probabilistic components;the model is solved by combining maximum a posteriori estimation of the former,with inference over a low-dimensional, Implicit Neural Representation of the latter.This results in a solution that combines both predictive accuracy and good calibration,as it entails inducing stochasticity over the full set of model weights while being comparatively cheap to compute.Experimentally, our approach compares favorably to the state of the art,including much more expensive methods as well as less expressive posterior approximations over full network parameters.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5KUiMKRebi",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19429,
    "title": "MMICL: Empowering Vision-language Model with Multi-Modal In-Context Learning",
    "authors": [
      "Haozhe Zhao",
      "Zefan Cai",
      "Shuzheng Si",
      "Xiaojian Ma",
      "Kaikai An",
      "Liang Chen",
      "Zixuan Liu",
      "Sheng Wang",
      "Wenjuan Han",
      "Baobao Chang"
    ],
    "abstract": "Since the resurgence of deep learning, vision-language models (VLMs) enhanced by large language models (LLMs) have grown exponentially in popularity. However, while LLMs can utilize extensive background knowledge and task information with in-context learning, most VLMs still struggle with understanding complex multi-modal prompts with multiple images, making VLMs less effective in downstream vision-language tasks.In this paper, we address the limitation above by 1) introducing MMICL, a new approach to allow the VLM to deal with multi-modal inputs efficiently; 2) proposing a novel context scheme to augment the in-context learning ability of the VLM; 3) constructing the Multi-modal In-Context Learning (MIC) dataset, designed to enhance the VLM's ability to understand complex multi-modal prompts.Our experiments confirm that MMICL achieves new state-of-the-art zero-shot performance on a wide range of general vision-language tasks, especially for complex benchmarks, including MME and MMBench. Our analysis demonstrates that MMICL effectively tackles the challenge of complex multi-modal prompt understanding and emerges the impressive ICL ability. Furthermore, we observe that MMICL successfully alleviates language bias in VLMs, a common issue for VLMs that often leads to hallucination when faced with extensive textual context.Our code, dataset and model are available at github link.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5KojubHBr8",
    "arxiv_id": "2309.07915",
    "GitHub": [
      "https://github.com/PKUnlp-icler/MIC"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19428,
    "title": "Multiscale Positive-Unlabeled Detection of AI-Generated Texts",
    "authors": [
      "Yuchuan Tian",
      "Hanting Chen",
      "Xutao Wang",
      "Zheyuan Bai",
      "QINGHUA ZHANG",
      "Ruifeng Li",
      "Chao Xu",
      "Yunhe Wang"
    ],
    "abstract": "Recent releases of Large Language Models (LLMs), e.g. ChatGPT, are astonishing at generating human-like texts, but they may impact the authenticity of texts. Previous works proposed methods to detect these AI-generated texts, including simple ML classifiers, pretrained-model-based zero-shot methods, and finetuned language classification models. However, mainstream detectors always fail on short texts, like SMSes, Tweets, and reviews. In this paper, a Multiscale Positive-Unlabeled (MPU) training framework is proposed to address the difficulty of short-text detection without sacrificing long-texts. Firstly, we acknowledge the human-resemblance property of short machine texts, and rephrase AI text detection as a partial Positive-Unlabeled (PU) problem by regarding these short machine texts as partially \"unlabeled\". Then in this PU context, we propose the length-sensitive Multiscale PU Loss, where a recurrent model in abstraction is used to estimate positive priors of scale-variant corpora. Additionally, we introduce a Text Multiscaling module to enrich training corpora. Experiments show that our MPU method augments detection performance on long AI-generated texts, and significantly improves short-text detection of language model detectors. Language Models trained with MPU could outcompete existing detectors on various short-text and long-text detection benchmarks. The codes are available at https://github.com/mindspore-lab/mindone/tree/master/examples/detect_chatgpt and https://github.com/YuchuanTian/AIGC_text_detector.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=5Lp6qU9hzV",
    "arxiv_id": "2305.18149",
    "GitHub": [
      "https://github.com/YuchuanTian/AIGC_text_detector"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19137,
    "title": "Constrained Decoding for Cross-lingual Label Projection",
    "authors": [
      "Duong Minh Le",
      "Yang Chen",
      "Alan Ritter",
      "Wei Xu"
    ],
    "abstract": "Zero-shot cross-lingual transfer utilizing multilingual LLMs has become a popular learning paradigm for low-resource languages with no labeled training data. However, for NLP tasks that involve fine-grained predictions on words and phrases, the performance of zero-shot cross-lingual transfer learning lags far behind supervised fine-tuning methods. Therefore, it is common to exploit translation and label projection to further improve the performance by (1) translating training data that is available in a high-resource language (e.g., English) together with the gold labels into low-resource languages, and/or (2) translating test data in low-resource languages to a high-source language to run inference on, then projecting the predicted span-level labels back onto the original test data. However, state-of-the-art marker-based label projection methods suffer from translation quality degradation due to the extra label markers injected in the input to the translation model. In this work, we explore a new direction that leverages constrained decoding for label projection to overcome the aforementioned issues. Our new method not only can preserve the quality of translated texts but also has the versatility of being applicable to both translating training and translating test data strategies. This versatility is crucial as our experiments reveal that translating test data can lead to a considerable boost in performance compared to translating only training data. We evaluate on two cross-lingual transfer tasks, namely Named Entity Recognition and Event Argument Extraction, spanning 20 languages. The results demonstrate that our approach outperforms the state-of-the-art marker-based method by a large margin and also shows better performance than other label projection methods that rely on external word alignment.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=DayPQKXaQk",
    "arxiv_id": "2402.03131",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18168,
    "title": "Tensor Trust: Interpretable Prompt Injection Attacks from an Online Game",
    "authors": [
      "Sam Toyer",
      "Olivia Watkins",
      "Ethan Adrian Mendes",
      "Justin Svegliato",
      "Luke Bailey",
      "Tiffany Wang",
      "Isaac Ong",
      "Karim Elmaaroufi",
      "Pieter Abbeel",
      "Trevor Darrell",
      "Alan Ritter",
      "Stuart Russell"
    ],
    "abstract": "We present a dataset of over 100,000 prompt injection attacks and 30,000 anti-injection \"defense\" prompts created by players of an online game, Tensor Trust. To the best of our knowledge, it is the largest dataset of human-generated adversarial examples for instruction-following LLMs. Using the Tensor Trust dataset, we create benchmarks for resistance to two types of prompt injection (which we refer to as prompt extraction and prompt hijacking) as well as a benchmark for detecting when an LLM has leaked sensitive information from the prompt. We also show that many attacks in our dataset have an intuitive structure that sheds light on the weaknesses of these models. The full Tensor Trust dataset and source code are available at `[URL removed for review]`.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=fsW7wJGLBd",
    "arxiv_id": "2311.01011",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19427,
    "title": "PandaLM: An Automatic Evaluation Benchmark for LLM Instruction Tuning Optimization",
    "authors": [
      "Yidong Wang",
      "Zhuohao Yu",
      "Wenjin Yao",
      "Zhengran Zeng",
      "Linyi Yang",
      "Cunxiang Wang",
      "Hao Chen",
      "Chaoya Jiang",
      "Rui Xie",
      "Jindong Wang",
      "Xing Xie",
      "Wei Ye",
      "Shikun Zhang",
      "Yue Zhang"
    ],
    "abstract": "Instruction tuning large language models (LLMs) remains a challenging task, owing to the complexity of hyperparameter selection and the difficulty involved in evaluating the tuned models. To determine the optimal hyperparameters, an automatic, robust, and reliable evaluation benchmark is essential. However, establishing such a benchmark is not a trivial task due to the challenges associated with evaluation accuracy and privacy protection. In response to these challenges, we introduce a judge large language model, named PandaLM, which is trained to distinguish the superior model given several LLMs. PandaLM's focus extends beyond just the objective correctness of responses, which is the main focus of traditional evaluation datasets. It addresses vital subjective factors such as relative conciseness, clarity, adherence to instructions, comprehensiveness, and formality. To ensure the reliability of PandaLM, we collect a diverse human-annotated test dataset, where all contexts are generated by humans and labels are aligned with human preferences. Our findings reveal that PandaLM-7B offers a performance comparable to both GPT-3.5 and GPT-4. Impressively, PandaLM-70B surpasses their performance. PandaLM enables the evaluation of LLM to be fairer but with less cost, evidenced by significant improvements achieved by models tuned through PandaLM compared to their counterparts trained with default Alpaca's hyperparameters. In addition, PandaLM does not depend on API-based evaluations, thus avoiding potential data leakage.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5Nn2BLV7SB",
    "arxiv_id": "2306.05087",
    "GitHub": [
      "https://github.com/WeOpenML/PandaLM"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17746,
    "title": "Boosting of Thoughts: Trial-and-Error Problem Solving with Large Language Models",
    "authors": [
      "Sijia Chen",
      "Baochun Li",
      "Di Niu"
    ],
    "abstract": "The reasoning performance of Large Language Models (LLMs) on a wide range of problems critically relies on chain-of-thought prompting, which involves providing a few chain of thought demonstrations as exemplars in prompts. Recent work, e.g., Tree of Thoughts, has pointed out the importance of exploration and self-evaluation in reasoning step selection for complex problem solving. In this paper, we present Boosting of Thoughts (BoT), an automated prompting framework for problem solving with LLMs by iteratively exploring and self-evaluating many trees of thoughts in order to acquire an ensemble of trial-and-error reasoning experiences, which will serve as a new form of prompting to solve the complex problem. Starting from a simple prompt without requiring examples, BoT iteratively explores and evaluates a large collection of reasoning steps, and more importantly, uses error analysis obtained from the LLM on them to explicitly revise prompting, which in turn enhances reasoning step generation, until a final answer is attained. Our experiments with GPT-4 and Llama2 across extensive complex mathematical problems demonstrate that BoT consistently achieves higher or comparable problem-solving rates than other advanced prompting approaches.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=qBL04XXex6",
    "arxiv_id": "2402.11140",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19425,
    "title": "Learning Adaptive Multiresolution Transforms via Meta-Framelet-based Graph Convolutional Network",
    "authors": [
      "Tianze Luo",
      "Zhanfeng Mo",
      "Sinno Jialin Pan"
    ],
    "abstract": "Graph Neural Networks are popular tools in graph representation learning that capture the graph structural properties. However, most GNNs employ single-resolution graph feature extraction, thereby failing to capture micro-level local patterns (high resolution) and macro-level graph cluster and community patterns (low resolution) simultaneously. Many multiresolution methods have been developed to capture graph patterns at multiple scales, but most of them depend on predefined and handcrafted multiresolution transforms that remain fixed throughout the training process once formulated. Due to variations in graph instances and distributions, fixed handcrafted transforms can not effectively tailor multiresolution representations to each graph instance. To acquire multiresolution representation suited to different graph instances and distributions, we introduce the Multiresolution Meta-Framelet-based Graph Convolutional Network (MM-FGCN), facilitating comprehensive and adaptive multiresolution analysis across diverse graphs. Extensive experiments demonstrate that our MM-FGCN achieves SOTA performance on various graph learning tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5RielfrDkP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19424,
    "title": "ControlVideo: Training-free Controllable Text-to-video Generation",
    "authors": [
      "Yabo Zhang",
      "Yuxiang Wei",
      "Dongsheng Jiang",
      "XIAOPENG ZHANG",
      "Wangmeng Zuo",
      "Qi Tian"
    ],
    "abstract": "Text-driven diffusion models have unlocked unprecedented abilities in image generation, whereas their video counterpart lags behind due to the excessive training cost.To avert the training burden, we propose a training-free ControlVideo to produce high-quality videos based on the provided text prompts and motion sequences.Specifically, ControlVideo adapts a pre-trained text-to-image model (i.e., ControlNet) for controllable text-to-video generation.To generate continuous videos without flicker effect, we propose an interleaved-frame smoother to smooth the intermediate frames.In particular, interleaved-frame smoother splits the whole videos with successive three-frame clips, and stabilizes each clip by updating the middle frame with the interpolation among other two frames in latent space.Furthermore, a fully cross-frame interaction mechanism have been exploited to further enhance the frame consistency, while a hierarchical sampler is employed to produce long videos efficiently.Extensive experiments demonstrate that our ControlVideo outperforms the state-of-the-arts both quantitatively and qualitatively. It is worthy noting that, thanks to the efficient designs, ControlVideo could generate both short and long videos within several minutes using one NVIDIA 2080Ti. All videos are shown in [this anonymous link](https://controlvideov1.github.io).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5a79AqFr0c",
    "arxiv_id": "2305.13077",
    "GitHub": [
      "https://github.com/YBYBZhang/ControlVideo"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19423,
    "title": "Certified Adversarial Robustness for Rate Encoded Spiking Neural Networks",
    "authors": [
      "Bhaskar Mukhoty",
      "Hilal AlQuabeh",
      "Giulia De Masi",
      "Huan Xiong",
      "Bin Gu"
    ],
    "abstract": "The spiking neural networks are inspired by the biological neurons that employ binary spikes to propagate information in the neural network. It has garnered considerable attention as the next-generation neural network, as the spiking activity simplifies the computation burden of the network to a large extent and is known for its low energy deployment enabled by specialized neuromorphic hardware. One popular technique to feed a static image to such a network is rate encoding, where each pixel is encoded into random binary spikes, following a Bernoulli distribution that uses the pixel intensity as bias. By establishing a novel connection between rate-encoding and randomized smoothing, we give the first provable robustness guarantee for spiking neural networks against adversarial perturbation of inputs bounded under $l_1$-norm. We introduce novel adversarial training algorithms for rate-encoded models that significantly improve the state-of-the-art empirical robust accuracy result. Experimental validation of the method is performed across various static image datasets, including CIFAR-10, CIFAR-100 and ImageNet-100.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5bNYf0CqxY",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19421,
    "title": "Contextual Bandits with Online Neural Regression",
    "authors": [
      "Rohan Deb",
      "Yikun Ban",
      "Shiliang Zuo",
      "Jingrui He",
      "Arindam Banerjee"
    ],
    "abstract": "Recent works have shown a reduction from contextual bandits to online regression under a realizability assumption \\citep{foster2020beyond,foster2021efficient}. In this work, we investigate the use of neural networks for such online regression and associated Neural Contextual Bandits (NeuCBs). Using existing results for wide networks, one can readily show a  ${\\mathcal{O}}(\\sqrt{T})$ regret for online regression with square loss, which via the reduction implies a ${\\mathcal{O}}(\\sqrt{K} T^{3/4})$ regret for NeuCBs. Departing from this standard approach, we first show a $\\mathcal{O}(\\log T)$ regret for online regression with almost convex losses that satisfy QG (Quadratic Growth) condition, a generalization of the PL (Polyak-\\L ojasiewicz) condition, and that have a unique minima. Although not directly applicable to wide networks since they do not have unique minima, we show that adding a suitable small random perturbation to the network predictions surprisingly makes the loss satisfy QG with unique minima. Based on such a perturbed prediction, we show a ${\\mathcal{O}}(\\log T)$ regret for online regression with both squared loss and KL loss, and subsequently convert these respectively to $\\tilde{\\mathcal{O}}(\\sqrt{KT})$ and $\\tilde{\\mathcal{O}}(\\sqrt{KL^*} + K)$ regret for NeuCB, where $L^*$ is the loss of the best policy. Separately, we also show that existing regret bounds for NeuCBs are $\\Omega(T)$ or assume i.i.d. contexts, unlike this work. Finally, our experimental results on various datasets demonstrate that our algorithms, especially the one based on KL loss, persistently outperform existing algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5ep85sakT3",
    "arxiv_id": "2312.07145",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19793,
    "title": "LEGO-Prover: Neural Theorem Proving with Growing Libraries",
    "authors": [
      "Haiming Wang",
      "Huajian Xin",
      "Chuanyang Zheng",
      "Zhengying Liu",
      "Qingxing Cao",
      "Yinya Huang",
      "Jing Xiong",
      "Han Shi",
      "Enze Xie",
      "Jian Yin",
      "Zhenguo Li",
      "Xiaodan Liang"
    ],
    "abstract": "Despite the success of large language models (LLMs), the task of theorem proving still remains one of the hardest reasoning tasks that is far from being fully solved. Prior methods using language models have demonstrated promising results, but they still struggle to prove even middle school level theorems. One common limitation of these methods is that they assume a fixed theorem library during the whole theorem proving process. However, as we all know, creating new useful theorems or even new theories is not only helpful but crucial and necessary for advancing mathematics and proving harder and deeper results.In this work, we present LEGO-Prover, which employs a growing skill library containing verified lemmas as skills to augment the capability of LLMs used in theorem proving. By constructing the proof modularly, LEGO-Prover enables LLMs to utilize existing skills retrieved from the library and to create new skills during the proving process. These skills are further evolved (by prompting an LLM) to enrich the library on another scale. Modular and reusable skills are constantly added to the library to enable tackling increasingly intricate mathematical problems. Moreover, the learned library further bridges the gap between human proofs and formal proofs by making it easier to impute missing steps. LEGO-Prover advances the state-of-the-art pass rate on miniF2F-valid (48.0\\% to 57.0\\%) and miniF2F-test (45.5\\% to 50.0\\%). During the proving process, LEGO-Prover also generates over 20,000 skills (theorems/lemmas) and adds them to the growing library. Our ablation study indicates that these newly added skills are indeed helpful for proving theorems, resulting in a 4.9\\% improvement in success rate",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=3f5PALef5B",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19418,
    "title": "INViTE: INterpret and Control Vision-Language Models with Text Explanations",
    "authors": [
      "Haozhe Chen",
      "Junfeng Yang",
      "Carl Vondrick",
      "Chengzhi Mao"
    ],
    "abstract": "Large-scale pre-trained vision foundation models, such as CLIP, have become de facto backbones for various vision tasks. However, due to their black-box nature, understanding the underlying rules behind these models\u2019 predictions and controlling model behaviors have remained open challenges. We present INViTE: a framework for INterpreting Vision Transformer\u2019s latent tokens with Text Explanations. Given a latent token, INViTE retains its semantic information to the final layer using transformer\u2019s local operations and retrieves the closest text for explanation. INViTE enables understanding of model visual reasoning procedure without needing additional model training or data collection. Based on the obtained interpretations, INViTE allows for model editing that controls model reasoning behaviors and improves model robustness against biases and spurious correlations. Our code is available at https://github.com/tonychenxyz/vit-interpret.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5iENGLEJKG",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19417,
    "title": "Some Intriguing Aspects about Lipschitz Continuity of Neural Networks",
    "authors": [
      "Grigory Khromov",
      "Sidak Pal Singh"
    ],
    "abstract": "Lipschitz continuity is a crucial functional property of any predictive model, that naturally governs its robustness, generalisation, as well as adversarial vulnerability. Contrary to other works that focus on obtaining tighter bounds and developing different practical strategies to enforce certain Lipschitz properties, we aim to thoroughly examine and characterise the Lipschitz behaviour of Neural Networks. Thus, we carry out an empirical investigation in a range of different settings (namely, architectures, datasets, label noise, and more) by exhausting the limits of the simplest and the most general lower and upper bounds. As a highlight of this investigation, we showcase a remarkable fidelity of the lower Lipschitz bound, identify a striking Double Descent trend in both upper and lower bounds to the Lipschitz and explain the intriguing effects of label noise on function smoothness and generalisation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5jWsW08zUh",
    "arxiv_id": "2302.10886",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17533,
    "title": "Provably Efficient Iterated CVaR Reinforcement Learning with Function Approximation and Human Feedback",
    "authors": [
      "Yu Chen",
      "Yihan Du",
      "Pihe Hu",
      "Siwei Wang",
      "Desheng Wu",
      "Longbo Huang"
    ],
    "abstract": "Risk-sensitive reinforcement learning (RL) aims to optimize policies that balance the expected reward and risk. In this paper, we present a novel risk-sensitive RL framework that employs an Iterated Conditional Value-at-Risk (CVaR) objective under both linear and general function approximations, enriched by human feedback. These new formulations provide a principled way to guarantee safety in each decision making step throughout the control process. Moreover, integrating human feedback into risk-sensitive RL framework bridges the gap between algorithmic decision-making and human participation, allowing us to also guarantee safety for human-in-the-loop systems. We propose provably sample-efficient algorithms for this Iterated CVaR RL and provide rigorous theoretical analysis. Furthermore, we establish a matching lower bound to corroborate the optimality of our algorithms in a linear context.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=vW1SkPl4kp",
    "arxiv_id": "2307.02842",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19275,
    "title": "Semantic Flow: Learning Semantic Fields of Dynamic Scenes from Monocular Videos",
    "authors": [
      "Fengrui Tian",
      "Yueqi Duan",
      "Angtian Wang",
      "Jianfei Guo",
      "Shaoyi Du"
    ],
    "abstract": "In this work, we pioneer Semantic Flow, a neural semantic representation of dynamic scenes from monocular videos. In contrast to previous NeRF methods that reconstruct dynamic scenes from the colors and volume densities of individual points, Semantic Flow learns semantics from continuous flows that contain rich 3D motion information. As there is 2D-to-3D ambiguity problem in the viewing direction when extracting 3D flow features from 2D video frames, we consider the volume densities as opacity priors that describe the contributions of flow features to the semantics on the frames. More specifically, we first learn a flow network to predict flows in the dynamic scene, and propose a flow feature aggregation module to extract flow features from video frames. Then, we propose a flow attention module to extract motion information from flow features, which is followed by a semantic network to output semantic logits of flows. We integrate the logits withvolume densities in the viewing direction to supervise the flow features with semantic labels on video frames. Experimental results show that our model is able to learn from multiple dynamic scenes and supports a series of new tasks such as instance-level scene editing, semantic completions, dynamic scene tracking and semantic adaption on novel scenes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=A2mRcRyGdl",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19350,
    "title": "Proper Laplacian Representation Learning",
    "authors": [
      "Diego Gomez",
      "Michael Bowling",
      "Marlos C. Machado"
    ],
    "abstract": "The ability to learn good representations of states is essential for solving large reinforcement learning problems, where exploration, generalization, and transfer are particularly challenging. The Laplacian representation is a promising approach to address these problems, by inducing intrinsic rewards for temporally-extended action discovery and reward shaping, and informative state encoding. To obtain the Laplacian representation one needs to compute the eigensystem of the graph Laplacian, which is often approximated through optimization objectives compatible with deep learning techniques. These approximations, however, depend on hyperparameters that are impossible to tune efficiently, converge to arbitrary rotations of the desired eigenvectors, and are unable to accurately recover the corresponding eigenvalues. In this paper we introduce a theoretically sound objective and corresponding optimization algorithm for approximating the Laplacian representation. Our approach naturally recovers both the true eigenvectors and eigenvalues while eliminating the hyperparameter dependence of previous approximations. We provide theoretical guarantees of our method and we also show that those results translate empirically into robust learning across multiple environments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=7gLfQT52Nn",
    "arxiv_id": "2310.10833",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19415,
    "title": "Time-Efficient Reinforcement Learning with Stochastic Stateful Policies",
    "authors": [
      "Firas Al-Hafez",
      "Guoping Zhao",
      "Jan Peters",
      "Davide Tateo"
    ],
    "abstract": "Stateful policies play an important role in reinforcement learning, such as handling partially observable environments, enhancing robustness, or imposing an inductive bias directly into the policy structure. The conventional method for training stateful policies is Backpropagation Through Time (BPTT), which comes with significant drawbacks, such as slow training due to sequential gradient propagation and the occurrence of vanishing or exploding gradients. The gradient is often truncated to address these issues, resulting in a biased policy update. We present a novel approach for training stateful policies by decomposing the latter into a stochastic internal state kernel and a stateless policy, jointly optimized by following the stateful policy gradient. We introduce different versions of the stateful policy gradient theorem, enabling us to easily instantiate stateful variants of popular reinforcement learning and imitation learning algorithms. Furthermore, we provide a theoretical analysis of our new gradient estimator and compare it with BPTT. We evaluate our approach on complex continuous control tasks, e.g. humanoid locomotion, and demonstrate that our gradient estimator scales effectively with task complexity while offering a faster and simpler alternative to BPTT.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5liV2xUdJL",
    "arxiv_id": "2311.04082",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18873,
    "title": "Massive Editing for Large Language Models via Meta Learning",
    "authors": [
      "Chenmien Tan",
      "Ge Zhang",
      "Jie Fu"
    ],
    "abstract": "While large language models (LLMs) have enabled learning knowledge from the pre-training corpora, the acquired knowledge may be fundamentally incorrect or outdated over time, which necessitates rectifying the knowledge of the language model (LM) after the training. A promising approach involves employing a hyper-network to generate parameter shift, whereas existing hyper-networks suffer from inferior scalability in synchronous editing operation amount (Hase et al., 2023b; Huang et al., 2023). For instance, Mitchell et al. (2022) mimics gradient accumulation to sum the parameter shifts together, which lacks statistical significance and is prone to cancellation effect. To mitigate the problem, we propose the MAssive Language Model Editing Network (MALMEN), which formulates the parameter shift aggregation as the least square problem, subsequently updating the LM parameter using the normal equation. To accommodate editing multiple facts simultaneously with limited memory budgets, we separate the computation on the hyper-network and LM, enabling arbitrary batch size on both neural networks. Our method is evaluated by editing up to thousands of facts on LMs with different architectures, i.e., BERT-base, GPT-2, and GPT-J (6B), across various knowledge-intensive NLP tasks, i.e., closed book fact-checking and question answering. Remarkably, MALMEN is capable of editing hundreds of times more facts than MEND (Mitchell et al., 2022) with the identical hyper-network architecture and outperforms editor specifically designed for GPT, i.e., MEMIT (Meng et al., 2023).",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=L6L1CJQ2PE",
    "arxiv_id": "2311.04661",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19414,
    "title": "Linear Log-Normal Attention with Unbiased Concentration",
    "authors": [
      "Yury Nahshan",
      "Joseph Kampeas",
      "Emir Haleva"
    ],
    "abstract": "Transformer models have achieved remarkable results in a wide range of applications. However, their scalability is hampered by the quadratic time and memory complexity of the self-attention mechanism concerning the sequence length. This limitation poses a substantial obstacle when dealing with long documents or high-resolution images. In this work, we study the self-attention mechanism by analyzing the distribution of the attention matrix and its concentration ability. Furthermore, we propose instruments to measure these quantities and introduce a novel self-attention mechanism, Linear Log-Normal Attention, designed to emulate the distribution and concentration behavior of the original self-attention. Our experimental results on popular natural language benchmarks reveal that our proposed Linear Log-Normal Attention outperforms other linearized attention alternatives, offering a promising avenue for enhancing the scalability of transformer models. Our code is available in supplementary materials.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5nM2AHzqUj",
    "arxiv_id": "2311.13541",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19413,
    "title": "Goodhart's Law in Reinforcement Learning",
    "authors": [
      "Jacek Karwowski",
      "Oliver Hayman",
      "Xingjian Bai",
      "Klaus Kiendlhofer",
      "Charlie Griffin",
      "Joar Max Viktor Skalse"
    ],
    "abstract": "Implementing a reward function that perfectly captures a complex task in the real world is impractical. As a result, it is often appropriate to think of the reward function as a *proxy* for the true objective rather than as its definition. We study this phenomenon through the lens of *Goodhart\u2019s law*, which predicts that increasing optimisation of an imperfect proxy beyond some critical point decreases performance on the true objective. First, we propose a way to *quantify* the magnitude of this effect and *show empirically* that optimising an imperfect proxy reward often leads to the behaviour predicted by Goodhart\u2019s law for a wide range of environments and reward functions. We then provide a *geometric explanation* for why Goodhart's law occurs in Markov decision processes. We use these theoretical insights to propose an *optimal early stopping method* that provably avoids the aforementioned pitfall and derive theoretical *regret bounds* for this method. Moreover, we derive a training method that maximises worst-case reward, for the setting where there is uncertainty about the true reward function. Finally, we evaluate our early stopping method experimentally. Our results support a foundation for a theoretically-principled study of reinforcement learning under reward misspecification.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5o9G4XF1LI",
    "arxiv_id": "2310.09144",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19412,
    "title": "Whittle Index with Multiple Actions and State Constraint for Inventory Management",
    "authors": [
      "Chuheng Zhang",
      "Xiangsen Wang",
      "Wei Jiang",
      "Xianliang Yang",
      "Siwei Wang",
      "Lei Song",
      "Jiang Bian"
    ],
    "abstract": "Whittle index is a heuristic tool that leads to good performance for the restless bandits problem. In this paper, we extend Whittle index to a new multi-agent reinforcement learning (MARL) setting with multiple discrete actions and a possibly changing constraint on the state space, resulting in WIMS (Whittle Index with Multiple actions and State constraint). This setting is common for inventory management where each agent chooses a replenishing quantity level for the corresponding stock-keeping-unit (SKU) such that the total profit is maximized while the total inventory does not exceed a certain limit. Accordingly, we propose a deep MARL algorithm based on WIMS for inventory management. Empirically, our algorithm is evaluated on real large-scale inventory management problems with up to 2307 SKUs and outperforms operation-research-based methods and baseline MARL algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5sixirvG0I",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19033,
    "title": "The Reversal Curse: LLMs trained on \u201cA is B\u201d fail to learn \u201cB is A\u201d",
    "authors": [
      "Lukas Berglund",
      "Meg Tong",
      "Maximilian Kaufmann",
      "Mikita Balesni",
      "Asa Cooper Stickland",
      "Tomasz Korbak",
      "Owain Evans"
    ],
    "abstract": "We expose a surprising failure of generalization in auto-regressive large language models (LLMs). If a model is trained on a sentence of the form \"*A is B*\", it will not automatically generalize to the reverse direction \"*B is A*\". This is the **Reversal Curse**. For instance, if a model is trained on \"Olaf Scholz was the ninth Chancellor of Germany\", it will not automatically be able to answer the question, \"Who was the ninth Chancellor of Germany?\". Moreover, the likelihood of the correct answer (\"Olaf Scholz\") will not be higher than for a random name. Thus, models exhibit a basic failure of logical deduction and do not generalize a prevalent pattern in their training set (i.e. if \"*A is B*\" occurs, \"*B is A*\" is more likely to occur). We provide evidence for the Reversal Curse by finetuning GPT-3 and Llama-1 on fictitious statements such as \"Uriah Hawthorne is the composer of *Abyssal Melodies*\" and showing that they fail to correctly answer \"Who composed *Abyssal Melodies?*\". The Reversal Curse is robust across model sizes and model families and is not alleviated by data augmentation. We also evaluate ChatGPT (GPT-3.5 and GPT-4) on questions about real-world celebrities, such as \"Who is Tom Cruise's mother? [A: Mary Lee Pfeiffer]\" and the reverse \"Who is Mary Lee Pfeiffer's son?\". GPT-4 correctly answers questions like the former 79% of the time, compared to 33% for the latter. This shows a failure of logical deduction that we hypothesize is caused by the Reversal Curse.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=GPKTIktA0k",
    "arxiv_id": "2309.12288",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19411,
    "title": "Robust Angular Synchronization via Directed Graph Neural Networks",
    "authors": [
      "Yixuan He",
      "Gesine Reinert",
      "David Wipf",
      "Mihai Cucuringu"
    ],
    "abstract": "The angular synchronization problem aims to accurately estimate (up to a constant additive phase) a set of unknown angles $\\theta_1, \\dots, \\theta_n\\in[0, 2\\pi)$ from $m$ noisy measurements of their offsets $\\theta_i-\\theta_j$ mod $2\\pi.$ Applications include, for example, sensor network localization, phase retrieval, and distributed clock synchronization. An extension of the problem to the heterogeneous setting (dubbed $k$-synchronization) is to estimate $k$ groups of angles simultaneously, given noisy observations (with unknown group assignment) from each group. Existing methods for angular synchronization usually perform poorly in high-noise regimes, which are common in applications. In this paper, we leverage neural networks for the angular synchronization problem, and its heterogeneous extension, by proposing GNNSync, a theoretically-grounded end-to-end trainable framework using directed graph neural networks. In addition, new loss functions are devised to encode synchronization objectives. Experimental results on extensive data sets demonstrate that GNNSync attains competitive, and often superior, performance against a comprehensive set of baselines for the angular synchronization problem and its extension, validating the robustness of GNNSync even at high noise levels.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5sjxMwWmk8",
    "arxiv_id": "2310.05842",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19410,
    "title": "Pose Modulated Avatars from Video",
    "authors": [
      "Chunjin Song",
      "Bastian Wandt",
      "Helge Rhodin"
    ],
    "abstract": "It is now possible to reconstruct dynamic human motion and shape from a sparse set of cameras using Neural Radiance Fields (NeRF) driven by an underlying skeleton. However, a challenge remains to model the deformation of cloth and skin in relation to skeleton pose. Unlike existing avatar models that are learned implicitly or rely on a proxy surface, our approach is motivated by the observation that different poses necessitate unique frequency assignments. Neglecting this distinction yields noisy artifacts in smooth areas or blurs fine-grained texture and shape details in sharp regions. We develop a two-branch neural network that is adaptive and explicit in the frequency domain. The first branch is a graph neural network that models correlations among body parts locally, taking skeleton pose as input. The second branch combines these correlation features to a set of global frequencies and then modulates the feature encoding. Our experiments demonstrate that our network outperforms state-of-the-art methods in terms of preserving details and generalization capabilities. Our code is available at https://github.com/ChunjinSong/PM-Avatars.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5t44vPlv9x",
    "arxiv_id": "2308.11951",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18875,
    "title": "Batch Calibration: Rethinking Calibration for In-Context Learning and Prompt Engineering",
    "authors": [
      "Han Zhou",
      "Xingchen Wan",
      "Lev Proleev",
      "Diana Mincu",
      "Jilin Chen",
      "Katherine A Heller",
      "Subhrajit Roy"
    ],
    "abstract": "Prompting and in-context learning (ICL) have become efficient learning paradigms for large language models (LLMs). However, LLMs suffer from prompt brittleness and various bias factors in the prompt, including but not limited to the formatting, the choice verbalizers, and the ICL examples. To address this problem that results in unexpected performance degradation, calibration methods have been developed to mitigate the effects of these biases while recovering LLM performance. In this work, we first conduct a systematic analysis of the existing calibration methods, where we both provide a unified view and reveal the failure cases. Inspired by these analyses, we propose Batch Calibration (BC), a simple yet intuitive method that controls the contextual bias from the batched input, unifies various prior approaches and effectively addresses the aforementioned issues. BC is zero-shot, inference-only, and incurs negligible additional costs. In the few-shot setup, we further extend BC to allow it to learn the contextual bias from labeled data. We validate the effectiveness of BC with PaLM 2-(S, M, L) and CLIP models and demonstrate state-of-the-art performance over previous calibration baselines across more than 10 natural language understanding and image classification tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=L3FHMoKZcS",
    "arxiv_id": "2309.17249",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19408,
    "title": "Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models",
    "authors": [
      "Thomas P Zollo",
      "Todd Morrill",
      "Zhun Deng",
      "Jake Snell",
      "Toniann Pitassi",
      "Richard Zemel"
    ],
    "abstract": "With the explosion of the zero-shot capabilities of (and thus interest in) pre-trained large language models, there has come accompanying interest in how best to prompt a language model to perform a given task. While it may be tempting to choose a prompt based on empirical results on a validation set, this can lead to a deployment where an unexpectedly high loss occurs. To mitigate this prospect, we propose a lightweight framework, Prompt Risk Control, for selecting a prompt based on rigorous upper bounds on families of informative risk measures. We provide and compare different methods for producing bounds on a diverse set of risk metrics like mean, CVaR, and the Gini coefficient of the loss distribution. In addition, we extend the underlying statistical bounding techniques to accommodate the possibility of distribution shifts in deployment. Extensive experiments on high-impact applications like chatbots, medical question answering, and news summarization highlight why such a framework is necessary to reduce exposure to the worst outcomes.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5tGGWOijvq",
    "arxiv_id": "2311.13628",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19407,
    "title": "Scale-Adaptive Diffusion Model for Complex Sketch Synthesis",
    "authors": [
      "Jijin Hu",
      "Ke Li",
      "Yonggang Qi",
      "Yi-Zhe Song"
    ],
    "abstract": "While diffusion models have revolutionized generative AI, their application to human sketch generation, especially in the creation of complex yet concise and recognizable sketches, remains largely unexplored. Existing efforts have primarily focused on vector-based sketches, limiting their ability to handle intricate sketch data. This paper introduces an innovative extension of diffusion models to pixellevel sketch generation, addressing the challenge of dynamically optimizing the guidance scale for classifier-guided diffusion. Our approach achieves a delicate balance between recognizability and complexity in generated sketches through scale-adaptive classifier-guided diffusion models, a scaling indicator, and the concept of a residual sketch. We also propose a three-phase sampling strategy to enhance sketch diversity and quality. Experiments on the QuickDraw dataset showcase the potential of diffusion models to push the boundaries of sketch generation, particularly in complex scenarios unattainable by vector-based methods.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=5xadJmgwix",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19406,
    "title": "NeurRev: Train Better Sparse Neural Network Practically via Neuron Revitalization",
    "authors": [
      "Gen Li",
      "Lu Yin",
      "Jie Ji",
      "Wei Niu",
      "Minghai Qin",
      "Bin Ren",
      "Linke Guo",
      "Shiwei Liu",
      "Xiaolong Ma"
    ],
    "abstract": "Dynamic Sparse Training (DST) employs a greedy search mechanism to identify an optimal sparse subnetwork by periodically pruning and growing network connections during training. To guarantee effectiveness, DST algorithms rely on high search frequency, which consequently, requires large learning rate and batch size to enforce stable neuron learning. Such settings demand extreme memory consumption, as well as generating significant system overheads that limit the wide deployment of deep learning-based applications on resource-constraint platforms. To reconcile such, we propose $\\underline{Neur}$on $\\underline{Rev}$italization framework for DST (NeurRev), based on an innovative finding that dormant neurons exist with the presence of weight sparsity, and cannot be revitalized (i.e., activated for learning) even with high sparse mask search frequency. These dormant neurons produce a large quantity of zeros during training, which contribute relatively little to the outputs of succeeding layers or to the final results. Different from most existing DST algorithms that spare no effort designing weight growing criteria, NeurRev focuses on optimizing the long-neglected pruning part, which awakes dormant neurons by pruning and incurs no additional computation costs. As such, NeurRev advances more effective neuron learning, which not only achieves outperforming accuracy in a variety of networks and datasets, but also promoting a low-cost dynamism at system-level. Systematical evaluations on training speed and system overhead are conducted on the mobile devices, where the proposed NeurRev framework consistently outperforms representative state-of-the-arts. Code will be released.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=60lNoatp7u",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19405,
    "title": "In-Context Learning Dynamics with Random Binary Sequences",
    "authors": [
      "Eric J Bigelow",
      "Ekdeep Singh Lubana",
      "Robert P. Dick",
      "Hidenori Tanaka",
      "Tomer Ullman"
    ],
    "abstract": "Large language models (LLMs) trained on huge corpora of text datasets demonstrate complex, emergent capabilities, achieving state-of-the-art performance on tasks they were not explicitly trained for. The precise nature of LLM capabilities is often unclear, and different prompts can elicit different capabilities through in-context learning. We propose a Cognitive Interpretability framework that enables us to analyze in-context learning dynamics to understand latent concepts in LLMs underlying behavioral patterns. This provides a more nuanced understanding than success-or-failure evaluation benchmarks, but does not require observing internal activations as a mechanistic interpretation of circuits would require. Inspired by the cognitive science of human randomness perception, we use random binary sequences as context and study dynamics of in-context learning by manipulating properties of context data, such as sequence length. In the latest GPT-3.5+ models, we find emergent abilities to generate pseudo-random numbers and learn basic formal languages, with striking in-context learning dynamics where model outputs transition sharply from pseudo-random behaviors to deterministic repetition.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=62K7mALO2q",
    "arxiv_id": "2310.17639",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17643,
    "title": "Understanding when Dynamics-Invariant Data Augmentations Benefit Model-free Reinforcement Learning Updates",
    "authors": [
      "Nicholas Corrado",
      "Josiah P. Hanna"
    ],
    "abstract": "Recently, data augmentation (DA) has emerged as a method for leveraging domain knowledge to inexpensively generate additional data in reinforcement learning (RL) tasks, often yielding substantial improvements in data efficiency.While prior work has demonstrated the utility of incorporating augmented data directly into model-free RL updates,it is not well-understood when a particular DA strategy will improve data efficiency.In this paper, we seek to identify general aspects of DA responsible for observed learning improvements.Our study focuses on sparse-reward tasks with dynamics-invariant data augmentation functions, serving as an initial step towards a more general understanding of DA and its integration into RL training.Experimentally, we isolate three relevant aspects of DA: state-action coverage,  reward density, and the number of augmented transitions generated per update (the augmented replay ratio).From our experiments, we draw two conclusions: (1) increasing state-action coverage often has a much greater impact on data efficiency than increasing reward density, and (2) decreasing the augmented replay ratio substantially improves data efficiency.In fact, certain tasks in our empirical study are solvable only when the replay ratio is sufficiently low.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=sVEu295o70",
    "arxiv_id": "2310.17786",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19496,
    "title": "SEGNO: Generalizing Equivariant Graph Neural Networks with Physical Inductive Biases",
    "authors": [
      "Yang Liu",
      "Jiashun Cheng",
      "Haihong Zhao",
      "Tingyang Xu",
      "Peilin Zhao",
      "Fugee Tsung",
      "Jia Li",
      "Yu Rong"
    ],
    "abstract": "Graph Neural Networks (GNNs) with equivariant properties have emerged as powerful tools for modeling complex dynamics of multi-object physical systems. However, their generalization ability is limited by the inadequate consideration of physical inductive biases: (1) Existing studies overlook the continuity of transitions among system states, opting to employ several discrete transformation layers to learn the direct mapping between two adjacent states; (2) Most models only account for first-order velocity information, despite the fact that many physical systems are governed by second-order motion laws. To incorporate these inductive biases, we propose the Second-order Equivariant Graph Neural Ordinary Differential Equation (SEGNO). Specifically, we show how the second-order continuity can be incorporated into GNNs while maintaining the equivariant property. Furthermore, we offer theoretical insights into SEGNO, highlighting that it can learn a unique trajectory between adjacent states, which is crucial for model generalization. Additionally, we prove that the discrepancy between this learned trajectory of SEGNO and the true trajectory is bounded. Extensive experiments on complex dynamical systems including molecular dynamics and motion capture demonstrate that our model yields a significant improvement over the state-of-the-art baselines.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=3oTPsORaDH",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19404,
    "title": "Compressed Context Memory for Online Language Model Interaction",
    "authors": [
      "Jang-Hyun Kim",
      "Junyoung Yeom",
      "Sangdoo Yun",
      "Hyun Oh Song"
    ],
    "abstract": "This paper presents a context key/value compression method for Transformer language models in online scenarios, where the context continually expands. As the context lengthens, the attention process demands increasing memory and computations, which in turn reduces the throughput of the language model. To address this challenge, we propose a compressed context memory system that continually compresses the accumulating attention key/value pairs into a compact memory space, facilitating language model inference in a limited memory space of computing environments. Our compression process involves integrating a lightweight conditional LoRA into the language model's forward pass during inference, without the need for fine-tuning the model's entire set of weights. We achieve efficient training by modeling the recursive compression process as a single parallelized forward computation. Through evaluations on conversation, personalization, and multi-task learning, we demonstrate that our approach achieves the performance level of a full context model with $5\\times$ smaller context memory size. We further demonstrate the applicability of our approach in a streaming setting with an unlimited context length, outperforming the sliding window approach. Codes are available at https://github.com/snu-mllab/context-memory.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=64kSvC4iPg",
    "arxiv_id": "2312.03414",
    "GitHub": [
      "https://github.com/snu-mllab/context-memory"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19403,
    "title": "Plug-and-Play Posterior Sampling under Mismatched Measurement and Prior Models",
    "authors": [
      "Marien Renaud",
      "Jiaming Liu",
      "Valentin De Bortoli",
      "Andres Almansa",
      "Ulugbek Kamilov"
    ],
    "abstract": "Posterior sampling has been shown to be a powerful Bayesian approach for solving imaging inverse problems. The recent plug-and-play unadjusted Langevin algorithm (PnP-ULA) has emerged as a promising method for Monte Carlo sampling and minimum mean squared error (MMSE) estimation by combining physical measurement models with deep-learning priors specified using image denoisers. However, the intricate relationship between the sampling distribution of PnP-ULA and the mismatched data-fidelity and denoiser has not been theoretically analyzed. We address this gap by proposing a posterior-$L_2$ pseudometric and using it to quantify an explicit error bound for PnP-ULA under mismatched posterior distribution. We numerically validate our theory on several inverse problems such as sampling from Gaussian mixture models and image deblurring. Our results suggest that the sensitivity of the sampling distribution of PnP-ULA to a mismatch in the measurement model and the denoiser can be precisely characterized.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=66arKkGiFy",
    "arxiv_id": "2310.03546",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17836,
    "title": "Learning Robust Generalizable Radiance Field with Visibility and Feature Augmented Point Representation",
    "authors": [
      "WANG Jiaxu",
      "Ziyi Zhang",
      "Renjing Xu"
    ],
    "abstract": "This paper introduces a novel paradigm for the generalizable neural radiance field (NeRF). Previous generic NeRF methods combine multiview stereo techniques with image-based neural rendering for generalization, yielding impressive results, while suffering from three issues. First, occlusions often result in inconsistent feature matching. Then, they deliver distortions and artifacts in geometric discontinuities and locally sharp shapes due to their individual process of sampled points and rough feature aggregation. Third, their image-based representations experience severe degradations when source views are not near enough to the target view. To address challenges, we propose the first paradigm that constructs the generalizable neural field based on point-based rather than image-based rendering, which we call Generalizable neural Point Field (GPF). Our approach explicitly models by geometric priors and augments it with neural features to eliminate occlusions in feature-fetching. We propose a novel nonuniform log sampling strategy to improve both rendering speed and reconstruction quality. Moreover, we present a learnable kernel spatially augmentedwith features for feature aggregations, mitigating distortions at places with drastically varying geometries. Besides, our representation can be easily manipulated. Experiments show that our model can deliver better geometries, view consistencies, and rendering quality than all counterparts and benchmarks on three datasets in both generalization and finetuning settings, preliminarily proving the potential of the new paradigm for generic NeRF.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=o4CLLlIaaH",
    "arxiv_id": "2401.14354",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18077,
    "title": "EventRPG: Event Data Augmentation with Relevance Propagation Guidance",
    "authors": [
      "Mingyuan Sun",
      "Donghao Zhang",
      "Zongyuan Ge",
      "WANG Jiaxu",
      "Jia Li",
      "Zheng Fang",
      "Renjing Xu"
    ],
    "abstract": "Event camera, a novel bio-inspired vision sensor, has drawn a lot of attention for its low latency, low power consumption, and high dynamic range. Currently, overfitting remains a critical problem in event-based classification tasks for SNN due to its relatively weak spatial representation capability. Data augmentation is a simple but efficient method to alleviate overfitting and improve the generalization ability of neural networks, and saliency-based augmentation methods are proven to be effective in the image processing field. However, there is no approach available for extracting saliency maps from SNNs. Therefore, for the first time, we present Spiking Layer-Time-wise Relevance Propagation rule (\\texttt{SLTRP}) and Spiking Layer-wise Relevance Propagation rule (\\texttt{SLRP}) in order for SNN to generate stable and accurate CAM and saliency maps. Based on this, we propose \\texttt{EventRPG}, which leverages relevance propagation on the spiking neural network for more efficient augmentation. Our proposed method has been evaluated on several SNN structures, achieving state-of-the-art performance in object recognition tasks including N-Caltech101, CIFAR10-DVS, with accuracies of $85.62\\%$ and $85.55\\%$, as well as action recognition task SL-Animals with an accuracy of $91.59\\%$. Codes will be available soon.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=i7LCsDMcZ4",
    "arxiv_id": "2403.09274",
    "GitHub": [
      "https://github.com/myuansun/EventRPG"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18556,
    "title": "NOLA: Networks as Linear Combination of Low Rank Random Basis",
    "authors": [
      "Soroush Abbasi Koohpayegani",
      "Navaneet K L",
      "Parsa Nooralinejad",
      "Soheil Kolouri",
      "Hamed Pirsiavash"
    ],
    "abstract": "Large Language Models (LLMs) have recently gained popularity due to their impressive few-shot performance across various downstream tasks. However, fine-tuning all parameters and storing a unique model for each downstream task or domain becomes impractical because of the massive size of checkpoints (e.g., 350GB in GPT-3). Current literature, such as LoRA, showcases the potential of low-rank modifications to the original weights of an LLM, enabling efficient adaptation and storage for task-specific models. These methods can reduce the number of parameters needed to fine-tune an LLM by several orders of magnitude. Yet, these methods face two primary limitations: 1) the parameter reduction is lower-bounded by the rank one decomposition, and 2) the extent of reduction is heavily influenced by both the model architecture and the chosen rank.For instance, in larger models, even a rank one decomposition might exceed the number of parameters truly needed for adaptation. In this paper, we introduce NOLA, which overcomes the rank one lower bound present in LoRA. It achieves this by re-parameterizing the low-rank matrices in LoRA using linear combinations of randomly generated matrices (basis) and optimizing the linear mixture coefficients only. This approach allows us to decouple the number of trainable parameters from both the choice of rank and the network architecture. We present adaptation results using GPT-2 and ViT in natural language and computer vision tasks. NOLA performs as well as, or better than models with equivalent parameter counts. Furthermore, we demonstrate that we can halve the parameters in larger models compared to LoRA with rank one, without sacrificing performance.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=TjfXcDgvzk",
    "arxiv_id": "2310.02556",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19526,
    "title": "Language Model Self-improvement by Reinforcement Learning Contemplation",
    "authors": [
      "Jing-Cheng Pang",
      "Pengyuan Wang",
      "Kaiyuan Li",
      "Xiong-Hui Chen",
      "Jiacheng Xu",
      "Zongzhang Zhang",
      "Yang Yu"
    ],
    "abstract": "Language model self-improvement (LMSI) techniques have recently gained significant attention as they improve language models without requiring external supervision. A common approach is reinforcement learning from AI feedback (RLAIF), which trains a reward model based on AI preference data and employs a reinforcement learning algorithm to train the language model. However, RLAIF relies on the heuristic assumption that an AI model can provide effective feedback and correct wrong answers, requiring a solid capability of the language model. This paper presents a novel LMSI method, Reinforcement Learning Contemplation (RLC). We disclose that it is simpler for language models to evaluate a sentence than to generate it, even for small language models. Leveraging the gap between the evaluation and generation, RLC evaluates generated answers and updates language model parameters using reinforcement learning to maximize evaluation scores. Through testing on various challenging reasoning tasks and text summarization task, our experiments show that RLC effectively improves language model performance without external supervision, resulting in an answering accuracy increase (from 31.23% to 37.09%) for BigBench-hard reasoning tasks, and a rise in BERTScore for CNN/Daily Mail summarization tasks. Furthermore, RLC can be applied to models of different sizes, showcasing its broad applicability.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=38E4yUbrgr",
    "arxiv_id": "2305.14483",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17802,
    "title": "Quality-Diversity through AI Feedback",
    "authors": [
      "Herbie Bradley",
      "Andrew Dai",
      "Hannah Benita Teufel",
      "Jenny Zhang",
      "Koen Oostermeijer",
      "Marco Bellagente",
      "Jeff Clune",
      "Kenneth Stanley",
      "Gregory Schott",
      "Joel Lehman"
    ],
    "abstract": "In many text-generation problems, users may prefer not only a single response, but a diverse range of high-quality outputs from which to choose. Quality-diversity (QD) search algorithms aim at such outcomes, by continually improving and diversifying a population of candidates. However, the applicability of QD to qualitative domains, like creative writing, has been limited by the difficulty of algorithmically specifying measures of quality and diversity. Interestingly, recent developments in language models (LMs) have enabled guiding search through \\emph{AI feedback}, wherein LMs are prompted in natural language to evaluate qualitative aspects of text. Leveraging this development, we introduce Quality-Diversity through AI Feedback (QDAIF), wherein an evolutionary algorithm applies LMs to both generate variation and evaluate the quality and diversity of candidate text. When assessed on creative writing domains, QDAIF covers more of a specified search space with high-quality samples than do non-QD controls. Further, human evaluation of QDAIF-generated creative texts validates reasonable agreement between AI and human evaluation. Our results thus highlight the potential of AI feedback to guide open-ended search for creative and original solutions, providing a recipe that seemingly generalizes to many domains and modalities. In this way, QDAIF is a step towards AI systems that can independently search, diversify, evaluate, and improve, which are among the core skills underlying human society's capacity for innovation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=owokKCrGYr",
    "arxiv_id": "2310.13032",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19616,
    "title": "Q-Bench: A Benchmark for General-Purpose Foundation Models on Low-level Vision",
    "authors": [
      "Haoning Wu",
      "Zicheng Zhang",
      "Erli Zhang",
      "Chaofeng Chen",
      "Liang Liao",
      "Annan Wang",
      "Chunyi Li",
      "Wenxiu Sun",
      "Qiong Yan",
      "Guangtao Zhai",
      "Weisi Lin"
    ],
    "abstract": "The rapid evolution of Multi-modality Large Language Models (MLLMs) has catalyzed a shift in computer vision from specialized models to general-purpose foundation models. Nevertheless, there is still an inadequacy in assessing the abilities of MLLMs on **low-level visual perception and understanding**. To address this gap, we present **Q-Bench**, a holistic benchmark crafted to systematically evaluate potential abilities of MLLMs on three realms: low-level visual perception, low-level visual description, and overall visual quality assessment. **_a)_** To evaluate the low-level **_perception_** ability, we construct the **LLVisionQA** dataset, consisting of 2,990 diverse-sourced images, each equipped with a human-asked question focusing on its low-level attributes. We then measure the correctness of MLLMs on answering these questions. **_b)_** To examine the **_description_** ability of MLLMs on low-level information, we propose the **LLDescribe** dataset consisting of long expert-labelled *golden* low-level text descriptions on 499 images, and a GPT-involved comparison pipeline between outputs of MLLMs and the *golden* descriptions. **_c)_** Besides these two tasks, we further measure their visual quality **_assessment_** ability to align with human opinion scores. Specifically, we design a softmax-based strategy that enables MLLMs to predict *quantifiable* quality scores, and evaluate them on various existing image quality assessment (IQA) datasets. Our evaluation across the three abilities confirms that MLLMs possess preliminary low-level visual skills. However, these skills are still unstable and relatively imprecise, indicating the need for specific enhancements on MLLMs towards these abilities. We hope that our benchmark can encourage the research community to delve deeper to discover and enhance these untapped potentials of MLLMs.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=0V5TVt9bk0",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17365,
    "title": "Breaking Physical and Linguistic Borders: Multilingual Federated Prompt Tuning for Low-Resource Languages",
    "authors": [
      "Wanru Zhao",
      "Royson Lee",
      "Yihong Chen",
      "Xinchi Qiu",
      "Yan Gao",
      "Hongxiang Fan",
      "Nicholas Donald Lane"
    ],
    "abstract": "Pretrained large language models (LLMs) have emerged as a cornerstone in modern natural language processing, with their utility expanding to various applications and languages. However, the fine-tuning of multilingual LLMs, particularly for low-resource languages, is fraught with challenges steming from data-sharing restrictions (the physical border) and from the inherent linguistic differences (the linguistic border). These barriers hinder users of various languages, especially those in low-resource regions, from fully benefiting from the advantages of LLMs.To overcome these challenges, we propose the Federated Prompt Tuning Paradigm for Multilingual Scenarios, which leverages parameter-efficient fine-tuning in a manner that preserves user privacy. We have designed a comprehensive set of experiments and introduced the concept of \"language distance\" to highlight the several strengths of this paradigm. Even under computational constraints, our method not only bolsters data efficiency but also facilitates mutual enhancements across languages, particularly benefiting low-resource ones. Compared to traditional local crosslingual transfer tuning methods, our approach achieves a 6.9\\% higher accuracy, reduces the training parameters by over 99\\%, and demonstrates stronger cross-lingual generalization. Such findings underscore the potential of our approach to promote social equality, ensure user privacy, and champion linguistic diversity.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=zzqn5G9fjn",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19082,
    "title": "Illusory Attacks: Information-theoretic detectability matters in adversarial attacks",
    "authors": [
      "Tim Franzmeyer",
      "Stephen Marcus McAleer",
      "Joao F. Henriques",
      "Jakob Nicolaus Foerster",
      "Philip Torr",
      "Adel Bibi",
      "Christian Schroeder de Witt"
    ],
    "abstract": "Autonomous agents deployed in the real world need to be robust against adversarial attacks on sensory inputs. Robustifying agent policies requires anticipating the strongest attacks possible.We demonstrate that existing observation-space attacks on reinforcement learning agents have a common weakness: while effective, their lack of information-theoretic detectability constraints makes them \\textit{detectable} using automated means or human inspection. Detectability is undesirable to adversaries as it may trigger security escalations.We introduce \\textit{$\\epsilon$-illusory attacks}, a novel form of adversarial attack on sequential decision-makers that is both effective and of $\\epsilon$-bounded statistical detectability. We propose a novel dual ascent algorithm to learn such attacks end-to-end.Compared to existing attacks, we empirically find $\\epsilon$-illusory attacks to be significantly harder to detect with automated methods, and a small study with human subjects\\footnote{IRB approval under reference XXXXX/XXXXX} suggests they are similarly harder to detect for humans. Our findings suggest the need for better anomaly detectors, as well as effective hardware- and system-level defenses.",
    "type": "Spotlight Poster",
    "OpenReview": "https://openreview.net/forum?id=F5dhGCdyYh",
    "arxiv_id": "2207.10170",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19443,
    "title": "Beyond Vanilla Variational Autoencoders: Detecting Posterior Collapse in Conditional and Hierarchical Variational Autoencoders",
    "authors": [
      "Hien Dang",
      "Tho Tran Huu",
      "Tan Minh Nguyen",
      "Nhat Ho"
    ],
    "abstract": "The posterior collapse phenomenon in variational autoencoder (VAE), where the variational posterior distribution closely matches the prior distribution, can hinder the quality of the learned latent variables. As a consequence of posterior collapse, the latent variables extracted by the encoder in VAE preserve less information from the input data and thus fail to produce meaningful representations as input to the reconstruction process in the decoder. While this phenomenon has been an actively addressed topic related to VAE performance, the theory for posterior collapse remains underdeveloped, especially beyond the standard VAE. In this work, we advance the theoretical understanding of posterior collapse to two important and prevalent yet less studied classes of VAE: conditional VAE and hierarchical VAE. Specifically, via a non-trivial theoretical analysis of linear conditional VAE and hierarchical VAE with two levels of latent, we prove that the cause of posterior collapses in these models includes the correlation between the input and output of the conditional VAE and the effect of learnable encoder variance in the hierarchical VAE. We empirically validate our theoretical findings for linear conditional and hierarchical VAE and demonstrate that these results are also predictive for non-linear cases with extensive experiments.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4zZFGliCl9",
    "arxiv_id": "2306.05023",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18058,
    "title": "Epitopological learning and Cannistraci-Hebb network shape intelligence brain-inspired theory for ultra-sparse advantage in deep learning",
    "authors": [
      "Yingtao Zhang",
      "Jialin Zhao",
      "Wenjing Wu",
      "Alessandro Muscoloni",
      "Carlo Vittorio Cannistraci"
    ],
    "abstract": "Sparse training (ST) aims to ameliorate deep learning by replacing fully connected artificial neural networks (ANNs) with sparse or ultra-sparse ones, such as brain networks are, therefore it might benefit to borrow brain-inspired learning paradigms from complex network intelligence theory. Here, we launch the ultra-sparse advantage challenge, whose goal is to offer evidence on the extent to which ultra-sparse (around 1% connection retained) topologies can achieve any leaning advantage on fully connected. Epitopological learning is a field of network science and complex network intelligence that studies how to implement learning on complex networks by changing the shape of their connectivity structure (epitopological plasticity). One way to implement Epitopological (epi- means new) Learning is via link prediction: predicting the likelihood of nonobserved links to appear in the network. Cannistraci-Hebb learning theory inspired the CH3-L3 network automata rule for link prediction which is effective for general-purpose link prediction. Here, starting from CH3-L3 we propose Epitopological Sparse Meta-deep Learning (ESML) to apply Epitopological Learning to sparse training. In empirical experiments, we find that ESML learns ANNs with ultra-sparse hyperbolic (epi-)topology in which emerges a community layer organization that is meta-deep (meaning that each layer also has an internal depth due to power-law node hierarchy). Furthermore, we discover that ESML can in many cases automatically sparse the neurons during training (arriving even to 30% neurons left in hidden layers), this process of node dynamic removal is called percolation. Starting from this network science evidence, we design Cannistraci-Hebb training (CHT), a 4-step training methodology that put ESML at its heart. We conduct experiments on 6 datasets and 3 network structures (MLPs, VGG16, ResNet50) comparing CHT to dynamic sparse training SOTA algorithms and fully connected network. The results indicate that, with a mere 1\\% of links retained during training, CHT surpasses fully connected networks on VGG16 and ResNet50. This key finding is an evidence for ultra-sparse advantage and signs a milestone in deep learning. CHT acts akin to a gradient-free oracle which adopts CH3-L3 based epitopological learning to guide the placement of new links in the ultra-sparse network topology to facilitate sparse-weight gradient learning, and this in turn reduces the convergence time of ultra-sparse training. Finally, CHT offers first examples of parsimony dynamic sparse training because, in many datasets, it can retain network performance by percolating and significantly reducing the node network size.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=iayEcORsGd",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19778,
    "title": "Cameras as Rays: Pose Estimation via Ray Diffusion",
    "authors": [
      "Jason Y. Zhang",
      "Amy Lin",
      "Moneish Kumar",
      "Tzu-Hsuan Yang",
      "Deva Ramanan",
      "Shubham Tulsiani"
    ],
    "abstract": "Estimating camera poses is a fundamental task for 3D reconstruction and remains challenging given sparse views ($<$10). In contrast to existing approaches that pursue top-down prediction of global parametrizations of camera extrinsics, we propose a distributed representation of camera pose that treats a camera as a bundle of rays. This representation allows for a tight coupling with spatial image features improving pose precision. We observe that this representation is naturally suited for set-level level transformers and develop a regression-based approach that maps image patches to corresponding rays. To capture the inherent uncertainties in sparse-view pose inference, we adapt this approach to learn a denoising diffusion model which allows us to sample plausible modes while improving performance. Our proposed methods, both regression- and diffusion-based, demonstrate state-of-the-art performance on camera pose estimation on CO3D while generalizing to unseen object categories and in-the-wild captures.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=EanCFCwAjM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17427,
    "title": "AdjointDPM: Adjoint Sensitivity Method for Gradient Backpropagation of Diffusion Probabilistic Models",
    "authors": [
      "Jiachun Pan",
      "Jun Hao Liew",
      "Vincent Tan",
      "Jiashi Feng",
      "Hanshu Yan"
    ],
    "abstract": "This paper considers a ubiquitous problem underlying several applications of DPMs, i.e., optimizing the parameters of DPMs when the objective is a differentiable metric defined on the generated contents. Since the sampling procedure of DPMs involves recursive calls to the denoising UNet, naive gradient backpropagation requires storing the intermediate states of all iterations, resulting in extremely high memory consumption. To overcome this issue, we propose a novel method AdjointDPM, which first generates new samples from diffusion models by solving the corresponding probability-flow ODEs. It then uses the adjoint sensitivity method to backpropagate the gradients of the loss to the models' parameters (including conditioning signals, network weights, and initial noises) by solving another augmented ODE. To reduce numerical errors in both the forward generation and gradient backpropagation processes, we further reparameterize the probability-flow ODE and augmented ODE as simple non-stiff ODEs using exponential integration. AdjointDPM can effectively compute the gradients of all types of parameters in DPMs, including the network weights, conditioning text prompts, and noisy states.Finally, we demonstrate the effectiveness of AdjointDPM on several interesting tasks: guided generation via modifying sampling trajectories, finetuning DPM weights for stylization, and converting visual effects into text embeddings.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=y33lDRBgWI",
    "arxiv_id": "2307.10711",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19250,
    "title": "Out-of-Distribution Detection by Leveraging Between-Layer Transformation Smoothness",
    "authors": [
      "Fran Jeleni\u0107",
      "Josip Juki\u0107",
      "Martin Tutek",
      "Mate Puljiz",
      "Jan Snajder"
    ],
    "abstract": "Effective OOD detection is crucial for reliable machine learning models, yet most current methods are limited in practical use due to requirements like access to training data or intervention in training. We present a novel method for detecting OOD data in deep neural networks based on transformation smoothness between intermediate layers of a network (BLOOD), which is applicable to pre-trained models without access to training data. BLOOD utilizes the tendency of between-layer representation transformations of in-distribution (ID) data to be smoother than the corresponding transformations of OOD data, a property that we also demonstrate empirically for Transformer networks. We evaluate BLOOD on several text classification tasks with Transformer networks and demonstrate that it outperforms methods with comparable resource requirements. Our analysis also suggests that when learning simpler tasks, OOD data transformations maintain their original sharpness, whereas sharpness increases with more complex tasks.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=AcRfzLS6se",
    "arxiv_id": "2310.02832",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17629,
    "title": "Real-Fake: Effective Training Data Synthesis Through Distribution Matching",
    "authors": [
      "Jianhao Yuan",
      "Jie Zhang",
      "Shuyang Sun",
      "Philip Torr",
      "Bo Zhao"
    ],
    "abstract": "Synthetic training data has gained prominence in numerous learning tasks and scenarios, offering advantages such as dataset augmentation, generalization evaluation, and privacy preservation. Despite these benefits, the efficiency of synthetic data generated by current methodologies remains inferior when training advanced deep models exclusively, limiting its practical utility. To address this challenge, we analyze the principles underlying training data synthesis for supervised learning and elucidate a principled theoretical framework from the distribution-matching perspective that explicates the mechanisms governing synthesis efficacy. Through extensive experiments, we demonstrate the effectiveness of our synthetic data across diverse image classification tasks, both as a replacement for and augmentation to real datasets, while also benefits challenging tasks such as out-of-distribution generalization and privacy preservation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=svIdLLZpsA",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18691,
    "title": "Copilot4D: Learning Unsupervised World Models for Autonomous Driving via Discrete Diffusion",
    "authors": [
      "Lunjun Zhang",
      "Yuwen Xiong",
      "Ze Yang",
      "Sergio Casas",
      "Rui Hu",
      "Raquel Urtasun"
    ],
    "abstract": "Learning world models can teach an agent how the world works in an unsupervised manner. Even though it can be viewed as a special case of sequence modeling, progress for scaling world models on robotic applications such as autonomous driving has been somewhat less rapid than scaling language models with Generative Pre-trained Transformers (GPT). We identify two reasons as major bottlenecks: dealing with complex and unstructured observation space, and having a scalable generative model. Consequently, we propose a novel world modeling approach that first tokenizes sensor observations with VQVAE, then predicts the future via discrete diffusion. To efficiently decode and denoise tokens in parallel, we recast Masked Generative Image Transformer into the discrete diffusion framework with a few simple changes, resulting in notable improvement. When applied to learning world models on point cloud observations, our model reduces prior SOTA Chamfer distance by more than 65% for 1s prediction, and more than 50% for 3s prediction, across NuScenes, KITTI Odometry, and Argoverse2 datasets. Our results demonstrate that discrete diffusion on tokenized agent experience can unlock the power of GPT-like unsupervised learning for robotic agents.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=Psl75UCoZM",
    "arxiv_id": "2311.01017",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18144,
    "title": "FlashFFTConv: Efficient Convolutions for Long Sequences with Tensor Cores",
    "authors": [
      "Daniel Y Fu",
      "Hermann Kumbong",
      "Eric Nguyen",
      "Christopher Re"
    ],
    "abstract": "Convolution models with long filters have demonstrated state-of-the-art reasoning abilities in many long-sequence tasks but lag behind the most optimized Transformers in wall-clock time.A major bottleneck is the Fast Fourier Transform (FFT)---which allows long convolutions to run in $O(N\\log N)$ time in sequence length $N$ but has poor hardware utilization.In this paper, we study how to optimize the FFT convolution.We find two key bottlenecks: the FFT does not effectively use specialized matrix multiply units, and it incurs expensive I/O between layers of the memory hierarchy.In response, we propose FlashFFTConv.FlashFFTConv uses a matrix decomposition that computes the FFT using matrix multiply units and enables kernel fusion for long sequences, reducing I/O.We also present two sparse convolution algorithms---1) partial convolutions and 2) frequency-sparse convolutions---which can be implemented simply by skipping blocks in the matrix decomposition, enabling further opportunities for memory and compute savings.FlashFFTConv speeds up exact FFT convolutions by up to 8.7$\\times$ over PyTorch and achieves up to 4.4$\\times$ speedup end-to-end.Given the same compute budget, FlashFFTConv allows Hyena-GPT-s to achieve 2.3 points better perplexity and M2-BERT-base to achieve 3.3 points higher GLUE score---matching models with twice the parameter count.FlashFFTConv also achieves 96.1% accuracy on Path-512, a high-resolution vision task where no model had previously achieved better than 50%.Furthermore, partial convolutions enable longer-sequence models---yielding the first DNA model that can process the longest human genes (2.3M base pairs)---and frequency-sparse convolutions speed up pretrained models while maintaining or improving model quality.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=gPKTTAfYBp",
    "arxiv_id": "2311.05908",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18327,
    "title": "R-MAE: Regions Meet Masked Autoencoders",
    "authors": [
      "Duy Kien Nguyen",
      "Yanghao Li",
      "Vaibhav Aggarwal",
      "Martin R. Oswald",
      "Alexander Kirillov",
      "Cees G. M. Snoek",
      "Xinlei Chen"
    ],
    "abstract": "In this work, we explore regions as the visual analogue of words for self-supervised image representation learning. Inspired by Masked Autoencoding (MAE), a generative pre-training baseline, we propose masked region autoencoding to learn from groups of pixels or regions. Specifically, we design an architecture which efficiently addresses the one-to-many mapping between images and regions, while being highly effective especially with high-quality regions. When integrated with MAE, our approach (R-MAE) demonstrates consistent improvements across various pre-training datasets and downstream detection and segmentation benchmarks, with negligible computational overheads. Beyond the quantitative evaluation, our analysis indicates the models pre-trained with masked region autoencoding unlock the potential for interactive segmentation.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=ba84RDHFnz",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 17700,
    "title": "Variance-aware Regret Bounds for Stochastic Contextual Dueling Bandits",
    "authors": [
      "Qiwei Di",
      "Tao Jin",
      "Yue Wu",
      "Heyang Zhao",
      "Farzad Farnoud",
      "Quanquan Gu"
    ],
    "abstract": "Dueling bandits is a prominent framework for decision-making involving preferential feedback, a valuable feature that fits various applications involving human interaction, such as ranking, information retrieval, and recommendation systems. While substantial efforts have been made to minimize the cumulative regret in dueling bandits, a notable gap in the current research is the absence of regret bounds that account for the inherent uncertainty in pairwise comparisons between the dueling arms. Intuitively, greater uncertainty suggests a higher level of difficulty in the problem.  To bridge this gap, this paper studies the problem of contextual dueling bandits, where the binary comparison of dueling arms is generated from a generalized linear model (GLM). We propose a new SupLinUCB-type algorithm that enjoys computational efficiency and a variance-aware regret bound $\\tilde O\\big(d\\sqrt{\\sum_{t=1}^T\\sigma_t^2} + d\\big)$, where $\\sigma_t$ is the variance of the pairwise comparison at round $t$, $d$ is the dimension of the context vectors, and $T$ is the time horizon. Our regret bound naturally aligns with the intuitive expectation \u2014 in scenarios where the comparison is deterministic, the algorithm only suffers from an $\\tilde O(d)$ regret. We perform empirical experiments on synthetic data to confirm the advantage of our method over previous variance-agnostic algorithms.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=rDH7dIFn20",
    "arxiv_id": "2310.00968",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19449,
    "title": "Pessimistic Nonlinear Least-Squares Value Iteration for Offline Reinforcement Learning",
    "authors": [
      "Qiwei Di",
      "Heyang Zhao",
      "Jiafan He",
      "Quanquan Gu"
    ],
    "abstract": "Offline reinforcement learning (RL), where the agent aims to learn the optimal policy based on the data collected by a behavior policy, has attracted increasing attention in recent years. While offline RL with linear function approximation has been extensively studied with optimal results achieved under certain assumptions, many works shift their interest to offline RL with non-linear function approximation.However, limited works on offline RL with non-linear function approximation have instance-dependent regret guarantees.    In this paper, we propose an oracle-efficient algorithm, dubbed Pessimistic Nonlinear Least-Square Value Iteration (PNLSVI), for offline RL with non-linear function approximation. Our algorithmic design comprises three innovative components: (1) a variance-based weighted regression scheme that can be applied to a wide range of function classes, (2) a subroutine for variance estimation, and (3) a planning phase that utilizes a pessimistic value iteration approach. Our algorithm enjoys a regret bound that has a tight dependency on the function class complexity and achieves minimax optimal instance-dependent regret when specialized to linear function approximation. Our work extends the previous instance-dependent results within simpler function classes, such as linear and differentiable function to a more general framework. To the best of our knowledge, this is the first statistically optimal algorithm for nonlinear offline RL.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4kLVvIh8cp",
    "arxiv_id": "2310.01380",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19559,
    "title": "Zero-Shot Continuous Prompt Transfer: Generalizing Task Semantics Across Language Models",
    "authors": [
      "Zijun Wu",
      "Yongkang Wu",
      "Lili Mou"
    ],
    "abstract": "Prompt tuning in natural language processing (NLP) has become an increasingly popular method for adapting large language models to specific tasks. However, the transferability of these prompts, especially continuous prompts, between different models remains a challenge. In this work, we propose a zero-shot continuous prompt transfer method, where source prompts are encoded into relative space and the corresponding target prompts are searched for transferring to target models. Experimental results confirm the effectiveness of our method, showing that 'task semantics' in continuous prompts can be generalized across various language models. Moreover, we find that combining 'task semantics' from multiple source models can further enhance the generalizability of transfer.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=26XphugOcS",
    "arxiv_id": "2310.01691",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18643,
    "title": "Ensemble Distillation for Unsupervised Constituency Parsing",
    "authors": [
      "Behzad Shayegh",
      "Yanshuai Cao",
      "Xiaodan Zhu",
      "Jackie CK Cheung",
      "Lili Mou"
    ],
    "abstract": "We investigate the unsupervised constituency parsing task, which organizes words and phrases of a sentence into a hierarchical structure without using linguistically annotated data. We observe that existing unsupervised parsers capture differing aspects of parsing structures, which can be leveraged to enhance unsupervised parsing performance.To this end, we propose a notion of ``tree averaging,'' based on which we further propose a novel ensemble method for unsupervised parsing.To improve inference efficiency, we further distill the ensemble knowledge into a student model; such an ensemble-then-distill process is an effective approach to mitigate the over-smoothing problem existing in common multi-teacher distilling methods.Experiments show that our method surpasses all previous approaches, consistently demonstrating its effectiveness and robustness across various runs, with different ensemble components, and under domain-shift conditions.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=RR8y0WKrFv",
    "arxiv_id": "2310.01717",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19546,
    "title": "sRGB Real Noise Modeling via Noise-Aware Sampling with Normalizing Flows",
    "authors": [
      "Dongjin Kim",
      "Donggoo Jung",
      "Sungyong Baik",
      "Tae Hyun Kim"
    ],
    "abstract": "Noise poses a widespread challenge in signal processing, particularly when it comes to denoising images. Although convolutional neural networks (CNNs) have exhibited remarkable success in this field, they are predicated upon the belief that noise follows established distributions, which restricts their practicality when dealing with real-world noise. To overcome this limitation, several efforts have been taken to collect noisy image datasets from the real world. Generative methods, employing techniques such as generative adversarial networks (GANs) and normalizing flows (NFs), have emerged as a solution for generating realistic noisy images. Recent works model noise using camera metadata, however requiring metadata even for sampling phase. In contrast, in this work, we aim to estimate the underlying camera settings, enabling us to improve noise modeling and generate diverse noise distributions. To this end, we introduce a new NF framework that allows us to both classify noise based on camera settings and generate various noisy images. Through experimental results, our model demonstrates exceptional noise quality and leads in denoising performance on benchmark datasets.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=2XBBumBGeP",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19470,
    "title": "Chain-of-Table: Evolving Tables in the Reasoning Chain for Table Understanding",
    "authors": [
      "Zilong Wang",
      "Hao Zhang",
      "Chun-Liang Li",
      "Julian Martin Eisenschlos",
      "Vincent Perot",
      "Zifeng Wang",
      "Lesly Miculicich",
      "Yasuhisa Fujii",
      "Jingbo Shang",
      "Chen-Yu Lee",
      "Tomas Pfister"
    ],
    "abstract": "Table-based reasoning with large language models (LLMs) is a promising direction to tackle many table understanding tasks, such as table-based question answering and fact verification. Compared with generic reasoning, table-based reasoning requires the extraction of underlying semantics from both free-form questions and semi-structured tabular data. Chain-of-Thought and its similar approaches incorporate the reasoning chain in the form of textual context, but it is still an open question how to effectively leverage tabular data in the reasoning chain. We propose the Chain-of-Table framework, where tabular data is explicitly used in the reasoning chain as a proxy for intermediate thoughts. Specifically, we guide LLMs using in-context samples to iteratively generate operations and update the table to represent a complex reasoning chain. LLMs can therefore dynamically plan the next operation based on the results of the previous ones. This continuous evolution of the table forms a chain, showing the reasoning process for a given tabular problem. The chain carries structured information of the intermediate results, enabling more accurate and reliable predictions. Chain-of-Table achieves new state-of-the-art performance on WikiTQ, FeTaQA, and TabFact benchmarks across multiple LLM choices.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=4L0xnS4GQM",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18917,
    "title": "CAMBranch: Contrastive Learning with Augmented MILPs for Branching",
    "authors": [
      "Jiacheng Lin",
      "Meng XU",
      "Zhihua Xiong",
      "Huangang Wang"
    ],
    "abstract": "Recent advancements have introduced machine learning frameworks to enhance the Branch and Bound (B\\&B) branching policies for solving Mixed Integer Linear Programming (MILP). These methods, primarily relying on imitation learning of Strong Branching, have shown superior performance. However, collecting expert samples for imitation learning, particularly for Strong Branching, is a time-consuming endeavor. To address this challenge, we propose \\textbf{C}ontrastive Learning with \\textbf{A}ugmented \\textbf{M}ILPs for \\textbf{Branch}ing (CAMBranch), a framework that generates Augmented MILPs (AMILPs) by applying variable shifting to limited expert data from their original MILPs. This approach enables the acquisition of a considerable number of labeled expert samples. CAMBranch leverages both MILPs and AMILPs for imitation learning and employs contrastive learning to enhance the model's ability to capture MILP features, thereby improving the quality of branching decisions. Experimental results demonstrate that CAMBranch, trained with only 10\\% of the complete dataset, exhibits superior performance. Ablation studies further validate the effectiveness of our method.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=K6kt50zAiG",
    "arxiv_id": "2402.03647",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 19773,
    "title": "Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness",
    "authors": [
      "Bohang Zhang",
      "Jingchu Gai",
      "Yiheng Du",
      "Qiwei Ye",
      "Di He",
      "Liwei Wang"
    ],
    "abstract": "Designing expressive Graph Neural Networks (GNNs) is a fundamental topic in the graph learning community. So far, GNN expressiveness has been primarily assessed via the Weisfeiler-Lehman (WL) hierarchy. However, such an expressivity measure has notable limitations: it is inherently coarse, qualitative, and may not well reflect practical requirements (e.g., the ability to encode substructures). In this paper, we introduce a novel framework for quantitatively studying the expressiveness of GNN architectures, addressing all the above limitations. Specifically, we identify a fundamental expressivity measure termed homomorphism expressivity, which quantifies the ability of GNN models to count graphs under homomorphism. Homomorphism expressivity offers a complete and practical assessment tool: the completeness enables direct expressivity comparisons between GNN models, while the practicality allows for understanding concrete GNN abilities such as subgraph counting. By examining four classes of prominent GNNs as case studies, we derive simple, unified, and elegant descriptions of their homomorphism expressivity for both invariant and equivariant settings. Our results provide novel insights into a series of previous work, unify the landscape of different subareas in the community, and settle several open questions. Empirically, extensive experiments on both synthetic and real-world tasks verify our theory, showing that the practical performance of GNN models aligns well with the proposed metric.",
    "type": "Oral",
    "OpenReview": "https://openreview.net/forum?id=HSKaGOi7Ar",
    "arxiv_id": "",
    "GitHub": [],
    "Space": [],
    "Model": [],
    "Dataset": []
  },
  {
    "id": 18921,
    "title": "Rethinking Channel Dimensions to Isolate Outliers for Low-bit Weight Quantization of Large Language Models",
    "authors": [
      "Jung Hwan Heo",
      "Jeonghoon Kim",
      "Beomseok Kwon",
      "Byeongwook Kim",
      "Se Jung Kwon",
      "Dongsoo Lee"
    ],
    "abstract": "Large Language Models (LLMs) have recently demonstrated a remarkable success across various tasks. However, efficiently serving LLMs has been a challenge due to its large memory bottleneck, specifically in small batch inference settings (e.g. mobile devices). Weight-only quantization can be a promising approach, but sub-4 bit quantization remains a challenge due to large-magnitude activation outliers. To mitigate the undesirable outlier effect, we first propose per-IC quantization, a simple yet effective method that creates quantization groups within each input channel (IC) rather than the conventional per-output channel (OC). Our method is motivated by the observation that activation outliers affect the input dimension of the weight matrix, so similarly grouping the weights in the IC direction can $\\textit{isolate outliers to be within a group}$. We also find that activation outliers do not dictate quantization difficulty, and inherent weight sensitivities also exist. With per-IC quantization as a new outlier-friendly scheme, we then propose Adaptive Dimensions ($\\textbf{AdaDim}$), a versatile quantization framework that can adapt to various weight sensitivity patterns. We demonstrate the effectiveness of AdaDim by augmenting prior methods such as Round-To-Nearest and GPTQ, showing significant improvements across various language modeling benchmarks for both base (up to $+4.7\\%$ on MMLU) and instruction-tuned (up to $+10\\%$ on HumanEval) LLMs.",
    "type": "Poster",
    "OpenReview": "https://openreview.net/forum?id=JzG7kSpjJk",
    "arxiv_id": "2309.15531",
    "GitHub": [
      "https://github.com/johnheo/adadim-llm"
    ],
    "Space": [],
    "Model": [],
    "Dataset": []
  }
]